‫معت ‪3‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا


‬

‫ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻤﺤﺘﻭﺍﻫﺎ‬

‫‪+‬‬
‫ﻋﺒﺩﻩ ﺤﺴﻥ ﺠﺭﻭﺏ‬

‫ﺍﻝﻤﻠﺨﺹ‬

‫ﻓﻲ ﻫﺫﺍ ﺍﻝﺒﺤﺙ ﺘﻡ ﺍﻝﻘﻴﺎﻡ ﺒﺘﻁﻭﻴﺭ ﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﻝﺘﻘﻴﻴﻡ ﻤﺩﻯ ﺍﻝﺘﺸﺎﺒﻪ ﺒﻴﻥ ﺼﻭﺭﺘﻴﻥ ﺃﻭ ﺃﻜﺜﺭ‪ ،‬ﻭﺘﻘﻠﻴﺹ ﺍﻝﺯﻤﻥ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻨﻬـﺎ‪،‬‬
‫ﻭﺫﻝﻙ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ‪ ،‬ﻭﺘﺤﻠﻴل ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ)‪ ،(Histogram‬ﻭﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺠﺯﺌﻴﺔ ﻤﻥ ﺍﻝﻠﻭﻥ ﺍﻝﻤﻜـﻭﻥ ﻝﻠﺼـﻭﺭﺓ‪ ،‬ﻭﺍﻝﺘـﻲ‬
‫ﻴﻤﻜﻥ ﺍﺴﺘﺨﺩﺍﻡ ﻫﺫﻩ ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﻝﻠﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻓﻲ ﻗﺎﻋﺩﺓ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻭﺍﻝﻨﻅﻡ ﻭﺍﻝﺸﺒﻜﺎﺕ ﺍﻝﺤﺎﺴﻭﺒﻴﺔ‪ ،‬ﻭﻗﺩ ﺘﻡ ﺘﻨﻔﻴﺫ ﻫـﺫﻩ ﺍﻝﺘﺠﺭﺒـﺔ ﺒﺎﺴـﺘﺨﺩﺍﻡ‬
‫ﺒﺭﻨﺎﻤﺞ ﺤﺎﺴﻭﺒﻲ ﺘﻡ ﺒﺭﻤﺠﺘﻪ ﺒﺎﺴﺘﺨﺩﺍﻡ ﻝﻐﺔ ‪ ،C++ Builder‬ﻜﻤﺎ ﺘﻡ ﺘﺤﻠﻴل ﺍﻝﻨﺘﺎﺌﺞ ﻭﺘﻭﻀﻴﺤﻬﺎ ﺒﺄﻤﺜﻠﺔ ﻤﺘﻌﺩﺩﺓ‪ ،‬ﻭﻗﺩ ﺃﻭﻀﺤﺕ ﺍﻝﻨﺘـﺎﺌﺞ ﺃﻥ ﺍﻝﻭﻗـﺕ‬
‫ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻴﺘﻭﻗﻑ ﻋﻠﻰ ﻋﺩﺓ ﻤﻌﺎﻴﻴﺭ ﺃﻫﻤﻬﺎ ﻋﺩﺩ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺴﺘﺨﺩﻤﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ‪ ،‬ﻭﻋـﺩﺩﻫﺎ‪ ،‬ﻭﻁﺭﻴﻘـﺔ ﻤﻌﺎﻝﺠـﺔ ﺍﻝﺼـﻭﺭ‬
‫ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ‪ ،‬ﻋﺩﺍ ﺘﻘﻴﻴﻡ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻝﻠﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺍﻝﺜﻼﺙ ﺘﻡ ﺘﻘﻴﻴﻡ ﻓﺎﻋﻠﻴﺘﻬﺎ )ﺃﻓﻀل ﺨﻭﺍﺭﺯﻤﻴﺔ ﻤـﻥ ﻨﺎﺤﻴـﺔ‬
‫ﺍﻝﻨﺘﺎﺌﺞ ﻭﺍﻷﺩﺍﺀ(‪.‬‬
‫ﺍﻝﻜﻠﻤﺎﺕ ﺍﻝﻤﻔﺘﺎﺤﻴﺔ‪ :‬ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‪ ،‬ﺍﻝﻤﻌﺎﻝﺠﺔ ﺍﻝﺭﻗﻤﻴﺔ ﻝﻠﺼﻭﺭ‪ ،‬ﺍﻝﺒﺤﺙ ﺒﺎﻝﻨﻤﺫﺠﺔ‪ ،‬ﺸﺩﺓ ﺒﻜﺴﻼﺕ ﺍﻝﺼﻭﺭ‪.‬‬

‫‪ .1‬ﺍﻝﻤﻘﺩﻤﺔ‬

‫ﻓﻲ ﺍﻝﻭﻗﺕ ﺍﻝﺤﺎﻀﺭ ﺘﹸﻌﺩ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻓﻲ ﻗﻭﺍﻋﺩ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻭﻤﺤﺭﻜﺎﺕ ﺍﻝﺒﺤﺙ ﻤﻁﻠﻭﺒﺔ ﻋﻠـﻰ ﻨﻁـﺎﻕ ﻭﺍﺴـﻊ‬
‫ﻜﺎﻝﺒﺤﺙ ﻓﻲ ﻗﻭﺍﻋﺩ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻋﻥ ﺍﻝﺼﻭﺭ‪ ،‬ﻭﺍﻝﺼﻭﺭ ﺍﻝﻤﺘﺸﺎﺒﻬﺔ‪ ،‬ﻭﺍﻝﺼﻭﺭ ﺍﻷﺼﻠﻴﺔ‪ ،‬ﻭﺍﻝﻘﺼﺎﺼﺎﺕ‪ ،‬ﻭﻏﻴﺭﻫﺎ‪ .‬ﻓﻬﻨﺎﻙ ﻗﻭﺍﻋـﺩ‬
‫ﻼ ﻋـﻥ ﻤﺠﻤﻭﻋـﺔ ﺍﻝﺼـﻭﺭ‬
‫ﺒﻴﺎﻨﺎﺕ ﺘﻬﺘﻡ ﺒﺎﻝﺼﻭﺭ ﻭﺍﻷﻋﻤﺎل ﺍﻝﻔﻨﻴﺔ‪ ،‬ﻭﺍﻝﺼﻭﺭ ﻤﻥ ﺍﻷﻗﻤﺎﺭ ﺍﻝﺼﻨﺎﻋﻴﺔ ﻭﺍﻝﺘﺼـﻭﻴﺭ‪ ،‬ﻓﻀـ ﹰ‬
‫ﺍﻝﻔﻭﺘﻭﻏﺭﺍﻓﻴﺔ ﺍﻝﻌﺎﻝﻤﻴﺔ‪.‬‬
‫ﻓﻘﻭﺍﻋﺩ ﺍﻝﺒﻴﺎﻨﺎﺕ ﺍﻝﻤﺴﺘﺨﺩﻤﺔ ﻝﺨﺯﻥ ﻫﺫﻩ ﺍﻝﺼﻭﺭ ﻴﻤﻜﻥ ﺃﻥ ﻴﻜﻭﻥ ﺤﺠﻤﻬﺎ ﻜﺒﻴﺭ ﺠﺩﹰﺍ‪ ،‬ﻭﺘﺤﺘﻭﻱ ﻋﻠـﻰ ﻤﺌـﺎﺕ ﺍﻵﻻﻑ ﺒـل‬
‫ﺍﻝﻤﻼﻴﻴﻥ ﻤﻥ ﺍﻝﺼﻭﺭ‪ .‬ﻭﻓﻲ ﻤﻌﻅﻡ ﺍﻝﺤﺎﻻﺕ ﻤﺜل ﻗﻭﺍﻋﺩ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻫﺫﻩ ﺘﻜﻭﻥ ﻤﻔﻬﺭﺴﺔ ﺒﺎﻝﻜﻠﻤﺎﺕ ﺍﻝﺭﺌﻴﺴﺔ‪ ،‬ﺃﻱ ﺃﻥ ﺍﻝﺼﻭﺭ ﻴـﺘﻡ‬
‫ﺨﺯﻨﻬﺎ ﻓﻲ ﻗﺎﻋﺩﺓ ﺍﻝﺒﻴﺎﻨﺎﺕ ﺒﻜﻠﻤﺎﺕ ﺘﺼﻔﻬﺎ‪ .‬ﻭﺍﻝﻜﻠﻤﺎﺕ ﺍﻷﺴﺎﺴﻴﺔ ﻓﻲ ﻗﻭﺍﻋﺩ ﺍﻝﺒﻴﺎﻨﺎﺕ ﺘﺨﺯﻥ ﻤﻥ ﻗﺒل ﺍﻝﺒﺸـﺭ ﺃﻭ ﺍﻝﻤﺴـﺘﺨﺩﻤﻴﻥ‬
‫ﺍﻝﺫﻴﻥ ﻴﺼﻨﻔﻭﻥ ﺍﻝﺼﻭﺭ ﺒﺤﺴﺏ ﻓﺌﺎﺕ ﻤﻌﻴﻨﺔ‪.‬‬

‫‪ .2‬ﺍﻝﺩﺭﺍﺴﺎﺕ ﺍﻝﺴﺎﺒﻘﺔ‬
‫ﻓﻲ ﻫﺫﺍ ﺍﻝﺠﺯﺀ ﺴﻴﺘﻡ ﺍﺴﺘﻌﺭﺍﺽ ﺃﻫﻡ ﺍﻝﺩﺭﺍﺴﺎﺕ ﺍﻝﺴﺎﺒﻘﺔ ﺍﻝﺘﻲ ﺍﺴﺘﺨﺩﻤﺕ ﺍﻝﻁﺭﻕ ﺍﻝﻤﺨﺘﻠﻔﺔ ﻝﻠﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴـﺎﺱ‬
‫ﻤﺤﺘﻭﺍﻫﺎ‪ .‬ﺍﻝﺩﺭﺍﺴﺔ ﺍﻷﻭﻝﻰ‪ :‬ﺍﻝﻭﺭﻗﺔ ﺍﻝﻌﻠﻤﻴﺔ]‪ ،[12‬ﻓﻲ ﻭﺭﻗﺔ ﺍﻝﺒﺤﺙ ﻫﺫﻩ ﺘﻡ ﺘﺠﺯﺌﺔ ﺍﻝﺼﻭﺭﺓ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺨﻭﺍﺭﺯﻤﻴـﺔ ‪K-mean‬‬
‫ﺍﻝﻌﻨﻘﻭﺩﻴﺔ ﻭﺍﻝﺘﻲ ﻴﺘﻡ ﺍﺴﺘﺨﺩﺍﻤﻬﺎ ﻓﻲ ﺍﻷﺒﺤﺎﺙ ﺍﻝﺨﺎﺼﺔ ﺒﺎﻝﺘﻌﺭﻑ ﻋﻠﻰ ﺍﻷﻨﻤﺎﻁ ]‪ [14][13‬ﻭﺫﻝﻙ ﻝﺘﻤﻜﻴﻥ ﺍﻝﺒﺤﺙ ﻭﺍﻻﺴـﺘﺭﺠﺎﻉ‬
‫ﻋﻠﻰ ﻤﺴﺘﻭﻯ ﺠﺯﺀ ﻤﻥ ﺍﻝﺼﻭﺭﺓ‪ ،‬ﺒﻌﺩ ﺫﻝﻙ ﺘﻡ ﺘﺼﻨﻴﻑ ﺠﺯﺀ ﺍﻝﺼﻭﺭﺓ ﺇﻝﻰ ﻨﻘﺎﻁ ﺘﺤﺘﻭﻱ ﻋﻠﻰ ﻜﺎﺌﻨﺎﺕ ﻭﻨﻘﺎﻁ ﺃﺨﺭﻯ ﻻ ﺘﺤﺘﻭﻱ‬
‫ﻋﻠﻰ ﻜﺎﺌﻨﺎﺕ ﺤﺘﻰ ﻴﻤﻜﻥ ﺍﺴﺘﺨﺩﺍﻡ ﺨﻭﺍﺹ ﻤﺘﻨﺎﺴﺒﺔ ﻤﻊ ﺍﻝﻨﻭﻉ‪.‬‬

‫‪ +‬ﻗﺴﻡ ﻋﻠﻭﻡ ﺍﻝﺤﺎﺴﻭﺏ ﻭﺘﻘﻨﻴﺔ ﺍﻝﻤﻌﻠﻭﻤﺎﺕ‪ ،‬ﺠﺎﻤﻌﺔ ﺍﻝﻌﻠﻭﻡ ﻭﺍﻝﺘﻜﻨﻭﻝﻭﺠﻴﺎ‪ ،‬ﺍﻝﻴﻤﻥ‪e-mail:abduohassan@yahoo.com ،‬‬
 ‫معت ‪4‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﺇﻥ ﺍﻝﺼﻨﻑ ﺍﻝﺫﻱ ﻴﺤﺘﻭﻱ ﻋﻠﻰ ﺍﻝﻜﺎﺌﻥ ﻴﺤﺘﻭﻱ ﻋﻠﻰ ﺃﺠﺯﺍﺀ ﻤﺘﻜﺘﻠﺔ ﺒﻴﻨﻤﺎ ﺍﻝﺼﻨﻑ ﺍﻝﺫﻱ ﻻ ﻴﺤﺘﻭﻱ ﻋﻠﻰ ﺍﻝﻜﺎﺌﻥ ﻤﻨﺘﺸﺭ ﻓـﻲ‬
‫‪ χ‬ﺍﻹﺤﺼﺎﺌﻲ‪ .‬ﻝﻘﺩ ﺘﻡ ﺘﻘﻴﻴﻡ ﺃﺩﺍﺀ ﻓﻬﺭﺴﺔ ﺃﺭﺒﻊ ﻤﻨﺎﻁﻕ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻝﺴﻠﻡ‬ ‫‪2‬‬
‫ﻜﺎﻤل ﻤﺸﻬﺩ ﺍﻝﺼﻭﺭﺓ ﻜﻤﺎ ﺘﻡ ﺘﺤﺩﻴﺩﻫﺎ ﺭﻴﺎﻀﻴﹰﺎ ﺒـ‬
‫ﺍﻹﺤﺼﺎﺌﻲ ﻭﺜﻼﺜﺔ ﻤﻨﺎﻁﻕ ﻋﻠﻰ ﺃﺴﺎﺱ ‪ .Wavelet‬ﻭﺘﻅﻬﺭ ﺍﻝﻨﺘﺎﺌﺞ ﺃﻨﻪ ﻤﻥ ﺨﻼل ﻓﻬﺭﺴﺔ ﺍﻝﻤﻨﺎﻁﻕ ﻋﻠﻰ ﺃﺴـﺎﺱ ‪Wavelet‬‬
‫ﺘﺯﻭﺩ ﺒﺄﺩﺍﺀ ﻤﻘﺎﺭﻨﺔ ﺠﻴﺩﺓ ﻝﻼﺴﺘﻌﻼﻡ ﻋﻥ ﺍﻝﻤﻨﺎﻁﻕ ﺍﻝﺘﻲ ﻻ ﺘﺤﺘﻭﻱ ﻋﻠﻰ ﺍﻝﻜﺎﺌﻨﺎﺕ‪ .‬ﺃﻤﺎ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻔﻬﺭﺴﺔ ﺍﻝﻤﻨـﺎﻁﻕ ﺒﺎﺴـﺘﺨﺩﺍﻡ‬
‫ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻓﺈﻨﻬﺎ ﺘﺯﻭﺩ ﺒﻤﻘﺎﺭﻨﺔ ﺠﻴﺩﺓ ﻝﻼﺴﺘﻌﻼﻡ ﻋﻥ ﺍﻝﻤﻨﺎﻁﻕ ﺍﻝﺘﻲ ﺘﺤﺘﻭﻱ ﻋﻠﻰ ﻜﺎﺌﻨﺎﺕ‪.‬‬
‫ﺍﻝﺩﺭﺍﺴﺔ ﺍﻝﺜﺎﻨﻴﺔ‪ :‬ﻓﻲ ﻫﺫﻩ ﺍﻝﻭﺭﻗﺔ ﺍﻝﺒﺤﺜﻴﺔ]‪ [15‬ﺘﻡ ﺍﻝﺘﺭﻜﻴﺯ ﻋﻠﻰ )ﻓﻬﺭﺴﺔ ﺍﻝﺼﻭﺭ ﻭﺍﻝﺒﺤﺙ ﻋﻨﻬﺎ ﻋﻠـﻰ ﺃﺴـﺎﺱ ‪(Wavelet‬‬
‫ﻭﺍﻝﺨﻭﺍﺭﺯﻤﻴﺔ ﺍﻝﻤﺴﺘﺨﺩﻤﺔ ﻓﻲ ﻓﻬﺭﺴﺔ ﺍﻝﺼﻭﺭ ﻭﺍﺴﺘﺭﺠﺎﻋﻬﺎ ﺘﻌﺘﻤﺩ ﻋﻠﻰ ﺘﺨﻁﻴﻁ ﺍﻝﺼﻭﺭﺓ ﺇﻝﻰ ﺃﺠﺯﺍﺀ ﻝﻠﺘﻤﻜﻥ ﻤﻥ ﺍﻝﺒﺤﺙ ﻋﻨﻬﺎ‬
‫ﻓﻲ ﻗﻭﺍﻋﺩ ﺍﻝﺒﻴﺎﻨﺎﺕ‪ .‬ﻭﺍﻝﺨﻭﺍﺭﺯﻤﻴﺔ ﺍﻝﻤﺴﺘﺨﺩﻤﺔ ﻫﻲ )‪ (Daubechies' wavelet‬ﻭﺍﻝﺘﻲ ﺒﺩﻭﺭﻫﺎ ﺘﺤﻭل ﻝﻭﻥ ﻜل ﻋﻨﺼﺭ ﻤـﻥ‬
‫ﻋﻨﺎﺼﺭ ﺍﻝﺼﻭﺭﺓ ﺍﻝﺜﻼﺜﺔ ‪ RGB‬ﺇﻝﻰ ﻤﻭﻴﺠﺎﺕ ﻭﺤﺴﺎﺏ ﻨﻁﺎﻗﻬﺎ )ﺍﻝﻤﺩﻯ ﺍﻝﺘﺭﺩﺩﻱ ﺍﻷﺩﻨﻰ ﻝﻬﺎ( ﻭﻓﻲ ﻗﺎﻋﺩﺓ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻴﺘﻡ ﺘﺤﺯﻴﻥ‬
‫ﻤﻌﺎﻤﻼﺕ ﺍﻝﻤﻭﻴﺠﺎﺕ ﻝﻠﺼﻭﺭﺓ ﻝﺘﺴﺭﻴﻊ ﺍﺴﺘﺭﺠﺎﻋﻬﺎ‪ ،‬ﻭﻴﺘﻡ ﺍﻝﺒﺤﺙ ﻋﻥ ﻁﺭﻴﻕ ﺃﺩﺍﺀ ﻤﻘﺎﺭﻨﺔ ﺒﻴﻥ ﺍﻝﺼﻭﺭﺓ ﺍﻝﻤﺨﺘﺎﺭﺓ ﻭﺍﻝﺼﻭﺭ ﻓﻲ‬
‫ﻗﺎﻋﺩﺓ ﺍﻝﺒﻴﺎﻨﺎﺕ‪ .‬ﻭﻗﺩ ﻭﻀﺢ ﺍﻝﺒﺎﺤﺙ ﺘﻘﻴﻴﻡ ﺍﻝﻨﺘﺎﺌﺞ ﻋﻥ ﻁﺭﻴﻕ ﺍﻝﺒﺤﺙ ﻋﻥ ﺼﻭﺭﺓ ﻓﻲ ﻗﺎﻋﺩﺓ ﺒﻴﺎﻨـﺎﺕ ﻤﻜﻭﻨـﺔ ﻤـﻥ ‪10000‬‬
‫ﺼﻭﺭﺓ ﻭﺃﻓﻀل ‪ 100‬ﺼﻭﺭﺓ ﺘﻡ ﺍﻝﺤﺼﻭل ﻋﻠﻴﻬﺎ ﻓﻲ ‪ 3.3‬ﺜﺎﻨﻴﺔ‪.‬‬

‫‪ .3‬ﻤﺸﻜﻠﺔ ﺍﻝﺒﺤﺙ‬
‫ﻼ ﻭﺒﺎﻝﺘـﺎﻝﻲ ﻻ‬
‫ﺇﻥ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﻓﻬﺭﺴﺔ ﺍﻝﻜﻠﻤﺎﺕ ﻭﺘﺨﺯﻴﻨﻬﺎ ﻓﻲ ﻗﺎﻋﺩﺓ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻴﺘﻁﻠﺏ ﻭﻗﺘﹰﺎ ﻁﻭﻴ ﹰ‬
‫ﻴﻭﻓﺭ ﺍﻝﻤﺭﻭﻨﺔ ﺍﻝﻼﺯﻤﺔ ﻝﻌﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭﺓ ﺍﻝﻤﻁﻠﻭﺒﺔ‪ ،‬ﺤﻴﺙ ﻗﺩ ﺘﺘﺸﺎﺒﻪ ﻋﺩﺓ ﺼﻭﺭ ﺒﻤﺴﻤﻰ ﻭﺍﺤﺩ‪.‬‬

‫‪ .4‬ﺃﻫﺩﺍﻑ ﺍﻝﺒﺤﺙ‬
‫ﻴﻬﺩﻑ ﺍﻝﺒﺤﺙ ﺇﻝﻰ ﺍﻝﺘﻘﻠﻴل ﻤﻥ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻝﻌﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺘﺸﺎﺒﻬﺔ ﻓﻲ ﻗﻭﺍﻋﺩ ﺍﻝﺒﻴﺎﻨـﺎﺕ ﻭﻴﺘﻤﺜـل ﻓـﻲ‬
‫ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺍﻝﺒﺤﺙ ﺒـ )‪ (Search by model‬ﻭﺫﻝﻙ ﻋﻨﺩﻤﺎ ﻴﻘﻭﻡ ﺍﻝﻤﺴﺘﺨﺩﻡ ﺒﺘﺤﺩﻴﺩ ﺠﺯﺀ ﻤﻥ ﺼﻭﺭﺓ ﺃﻭ‬
‫ﺼﻭﺭﺓ ﻜﺎﻤﻠﺔ ﻭﺍﻝﺒﺤﺙ ﺒﻭﺍﺴﻁﺘﻬﺎ ﻋﻥ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺸﺎﺒﻬﺔ ﻝﻬﺎ ﻓﻲ ﻗﺎﻋﺩﺓ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻭﻭﻀﻌﻬﺎ ﻜﺩﻝﻴل ﺒﺤﺙ ﻓﻲ ﻗﺎﻋـﺩﺓ ﺍﻝﺒﻴﺎﻨـﺎﺕ‬
‫ﻭﻤﻘﺎﺭﻨﺔ ﻭﺠﻪ ﺍﻝﺘﺸﺎﺒﻪ ﻤﻊ ﻫﺫﻩ ﺍﻝﺼﻭﺭﺓ‪ ،‬ﻭﺫﻝﻙ ﻝﻀﻤﺎﻥ ﺍﻝﺩﻗﺔ ﻓﻲ ﻨﺘﺎﺌﺞ ﺍﻝﺒﺤﺙ‪.‬‬

‫‪ .5‬ﻤﻨﻬﺠﻴﺔ ﺍﻝﺒﺤﺙ‬
‫ﺍﺴﺘﺨﺩﻤﺕ ﺃﺴﺎﻝﻴﺏ ﺍﻝﻨﻤﺫﺠﺔ ﺍﻝﺭﻴﺎﻀﻴﺔ ﻭﺍﻝﺒﺭﻤﺠﺔ ﻭﺘﻘﻨﻴﺎﺕ ﻤﻌﺎﻝﺠﺔ ﺍﻹﺸﺎﺭﺍﺕ ﺍﻝﺭﻗﻤﻴﺔ ﻭﺍﻝﺘﺼﻭﻴﺭ‪.‬‬

‫‪ .6‬ﺍﻝﺼﻭﺭ ﺍﻝﺭﻗﻤﻴﺔ‬

‫ﻴﻤﻜﻥ ﺘﻌﺭﻴﻑ ﺃﻱ ﺼﻭﺭﺓ ﻋﻠﻰ ﺃﻨﻬﺎ ﺩﺍﻝﺔ ﺫﺍﺕ ﺒﻌﺩﻴﻥ )‪ (two dimensional function‬ﺩ)ﺱ ‪ ،‬ﺹ( ﺤﻴﺙ ﺱ‪ ،‬ﺹ ﻫﻤـﺎ‬
‫ﺇﺤﺩﺍﺜﻴﺎﺕ ﻤﺴﺘﻭﻴﺔ‪ ،‬ﻭﺘﺴﻤﻲ ﻗﻴﻤﺔ ﺍﻝﺩﺍﻝﺔ ) ﺩ( ﻋﻨﺩ ﺃﻱ ﺯﻭﺝ ﻤﻥ ﺍﻹﺤﺩﺍﺜﻴﺎﺕ ﺒــ " ﺍﻝﻤﺴـﺘﻭﻯ ﺍﻝﺭﻤـﺎﺩﻱ" )‪ ( gray level‬ﺃﻭ‬
‫ﺍﻝﺸﺩﺓ )‪ (intensity‬ﻋﻨﺩ ﻫﺫﻩ ﺍﻝﻨﻘﻁﺔ‪ .‬ﺘﺴﻤﻰ ﺍﻝﺼﻭﺭﺓ ﺒـ "ﺍﻝﺼﻭﺭﺓ ﺍﻝﺭﻗﻤﻴﺔ" ﻋﻨﺩﻤﺎ ﺘﻜﻭﻥ ﻗﻴﻡ )ﺱ‪ ،‬ﺹ‪ ،‬ﺩ( ﻜﻠﻬـﺎ ﺘﻨﺘﻤـﻲ‬
‫ﻝﻤﺠﻤﻭﻋﺔ ﻤﻥ ﺍﻝﻘﻴﻡ ﺍﻝﻤﺤﺩﺩﺓ )‪ ،(discrete quantities‬ﺘﺴﻤﻰ ﻫﺫﻩ ﺍﻝﻌﻨﺎﺼﺭ )‪ (picture elements‬ﺃﻭ)‪.(pixels‬‬
‫ﻭﻫﻨﺎ ﻴﻤﻜﻥ ﺘﻭﻀﻴﺢ ﺍﻝﻤﻘﺼﻭﺩ ﺒﻜل ﻤﻥ "ﻤﻌﺎﻝﺠﺔ ﺍﻝﺼﻭﺭ" ﻭ"ﺘﺤﻠﻴل ﺍﻝﺼﻭﺭ" ﻭ "ﺍﻝﺭﺅﻴﺔ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻝﺤﺎﺴﺏ"]‪.[2][1‬‬
 ‫معت ‪5‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫
ﻤﻌﺎﻝﺠﺔ ﺍﻝﺼﻭﺭ‪ :‬ﻫﻲ ﻋﻤﻠﻴﺔ ﺘﻜﻭﻥ ﻤﺩﺨﻼﺘﻬﺎ ﺼﻭﺭﺓ ﻭﻤﺨﺭﺠﺎﺘﻬﺎ ﺼﻭﺭﺓ ﺃﺨﺭﻯ ﻤﺜل ﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺘﺤﺴﻴﻥ ﺍﻝﺼﻭﺭﺓ‪.‬‬
‫
ﺍﻝﺭﺅﻴﺔ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻝﺤﺎﺴﺏ‪ :‬ﺘﻬﺘﻡ ﺒﻤﺤﺎﻜﺎﺓ ﻗﺩﺭﺓ ﺍﻹﻨﺴﺎﻥ ﻋﻠﻰ ﺍﻝﺭﺅﻴﺔ ﺒﻤﺎ ﻴﺘﻀﻤﻥ ﺍﻝﻘﺩﺭﺓ ﻋﻠﻰ ﺍﻝﺘﻌﻠﻡ ﻭﺍﻻﺴﺘﻨﺘﺎﺝ ﻭﺍﺘﺨﺎﺫ‬
‫ﺭﺩﻭﺩ ﺃﻓﻌﺎل ﺒﻨﺎﺀ ﻋﻠﻰ ﻤﺩﺨﻼﺕ ﺒﺼﺭﻴﺔ‪.‬‬
‫ﻻ ﻤﺘﻭﺴﻁﹰﺎ ﺒﻴﻥ ﺍﻝﺭﺅﻴﺔ ﺒﺎﻝﺤﺎﺴﺏ ﻭﻤﻌﺎﻝﺠﺔ ﺍﻝﺼﻭﺭ‪ .‬ﻴﺼﻌﺏ ﺇﻝﻰ ﺤﺩ ﻤﺎ ﺇﻴﺠﺎﺩ ﺤﺩﻭﺩ ﻓﺎﺼﻠﺔ ﺒﻴﻥ‬
‫
ﺘﺤﻠﻴل ﺍﻝﺼﻭﺭ‪ :‬ﻴﻌﺩ ﻤﺠﺎ ﹸ‬
‫ﻫﺫﻩ ﺍﻝﻤﻭﺍﻀﻴﻊ ﺍﻝﺜﻼﺜﺔ )ﻤﻌﺎﻝﺠﺔ ﺍﻝﺼﻭﺭ‪ ،‬ﻭﺘﺤﻠﻴﻠﻬﺎ ﻭﺍﻝﺭﺅﻴﺔ ﺒﺎﻝﺤﺎﺴﺏ(‪ ،‬ﺇﻻ ﺃﻨﻪ ﻴﻤﻜﻥ ﺘﻘﺴﻴﻡ ﺍﻝﻌﻤﻠﻴﺎﺕ ﺍﻝﺘﻲ ﻴﺴﺘﺨﺩﻡ ﻓﻴﻬـﺎ‬
‫ﺍﻝﺤﺎﺴﺏ ﻓﻲ ﻫﺫﺍ ﺍﻝﻤﺠﺎل ﺇﻝﻲ ﺜﻼﺜﺔ ﻤﺴﺘﻭﻴﺎﺕ‪:‬‬
‫‪ .1‬ﻋﻤﻠﻴﺎﺕ ﺫﺍﺕ ﻤﺴﺘﻭﻯ ﻤﻨﺨﻔﺽ ﻭﺍﻝﺘﻲ ﺘﺘﻀﻤﻥ ﺇﺯﺍﻝﺔ ﺍﻝﺘﺸﻭﻩ ﻭﺘﺤﺴﻴﻥ ﺍﻝﺘﺒﺎﻴﻥ ﻭﺯﻴﺎﺩﺓ ﺤﺩﺓ ﺍﻝﺼﻭﺭﺓ‪.‬‬
‫‪ .2‬ﻋﻤﻠﻴﺎﺕ ﺫﺍﺕ ﻤﺴﺘﻭﻯ ﻤﺘﻭﺴﻁ ﻭﺍﻝﺘﻲ ﺘﺘﻀﻤﻥ ﺘﻘﺴﻴﻡ ﺍﻝﺼﻭﺭﺓ ﺇﻝﻰ ﻤﻨﺎﻁﻕ ﺃﻭ ﻋﻨﺎﺼﺭ‪ ،‬ﺜـﻡ ﻭﺼـﻑ ﻫـﺫﻩ ﺍﻝﻌﻨﺎﺼـﺭ‬
‫ﻻﺨﺘﺯﺍﻝﻬﺎ ﺇﻝﻰ ﺘﻤﺜﻴل ﺼﺎﻝﺢ ﻝﻠﻤﻌﺎﻝﺠﺔ ﺒﺎﻝﺤﺎﺴﺏ‪ ،‬ﻜﻤﺎ ﺘﺸﻤل ﺃﻴﻀﹰﺎ ﻋﻤﻠﻴﺎﺕ ﺍﻝﺘﻌﺭﻑ ﻋﻠﻰ ﻋﻨﺎﺼﺭ ﻤﺤﺩﺩﺓ ﺒﺎﻝﺼﻭﺭﺓ‪.‬‬
‫‪ .3‬ﻋﻤﻠﻴﺎﺕ ﺫﺍﺕ ﻤﺴﺘﻭﻯ ﻋﺎل ﻭﻫﺫﻩ ﺘﺘﻀﻤﻥ ﻋﻤﻠﻴﺔ ﻓﻬﻡ ﺃﻭ ﺇﺩﺭﺍﻙ )‪ (making sense‬ﻝﻤﺠﻤﻭﻋﺔ ﻤﻥ ﺍﻝﻌﻨﺎﺼﺭ ﺍﻝﺘـﻲ ﺘـﻡ‬
‫ﺍﻝﺘﻌﺭﻑ ﻋﻠﻴﻬﺎ ﻭﻓﻲ ﻗﻤﺔ ﻋﻤﻠﻴﺎﺕ ﻫﺫﺍ ﺍﻝﻤﺴﺘﻭﻯ ﺘـﺄﺘﻲ ﻋﻤﻠﻴـﺎﺕ ﺍﻝـﺘﻌﻠﻡ ﻭﺍﻜﺘﺴـﺎﺏ ﺍﻝﻤﻌﺭﻓـﺔ ﺍﻝﻤﺭﺘﺒﻁـﺔ ﺒﺎﻝﺭﺅﻴـﺔ‬
‫ﺒﺎﻝﺤﺎﺴﺏ ]‪.[2] [1‬‬

‫‪ .7‬ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ )‪(Histogram‬‬

‫ﻫﻭ ﻋﺒﺎﺭﺓ ﻋﻥ ﺩﺍﻝﺔ ﻭﺼﻔﻴﺔ )ﺭﺴﻡ ﺒﻴﺎﻨﻲ( ﺘﻭﻀﺢ ﺘﻭﺯﻴﻊ ﺍﻝﻤﺴﺘﻭﻴﺎﺕ ﺍﻝﻠﻭﻨﻴﺔ ﻭﻨﺴﺒﺘﻬﺎ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻠﺼﻭﺭﺓ‪ ،‬ﺃﻤﺎ ﺩﺍﻝـﺔ ﺘﻁﺒﻴـﻊ‬
‫ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ)‪ (normalised histogram function‬ﻓﺘﻌﻁﻲ ﻤﻘﻴﺎﺱ ﻜﻤﻴﺔ ﺸﺩﺓ ﻜل ﺒﻜﺴل ﻓﻲ ﺍﻝﺼﻭﺭﺓ‪ .‬ﺇﻥ ﻁﺭﻴﻘﺔ ﺘﺤﻠﻴل‬
‫ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻤﻥ ﺃﻜﺜﺭ ﺍﻝﻁﺭﺍﺌﻕ ﻓﺎﻋﻠﻴﺔ ﻝﻤﻘﺎﺭﻨﺔ ﺍﻝﺼﻭﺭ ﻭﻓﻬﺭﺴﺘﻬﺎ‪ ،‬ﻝﺫﺍ ﻴﻭﺠﺩ ﻝﻜل ﺼﻭﺭﺓ ﺴﻠﻡ ﺇﺤﺼﺎﺌﻲ ﺨﺎﺹ ﺒﻬﺎ ﻋﺩﺍ‬
‫ﻓﻲ ﺤﺎﻝﺔ ﺘﻁﺎﺒﻕ ﺍﻝﺼﻭﺭ ﻓﺎﻥ ﺴﻼﻝﻤﻬﺎ ﺍﻹﺤﺼﺎﺌﻴﺔ ﺘﺘﻁﺎﺒﻕ]‪.[3‬‬

‫ﺸﻜل)‪ :(1‬ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻝﻠﺼﻭﺭﺓ‪.‬‬

‫‪ .8‬ﺍﻝﻨﻤﺫﺠﺔ ﺍﻝﺭﻴﺎﻀﻴﺔ‬

‫‪ 1.8‬ﻁﺭﻴﻘﺔ ﺘﻘﺴﻴﻡ ﺃﻝﻭﺍﻥ ‪ RGB‬ﻭﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻷﻝﻭﺍﻥ‬

‫ﻝﻭ ﻋﺭ‪‬ﻓﻨﺎ ﻤﺠﻤﻭﻋﺔ ﺍﻷﻝﻭﺍﻥ ﻓﻲ ﺼﻭﺭﺓ ﻤﺎ ﺒـ ‪ C‬ﻓﺎﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﻴﻤﻜﻥ ﺼﻴﺎﻏﺘﻬﺎ ﻜﺎﻵﺘﻲ ]‪:[4‬‬

‫‪ 0 ≤ I (C ) < I max‬ﺃﻭ ‪0 ≤ I (C ) < 256‬‬ ‫……………‬ ‫)‪(1‬‬

‫ﺃﻤﺎ ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﻝﻠﺼﻭﺭﺓ ﺍﻝﻤﻠﻭﻨﺔ ﻓﻴﻤﻜﻥ ﺤﺴﺎﺒﻬﺎ ﺒﺎﻝﻤﻌﺎﺩﻝﺔ ﺍﻵﺘﻴﺔ‪:‬‬

‫) ‪I (C ) = 0.3 ⋅ R (C ) + 0.59 ⋅ G (C ) + 0.11 ⋅ B (C‬‬ ‫……………‬ ‫)‪(2‬‬

 ‫معت ‪6‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﻭﻝﻌﻤﻠﻴﺔ ﺍﻝﻤﻘﺎﺭﻨﺔ ﺒﻴﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﻴﺴﺘﺨﺩﻡ ﻤﻔﻬﻭﻡ ﺍﻝﻤﺴﺎﻓﺔ ﺒﻴﻥ ﺸﺩﺘﻬﺎ‪ ،‬ﻭﻝﻠﻤﻘﺎﺭﻨـﺔ ﺒـﻴﻥ‬
‫ﺼﻭﺭﺘﻴﻥ ﻭﺤﺴﺎﺏ ﻤﻘﺩﺍﺭ ﺍﻝﺘﺸﺎﺒﻪ ﺒﻴﻨﻬﻤﺎ ﺘﺴﺘﺨﺩﻡ ﺍﻝﻤﻌﺎﺩﻝﺔ ﺍﻝﺘﺎﻝﻴﺔ‪:‬‬

‫‪p‬‬
‫‪1 N −1 1‬‬
‫= ) ‪d p ( h, h‬‬
‫‪1‬‬ ‫‪2‬‬ ‫‪p‬‬ ‫‪⋅ ∑ hi − 2 hi‬‬ ‫……………‬ ‫)‪(3‬‬
‫‪N i =0‬‬

‫ﺤﻴﺙ‪:‬‬
‫‪ : 1 hi , 2 hi‬ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﻝﻠﺼﻭﺭﺘﻴﻥ ﺍﻝﺩﺍﺨﻠﺘﻴﻥ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﻤﻘﺎﺭﻨﺔ‪.‬‬
‫‪ :P‬ﺘﻤﺜل ﻋﺩﺩ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﻤﻘﺎﺭﻨﺔ ﻭﻫﻨﺎ ﺼﻭﺭﺘﻴﻥ‪.‬‬
‫‪ :N‬ﺘﻤﺜل ﺍﻝﻤﺩﻯ ﺍﻝﻠﻭﻨﻲ ﻝﻜل ﻤﺭﻜﺒﺔ )‪ (R,G,B‬ﺤﻴﺙ ﻝﻜل ﻤﺭﻜﺒﺔ ﻤﺩﻯ ﻝﻭﻨﻲ ﻤﻥ ‪ 0‬ﺇﻝﻰ ‪.255‬‬
‫ﻭﻝﻤﻌﺭﻓﺔ ﻤﻘﺩﺍﺭ ﺍﻝﺘﺸﺎﺒﻪ ﺒﻴﻥ ﺍﻝﺼﻭﺭﺘﻴﻥ ﺍﻝﺩﺍﺨﻠﺘﻴﻥ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل ﺤﺴﺏ ﺍﻝﻤﻌﺎﺩﻝﺔ ﺍﻝﺴﺎﺒﻘﺔ ﻫﻭ ﺍﻨﻪ ﻜﻠﻤﺎ ﻜﺎﻥ )‪d p ( 1h, 2 h‬‬
‫ﺃﻗل ﻤﺎ ﻴﻤﻜﻥ ﻜﺎﻥ ﺍﻝﺘﺸﺎﺒﻪ ﺒﻴﻥ ﺍﻝﺼﻭﺭﺘﻴﻥ ﺃﻜﺒﺭ‪.‬‬

‫‪ .2.8‬ﻁﺭﻴﻘﺔ ﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‬

‫ﻓﻲ ﺍﺴﺘﻌﺭﺍﺽ ﻁﺭﻴﻘﺔ )‪ (1‬ﻓﺈﻥ ﺘﺤﻠﻴل ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻝﺸﺩﺓ ﺍﻝﺼﻭﺭﺓ ﻫﻭ ﻭﺼﻑ ﻋﺎﻡ ﻝﻠﻌﻨﺎﺼﺭ‪ ،‬ﻭﻫﺫﺍ ﺍﻝﻨﻬﺞ ﻻ ﻴﺄﺨﺫ ﻓﻲ‬
‫ﺍﻻﻋﺘﺒﺎﺭ ﺨﺼﻭﺼﻴﺎﺕ ﻜل ﻝﻭﻥ ﻤﻥ ﻤﻜﻭﻨﺎﺘﻬﺎ‪ .‬ﻝﺫﻝﻙ ﺃﺠﺭﻴﺕ ﺒﺤﻭﺙ ﻝﺘﺤﺴﻴﻥ ﺍﺴﻠﻭﺏ ﺘﻘﺴﻴﻡ ﺴﻁﻭﻉ ﺍﻷﻝﻭﺍﻥ ‪ RGB‬ﻭﺘﺤﻠﻴـل‬
‫ﺸﺩﺘﻬﺎ ﻤﻊ ﺍﻷﺨﺫ ﻓﻲ ﺍﻻﻋﺘﺒﺎﺭ ﺍﻝﻌﻨﺎﺼﺭ ﺍﻝﻤﺤﻴﻁﺔ ]‪.[6‬‬

‫‪R r 1 ( i ) = H 1 r [ i ] − H 2 r [ i − 1] ,‬‬ ‫ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻸﺤﻤﺭ‬

‫‪R r 2 (i) = H 1r [i] − H 2 r [i] ,‬‬ ‫……………‬ ‫)‪(4‬‬

‫]‪R r 3 ( i ) = H 1 r [ i ] − H 2 r [ i + 1‬‬

‫‪R g 1 ( i ) = H 1 g [ i ] − H 2 g [ i − 1] ,‬‬
‫ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻸﺨﻀﺭ‬
‫‪R g 2 (i ) = H 1 g [i ] − H 2 g [i ] ,‬‬
‫……………‬ ‫)‪(5‬‬
‫]‪R g 3 ( i ) = H 1 g [ i ] − H 2 g [ i + 1‬‬

‫‪R b 1 ( i ) = H 1 b [ i ] − H 2 b [ i − 1] ,‬‬ ‫ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻸﺯﺭﻕ‬

‫‪R b 2 (i ) = H 1b [i ] − H 2 b [i ] ,‬‬ ‫……………‬ ‫)‪(6‬‬
‫]‪R b 3 ( i ) = H 1 b [ i ] − H 2 b [ i + 1‬‬

‫ﻓﻲ ﺍﻝﻤﻌﺎﺩﻻﺕ ﺍﻝﺜﻼﺙ ﺍﻝﺴﺎﺒﻘﺔ )‪ (6 ،5 ،4‬ﺇﻥ ‪ H1,H2‬ﻫﻤﺎ ﻋﺒﺎﺭﺓ ﻋﻥ ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻝﻠﺼﻭﺭﺓ ﺍﻝﺩﺍﺨﻠﺔ ﻭﺍﻝﺼﻭﺭﺓ ﺍﻝﺘﻲ‬
‫ﺴﺘﻘﺎﺭﻥ ﻤﻌﻬﺎ‪ ،‬ﻭﻝﺤﺴﺎﺏ ﺍﻝﻔﺭﻕ ﺒﻴﻥ ﺼﻭﺭﺘﻴﻥ) ﺍﻝﻤﺴﺎﻓﺔ ﺍﻷﻗل ﺒﻴﻥ ﺍﻝﺴﻠﻤﻴﻥ ﺍﻹﺤﺼﺎﺌﻴﻴﻥ ﻝﻜل ﻤﻜﻭﻥ ﻝﻭﻨﻲ ﻝﻠﺼـﻭﺭﺘﻴﻥ(]‪[9‬‬
‫ﺘﻜﻭﻥ ﻜﺎﻝﺘﺎﻝﻲ‪:‬‬
 ‫معت ‪7‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﺍﻝﻔﺭﻕ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻸﺤﻤﺭ‪:‬‬

‫‪N −1‬‬
‫= ‪Sr‬‬ ‫‪∑ min( R‬‬
‫‪i =0‬‬
‫‪rk‬‬ ‫)) ‪( i‬‬ ‫‪1≤ k ≤ 3‬‬ ‫‪................‬‬ ‫)‪(7‬‬

‫ﺍﻝﻔﺭﻕ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻸﺨﻀﺭ‪:‬‬

‫‪N −1‬‬
‫= ‪Sg‬‬ ‫‪∑ min( R‬‬
‫‪i =0‬‬
‫‪gk‬‬ ‫)) ‪( i‬‬ ‫‪1≤ k ≤ 3‬‬ ‫‪................‬‬ ‫)‪(8‬‬

‫ﺍﻝﻔﺭﻕ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻸﺯﺭﻕ‪:‬‬

‫‪N −1‬‬
‫= ‪Sb‬‬ ‫(‪∑ min‬‬
‫‪i =0‬‬
‫)) ‪R bk ( i‬‬ ‫‪1≤ k ≤3‬‬ ‫‪................‬‬ ‫)‪(9‬‬

‫ﻭﺍﻝﺼﻴﻐﺔ ﻝﺤﺴﺎﺏ ﺍﻝﻔﺭﻕ ﺒﻴﻥ ﺼﻭﺭﺘﻴﻥ ﻝﻠﺜﻼﺙ ﺍﻝﻤﺭﻜﺒﺎﺕ ‪ RGB‬ﻤﻊ ﺒﻌﻀﻬﺎ ﻴﻤﻜﻥ ﻜﺘﺎﺒﺘﻬﺎ ﻜﺎﻝﺘﺎﻝﻲ‪:‬‬

‫= ) ‪d ( H 1, H 2‬‬ ‫‪S r2 + S g2 + S b2‬‬

‫‪................‬‬ ‫)‪(10‬‬

‫ﺃﻤﺎ ﺍﻝﺼﻴﻐﺔ ﺍﻝﻌﺎﻤﺔ ﻝﺤﺴﺎﺏ ﻤﺩﻯ ﺘﺸﺎﺒﻪ ﺼﻭﺭﺘﻴﻥ ﻤﻊ ﺤﺴﺎﺏ ﺍﻝﻔﺭﻕ ﺒﻴﻨﻬﻤﺎ ﻝﻠﻤﺭﻜﺒﺎﺕ ﺍﻝﺜﻼﺙ ‪ RGB‬ﻓﻬﻲ ﻜﺎﻷﺘﻲ‪:‬‬

‫‪2‬‬
‫‪ N −1‬‬ ‫‪‬‬
‫]‪ ∑ min( H1r [i] − H2 r [i − 1] , H1r [i] − H2 r [i] , H1r [i] − H2 r [i + 1‬‬ ‫‪) ‬‬ ‫‪+‬‬
‫‪ i =0‬‬ ‫‪‬‬
‫‪2‬‬
‫‪ N −1‬‬ ‫‪‬‬
‫]‪d(H1, H2) =  ∑ min( H1 g [i] − H2 g [i − 1] , H1 g [i] − H2 g [i] , H1 g [i] − H2 g [i + 1‬‬ ‫‪) ‬‬ ‫‪+‬‬ ‫)‪(11‬‬
‫‪ i =0‬‬ ‫‪‬‬
‫‪2‬‬
‫‪ N −1‬‬ ‫‪‬‬
‫]‪ ∑ min( H1b [i] − H2 b [i − 1] , H1b [i] − H2 b [i] , H1b [i] − H2 b [i + 1‬‬ ‫‪) ‬‬
‫‪ i =0‬‬ ‫‪‬‬

‫‪ .3.8‬ﻁﺭﻴﻘﺔ ﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻝﻠﻭﻥ‬

‫ﻤﻥ ﺍﻷﺴﺎﻝﻴﺏ ﺍﻝﺘﻲ ﺘﺠﻌل ﻤﻥ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﺃﻜﺜﺭ ﻤﺭﻭﻨﺔ ﻫﻲ ﺃﻥ ﻴﻜﻭﻥ ﺒﺎﻹﻤﻜﺎﻥ ﺇﺩﺨﺎل ﻨﺴﺏ ﻤﺤﺩﺩﺓ ﻤﻥ ﺍﻷﻝﻭﺍﻥ ﻭﺍﻝﺒﺤﺙ‬
‫ﻓﻲ ﻗﻭﺍﻋﺩ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻋﻥ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺸﺎﺒﻬﺔ ﻝﻬﺫﻩ ﺍﻝﻨﺴﺏ )ﻋﻠﻰ ﺴﺒﻴل ﺍﻝﻤﺜﺎل‪ ،‬ﺇﻴﺠﺎﺩ ﺼﻭﺭﺓ ﻝﻬﺎ ﻨﺴﺒﺔ ﻤﻥ ﺍﻷﻝﻭﺍﻥ ﻭﻝـﺘﻜﻥ ﻝﻬـﺎ‬
‫‪ ٪20‬ﻝﻭﻥ ﺍﺤﻤﺭ ﻭ ‪ ٪ 30‬ﻝﻭﻥ ﺍﺯﺭﻕ( ]‪.[7‬‬
 ‫معت ‪8‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﻝﻨﻔﺭﺽ ﺃﻥ ﻤﺠﻤﻭﻋﺔ ﻤﻥ ﺃﻝﻭﺍﻥ ﺒﻜﺴﻼﺕ ﺍﻝﺼﻭﺭﺓ ﻫﻲ ]‪ ، K=NumP[i‬ﻭﻜل ﺒﻜﺴﻼﺕ ﺍﻝﺼﻭﺭﺓ ﻫـﻲ ‪ ،NumAll‬ﻓﻤـﻥ‬
‫ﺍﻝﺒﺩﻴﻬﻲ ﺘﻤﺜﻴل ﺍﻝﺼﻭﺭﺓ ﻜﺎﻷﺘﻲ‪:‬‬
‫‪NumAll = width ⋅ height‬‬
‫ﺤﻴﺙ ‪ width, height‬ﺘﻤﺜل ﻁﻭل ﺍﻝﺼﻭﺭﺓ ﻭﻋﺭﻀﻬﺎ‪ ،‬ﻭﻝﺤﺴﺎﺏ ﻨﺴﺒﺔ ﺃﻱ ﻝﻭﻥ ﻓﻲ ﺍﻝﺼﻭﺭﺓ ﻓﺎﻥ ﻤﻌﺎﺩﻝﺘﻬﺎ ﺘﻜﻭﻥ ﻜﺎﻵﺘﻲ‪:‬‬
‫] ‪NumP [ i‬‬
‫= ] ‪Pr oc [ i‬‬ ‫‪⋅ 100%, i ∈ K‬‬
‫‪NumAll‬‬

‫ﺍﻝﻤﻌﺎﺩﻝﺔ ﺍﻝﺴﺎﺒﻘﺔ ﻝﺤﺴﺎﺏ ﻤﺭﻜﺏ ﻝﻭﻨﻲ ﻭﺍﺤﺩ‪ ،‬ﺃﻤﺎ ﺒﺎﻝﻨﺴﺒﺔ ﻝﻤﺭﻜﺒﺎﺕ ﻝﻭﻨﻴﺔ ﺜﻼﺜﺔ ‪ RGB‬ﻓﺘﻜﻭﻥ ﺍﻝﻤﻌﺎﺩﻝﺔ ﻜﺎﻝﺘﺎﻝﻲ‪:‬‬

‫] )‪ NumP[i GB(R − 1‬‬ ‫‪NumP[i RB(G − 1) ] ‬‬

‫‪‬‬ ‫‪+‬‬ ‫‪+‬‬
‫‪‬‬ ‫‪NumAll‬‬ ‫‪NumAll‬‬ ‫‪‬‬
‫] )‪ NumP[i RG(B − 1‬‬ ‫] ‪NumP[i RGB‬‬ ‫‪‬‬
‫‪‬‬ ‫‪+‬‬ ‫‪+‬‬ ‫‪‬‬
‫]‪Proc[i‬‬ ‫=‬ ‫‪‬‬ ‫‪NumAll‬‬ ‫‪NumAll‬‬ ‫‪ ⋅ 100%,‬‬ ‫‪i∈ K‬‬ ‫‪………..‬‬ ‫)‪(12‬‬
‫] )‪ NumP[i GB(R + 1‬‬ ‫‪NumP[i RB(G + 1) ] ‬‬
‫‪‬‬ ‫‪+‬‬ ‫‪+‬‬
‫‪‬‬ ‫‪NumAll‬‬ ‫‪NumAll‬‬ ‫‪‬‬
‫‪‬‬ ‫] )‪NumP[i RG(B + 1‬‬ ‫‪‬‬
‫‪‬‬ ‫‪‬‬
‫‪‬‬ ‫‪NumAll‬‬ ‫‪‬‬

‫ﻭﻝﻠﻤﻘﺎﺭﻨﺔ ﺒﻴﻥ ﻨﺴﺏ ﺘﺸﺎﺒﻪ ﺼﻭﺭﺘﻴﻥ ﻓﺎﻥ ﻤﻌﺎﺩﻝﺘﻬﻤﺎ ﺍﻝﺭﻴﺎﻀﻴﺔ ﺘﻜﻭﻥ ﻜﺎﻷﺘﻲ‪:‬‬

‫‪1 K −1‬‬
‫) ] ‪⋅ ∑ (Pr ocA [ i ] − Pr ocB [ i‬‬ ‫)‪(13‬‬
‫‪2‬‬
‫= ) ‪d ( A, B‬‬ ‫‪…………….‬‬
‫‪K‬‬ ‫‪i‬‬ ‫=‬ ‫‪0‬‬

‫ﺤﻴﺙ ‪ A,B‬ﺘﻤﺜﹼﻼﻥ ﻗﻴﻡ ﺍﻝﻨﺴﺏ ﺍﻝﻠﻭﻨﻴﺔ ﻝﻠﺼﻭﺭﺘﻴﻥ ﺍﻝﻤﺩﺨﻠﺘﻴﻥ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﻤﻘﺎﺭﻨﺔ‪.‬‬

‫‪ .9‬ﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺘﻘﻴﻴﻡ ﺃﻭﺠﻪ ﺍﻝﺘﺸﺎﺒﻪ ﻭﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ‬

‫ﻭﻓﻘﹰﺎ ﻝﺼﻴﻎ ﺍﻝﻤﻌﺎﺩﻻﺕ ﺭﻗﻡ )‪ ،(13)-(1‬ﻓﺈﻥ ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺍﻵﺘﻴﺔ ﻭﻀﻌﺕ ﻭﻨﻔﺫﺕ ﻭﻓﻕ ﺘﻠﻙ ﺍﻝﺼﻴﻎ ﻝﺘﻘﻴﻴﻡ ﻤﺩﻯ ﺍﻝﺘﺸـﺎﺒﻪ‬
‫ﻭﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ‪.‬‬

‫‪ .1.9‬ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ‬

‫ﺒﻌﺩ ﺘﺤﻤﻴل ﺍﻝﺼﻭﺭﺓ ﺇﻝﻰ ﺍﻝﺒﺭﻨﺎﻤﺞ ﻭﺤﺴﺎﺏ ﻁﻭل ﻫﺫﻩ ﺍﻝﺼﻭﺭﺓ ﻭﻋﺭﻀﻬﺎ ﻴﺘﻡ ﺘﺨﺯﻴﻥ ﻗﻴﻡ ﺍﻝـ ‪ Pixels‬ﻓﻲ ﻤﺼﻔﻭﻓﺔ ﻝﻜـﻲ‬
‫ﻴﺘﻡ ﺍﺴﺘﺨﺩﺍﻡ ﺼﻴﻐﺔ ﺍﻝﻤﻌﺎﺩﻝﺔ ﺭﻗﻡ)‪ (2‬ﻝﺤﺴﺎﺏ ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﺘﻜﻭﻥ ﻜﺎﻵﺘﻲ‪:‬‬
 ‫معت ‪9‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫‪i‬‬
‫≥ ) ‪I( c‬‬
‫‪N ⋅ 255‬‬
‫&‬
‫‪i +1‬‬
‫≤ ) ‪I( c‬‬
‫‪N ⋅ 255‬‬

‫ﺸﻜل)‪ :(2‬ﻁﺭﻴﻘﺔ ﺤﺴﺎﺏ ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﻝﻠﺼﻭﺭﺓ ﺍﻝﺩﺍﺨﻠﺔ ﺇﻝﻰ ﺍﻝﺒﺭﻨﺎﻤﺞ‪.‬‬

‫ﺒﻌﺩ ﻋﻤﻠﻴﺔ ﺤﺴﺎﺏ ﺸﺩﺓ ﺍﻝﺘﺒﺎﻴﻥ ﻝﻠﺼﻭﺭﺓ ﺍﻝﺩﺍﺨﻠﺔ ﺍﻷﺼﻠﻴﺔ ﻭﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﻤﻘﺎﺭﻨﺔ ﻴﺘﻡ ﺤﺴﺎﺏ ﻤﻘﺩﺍﺭ ﺍﻝﺘﺸـﺎﺒﻪ‬
‫ﺒﻴﻥ ﺘﻠﻙ ﺍﻝﺼﻭﺭ ﻭﻓﻘﹰﺎ ﻝﻠﻤﻌﺎﺩﻝﺔ ﺭﻗﻡ )‪.(3‬‬
‫م ع ت ‪10‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫‪p‬‬
‫‪1 N −1 1 2‬‬
‫= ) ‪d p ( h, h‬‬
‫‪1‬‬ ‫‪2‬‬ ‫‪p‬‬
‫‪⋅ ∑ hi − hi‬‬ ‫‪TU‬ب‬
‫‪N i =0‬‬

‫ﺸﻜل)‪ :(3‬ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺤﺴﺎﺏ ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ‪.‬‬

‫‪ .2.9‬ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‬

‫ﻭﻓﻘﹰﺎ ﻝﺼﻴﻎ ﺍﻝﻤﻌﺎﺩﻻﺕ ﺭﻗﻡ )‪ (11) – (4‬ﻓﺈﻥ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺤﺴﺎﺏ ﺘﺸﺎﺒﻪ ﺼﻭﺭﺘﻴﻥ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﺘﺘﻡ‬
‫ﻜﻤﺎ ﻓﻲ ﺍﻝﺸﻜل ﺍﻝﺘﺎﻝﻲ‪:‬‬
 ‫م ع ت ‪11‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫‪Sr = 0‬‬

‫‪Sb = 0‬‬
‫‪Rr 1( i ) = H 1r [ i ] − H 2r [ i − 1 ] ,‬‬
‫‪Rr 2 ( i ) = H 1r [ i ] − H 2r [ i ] ,‬‬
‫] ‪Rr 3 ( i ) = H 1r [ i ] − H 2r [ i + 1‬‬

‫‪Rb1( i ) = H 1b [ i ] − H 2b [ i − 1 ] ,‬‬
‫) ‪Sr = Sr + min( Rr 1 , Rr 2 , Rr 3‬‬
‫‪Rb 2 ( i ) = H 1b [ i ] − H 2b [ i ] ,‬‬
‫] ‪Rb3 ( i ) = H 1b [ i ] − H 2b [ i + 1‬‬

‫‪Sg = 0‬‬ ‫) ‪Sb = Sb + min( Rb1 , Rb 2 , Rb3‬‬

‫‪d ( H 1, H 2 ) = Sr2 + S g2 + Sb2‬‬

‫‪Rg 1( i ) = H 1g [ i ] − H 2g [ i − 1 ] ,‬‬
‫‪Rg 2 ( i ) = H 1g [ i ] − H 2g [ i ] ,‬‬
‫] ‪Rg 3 ( i ) = H 1g [ i ] − H 2g [ i + 1‬‬

‫) ‪S g = S g + min( Rg 1 , Rg 2 , Rg 3‬‬

‫ﺸﻜل)‪ :(4‬ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﺸﺎﺒﻪ ﺼﻭﺭﺘﻴﻥ ﻋﻠﻰ ﺃﺴﺎﺱ ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‪.‬‬

‫‪ .3.9‬ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻝﻠﻭﻥ‬

‫ﻓﻲ ﻫﺫﻩ ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺔ ﻝﻠﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻴﺴﺘﺨﺩﻡ ﻤﻌﻴﺎﺭ ﺍﻝﻨﺴﺒﺔ ﺍﻝﻤﺌﻭﻴﺔ ﺍﻝﻤﺤﺩﺩﺓ ﻝﻸﻝﻭﺍﻥ ﻓﻲ ﺍﻝﺼﻭﺭﺓ‪ ،‬ﻭ ﻤﺩﻯ ﺘﺸﺎﺒﻪ ﺍﻝﺴﻠﻡ‬
‫ﺍﻹﺤﺼﺎﺌﻲ ﻝﻬﺫﻩ ﺍﻝﻨﺴﺏ‪ ،‬ﻭﻭﻓﻘﹰﺎ ﻝﺼﻴﻎ ﺍﻝﻤﻌﺎﺩﻻﺕ ﺭﻗﻡ )‪ (13) ،(12‬ﻓﺈﻨﻪ ﻴﻤﻜﻥ ﺘﻤﺜﻴﻠﻬﺎ ﻜﺎﻵﺘﻲ‪:‬‬
‫م ع ت ‪12‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫‪di = di + ( NumColor[ l ] −‬‬

‫‪NCol1[ l ])2‬‬

‫‪1‬‬
‫= ‪di‬‬ ‫‪⋅ di‬‬
‫‪k‬‬

‫ﺸﻜل)‪ :(5‬ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻝﻠﻭﻥ‪.‬‬
 ‫م ع ت ‪13‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫‪ .10‬ﺍﻝﺩﺭﺍﺴﺔ ﺍﻝﺘﺠﺭﻴﺒﻴﺔ ﻝﻔﻌﺎﻝﻴﺔ ﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ )ﺩﺭﺍﺴﺔ ﺍﻝﻨﺘﺎﺌﺞ(‬

‫ﺘﻡ ﺘﺼﻤﻴﻡ ﺒﺭﺍﻤﺞ ﺍﻝﻤﻘﺎﺭﻨﺔ ﻭﺒﺭﻤﺠﺘﻬﺎ ﺒﺎﺴﺘﺨﺩﺍﻡ ﻝﻐﺔ ‪ ،C++ Builder‬ﻭﺍﻷﺸﻜﺎل ﺍﻵﺘﻴﺔ ﺘﻭﻀﺢ ﺼﻭﺭ ﻝﻠﺒﺭﺍﻤﺞ ﺍﻝﻤﺴـﺘﺨﺩﻤﺔ‬
‫ﻭﺍﻝﻨﺘﺎﺌﺞ ﺍﻝﺘﻲ ﺘﻡ ﺍﻝﺤﺼﻭل ﻋﻠﻴﻬﺎ‪.‬‬

‫ﺸﻜل)‪ :(6‬ﻭﺍﺠﻬﺔ ﺍﻝﺒﺭﻨﺎﻤﺞ ﻭﻤﻘﺎﺭﻨﺔ ﺼﻭﺭﺓ ﻤﻊ ﻤﺠﻤﻭﻋﺔ ﺼﻭﺭ ﻓﻲ ﺍﻝﻘﺎﺌﻤﺔ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺘﺤﻠﻴل ‪%& '()*+‬ة ا"! ن‪.‬‬

‫ﺸﻜل)‪ :(7‬ﻭﺍﺠﻬﺔ ﺍﻝﺒﺭﻨﺎﻤﺞ ﻭﻤﻘﺎﺭﻨﺔ ﺼﻭﺭﺓ ﻤﻊ ﻤﺠﻤﻭﻋﺔ ﺼﻭﺭ ﻓﻲ ﺍﻝﻘﺎﺌﻤﺔ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺘﺤﻠﻴل ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‪.‬‬
 ‫م ع ت ‪14‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﺤﻴﺙ ﺘﻤﺜل ﺍﻷﺭﻗﺎﻡ ﺍﻝﻤﻭﺠﻭﺩﺓ ﻓﻲ ﺍﻝﺸﻜل ﺍﻝﺴﺎﺒﻕ ﺒﺎﻻﺘﻲ‪:‬‬

‫‪ .1‬ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪.‬‬
‫‪ .2‬ﺼﻭﺭﺓ ﻤﻥ ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻝﻠﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪.‬‬
‫‪ .3‬ﻗﺎﺌﻤﺔ ﺍﻝﺼﻭﺭ ﺍﻝﺘﻲ ﺘﻡ ﻤﻘﺎﺭﻨﻬﺎ ﻤﻊ ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪.‬‬
‫‪ .4‬ﺨﺼﺎﺌﺹ ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪.‬‬
‫‪ .5‬ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻝﻤﺩﻯ ﺍﻝﺘﺸﺎﺒﻪ ﻭﺍﻝﻔﺭﻕ ﺒﻴﻥ ﺍﻝﺼﻭﺭ ﻓﻲ ﻗﺎﺌﻤﺔ ﺍﻝﺼﻭﺭ‪.‬‬
‫‪ .6‬ﺍﻝﻌﺜﻭﺭ ﻋﻠﻰ ﻋﺩﺩ ﺃﺭﺒﻊ ﺼﻭﺭ ﻤﺸﺎﺒﻬﻪ ﻝﻠﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪.‬‬

‫ﺸﻜل)‪ :(8‬ﻭﺍﺠﻬﺔ ﺒﺭﻨﺎﻤﺞ ﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻷﻝﻭﺍﻥ‪.‬‬

‫ﺤﻴﺙ ﺘﻤﺜل ﺍﻷﺭﻗﺎﻡ ﺍﻝﻤﻭﺠﻭﺩﺓ ﻓﻲ ﺍﻝﺸﻜل ﺍﻝﺴﺎﺒﻕ ﺒﺎﻻﺘﻲ‪:‬‬

‫‪ .1‬ﻗﺎﺌﻤﺔ ﺘﺤﻤﻴل ﺍﻝﺼﻭﺭ‪.‬‬
‫‪ .2‬ﺍﻝﺼﻭﺭﺓ ﺍﻝﻤﺨﺘﺎﺭﺓ‪.‬‬
‫‪ .3‬ﺍﺨﺘﻴﺎﺭ ﻋﺩﺩ ﻤﻥ ﺍﻷﻝﻭﺍﻥ ﻓﻲ ﺍﻝﺼﻭﺭﺓ‪.‬‬
‫‪ .4‬ﻨﺘﻴﺠﺔ ﻝﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻷﻝﻭﺍﻥ )ﺍﻝﻨﺴﺒﺔ ﺍﻝﻤﺌﻭﻴﺔ ﻤﻥ ﺍﻷﻝﻭﺍﻥ ﺍﻝﻤﺨﺘﺎﺭﺓ ﻓﻲ ﻜل ﺼﻭﺭﺓ ﻤﻥ ﺍﻝﻘﺎﺌﻤﺔ(‪.‬‬
‫‪ .5‬ﻨﺘﻴﺠﺔ ﻝﻠﻤﻘﺎﺭﻨﺔ ﺒﻴﻥ ﺍﻝﺼﻭﺭ )ﻋﺭﺽ ﺍﻝﺭﺴﻡ ﺍﻝﺒﻴﺎﻨﻲ(‪.‬‬
‫‪ .6‬ﻤﺩﻯ ﻗﺭﺏ ﺍﻝﺘﺸﺎﺒﻪ ﻤﻥ ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪.‬‬

‫ﻓﻲ ﺍﻝﺒﺭﺍﻤﺞ ﺍﻝﺜﻼﺜﺔ ﺍﻝﻤﺼﻤﻤﺔ ﺘﻡ ﺍﺴﺘﺨﺩﺍﻡ ﻤﺠﻤﻭﻋﺔ ﻤﻥ ﺍﻝﺼﻭﺭ ﺤﻴﺙ ﻴﻤﺜل ﺍﻝﺸﻜل ﺭﻗﻡ )‪ (9‬ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪ ،‬ﻭﺍﻝﺸـﻜل‬
‫ﺭﻗﻡ )‪ (10‬ﻴﻤﺜل ﻤﺠﻤﻭﻋﺔ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل ﻭﺍﻝﺘﻲ ﺴﻴﺘﻡ ﻤﻘﺎﺭﻨﺘﻬﺎ ﻤﻊ ﺍﻝﺼﻭﺭ ﺍﻷﺼـﻠﻴﺔ ﻭﺍﻝﺘـﻲ ﺘﺘـﻭﺍﻓﺭ‬
‫ﺒﺎﻷﺤﺠﺎﻡ ﺍﻝﻤﺨﺘﻠﻔﺔ ﺍﻵﺘﻴﺔ‪:‬‬

‫‪10x10, 50x50, 100x100, 200x200, 500x500, 1024x1024, 2048x2048‬‬

 ‫م ع ت ‪15‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﺤﻴﺙ ﺘﻡ ﺍﺴﺘﺨﺩﺍﻡ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل ﻜﻤﺠﻤﻭﻋﺔ ﻭﺍﺤﺩﺓ ﺒﺄﺤﺠﺎﻤﻬﺎ ﺍﻝﻤﺨﺘﻠﻔﺔ‪ ،‬ﻋﻠﻰ ﺃﻥ ﻴـﺘﻡ ﺍﺨﺘﺒـﺎﺭ ﻜـل‬
‫ﻤﺠﻤﻭﻋﺔ ﻤﻥ ﺍﻷﺤﺠﺎﻡ ﺍﻝﻤﺨﺘﻠﻔﺔ ﻓﻲ ﻜل ﻋﻤﻠﻴﺔ ﺒﻤﺠﻤﻭﻋﺔ ﺼﻭﺭ ﺘﺘﺭﺍﻭﺡ ﺒﻴﻥ ﺼﻭﺭﺓ ﻭﺍﺤﺩﺓ ﺇﻝﻰ ﺨﻤﺱ ﺼﻭﺭ‪ .‬ﻋـﺩﺍ ﺫﻝـﻙ‬
‫ﺃﻤﻜﻥ ﻗﻴﺎﺱ ﺍﻝﻭﻗﺕ ﺍﻝﻼﺯﻡ ﻝﻠﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺸﺎﺒﻬﺔ ﻝﻜل ﻋﻤﻠﻴﺔ‪ ،‬ﻭﺤﺴﺎﺏ ﺍﻝﻭﻗﺕ ﻴﺒﺩﺃ ﻤﻥ ﻝﺤﻅﺔ ﺘﻜﻭﻴﻥ ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‬
‫ﻝﻠﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪.‬‬

‫ﺸﻜل)‪ :(9‬ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ‪.‬‬

‫)ج(‬ ‫)ب(‬ ‫)أ(‬

‫)هـ(‬ ‫)د(‬
‫ﺸﻜل )‪ :(10‬ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل‬

‫ﺤﻴﺙ ﺃﺠﺭﻴﺕ ﺍﻝﺩﺭﺍﺴﺔ ﻋﻠﻰ ﺠﻬﺎﺯ ﻜﻤﺒﻴﻭﺘﺭ ﺒﺎﻝﻤﻭﺍﺼﻔﺎﺕ ﺍﻝﺘﺎﻝﻴﺔ‪:‬‬

‫ﻭﺤﺩﺓ ﺍﻝﻤﻌﺎﻝﺠﺔ ﺍﻝﻤﺭﻜﺯﻴﺔ‪ ،Athlon 1600GH :‬ﺍﻝﺫﺍﻜﺭﺓ‪ ،256 MB :‬ﺫﺍﻜﺭﺓ ﻓﻴﺩﻴﻭ‪ ،128 MB :‬ﻨﻅﺎﻡ ﺍﻝﺘﺸﻐﻴل ﻭﻴﻨﺩﻭﺯ ‪.XP‬‬
 ‫م ع ت ‪16‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫‪ .1.10‬ﻨﺘﺎﺌﺞ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻝﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ‬

‫ﺍﻝﺠﺩﻭل )‪ (1‬ﻴﻌﻜﺱ ﻨﺘﺎﺌﺞ ﺍﻝﺩﺭﺍﺴﺎﺕ ﺍﻝﺘﺠﺭﻴﺒﻴﺔ ﻝﻠﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ)ﺠﺯﺀ ﻤﻥ ﺜﺎﻨﻴﺔ( ﻤﻊ ﺍﺨـﺘﻼﻑ ﻋـﺩﺩ‬
‫ﺍﻝﺼﻭﺭ ﻭﺤﺠﻤﻬﺎ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﻭﺫﻝﻙ ﺤﺴﺏ ﺍﻝﻤﻌﺎﺩﻻﺕ ﺭﻗﻡ )‪.(3) ،(2) ،(1‬‬

‫ﺠﺩﻭل)‪ :(1‬ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ‪.‬‬

‫ﺤﺠﻡ ﺍﻝﺼﻭﺭ‬
‫‪10 * 10‬‬ ‫‪50 * 50‬‬ ‫‪100 * 100‬‬ ‫‪200 * 200‬‬ ‫‪500 * 500‬‬ ‫‪1024 * 1024‬‬ ‫‪2048 * 2048‬‬ ‫ﻋﺩﺩ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ‬
‫ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل‬
‫‪0.0733‬‬ ‫‪0.1799‬‬ ‫‪0.2396‬‬ ‫‪0.4596‬‬ ‫‪0.9996‬‬ ‫‪3.1998‬‬ ‫‪6.9996‬‬ ‫‪1‬‬
‫‪0.1632‬‬ ‫‪0.358‬‬ ‫‪0.4396‬‬ ‫‪0.9996‬‬ ‫‪1.9998‬‬ ‫‪4.9998‬‬ ‫‪12.9996‬‬ ‫‪2‬‬
‫‪0.2332‬‬ ‫‪0.527‬‬ ‫‪0.8996‬‬ ‫‪1.3996‬‬ ‫‪3.1998‬‬ ‫‪7.9998‬‬ ‫‪18.9996‬‬ ‫‪3‬‬
‫‪0.3232‬‬ ‫‪0.708‬‬ ‫‪1.2096‬‬ ‫‪1.7996‬‬ ‫‪3.996‬‬ ‫‪9.9996‬‬ ‫‪25.9998‬‬ ‫‪4‬‬
‫‪0.4042‬‬ ‫‪0.8798‬‬ ‫‪1.5196‬‬ ‫‪2.2496‬‬ ‫‪4.99‬‬ ‫‪12.9996‬‬ ‫‪34.9998‬‬ ‫‪5‬‬

‫ﻤﻥ ﺍﻝﺠﺩﻭل)‪ (1‬ﻨﻠﺤﻅ ﺃﻥ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﻴﺘﻭﻗﻑ ﻋﻠﻰ‬
‫ﺤﺠﻡ ﺍﻝﺼﻭﺭ ﻭﻋﺩﺩﻫﺎ‪ ،‬ﻜﻤﺎ ﻨﻠﺤﻅ ﺃﻴﻀﹰﺎ ﺃﻥ ﻗﻴﻤﺔ ﺍﻝﻭﻗﺕ ﻫﻲ ﻨﻔﺴﻬﺎ ﻓﻲ ﺍﻷﺤﺠﺎﻡ ﺍﻝﺼﻐﻴﺭﺓ ﺘﻘﺭﻴﺒﹰﺎ ﻋﻠﻰ ﺍﻝﺭﻏﻡ ﻤﻥ ﺍﺨـﺘﻼﻑ‬
‫ﻋﺩﺩﻫﺎ‪.‬‬

‫‪ .2.10‬ﻨﺘﺎﺌﺞ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻝﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‬

‫ﺍﻝﺠﺩﻭل )‪ (2‬ﻴﻌﻜﺱ ﻨﺘﺎﺌﺞ ﺍﻝﺩﺭﺍﺴﺎﺕ ﺍﻝﺘﺠﺭﻴﺒﻴﺔ ﻝﻠﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ)ﺠﺯﺀ ﻤﻥ ﺜﺎﻨﻴﺔ( ﻤﻊ ﺍﺨـﺘﻼﻑ ﻋـﺩﺩ‬
‫ﺍﻝﺼﻭﺭ ﻭﺤﺠﻤﻬﺎ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻭﺫﻝﻙ ﺤﺴﺏ ﺍﻝﻤﻌﺎﺩﻻﺕ ﺭﻗﻡ)‪.(11) – (4‬‬

‫ﺠﺩﻭل)‪ :(2‬ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﺤﻠﻴل ﺍﻝﻠﻭﻥ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‪.‬‬

‫ﺤﺠﻡ ﺍﻝﺼﻭﺭ‬
‫‪10 * 10‬‬ ‫‪50 * 50‬‬ ‫‪100 * 100‬‬ ‫‪200 * 200‬‬ ‫‪500 * 500‬‬ ‫‪1024 * 1024‬‬ ‫‪2048 * 2048‬‬ ‫ﻋﺩﺩ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ‬
‫ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل‬
‫‪0.3998‬‬ ‫‪0.9996‬‬ ‫‪1.3998‬‬ ‫‪1.6998‬‬ ‫‪1.9998‬‬ ‫‪3.1998‬‬ ‫‪12.996‬‬ ‫‪1‬‬
‫‪0.5998‬‬ ‫‪1.0533‬‬ ‫‪1.9998‬‬ ‫‪3.1996‬‬ ‫‪3.3998‬‬ ‫‪6.9996‬‬ ‫‪24.996‬‬ ‫‪2‬‬
‫‪0.9996‬‬ ‫‪2.6998‬‬ ‫‪3.6996‬‬ ‫‪3.9996‬‬ ‫‪5.1798‬‬ ‫‪9.9996‬‬ ‫‪36.996‬‬ ‫‪3‬‬
‫‪1.9998‬‬ ‫‪3.6998‬‬ ‫‪4.6998‬‬ ‫‪4.9998‬‬ ‫‪7.9998‬‬ ‫‪12.9996‬‬ ‫‪49.998‬‬ ‫‪4‬‬

‫‪2.6666‬‬ ‫‪5.9998‬‬ ‫‪6.6996‬‬ ‫‪6.9996‬‬ ‫‪7.9998‬‬ ‫‪15.9996‬‬ ‫‪61.998‬‬ ‫‪5‬‬

‫‪ .3.10‬ﻨﺘﺎﺌﺞ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻝﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻝﻠﻭﻥ‬

‫ﺍﻝﺠﺩﻭل )‪ (3‬ﻴﻌﻜﺱ ﻨﺘﺎﺌﺞ ﺍﻝﺩﺭﺍﺴﺔ ﺍﻝﺘﺠﺭﻴﺒﻴﺔ ﻝﻁﺭﻴﻘﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺍﻝﺘﻲ ﺘﺴﺘﺨﺩﻡ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﻘﻴﻴﻡ ﺘﺸـﺎﺒﻪ ﺍﻝﺼـﻭﺭ‬
‫ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻝﻠﻭﻥ‪.‬‬
 ‫م ع ت ‪17‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﺠﺩﻭل)‪ :(3‬ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻝﻠﻭﻥ‪.‬‬

‫ﺤﺠﻡ ﺍﻝﺼﻭﺭ‬
‫‪10 * 10‬‬ ‫‪50 * 50‬‬ ‫‪100 * 100‬‬ ‫‪200 * 200‬‬ ‫‪500 * 500‬‬ ‫‪1024 * 1024‬‬ ‫‪2048 * 2048‬‬ ‫ﻋﺩﺩ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ‬
‫ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل‬
‫‪0.998‬‬ ‫‪1.7‬‬ ‫‪4.098‬‬ ‫‪5.0196‬‬ ‫‪6.9996‬‬ ‫‪9.996‬‬ ‫‪26.0196‬‬ ‫‪1‬‬
‫‪1.54‬‬ ‫‪2.98‬‬ ‫‪4.9998‬‬ ‫‪6.9998‬‬ ‫‪7.9998‬‬ ‫‪15.3996‬‬ ‫‪45.9996‬‬ ‫‪2‬‬
‫‪2.23‬‬ ‫‪3.99‬‬ ‫‪6.09‬‬ ‫‪7.598‬‬ ‫‪9.1998‬‬ ‫‪21.3996‬‬ ‫‪66.9996‬‬ ‫‪3‬‬
‫‪3.128‬‬ ‫‪4.9998‬‬ ‫‪7.088‬‬ ‫‪8.7998‬‬ ‫‪9.9798‬‬ ‫‪26.0196‬‬ ‫‪87.9798‬‬ ‫‪4‬‬
‫‪4.09‬‬ ‫‪5.98‬‬ ‫‪7.98‬‬ ‫‪9.498‬‬ ‫‪10.9998‬‬ ‫‪30.9996‬‬ ‫‪109.9998‬‬ ‫‪5‬‬

‫ﺍﻝﻨﺘﺎﺌﺞ ﺍﻝﺘﻲ ﺘﻡ ﺍﻝﺤﺼﻭل ﻋﻠﻴﻬﺎ ﺘﻡ ﺘﻤﺜﻴﻠﻬﺎ ﺒﺎﻝﺸﻜﻠﻴﻥ ﺍﻝﺒﻴﺎﻨﻴﻴﻥ ﺭﻗﻡ )‪ (12) ، (11‬ﺤﻴﺙ ﺘﻤﺜل ﺍﻝﻤﺤﺎﻭﺭ ﺍﻹﺤﺩﺍﺜﻴﺔ ﻤﺎ ﻴﻠﻲ‪:‬‬
‫ﺍﻝﻤﺤﻭﺭ ‪ : X‬ﻴﻤﺜل ﺃﺤﺠﺎﻡ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺨﺘﻠﻔﺔ ﺒﺎﻝﺒﻜﺴل‪.‬‬
‫ﺍﻝﻤﺤﻭﺭ‪ :Y‬ﻴﻤﺜل ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ‪.‬‬
‫ﺤﻴﺙ ﺘﻌﺭﺽ ﺘﻠﻙ ﺍﻝﺭﺴﻭﻡ ﺍﻝﺒﻴﺎﻨﻴﺔ ﻨﺘﺎﺌﺞ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺜﻼﺙ ﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﻤﺨﺘﻠﻔﺔ ﻓﻲ ﺤﺎﻝﺘﻴﻥ ﻜﻤﺎ ﻴﻠﻲ‪:‬‬
‫ﺍﻝﺤﺎﻝﺔ ﺍﻷﻭﻝﻰ‪ :‬ﻋﻨﺩﻤﺎ ﺘﺘﻡ ﻋﻤﻠﻴﺔ ﻤﻘﺎﺭﻨﺔ ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ ﻤﻊ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل ﻜﻤﺠﻤﻭﻋﺔ ﻭﺍﺤﺩﺓ‬ ‫
‬
‫ﺒﺄﺤﺠﺎﻤﻬﺎ ﺍﻝﻤﺨﺘﻠﻔﺔ ﻭﺫﻝﻙ ﻋﻨﺩﻤﺎ ﻴﻜﻭﻥ ﻋﺩﺩﻫﺎ ﻴﺴﺎﻭﻱ ﺼﻭﺭﺓ ﻭﺍﺤﺩﻩ ﻝﻜل ﺤﺠﻡ‪.‬‬
‫ﺍﻝﺤﺎﻝﺔ ﺍﻝﺜﺎﻨﻴﺔ‪ :‬ﻋﻨﺩﻤﺎ ﺘﺘﻡ ﻋﻤﻠﻴﺔ ﻤﻘﺎﺭﻨﺔ ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ ﻤﻊ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺘﺤﻠﻴل ﻜﻤﺠﻤﻭﻋﺔ ﻭﺍﺤﺩﺓ‬ ‫
‬
‫ﺒﺄﺤﺠﺎﻤﻬﺎ ﺍﻝﻤﺨﺘﻠﻔﺔ ﻭﺫﻝﻙ ﻋﻨﺩﻤﺎ ﻴﻜﻭﻥ ﻋﺩﺩﻫﺎ ﻴﺴﺎﻭﻱ ﺨﻤﺱ ﺼﻭﺭ ﻝﻜل ﺤﺠﻡ‪.‬‬

‫ﺠﺩﻭل)‪ :(4‬ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻝﻤﺠﻤﻭﻋﺔ ﺍﻝﺼﻭﺭ ﻋﻨﺩﻤﺎ ﻴﻜﻭﻥ ﻋﺩﺩﻫﺎ ﻴﺴﺎﻭﻱ ﺼﻭﺭﺓ ﻭﺍﺤﺩﻩ ﻝﻜل ﺤﺠﻡ‪.‬‬

‫‪2048 *2048‬‬ ‫‪1024 *1024‬‬ ‫‪500 *500‬‬ ‫‪200 *200‬‬ ‫‪100 *100‬‬ ‫‪50 * 50‬‬ ‫‪10 * 10‬‬ ‫ا"; ارز‪678‬‬ ‫م‬

‫‪6.9996‬‬ ‫‪3.1998‬‬ ‫‪0.9996‬‬ ‫‪0.4596‬‬ ‫‪0.2396‬‬ ‫‪0.1799‬‬ ‫‪0.0733‬‬ ‫‪%& '()*+ <7!=+‬ة ا"! ن‬ ‫‪1‬‬

‫‪12.996‬‬ ‫‪3.1998‬‬ ‫‪1.9998‬‬ ‫‪1.6998‬‬ ‫‪1.3998‬‬ ‫‪0.9996‬‬ ‫‪0.3998‬‬ ‫‪ <7!=+‬ا"‪ C!D‬ا‪>?)@AB‬‬ ‫‪2‬‬

‫‪26.0196‬‬ ‫‪9.996‬‬ ‫‪6.9996‬‬ ‫‪5.0196‬‬ ‫‪4.098‬‬ ‫‪1.7‬‬ ‫‪0.998‬‬ ‫‪ 6*DE <7!=+‬ا"! ن‬ ‫‪3‬‬

‫
‬
‫‬
‫ﺍ ﻝﻭﻗﺕ )ﺠﺯﺀ ﻤﻥ ﺜﺎﻨﻴـﺔ(‬

‫
‬
‫‬
‫
‬
‫‬
‫
‬
‫

‬ ‫

‬ ‫



‬ ‫



‬ ‫



‬ ‫

‬ ‫

‬

‫ﺤﺠﻡ ﺍﻝﺼﻭﺭ ﺒﺎﻝﺒﻜﺴل‬

‫  
ة ان‬
‫ ا ا‬
‫   ان‬

‫ﺸﻜل)‪ :(11‬ﺍﻝﺭﺴﻡ ﺍﻝﺒﻴﺎﻨﻲ ﻝﻠﻤﻘﺎﺭﻨﺔ ﺒﻴﻥ ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺍﻝﻤﺨﺘﻠﻔﺔ ﻝﻠﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ)ﻋﺩﺩ ﻤﺠﻤﻭﻋﺔ ﺍﻝﺼﻭﺭ ﻓﻲ ﺍﻝﻘﺎﺌﻤﺔ‪ :‬ﺼﻭﺭﺓ ﻭﺍﺤﺩﺓ(‪.‬‬
 ‫م ع ت ‪18‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﺠﺩﻭل)‪ :(5‬ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻝﻤﺠﻤﻭﻋﺔ ﺍﻝﺼﻭﺭ ﻋﻨﺩﻤﺎ ﻴﻜﻭﻥ ﻋﺩﺩﻫﺎ ﺨﻤﺱ ﺼﻭﺭ ﻝﻜل ﺤﺠﻡ‪.‬‬

‫‪2048x2048‬‬ ‫‪1024x1024‬‬ ‫‪500x500‬‬ ‫‪200x200‬‬ ‫‪100x100‬‬ ‫‪50x50‬‬ ‫‪10x10‬‬ ‫ا"; ارز‪678‬‬ ‫م‬

‫‪34.9998‬‬ ‫‪12.9996‬‬ ‫‪4,99‬‬ ‫‪2.2496‬‬ ‫‪1.5196‬‬ ‫‪0.8798‬‬ ‫‪0.4042‬‬ ‫‪%& '()*+ <7!=+‬ة ا"! ن‬ ‫‪1‬‬

‫‪61.998‬‬ ‫‪15.9996‬‬ ‫‪7.9998‬‬ ‫‪6.9996‬‬ ‫‪6.6996‬‬ ‫‪5.9998‬‬ ‫‪2.6666‬‬ ‫‪ <7!=+‬ا"‪ C!D‬ا‪>?)@AB‬‬ ‫‪2‬‬

‫‪109.9998‬‬ ‫‪30.9996‬‬ ‫‪10.9998‬‬ ‫‪9.498‬‬ ‫‪7.98‬‬ ‫‪5.98‬‬ ‫‪4.09‬‬ ‫‪ 6*DE <7!=+‬ا"! ن‬ ‫‪3‬‬

‫
‬
‫

‬
‫ﺍﻝﻭﻗﺕ )ﺠﺯﺀ ﻤﻥ ﺜﺎﻨﻴـﺔ(‬

‫
‬
‫
‬
‫
‬
‫
‬
‫
‬
‫

‬ ‫
 
‬ ‫

 

‬ ‫

 

‬ ‫



‬ ‫

‬ ‫
 
‬

‫ﺤﺠﻡ ﺍﻝﺼﻭﺭ ﺒﺎﻝﺒﻜﺴل‬

‫  
ة ان‬
‫ ا ا‬
‫   ان‬
‫ﺸﻜل)‪ :(12‬ﺍﻝﺭﺴﻡ ﺍﻝﺒﻴﺎﻨﻲ ﻝﻠﻤﻘﺎﺭﻨﺔ ﺒﻴﻥ ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺍﻝﻤﺨﺘﻠﻔﺔ ﻝﻠﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ)ﻋﺩﺩ ﻤﺠﻤﻭﻋﺔ ﺍﻝﺼﻭﺭ ﻓﻲ ﺍﻝﻘﺎﺌﻤﺔ‪ :‬ﺨﻤﺱ ﺼﻭﺭ(‬

‫ﻤﻥ ﺍﻝﻭﺍﻀﺢ ﻤﻥ ﺍﻝﺭﺴﻭﻡ ﺍﻝﺒﻴﺎﻨﻴﺔ ﺃﻥ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻴﺘﻭﻗﻑ ﻋﻠﻰ ﺃﺤﺠﺎﻡ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴـﺔ‬
‫ﺍﻝﺒﺤﺙ ﻭﻋﺩﺩﻫﺎ‪ ،‬ﻭﻤﻥ ﺍﻝﻭﺍﻀﺢ ﺃﻴﻀﹰﺎ ﺃﻥ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ ﻝﻠﺼﻭﺭ ﺃﻗـل‬
‫ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﻤﻥ ﻨﺎﺤﻴﺔ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﺇﻻ ﺃﻨﻬﺎ ﺘﻜﺎﺩ ﺘﻜﻭﻥ ﻝﺤﺴﺎﺏ ﺍﻝﻭﻗﺕ ﻝﻺﺤﺠﺎﻡ ﺍﻝﺼﻐﻴﺭﺓ ﻝﻠﺼـﻭﺭ‬
‫ﻭﺍﺤﺩﺓ‪ ،‬ﻜﻤﺎ ﻨﻠﺤﻅ ﺃﻥ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻴﺘﻭﻗﻑ ﻋﻠﻰ ﻁﺭﻴﻘﺔ ﻤﻌﺎﻝﺠﺔ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤـﺙ‪،‬‬
‫ﺒﻤﻌﻨﻰ ﺃﻨﻪ ﻓﻲ ﺤﺎﻝﺔ ﻤﻌﺎﻝﺠﺔ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﺃﻨﻴﹰﺎ ﻤﻊ ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ ﻓﺈﻥ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴـﺔ‬
‫ﺍﻝﺒﺤﺙ ﻴﺯﺩﺍﺩ‪ ،‬ﻭﺇﺫﺍ ﺘﻡ ﻤﻌﺎﻝﺠﺔ ﺍﻝﺼﻭﺭ ﺍﻝﺩﺍﺨﻠﺔ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻤﺴﺒﻘﹰﺎ ﻭﺘﺨﺯﻴﻥ ﺍﻝﻨﺘﺎﺌﺞ ﻓﻲ ﻗﺎﻋﺩﺓ ﺍﻝﺒﻴﺎﻨﺎﺕ ﻓﺈﻨﻪ ﻋﻨﺩ ﻋﻤﻠﻴـﺔ‬
‫ﺍﻝﻤﻘﺎﺭﻨﺔ ﻤﻊ ﺍﻝﺼﻭﺭﺓ ﺍﻷﺼﻠﻴﺔ ﻨﺠﺩ ﺃﻥ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻴﻘل‪.‬‬
‫ﻋﺩﺍ ﺘﻘﻴﻴﻡ ﺍﻝﻭﻗﺕ ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻝﻠﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺍﻝﺜﻼﺙ ﺘﻡ ﺘﻘﻴﻴﻡ ﻓﺎﻋﻠﻴﺘﻬﺎ )ﺃﻓﻀل ﺨﻭﺍﺭﺯﻤﻴﺔ ﻤﻥ ﻨﺎﺤﻴﺔ ﺍﻝﻨﺘﺎﺌﺞ‬
‫ﻭﺍﻷﺩﺍﺀ(‪ ،‬ﻭﻝﻬﺫﺍ ﺍﻝﻐﺭﺽ ﺘﻡ ﺘﻭﻓﻴﺭ ﻋﺩﺩ ‪ 75‬ﺼﻭﺭﺓ ﻤﺘﺸﺎﺒﻬﺔ ﻭﻋﺩﺩ ‪ 75‬ﺼﻭﺭﺓ ﻤﺨﺘﻠﻔﺔ ﺘﻤﺎﻤﹰﺎ )ﻤﻨﺎﻅﺭ ﻁﺒﻴﻌﻴﺔ ﻝﻸﺸﺠﺎﺭ ﻓـﻲ‬
‫ﺃﻭﻗﺎﺕ ﻤﺨﺘﻠﻔﺔ ﻤﻥ ﺍﻝﻴﻭﻡ ﻤﻌﻅﻤﻬﺎ ﺨﻼل ﺍﻝﻨﻬﺎﺭ ﻭﺼﻭﺭ ﻝﻠﺴﻤﺎﺀ ﻨﻬﺎﺭﹰﺍ( ﻝﻠﺒﺭﺍﻤﺞ ﺍﻝﺜﻼﺜﺔ ﻭﻜﺎﻨﺕ ﺍﻝﻨﺘﺎﺌﺞ ﻋﻠﻰ ﺍﻝﻨﺤﻭ ﺍﻝﺘﺎﻝﻲ‪:‬‬

‫ﺠﺩﻭل)‪ :(6‬ﻨﺘﺎﺌﺞ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻝﻠﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺍﻝﻤﺨﺘﻠﻔﺔ‪.‬‬

‫ﻨﺴﺒﺔ ﺃﺨﻁﺎﺀ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺘﺤﺼل ﻋﻠﻴﻬﺎ‬ ‫ﻨﺴﺒﺔ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺘﺤﺼل ﻋﻠﻴﻬﺎ‬
‫ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺔ‬
‫)ﻤﻥ ‪ 75‬ﺼﻭﺭﺓ ﻏﻴﺭ ﻤﺘﺸﺎﺒﻬﻪ(‬ ‫)ﻤﻥ ‪ 75‬ﺼﻭﺭﺓ ﻤﺘﺸﺎﺒﻬﻪ(‬
‫‪4,6‬‬ ‫‪64‬‬ ‫ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺘﺒﺎﻴﻥ ﺸﺩﺓ ﺍﻝﻠﻭﻥ‬
‫‪4‬‬ ‫‪80‬‬ ‫ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ‬
‫‪16‬‬ ‫‪45,3‬‬ ‫ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻨﺴﺒﺔ ﺍﻝﻠﻭﻥ‬
 ‫م ع ت ‪19‬‬ ‫اد)‪2010 (1‬‬ ‫ا)‪(15‬‬ ‫ ام وا 
‬

‫ﻤﻥ ﺍﻝﻤﻼﺤﻅ ﺃﻥ ﺃﻓﻀل ﺍﻝﻨﺘﺎﺌﺞ ﺍﻝﺘﻲ ﺘﻡ ﺍﻝﺤﺼﻭل ﻋﻠﻴﻬﺎ ﻋﻨﺩ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺘﺸﺎﺒﻬﺔ ﻫﻲ ﻁﺭﻴﻘـﺔ ﺘﺤﻠﻴـل ﺍﻝﺴـﻠﻡ‬
‫ﺍﻹﺤﺼﺎﺌﻲ ﻝﻠﺼﻭﺭ‪ ،‬ﺇﻻ ﺃﻨﻪ ﻜﻨﺘﻴﺠﺔ ﻤﻁﻠﻘﺔ ‪ %100‬ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ ﻝﻡ ﻴﺘﻡ ﺍﻝﺘﻭﺼل ﺇﻝﻴﻬﺎ‪ ،‬ﻭﺘﺭﺠﻊ ﺇﻝﻰ ﺃﺴـﺒﺎﺏ ﺍﺨـﺘﻼﻑ‬
‫ﻼ(‪ ،‬ﻫﺫﻩ ﺍﻷﺴﺒﺎﺏ ﻨﻔﺴـﻬﺎ‬
‫ﺘﺒﺎﻴﻥ ﺴﻁﻭﻉ ﺍﻝﻠﻭﻥ ﺒﻌﺽ ﺍﻝﺼﻭﺭ ﻝﻠﻤﺸﻬﺩ ﺍﻝﻭﺍﺤﺩ ﻓﻲ ﻓﺘﺭﺍﺕ ﻤﺨﺘﻠﻔﺔ ﻤﻥ ﺍﻝﻴﻭﻡ ﺍﻝﻭﺍﺤﺩ)ﻨﻬﺎﺭﹰﺍ ﺃﻭ ﻝﻴ ﹰ‬
‫ﺍﻝﺘﻲ ﺘﺴﺒﺏ ﺍﻨﺨﻔﺎﺽ ﺃﺩﺍﺀ ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺔ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﺍﻝﻤﺘﺸﺎﺒﻬﺔ ﻋﻠﻰ ﺃﺴﺎﺱ ﺍﻝﺘﺤﻠﻴل ﺍﻝﺠﺯﺌﻲ ﻝﻨﺴﺒﺔ ﺍﻝﻠﻭﻥ‪ ،‬ﺇﻻ ﺃﻨﻪ ﻴﻤﻜﻥ‬
‫ﺍﻝﺘﺨﻠﺹ ﻤﻥ ﻫﺫﻩ ﺍﻷﺴﺒﺎﺏ ﻤﻥ ﺨﻼل ﺃﺨﺫ ﺼﻭﺭ ﻤﺘﻌﺩﺩﺓ ﻝﻠﻤﺸﻬﺩ ﺍﻝﻭﺍﺤﺩ ﻝﻠﻔﺘﺭﺍﺕ ﺍﻝﻤﺨﺘﻠﻔﺔ‪.‬‬

‫‪ .11‬ﺍﻻﺴﺘﻨﺘﺎﺠﺎﺕ‬
‫ﻗﺩﻡ ﻫﺫﺍ ﺍﻝﺒﺤﺙ ﺘﻁﻭﻴﺭ ﻝﺒﻌﺽ ﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﻤﺤﺘﻭﺍﻫـﺎ‪ ،‬ﻭﺍﻝﺘﻘﻠﻴـل ﻤـﻥ ﺍﻝﻭﻗـﺕ‬
‫ﺍﻝﻤﺴﺘﻐﺭﻕ ﻓﻲ ﻋﻤﻠﻴﺔ ﺍﻝﺒﺤﺙ‪ ،‬ﻭﻨﺴﺒﺔ ﺍﻝﺘﺸﺎﺒﻪ ﺒﻴﻥ ﺍﻝﺼﻭﺭﺓ ﺍﻝﻤﻭﻀﻭﻋﺔ ﻝﻠﺒﺤﺙ ﻭﺍﻝﺼﻭﺭ ﺍﻝﺘﻲ ﺴﺘﻘﺎﺭﻥ ﻤﻌﻬﺎ ﺍﻝﺘﻲ ﺘﻭﺠﺩ ﻓـﻲ‬
‫ﻗﺎﺌﻤﺔ ﺍﻝﺒﺤﺙ‪ ،‬ﺤﻴﺙ ﻴﻤﻜﻥ ﺘﻠﺨﻴﺹ ﺍﻝﻨﺘﺎﺌﺞ ﻜﺎﻵﺘﻲ‪:‬‬
‫‪ .1‬ﻤﻥ ﺃﺠل ﺍﻝﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ ﻭﺘﺤﻠﻴل ﻤﺤﺘﻭﻴﺎﺘﻬﺎ ﻤﻥ ﺃﻓﻀل ﺍﻝﻁﺭﻕ ﻫﻭ ﺍﻻﺴﺘﻔﺎﺩﺓ ﻤﻥ ﺍﻝﺨﺼﺎﺌﺹ ﺍﻹﺤﺼﺎﺌﻴﺔ ﻝﻠﺼﻭﺭﺓ‪،‬‬
‫ﻤﻤﺎ ﻴﺴﻤﺢ ﻹﻴﺠﺎﺩ ﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﻝﺘﺤﻠﻴل ﻭﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ‪ ،‬ﻭﻓﻲ ﺍﻝﺩﺭﺍﺴﺔ ﺍﺴﺘﺨﺩﻤﺕ ﻁﺭﻴﻘـﺔ ﺍﻝﺴـﻠﻡ ﺍﻹﺤﺼـﺎﺌﻲ‬
‫ﻭﻁﺭﻴﻘﺔ ﺍﻝﻤﻘﺎﺭﻨﺔ ﻋﻠﻰ ﺃﺴﺎﺱ ﻨﺴﺒﺔ ﻤﻥ ﺍﻷﻝﻭﺍﻥ ﻓﻲ ﺍﻝﺼﻭﺭﺓ‪.‬‬
‫‪ .2‬ﺘﻁﻭﻴﺭ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺘﻘﻴﻴﻡ ﺘﺸﺎﺒﻪ ﺍﻝﺼﻭﺭ ﻋﻠﻰ ﺃﺴﺎﺱ ﺘﺤﻠﻴل ﺍﻝﺴﻠﻡ ﺍﻹﺤﺼﺎﺌﻲ ﻭﺍﻝﻤﻘﺎﺭﻨﺔ ﻋﻠﻰ ﺃﺴﺎﺱ ﻨﺴﺒﺔ ﻤﻥ ﺍﻷﻝـﻭﺍﻥ‬
‫ﻓﻲ ﺍﻝﺼﻭﺭﺓ ﻴﻌﻨﻲ ﺃﺩﺍﺀ ﺴﺭﻴﻊ ﻝﻠﺒﺤﺙ ﻋﻥ ﺍﻝﺼﻭﺭ‪.‬‬
‫‪ .3‬ﻤﻥ ﺍﻷﻋﻤﺎل ﺍﻝﻤﺴﺘﻘﺒﻠﻴﺔ ﻝﻬﺫﻩ ﺍﻝﺩﺭﺍﺴﺔ ﻫﻲ ﺇﻤﻜﺎﻨﻴﺔ ﺇﻀﺎﻓﺔ ﺨﻭﺍﺭﺯﻤﻴﺎﺕ ﺃﺨﺭﻯ ﻭﺍﻝﻤﻘﺎﺭﻨﺔ ﺒﻴﻨﻬﺎ ﻻﺨﺘﻴﺎﺭ ﺃﻓﻀـل ﻫـﺫﻩ‬
‫ﺍﻝﺨﻭﺍﺭﺯﻤﻴﺎﺕ‪.‬‬

‫‪ .12‬ﺍﻝﻤﺭﺍﺠﻊ‬
‫]‪[1‬‬ ‫‪Gonzales, R. Woods, R. "Digital Image Processing". (Addison-Wesley -2002).‬‬
‫]‪[2‬‬ ‫‪Azriel, R. Avinash, "Digital Picture Processing". (Academic Press, 1982).‬‬
‫]‪[3‬‬ ‫‪Rajeev, Ramanath. "Interpolation methods for the bayer color array", (Master’s thesis,‬‬
‫‪NorthCarolina State University, – 2000).‬‬
‫]‪[4‬‬ ‫‪Said A., Pearlman W.A. "New Fast and Efficient Image Codec Based on Set‬‬
‫‪Partitioning in Hierarchical Trees", (IEEE Trans. on Circuits and Systems for Video‬‬
‫‪Technology– June 1996).‬‬
‫]‪[5‬‬ ‫‪Carson, C., Belongie, S., Greenspan, H., Malik, J., "Color- and Texture-Based Image‬‬
‫‪Segmentation Using EM and Its application to Image Querying and Classification",‬‬
‫‪(http://elib.cs.berkeley.edu/papers/ -1997).‬‬
‫]‪[6‬‬ ‫‪Smith, J.R. and Shih-Fu Chang. "Automated Image Retrieval Using Color and‬‬
‫‪Texture"( http://www.ctr.columbia.edu/~jrsmith/html/pubs/- 1995).‬‬
‫]‪[7‬‬ ‫‪Smith, J.R. and Shih-Fu Chang. "Automated Binary Texture Feature Sets for Image‬‬
‫‪Retrieval" (http://www.ctr.columbia.edu/~jrsmith/html/pubs/- 1996).‬‬
‫]‪[8‬‬ ‫‪Unser, M. Splines: A perfect fit for signal and image processing. IEEE Signal‬‬
‫‪Processing Magazine and IEEE Signal Processing Society’s 2000 Magazine Award //‬‬
‫‪16(6):22–38, November -1999.‬‬
20 ‫م ع ت‬ 2010 (1)‫اد‬ (15)‫ا‬ 
 ‫ ام وا‬

[9] Ardizzone, E., La Cascia, M., Vito di Gesu,Valenti, C., "Content Based Indexing of
Image and Video Databases by Global and Shape Features
//http://www.cs.edu./associates/marco/publications.html -1996.
[10] Sobel, I. "An isotropic image gradient operator. Machine Vision for Three-Dimensional
Scenes" // pp.376-379. Academic Press, 1990
[11] Carson, C. and Ogle, V.E., "Storage and Retrieval of Feature Data for a Very Large
Online Image Collection" // http://elib.cs.berkeley.edu/papers/ - 1996.
[12] Mohammed Abdulshakoor Ameen "Content-Based Image Search Engine", The 17the
national conference on Computer Science, King Abdul Aziz University,2004
[13] Tou, J. T. and Gonzalez, R. C., Pattern Recognition Principles. Reading, MA: Addison-
Wesley, 1974.
[14] Bezdek, J. C., Pattern Recognition with Fuzzy Objective Function Algorithms. New
York: Plenum, 1982.
[15] James Ze Wang, Gio Wiederhold, Oscar Firschein and Sha Xin Wei, "Content-based
image indexing and searching using Daubechies' wavelets", Department of Computer
Science, Stanford University, Stanford, CA 94305, USA, US