‫‪Archvie of SID‬‬

‫ﺍﺭﺍﺋﻪ ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺭﻭﺵﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ‪ LSB-M‬ﻭ ‪LSB-F‬‬

‫ﻭﺟﻴﻬﻪ ﺛﺎﺑﺘﯽ‬ ‫ﺷﺎﺩﺭﺥ ﺳﻤﺎﻭﯼ‬ ‫ﻣﺠﺘﺒﯽ ﻣﻬﺪﻭﯼ‬

‫ﺩﺍﻧﺸﮑﺪﻩ ﺑﺮﻕ ﻭ ﮐﺎﻣﭙﻴﻮﺗﺮ‬ ‫ﺩﺍﻧﺸﮑﺪﻩ ﺑﺮﻕ ﻭ ﮐﺎﻣﭙﻴﻮﺗﺮ‬ ‫ﺩﺍﻧﺸﮑﺪﻩ ﺑﺮﻕ ﻭ ﮐﺎﻣﭙﻴﻮﺗﺮ‬
‫ﺩﺍﻧﺸﮕﺎﻩ ﺻﻨﻌﺘﯽ ﺍﺻﻔﻬﺎﻥ‬ ‫ﺩﺍﻧﺸﮕﺎﻩ ﺻﻨﻌﺘﯽ ﺍﺻﻔﻬﺎﻥ‬ ‫ﺩﺍﻧﺸﮕﺎﻩ ﺻﻨﻌﺘﯽ ﺍﺻﻔﻬﺎﻥ‬
‫‪sabeti@ec.iut.ac.ir‬‬ ‫‪samavi96@cc.iut.ac.ir‬‬ ‫‪mahdavi@ec.iut.ac.ir‬‬

‫ﭼﮑﻴﺪﻩ‪ :‬ﺍﻟﮕﻮﺭﻳﺘﻢﻫﺎﻱ ﺟﺎﺳﺎﺯﻱ ﺩﺭ ﺑﻴﺖ ﮐﻢ ﺍﺭﺯﺵ ﭘﻴﮑﺴﻞﻫﺎﻱ ﺗﺼﻮﻳﺮ ) ‪ LSB-F‬ﻭ ‪ (LSB-M‬ﺍﺯ ﺭﺍﻳﺞﺗﺮﻳﻦ ﻭ ﺳﺎﺩﻩﺗﺮﻳﻦ ﺭﻭﺵﻫﺎﻱ ﭘﻨﻬﺎﻥ‪-‬‬
‫ﻧﮕﺎﺭﻱ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﻣﻘﺎﻟﻪ ﻣﺪﻟﻲ ﺭﻳﺎﺿﻲ ﺑﺮﺍﻱ ﺍﻳﻦ ﺭﻭﺵﻫﺎ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺍﻳﻦ ﻣﺪﻝ ﻣﻲﺗﻮﺍﻧﺪ ﺑﺮﺍﻱ ﺗﻮﺟﻴﻪ ﺭﻓﺘﺎﺭ ﻭ ﺧﻮﺍﺹ ﺍﻳﻦ ﺩﻭ ﻧﻮﻉ‬
‫ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺑﮑﺎﺭ ﺭﻭﺩ‪ .‬ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﻳﮑﻲ ﺍﺯ ﻭﻳﮋﮔﻲﻫﺎﻱ ﺗﺼﻮﻳﺮ ﺍﺳﺖ ﮐﻪ ﺩﺭ ﺍﺛﺮ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺭﻭﺵﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺗﻐﻴﻴﺮ ﻣﻲﮐﻨﺪ‪ .‬ﺑﺎ‬
‫ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺍﺭﺍﺋﻪ ﺷﺪﻩ‪ ،‬ﺭﻓﺘﺎﺭ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﺑﻌﺪ ﺍﺯ ﺟﺎﺳﺎﺯﻱ ﻧﻴﺰ ﻣﺪﻝ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺳﭙﺲ ﺍﺯ ﻣﺪﻝ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ‪ ،‬ﺑﺮﺍﻱ‬
‫ﺗﺨﻤﻴﻦ ﻣﻴﺰﺍﻥ ﺗﻐﻴﻴﺮﺍﺕ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺩﺭ ﺍﺛﺮ ﺟﺎﺳﺎﺯﻱ ﺍﺳﺘﻔﺎﺩﻩ ﮔﺮﺩﻳﺪﻩ ﺍﺳﺖ‪ .‬ﺻﺤﺖ ﻣﺪﻝﻫﺎﻱ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺗﻮﺳﻂ ﺷﺒﻴﻪﺳﺎﺯﻱ ﺑﻪ ﺍﺛﺒﺎﺕ ﺭﺳﻴﺪﻩ‬
‫ﺍﺳﺖ‪.‬‬

‫ﻭﺍﮊﻩ ﻫﺎﻱ ﮐﻠﻴﺪﻱ‪ :‬ﭘﻨﻬﺎﻥ ﻧﮕﺎﺭﯼ‪ ،‬ﻫﻴﺴﺘﻮﮔﺮﺍﻡ‪ ،‬ﻣﺪﻝ ﺭﻳﺎﺿﯽ‪ ،‬ﺑﻴﺖ ﮐﻢ ﺍﺭﺯﺵ‬

‫ﭘﻨﻬﺎﻥ ﻧﮕﺎﺭﻱ ﻫﻨﺮ ﺍﺭﺗﺒﺎﻁ ﭘﻨﻬﺎﻧﻲ ﺍﺳﺖ ﻭ ﻫﺪﻑ ﺁﻥ ﭘﻨﻬﺎﻥ ﮐﺮﺩﻥ‬
‫‪٤‬‬
‫ﺍﺭﺗﺒﺎﻁ ﺑﻪ ﻭﺳﻴﻠﻪ ﻗﺮﺍﺭ ﺩﺍﺩﻥ ﭘﻴﺎﻡ ﺩﺭ ﻳﮏ ﺭﺳﺎﻧﻪ ﭘﻮﺷﺎﻧﻪ ﺍﺳﺖ ﺑﻪ‬
‫ﮔﻮﻧﻪ ﺍﻱ ﮐﻪ ﮐﻤﺘﺮﻳﻦ ﺗﻐﻴﻴﺮ ﻗﺎﺑﻞ ﮐﺸﻒ ﺭﺍ ﺩﺭ ﺁﻥ ﺍﻳﺠﺎﺩ ﻧﻤﺎﻳﺪ ﻭ‬
‫ﻧﺘﻮﺍﻥ ﻣﻮﺟﻮﺩﻳﺖ ﭘﻴﺎﻡ ﭘﻨﻬﺎﻥ ﺩﺭ ﺭﺳﺎﻧﻪ ﺭﺍ ﺣﺘﻲ ﺑﻪ ﺻﻮﺭﺕ‬
‫ﺍﺣﺘﻤﺎﻟﻲ ﺁﺷﻜﺎﺭ ﺳﺎﺧﺖ ]‪.[2‬‬
‫ﺭﻣﺰﻧﮕﺎﺭﻱ ﻧﻴﺰ ﻳﮑﻲ ﺍﺯ ﺭﻭﺵﻫﺎﻱ ﺍﻣﻦ ﮐﺮﺩﻥ ﺍﺭﺗﺒﺎﻃﺎﺕ ﺍﺳﺖ‪ .‬ﺩﺭ‬
‫ﺭﻣﺰﻧﮕﺎﺭﻱ ﺗﻼﺷﻲ ﺑﺮﺍﻱ ﭘﻨﻬﺎﻥ ﮐﺮﺩﻥ ﭘﻴﺎﻡ ﮐﺪ ﺷﺪﻩ ﺍﻧﺠﺎﻡ‬
‫ﻧﻤﻲﺷﻮﺩ ﻭ ﻫﺪﻑ‪ ،‬ﺍﻧﺘﻘﺎﻝ ﺍﻃﻼﻋﺎﺕ ﺑﻪ ﮔﻮﻧﻪﺍﻱ ﺍﺳﺖ ﮐﻪ ﻃﺮﻑ‬
‫‪ -۱‬ﻣﻘﺪﻣﻪ‬
‫ﻣﺘﻦ‪ ،‬ﺗﺼﻮﻳﺮ‪ ،‬ﺻﻮﺕ ﻭ ﻭﻳﺪﺋﻮ ﺭﺍ ﻣﻲﺗﻮﺍﻥ ﺑﻪ ﺻﻮﺭﺕ ﺩﺍﺩﻩﻫﺎﻱ‬
‫ﺩﻳﺠﻴﺘﺎﻝ ﺑﻴﺎﻥ ﮐﺮﺩ‪ .‬ﻓﺮﺍﮔﻴﺮﻱ ﻓﺰﺍﻳﻨﺪﻩ ﻭ ﺭﺷﺪ ﺳﺮﻳﻊ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ‬
‫ﺍﻳﻨﺘﺮﻧﺖ ﺍﻧﺴﺎﻥﻫﺎ ﺭﺍ ﺑﻪ ﺳﻮﻱ ﺟﻬﺎﻥ ﺩﻳﺠﻴﺘﺎﻝ ﻭ ﺍﺭﺗﺒﺎﻁ ﺍﺯ ﻃﺮﻳﻖ‬
‫ﺩﺍﺩﻩﻫﺎﻱ ﺩﻳﺠﻴﺘﺎﻝ ﺳﻮﻕ ﺩﺍﺩﻩ ﺍﺳﺖ‪ .‬ﺍﻣﻨﻴﺖ ﺍﺭﺗﺒﺎﻃﺎﺕ ﺩﺍﻧﺸﻲ‬
‫ﺍﺳﺖ ﮐﻪ ﺷﺎﻣﻞ ﻋﻠﻮﻡ ﻣﺨﺘﻠﻔﻲ ﭼﻮﻥ ﺭﻣﺰﻧﮕﺎﺭﻱ‪ ،١‬ﺗﻪﻧﻘﺶ‪-‬‬
‫ﻧﮕﺎﺭﻱ‪ ،٢‬ﺍﺭﺗﺒﺎﻃﺎﺕ ﭘﻮﺷﻴﺪﻩ‪ ٣‬ﻭ ‪ ...‬ﻣﻲﺑﺎﺷﺪ]‪.[1‬‬

‫‪1‬‬ ‫‪Cryptography‬‬
‫‪٢٤٩‬‬
‫‪2‬‬ ‫‪Watermarking‬‬
‫‪4‬‬ ‫‪Cover media‬‬ ‫‪3 Covert Channel‬‬

‫‪www.SID.ir‬‬
‫‪Archvie of SID‬‬
‫ﺷﮑﻞ‪ :۱‬ﺷﻤﺎﻱ ﮐﻠﻲ ﻳﮏ ﺍﺭﺗﺒﺎﻁ ﺳﺮﻱ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ‬
‫ﺭﻣﺰﮔﺸﺎﻳﻲ‪ ١٠‬ﻭ ﺳﭙﺲ ﺑﺎﺯﮔﺸﺎﻳﻲ ﺭﺍ ﺭﻭﻱ ﭘﻴﺎﻡ ﺍﺳﺘﺨﺮﺍﺝ ﺷﺪﻩ‬
‫‪١١‬‬
‫ﺳﻮﻡ ﻗﺎﺩﺭ ﺑﻪ ﺧﻮﺍﻧﺪﻥ ﺁﻥ ﻧﺒﺎﺷﺪ‪ .‬ﺍﻣﺎ‪ ،‬ﭘﻨﻬﺎﻥ ﻧﮕﺎﺭﻱ ﭘﻴﺎﻡ ﺭﻣﺰ ﺭﺍ‬
‫ﺍﻋﻤﺎﻝ ﮐﻨﺪ]‪.[4‬‬
‫ﻫﺪﻑ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ‪ ،‬ﻏﻴﺮﻗﺎﺑﻞ ﮐﺸﻒ ﺑﻮﺩﻥ ﻭﺟﻮﺩ ﺩﺍﺩﻩ ﭘﻨﻬﺎﻥ ﺷﺪﻩ‬
‫ﺍﺳﺖ‪ ،‬ﺍﻣﺎ ﺍﮐﺜﺮ ﺭﻭﺵﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺍﺛﺮﺍﺕ ﻗﺎﺑﻞ ﮐﺸﻔﻲ ﺩﺭ‬
‫ﺷﺊ ﭘﻮﺷﺎﻧﻪ ﺑﺎﻗﻲ ﻣﻲﮔﺬﺍﺭﻧﺪ‪ .‬ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺍﻳﻦ ﺗﻐﻴﻴﺮﺍﺕ ﺑﺮﺍﻱ‬
‫ﮐﺸﻒ ﻭﺟﻮﺩ ﻳﮏ ﭘﻴﺎﻡ ﻣﺨﻔﻲ ﺩﺭ ﻳﮏ ﺍﺭﺗﺒﺎﻁ‪ ،‬ﻫﺪﻑ ﭘﻨﻬﺎﻥ‪-‬‬
‫‪١٢‬‬
‫ﺷﻜﻨﻲ ﺍﺳﺖ]‪.[5‬‬
‫ﮐﺎﺭﻫﺎﻱ ﺯﻳﺎﺩﻱ ﺩﺭ ﺯﻣﻴﻨﻪ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﻭ ﭘﻨﻬﺎﻥﺷﮑﻨﻲ ﺩﺭ ﺗﺼﺎﻭﻳﺮ‬
‫ﺍﻧﺠﺎﻡ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﻣﻌﻤﻮﻻﹰ ﺩﺭ ﺩﻭ ﺣﻮﺯﻩ ﻣﮑﺎﻥ‪ ١٣‬ﻭ‬
‫‪١٤‬‬
‫ﺣﻮﺯﻩ ﺗﺒﺪﻳﻞ ﺻﻮﺭﺕ ﻣﻲﮔﻴﺮﺩ‪ .‬ﺑﺮﺍﻱ ﻣﺜﺎﻝ ﺟﺎﺳﺎﺯﻱ ﺩﺍﺩﻩﻫﺎ ﺩﺭ‬
‫ﺑﻴﺖﻫﺎﻱ ﮐﻢ ﺍﺭﺯﺵ ﺗﺼﺎﻭﻳﺮ]‪ [6,7‬ﺍﺯ ﺣﻮﺯﻩ ﻣﮑﺎﻥ ﻭ ﺭﻭﺵﻫﺎﻳﻲ‬
‫ﻣﺎﻧﻨﺪ ‪ OutGuess ،Jsteg‬ﻭ‪ [9,8,5] F5‬ﺍﺯ ﺣﻮﺯﻩ ﺗﺒﺪﻳﻞ ﺍﺳﺘﻔﺎﻩ‬
‫ﻣﻲﮐﻨﻨﺪ‪.‬‬
‫ﺩﺭ ﺍﻳﻦ ﻣﻘﺎﻟﻪ ﺳﻌﻲ ﮔﺮﺩﻳﺪﻩ ﺍﺳﺖ ﺗﺎ ﻳﮏ ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺑﺮﺍﻱ‬
‫‪١٦‬‬ ‫‪١٥‬‬
‫ﺍﺭﺍﺋﻪ‬ ‫ﻭ ‪LSB-M‬‬ ‫ﺭﻓﺘﺎﺭ ﺭﻭﺵﻫﺎﻱ ﭘﻨﻬﺎﻥ ﻧﮕﺎﺭﻱ ‪LSB-F‬‬
‫ﮔﺮﺩﺩ‪ .‬ﭼﻨﻴﻦ ﻣﺪﻟﻲ ﻣﻲﺗﻮﺍﻧﺪ ﺩﺭ ﺗﻮﺟﻴﻪ ﺭﻓﺘﺎﺭ ﻭ ﺧﻮﺍﺹ ﻭ ﺳﻄﺢ‬
‫ﺍﻣﻨﻴﺖ ﻭ ﻇﺮﻓﻴﺖ ﺍﻳﻦ ﻧﻮﻉ ﭘﻨﻬﺎﻥ ﻧﮕﺎﺭﻱ ﺑﮑﺎﺭ ﺭﻭﺩ‪ .‬ﻫﻴﺴﺘﻮﮔﺮﺍﻡ‬
‫ﺗﺼﻮﻳﺮ ﻳﮑﻲ ﺍﺯ ﻭﻳﮋﮔﻲﻫﺎﻳﻲ ﺍﺳﺖ ﮐﻪ ﺩﺭ ﺟﺎﺳﺎﺯﻱ ﺗﻐﻴﻴﺮ ﻣﻲﮐﻨﺪ‬
‫ﻭ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺗﻐﻴﻴﺮﺍﺕ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﻣﺒﻨﺎﻱ ﺑﺴﻴﺎﺭﻱ ﺍﺯ ﺣﻤﻼﺕ‬
‫ﻣﻮﻓﻖ ﻣﻲﺑﺎﺷﺪ]‪ .[10‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺑﺮﺍﻱ‬
‫‪10 Decryption‬‬
‫‪11 Decompression‬‬
‫‪12 Steganalysis‬‬
‫‪13‬‬ ‫‪spatial domain‬‬
‫‪14 transform domain‬‬
‫)‪15 Least Significant Bit Flipping (LSB-F‬‬
‫)‪16 Least Significant Bit Matching (LSB-M‬‬
‫ﺗﻐﻴﻴﺮ ﻧﻤﻲﺩﻫﺪ‪ ،‬ﺑﻠﮑﻪ ﺁﻥ ﺭﺍ ﺩﺍﺧﻞ ﻳﮏ ﺷﺊ ﭘﻮﺷﺎﻧﻪ ﺑﻪ ﮔﻮﻧﻪﺍﻱ‬
‫ﻣﺨﻔﻲ ﻣﻲﮐﻨﺪ ﮐﻪ ﻗﺎﺑﻞ ﺩﻳﺪﻥ ﻧﺒﺎﺷﺪ]‪.[3‬‬
‫ﺩﺭ ﺷﮑﻞ ‪ ،١‬ﺷﻤﺎﻱ ﮐﻠﻲ ﻳﮏ ﺍﺭﺗﺒﺎﻁ ﺳﺮﻱ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﭘﻨﻬﺎﻥ‬
‫ﻧﮕﺎﺭﻱ ﻧﺸﺎﻥ ﺩﺍﺩﻩ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﻫﺪﻑ ﺩﺭ ﺍﻳﻦ ﺍﺭﺗﺒﺎﻁ ﺗﺒﺎﺩﻝ ﻳﮏ‬
‫ﭘﻴﺎﻡ ﺳﺮﻱ ﺍﺳﺖ‪ .‬ﺍﻳﻦ ﭘﻴﺎﻡ ﻋﻠﻴﺮﻏﻢ ﺷﮑﻞ ﻇﺎﻫﺮﻱ ﺧﻮﺩ ﺑﺎﻳﺪ ﺑﻪ‬
‫ﺻﻮﺭﺕ ﻳﮏ ﺭﺷﺘﻪ ﺑﻴﺘﻲ ﺑﻴﺎﻥ ﺷﻮﺩ‪ .‬ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺩﻭ ﻣﺎﮊﻭﻝ ﻓﺸﺮﺩﻩ‪-‬‬
‫ﺳﺎﺯﻱ‪ ٥‬ﻭ ﺭﻣﺰﻧﮕﺎﺭﻱ‪ ٦‬ﻗﺒﻞ ﺍﺯ ﺍﻋﻤﺎﻝ ﺭﻭﺵ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺍﻟﺰﺍﻣﻲ‬
‫ﺍﺳﺖ‪ .‬ﻓﺸﺮﺩﻩ ﮐﺮﺩﻥ ﺑﺎﻋﺚ ﺣﺬﻑ ﺍﻓﺰﻭﻧﮕﻲﻫﺎﻱ ﻣﻮﺟﻮﺩ ﺩﺭ ﺩﺍﺩﻩ‬
‫ﻭ ﺩﺭ ﻧﺘﻴﺠﻪ ﺟﻠﻮﮔﻴﺮﻱ ﺍﺯ ﺍﺗﻼﻑ ﻇﺮﻓﻴﺖ ﺗﺼﻮﻳﺮ ﻣﻲﺷﻮﺩ‪ .‬ﺑﺮﺍﻱ‬
‫ﺍﻓﺰﺍﻳﺶ ﺍﻣﻨﻴﺖ ﺍﺭﺗﺒﺎﻁ‪ ،‬ﻳﮏ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺭﻣﺰﻧﮕﺎﺭﻱ ﺑﺮﺍﻱ ﭘﻨﻬﺎﻥ‬
‫ﮐﺮﺩﻥ ﻣﻔﻬﻮﻡ ﭘﻴﺎﻡ‪ ،‬ﺭﻭﻱ ﺩﺍﺩﻩ ﻓﺸﺮﺩﻩ ﺷﺪﻩ ﺍﻋﻤﺎﻝ ﻣﻲﺷﻮﺩ‪.‬‬
‫‪٧‬‬
‫ﺑﻪ ﻃﻮﺭ ﮐﻠﻲ ﺭﻭﺵﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺍﺯ ﺩﻭ ﻓﺮﺁﻳﻨﺪ ﺟﺎﺳﺎﺯﻱ ﻭ‬
‫ﺍﺳﺘﺨﺮﺍﺝ‪ ٨‬ﺗﺸﮑﻴﻞ ﺷﺪﻩﺍﻧﺪ‪ .‬ﺩﺭ ﻓﺮﺁﻳﻨﺪ ﺟﺎﺳﺎﺯﻱ‪ ،‬ﺩﺍﺩﻩ ﻓﺸﺮﺩﻩ‬
‫ﺷﺪﻩ ﻭ ﺭﻣﺰﺷﺪﻩ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻳﮏ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺟﺎﺳﺎﺯﻱ ﺩﺭ ﻳﮏ‬
‫ﺭﺳﺎﻧﻪ ﭘﻮﺷﺎﻧﻪ ﭘﻨﻬﺎﻥ ﻣﻲﺷﻮﺩ ﻭ ﺭﺳﺎﻧﻪ ﮔﻨﺠﺎﻧﻪ‪ ٩‬ﺗﻮﻟﻴﺪ ﻣﻲﺷﻮﺩ‪.‬‬
‫ﺑﺮﺍﻱ ﺍﻓﺰﺍﻳﺶ ﺍﻣﻨﻴﺖ ﻣﻌﻤﻮﻻﹰ ﺍﺯ ﻳﮏ ﮐﻠﻴﺪ ﺟﺎﺳﺎﺯﻱ ﺩﺭ ﺍﻳﻦ‬
‫ﻣﺮﺣﻠﻪ ﺍﺳﺘﻔﺎﺩﻩ ﻣﻲﺷﻮﺩ‪ .‬ﮔﻴﺮﻧﺪﻩ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻳﮏ ﺍﻟﮕﻮﺭﻳﺘﻢ‬
‫ﺍﺳﺘﺨﺮﺍﺝ‪ ،‬ﺩﺍﺩﻩ ﻣﺨﻔﻲ ﺷﺪﻩ ﺭﺍ ﺍﺯ ﺭﺳﺎﻧﻪ ﮔﻨﺠﺎﻧﻪ ﺧﺎﺭﺝ ﻣﻲﮐﻨﺪ‪.‬‬
‫ﮔﻴﺮﻧﺪﻩ ﺑﺮﺍﻱ ﺧﺎﺭﺝ ﮐﺮﺩﻥ ﭘﻴﺎﻡ ﺍﺻﻠﻲ‪ ،‬ﺑﺎﻳﺪ ﺍﻟﮕﻮﺭﻳﺘﻢﻫﺎﻱ‬
‫‪5‬‬ ‫‪Compression‬‬
‫‪6‬‬ ‫‪Encryption‬‬
‫‪7 Embedding‬‬
‫‪8 Extraction‬‬ ‫‪٢٥٠‬‬
‫‪9 Stego Media‬‬
‫‪www.SID.ir‬‬
 ‫‪Archvie of SID‬‬

‫ﺗﺼﻮﻳﺮ ﺑﺮﺍﺑﺮ ﺍﺳﺖ‪ .‬ﺑﻪ ﻫﻤﻴﻦ ﺩﻟﻴﻞ ﺍﻳﻦ ﺭﻭﺵ ﺩﺭ ﺑﺮﺍﺑﺮ ﺣﻤﻼﺗﻲ‬ ‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ‪ ،‬ﺗﺨﻤﻴﻨﻲ ﺍﺯ ﺗﻐﻴﻴﺮ ﺍﻳﺠﺎﺩ ﺷﺪﻩ ﺩﺭ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ‬
‫ﺁﺳﻴﺐ ﭘﺬﻳﺮ ﺍﺳﺖ ﮐﻪ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺭﺍ ﺑﺮﺭﺳﻲ ﻣﻲ ﮐﻨﻨﺪ‪ .‬ﺑﺮﺧﻲ ﺍﺯ‬ ‫ﺗﺼﻮﻳﺮ ﺩﺭ ﺍﺛﺮ ﺟﺎﺳﺎﺯﻱ ﺑﻪ ﺭﻭﺵﻫﺎﻱ ‪ LSB-F‬ﻭ ‪ LSB-M‬ﻗﺎﺑﻞ‬
‫ﺍﻳﻦ ﺣﻤﻼﺕ ﺩﺭ ]‪ [10,13,14‬ﺁﻭﺭﺩﻩ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺍﻣﺎ ﺑﺎ ﺗﻮﺟﻪ ﺑﺎ‬ ‫ﻣﺤﺎﺳﺒﻪ ﺍﺳﺖ‪.‬‬
‫ﺍﻳﻦﮐﻪ ﺭﻭﺵ ‪ LSB-M‬ﺍﺯ ﺍﻳﺠﺎﺩ ‪ POV‬ﺩﺭ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺟﻠﻮﮔﻴﺮﻱ‬ ‫ﺩﺭ ﺍﺩﺍﻣﻪ ﻣﻘﺎﻟﻪ‪ ،‬ﺍﺑﺘﺪﺍ ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ LSB-M‬ﻭ ‪ LSB-F‬ﺑﻪ ﺻﻮﺭﺕ‬
‫ﻣﻲﮐﻨﺪ‪ ،‬ﺩﺭ ﺑﺮﺍﺑﺮ ﺣﻤﻼﺕ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺑﺮﺍﻱ ‪ LSB-F‬ﻣﻘﺎﻭﻡ ﺍﺳﺖ‪.‬‬ ‫ﻣﺨﺘﺼﺮ ﺑﺮﺭﺳﻲ ﻣﻲﺷﻮﺩ‪ .‬ﺳﭙﺲ ﺩﺭ ﺑﺨﺶ ‪ ،٣‬ﻣﺪﻝ ﺭﻳﺎﺿﻲ‬
‫ﺩﺭ ﻣﻮﺭﺩ ‪ LSB-M‬ﻧﻴﺰ ﺣﻤﻼﺕ ﺩﻳﮕﺮﻱ ﻣﻄﺮﺡ ﮔﺮﺩﻳﺪﻩ ﺍﺳﺖ‪ ،‬ﺍﻣﺎ‬ ‫ﻣﺘﻨﺎﻇﺮ ﺑﺎ ﺍﻳﻦ ﺭﻭﺵ ﻫﺎ ﺍﺭﺍﺋﻪ ﻣﻲﺷﻮﺩ‪ .‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺍﻳﻦ ﻣﺪﻝﻫﺎﻱ‬
‫ﻫﻴﭻ ﮐﺪﺍﻡ ﺍﺯ ﺁﻧﻬﺎ ﮐﺎﻣﻼﹰ ﻣﻮﻓﻖ ﻧﺒﻮﺩﻩﺍﻧﺪ‪ .‬ﺑﺮﺧﻲ ﺍﺯ ﺍﻳﻦ ﺣﻤﻼﺕ‬ ‫ﺭﻳﺎﺿﻲ‪ ،‬ﺩﺭ ﺑﺨﺶ ‪ ٤‬ﺭﻭﺷﻲ ﺑﺮﺍﻱ ﻣﺤﺎﺳﺒﻪ ﺗﺨﻤﻴﻦ ﺧﻄﺎﻱ‬
‫ﺩﺭ ]‪ [11,15‬ﺁﻭﺭﺩﻩ ﺷﺪﻩ ﺍﺳﺖ‪.‬‬ ‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺩﺭ ﺍﺛﺮ ﺍﻋﻤﺎﻝ ﺍﻳﻦ ﺭﻭﺵﻫﺎ ﺍﺭﺍﺋﻪ ﻣﻲﺷﻮﺩ‪ .‬ﺩﺭ ﺑﺨﺶ‪،٥‬‬
‫ﻧﺘﺎﻳﺞ ﺗﺨﻤﻴﻦ ﺧﻄﺎﻱ ﺣﺎﺻﻞ ﺍﺯ ﺗﺌﻮﺭﻱ ﻭ ﺷﺒﻴﻪ ﺳﺎﺯﻱ ﻣﻘﺎﻳﺴﻪ‬
‫ﻣﻲﺷﻮﺩ‪.‬‬
‫‪ -۳‬ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺭﻭﺵﻫﺎﻱ‪ LSB-F‬ﻭ ‪LSB-M‬‬
‫ﺩﺍﺩﻩﻫﺎﻳﻲ ﮐﻪ ﺩﺭ ﻓﺮﺁﻳﻨﺪ ﺟﺎﺳﺎﺯﻱ ﻣﻮﺭﺩ ﺍﺳﺘﻔﺎﺩﻩ ﻗﺮﺍﺭ ﻣﻲﮔﻴﺮﻧﺪ‪،‬‬
‫ﺑﺎﻳﺪ ﺍﺑﺘﺪﺍ ﻓﺸﺮﺩﻩ ﻭ ﺳﭙﺲ ﺭﻣﺰ ﺷﻮﻧﺪ‪ .‬ﺩﺍﺩﻩﻫﺎﻳﻲ ﮐﻪ ﺑﻪ ﺍﻳﻦ‬ ‫‪ -۲‬ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ LSB-F‬ﻭ ‪LSB-M‬‬
‫ﺻﻮﺭﺕ ﺗﻮﻟﻴﺪ ﻣﻲﺷﻮﻧﺪ ﺧﻮﺍﺻﻲ ﻣﺎﻧﻨﺪ ﻳﮏ ﺩﻧﺒﺎﻟﻪ ﺑﻴﺖ ﺗﺼﺎﺩﻓﻲ‬ ‫ﺭﺍﻳﺞﺗﺮﻳﻦ ﻭ ﺳﺎﺩﻩﺗﺮﻳﻦ ﺭﻭﺵ ﺟﺎﺳﺎﺯﻱ ﺩﺭ ﺣﻮﺯﻩ ﻣﮑﺎﻧﻲ‪ ،‬ﺭﻭﺵ‬
‫ﺩﺍﺭﻧﺪ‪ .‬ﺍﻣﻴﺪ ﺭﻳﺎﺿﻲ ﺗﻌﺪﺍﺩ ﺑﻴﺖﻫﺎﻱ ﻳﮏ ﻭ ﺻﻔﺮ ﺩﺭ ﺍﻳﻦ ﺭﺷﺘﻪ‬ ‫ﺟﺎﺳﺎﺯﻱ ﺩﺭ ﺑﻴﺖﻫﺎﻱ ﮐﻢ ﺍﺭﺯﺵ ﺍﺳﺖ ﮐﻪ ﭘﻴﺎﻡ ﺭﺍ ﺩﺭ ﮐﻢ ﺍﺭﺯﺵ‪-‬‬
‫ﺑﻴﺖ ﺑﺎ ﻳﮑﺪﻳﮕﺮ ﺑﺮﺍﺑﺮ ﺍﺳﺖ]‪ .[16‬ﺟﺎﺳﺎﺯﻱ ﻳﮏ ﺑﻴﺖ ﺩﺍﺩﻩ‬ ‫ﺗﺮﻳﻦ ﺑﻴﺖﻫﺎﻱ ﭘﻴﮑﺴﻞﻫﺎ ﻗﺮﺍﺭ ﻣﻲﺩﻫﺪ‪ .‬ﺟﺎﺳﺎﺯﻱ ﺑﻪ ﺍﻳﻦ ﺭﻭﺵ‬
‫ﺗﺼﺎﺩﻓﻲ ﺩﺭ ﻳﮏ ﭘﻴﮑﺴﻞ ﺑﺎﻋﺚ ﺍﻳﺠﺎﺩ ﺗﻐﻴﻴﺮﺍﺗﻲ ﺩﺭ ﻣﻘﺪﺍﺭ ﺳﻄﺢ‬ ‫ﺳﺎﺩﻩﺗﺮﻳﻦ ﺭﻭﺵ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺩﺭ ﺣﻮﺯﻩ ﻣﮑﺎﻧﻲ ﺍﺳﺖ ﻭ ﺭﻭﺵ‪-‬‬
‫ﺭﻭﺷﻨﺎﻳﻲ ﺁﻥ ﭘﻴﮑﺴﻞ ﻣﻲﮔﺮﺩﺩ‪ .‬ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺍﻳﻨﮑﻪ ﺟﺎﺳﺎﺯﻱ ﺑﻪ‬ ‫ﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺑﺴﻴﺎﺭﻱ ﺑﺮ ﻣﺒﻨﺎﻱ ﺍﻳﻦ ﺭﻭﺍﻝ ﺗﺎ ﺑﻪ ﺣﺎﻝ ﺍﺭﺍﺋﻪ‬
‫ﺭﻭﺵﻫﺎﻱ ‪ LSB-M‬ﻭ ‪ LSB-F‬ﺗﻨﻬﺎ ﻣﻘﺪﺍﺭ ﭘﻴﮑﺴﻞ ﺭﺍ ﺑﻪ ﺍﻧﺪﺍﺯﻩ‬ ‫ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺑﺼﻮﺭﺕ ﮐﻠﻲ‪ ،‬ﺭﻭﺵﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺩﺭ ﺑﻴﺖﻫﺎﻱ‬
‫ﻳﮏ ﻭﺍﺣﺪ ﮐﺎﻫﺶ ﻳﺎ ﺍﻓﺰﺍﻳﺶ ﻣﻲﺩﻫﺪ‪ ،‬ﻣﻲﺗﻮﺍﻥ ﺗﻐﻴﻴﺮ ﻣﻘﺪﺍﺭ ﺳﻄﺢ‬ ‫ﮐﻢ ﺍﺭﺯﺵ ﺭﺍ ﺩﺭ ﺩﻭ ﺩﺳﺘﻪ ‪ LSB-F‬ﻭ ‪ LSB-M‬ﻣﻲﺗﻮﺍﻥ ﺗﻘﺴﻴﻢ‬
‫ﺭﻭﺷﻨﺎﻳﻲ ﻳﮏ ﭘﻴﮑﺴﻞ ﺩﺭ ﺍﺛﺮ ﺟﺎﺳﺎﺯﻱ ﻳﮏ ﺑﻴﺖ ﺩﺍﺩﻩ ﺗﺼﺎﺩﻓﻲ ﺭﺍ‬ ‫ﺑﻨﺪﻱ ﮐﺮﺩ]‪.[11‬‬
‫ﺑﻪ ﺻﻮﺭﺕ ﺷﮑﻞ ‪ ٢‬ﻣﺪﻝ ﮐﺮﺩ‪.‬‬ ‫ﺩﺭ ﺭﻭﺵ ‪ ،LSB-F‬ﺗﻨﻬﺎ ﮐﻢ ﺍﺭﺯﺵﺗﺮﻳﻦ ﺑﻴﺖ ﻫﺮ ﭘﻴﮑﺴﻞ ﺗﻐﻴﻴﺮ‬
‫ﺍﮔﺮ ﺳﻄﺢ ﺭﻭﺷﻨﺎﻳﻲ ﻳﮏ ﭘﻴﮑﺴﻞ ﺭﺍ ‪ i‬ﻓﺮﺽ ﮐﻨﻴﻢ ﻭ ﺳﻄﺢ‬ ‫ﻣﻲﮐﻨﺪ‪ .‬ﺑﻪ ﻋﺒﺎﺭﺕ ﺩﻳﮕﺮ ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﺑﻴﺖ ﮐﻢ ﺍﺭﺯﺵ ﭘﻴﮑﺴﻞ‪-‬‬
‫ﺭﻭﺷﻨﺎﻳﻲ ﻫﻤﻴﻦ ﭘﻴﮑﺴﻞ ﺑﻌﺪ ﺍﺯ ﺟﺎﺳﺎﺯﻱ ﺩﺭ ﺁﻥ ﺭﺍ ‪ j‬ﺑﻨﺎﻣﻴﻢ‪،‬‬ ‫ﻫﺎﻱ ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﺑﺎ ﺑﻴﺖﻫﺎﻱ ﭘﻴﺎﻡ ﺟﺎﮔﺬﺍﺭﻱ ﻣﻲﺷﻮﻧﺪ‪ .‬ﺩﺭ‬
‫ﺁﻧﮕﺎﻩ ﺩﺭ ﺣﺎﻟﺖ ﮐﻠﻲ‪ ،‬ﺑﺎ ﻓﺮﺽ ﺍﻳﻨﮑﻪ ﻣﻘﺪﺍﺭ ﺩﺍﺩﻩ ﺟﺎﺳﺎﺯﻱ ﺷﺪﻩ‬ ‫ﺭﻭﺵ ‪ LSB-M‬ﻧﻴﺰ ﻫﺪﻑ ﻳﮑﺴﺎﻥ ﮐﺮﺩﻥ ﺑﻴﺖ ‪ LSB‬ﭘﻴﮑﺴﻞﻫﺎﻱ‬
‫‪ d‬ﺑﺎﺷﺪ‪ ،‬ﺍﺣﺘﻤﺎﻝ ﺗﻐﻴﻴﺮ ‪ i‬ﺑﻪ ‪ j‬ﺑﺮﺍﺑﺮ ﺍﺳﺖ ﺑﺎ‪:‬‬ ‫ﺗﺼﻮﻳﺮ ﺑﺎ ﺑﻴﺖﻫﺎﻱ ﭘﻴﺎﻡ ﺍﺳﺖ‪ ،‬ﺍﻣﺎ ﻣﻤﮑﻦ ﺍﺳﺖ ﺑﺮﺍﻱ ﺭﺳﻴﺪﻥ ﺑﻪ‬
‫‪P (i ® j ) = P (i ® j | d = 0) P (d = 0) +‬‬ ‫ﺍﻳﻦ ﻫﺪﻑ ﭼﻨﺪ ﺑﻴﺖ ﭘﻴﮑﺴﻞ ﺗﻐﻴﻴﺮ ﻳﺎﺑﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﺩﺭ‬
‫)‪P (i ® j | d = 1) P (d = 1‬‬
‫ﺻﻮﺭﺕ ﺗﻄﺎﺑﻖ ﺑﻴﺖ ﺩﺍﺩﻩ ﺑﺎ ﺑﻴﺖ ﮐﻢ ﺍﺭﺯﺵ ﭘﻴﮑﺴﻞ‪ ،‬ﺗﻐﻴﻴﺮﻱ ﺩﺭ‬
‫ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺑﮑﺎﺭ ﺭﻓﺘﻪ ﺑﺮﺍﻱ ﺟﺎﺳﺎﺯﻱ‪ ،‬ﻣﻘﺪﺍﺭ ﺍﻳﻦ‬
‫ﭘﻴﮑﺴﻞ ﺍﻳﺠﺎﺩ ﻧﻤﻲﺷﻮﺩ‪ .‬ﺩﺭ ﺻﻮﺭﺕ ﻋﺪﻡ ﺗﻄﺎﺑﻖ‪ ،‬ﻣﻘﺪﺍﺭ ﭘﻴﮑﺴﻞ‬
‫ﺍﺣﺘﻤﺎﻝ ﺩﺭ ﺣﺎﻻﺕ ﻣﺨﺘﻠﻒ‪ ،‬ﻣﺘﻔﺎﻭﺕ ﺍﺳﺖ‪ .‬ﺩﺭ ﺟﺪﻭﻝ ‪ ،١‬ﻣﻘﺪﺍﺭ‬
‫ﺑﻪ ﺻﻮﺭﺕ ﺗﺼﺎﺩﻓﻲ ﮐﺎﻫﺶ ﻳﺎ ﺍﻓﺰﺍﻳﺶ ﻣﻲﻳﺎﺑﺪ‪ .‬ﺑﻪ ﻫﻤﻴﻦ ﺩﻟﻴﻞ‬
‫ﺍﻳﻦ ﺍﺣﺘﻤﺎﻝ ﺩﺭ ﺣﺎﻻﺕ ﮔﻮﻧﺎﮔﻮﻥ ﻧﺸﺎﻥ ﺩﺍﺩﻩ ﺷﺪﻩ ﺍﺳﺖ‪.‬ﺑﺎ ﺗﻮﺟﻪ‬
‫ﺍﻳﻦ ﺭﻭﺵ ﺑﺎ ﻋﻨﻮﺍﻥ ﺭﻭﺵ ﺟﺎﺳﺎﺯﻱ ‪ ± 1‬ﻧﻴﺰ ﺷﻨﺎﺧﺘﻪ ﻣﻲ‪-‬‬
‫ﺑﻪ ﻣﻘﺎﺩﻳﺮ ﺑﺪﺳﺖ ﺁﻣﺪﻩ ﺩﺭ ﺟﺪﻭﻝ‪ ،١‬ﻣﻲ ﺗﻮﺍﻥ ﺷﮑﻞ‪ ٢‬ﺭﺍ ﺑﺮﺍﻱ‬
‫ﺷﻮﺩ]‪.[12‬‬
‫ﺭﻭﺵ ‪ LSB-F‬ﺑﻪ ﺻﻮﺭﺕ ﺷﮑﻞ ‪-٣‬ﺍﻟﻒ ﻭ ﺑﺮﺍﻱ ﺭﻭﺵ ‪LSB-M‬‬
‫‪١٧‬‬
‫ﺟﺎﺳﺎﺯﻱ ﺑﻪ ﺭﻭﺵ ‪ ،LSB-F‬ﺟﻔﺖ ﺭﻧﮓ ﻫﺎ ﻳﺎ ﺯﻭﺝ ﻣﻘﺎﺩﻳﺮﻱ‬
‫‪٢٥١‬‬ ‫ﺑﻪ ﺻﻮﺭﺕ ﺷﮑﻞ ‪-٣‬ﺏ ﻧﻤﺎﻳﺶ ﺩﺍﺩ‪.‬‬
‫ﺩﺭ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﺍﻳﺠﺎﺩ ﻣﻲﮐﻨﺪ ﮐﻪ ﺗﻌﺪﺍﺩ ﺭﺧﺪﺍﺩ ﺁﻥﻫﺎ ﺩﺭ‬

‫‪17‬‬
‫)‪Pair Of Value (POV‬‬ ‫‪www.SID.ir‬‬
‫‪Archvie of SID‬‬

‫ﺷﮑﻞ‪ :۲‬ﻣﺪﻝ ﮐﻠﻲ ﺗﻐﻴﻴﺮ ﻣﻘﺪﺍﺭ ﺳﻄﺢ ﺭﻭﺷﻨﺎﻳﻲ ﻳﮏ ﭘﻴﮑﺴﻞ ﺩﺭ ﺍﺛﺮ ﺟﺎﺳﺎﺯﻱ ﻳﮏ ﺑﻴﺖ ﺩﺍﺩﻩ‬
‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺭﻧﮓ ﭘﻴﮑﺴﻞﻫﺎﻱ ﺗﺼﻮﻳﺮ ﺑﻮﺟﻮﺩ ﺧﻮﺍﻫﺪ ﺁﻣﺪ‪ .‬ﺩﺭ‬
‫ﺍﺩﺍﻣﻪ ﺗﺼﺎﻭﻳﺮ ﻃﻴﻒ ﺧﺎﮐﺴﺘﺮﻱ‪ ٢٠‬ﻣﻮﺭﺩ ﺑﺮﺭﺳﻲ ﻗﺮﺍﺭ ﻣﻲﮔﻴﺮﻧﺪ‪.‬‬
‫ﺭﻭﺵ ﭘﻴﺸﻨﻬﺎﺩﻱ ﺭﺍ ﻣﻲﺗﻮﺍﻥ ﺑﺮﺍﻱ ﺗﺼﺎﻭﻳﺮ ﺭﻧﮕﻲ ﻧﻴﺰ ﺗﻌﻤﻴﻢ ﺩﺍﺩ‪،‬‬
‫ﺯﻳﺮﺍ ﺗﺼﺎﻭﻳﺮ ﺭﻧﮕﻲ ﺭﺍ ﻣﻲﺗﻮﺍﻥ ﺑﻪ ﺻﻮﺭﺕ ﺳﻪ ﺗﺼﻮﻳﺮ ﻃﻴﻒ‬
‫ﺧﺎﮐﺴﺘﺮﻱ ﻣﺠﺰﺍ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺖ‪.‬‬
‫ﺗﺼﻮﻳﺮﻫﺎﻱ ﻃﻴﻒ ﺧﺎﮐﺴﺘﺮﻱ ﺑﺎ ﭘﻴﮑﺴﻞﻫﺎﻱ ‪ ٨‬ﺑﻴﺘﻲ ﺩﺍﺭﺍﻱ‬
‫ﺭﻭﺷﻨﺎﻳﻲ ﺩﺭ ﺑﺎﺯﻩ ]‪ [0,255‬ﻣﻲﺑﺎﺷﻨﺪ‪ .‬ﻓﺮﺽ ﮐﻨﻴﺪ ﺭﻭﺷﻨﺎﻳﻲ‬
‫ﺗﺼﻮﻳﺮ ﺩﺭ ﻣﻮﻗﻌﻴﺖ )‪ (m,n‬ﺭﺍ ﺑﺎ )‪ I(m,n‬ﻧﺸﺎﻥ ﺩﻫﻴﻢ‪.‬‬
‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ‪ ،‬ﺑﻴﺎﻧﮕﺮ ﻓﺮﮐﺎﻧﺲ ﺭﺧﺪﺍﺩ ﻫﺮ ﺭﻭﺷﻨﺎﻳﻲ ﺩﺭ ﺗﺼﻮﻳﺮ‬
‫ﺍﺳﺖ‪ ،‬ﺑﻪ ﻋﺒﺎﺭﺕ ﺩﻳﮕﺮ‪:‬‬
‫}‪hi = {(m, n) | I (m, n) = i‬‬
‫ﺩﺭ ﺷﮑﻞ ‪-٣‬ﺍﻟﻒ ﺩﻳﺪﻩ ﻣﻲﺷﻮﺩ ﮐﻪ ﭘﻴﮑﺴﻠﻲ ﺑﺎ ﺳﻄﺢ ﺭﻭﺷﻨﺎﻳﻲ‬
‫ﺯﻭﺝ ﺩﺭ ﺍﺛﺮ ﺟﺎﺳﺎﺯﻱ ﺑﻴﺖ ‪ ١‬ﺑﻪ ﺳﻄﺢ ﺭﻭﺷﻨﺎﻳﻲ ﻓﺮﺩ ﺗﻐﻴﻴﺮ ﻣﻲ‪-‬‬
‫ﮐﻨﺪ‪ .‬ﺩﺭ ﺭﻭﺵ ‪ ،LSB-F‬ﺍﮔﺮ ﺩﺍﺩﻩﻫﺎﻱ ﺟﺎﺳﺎﺯﻱ ﺷﺪﻩ ﺭﺍ ﺗﺼﺎﺩﻓﻲ‬
‫ﻓﺮﺽ ﮐﻨﻴﻢ ﭘﻴﮑﺴﻠﻲ ﺑﺎ ﺳﻄﺢ ﺭﻭﺷﻨﺎﻳﻲ ‪ 2i‬ﺑﻪ ﺍﺣﺘﻤﺎﻝ ‪ 1 2‬ﺑﻪ‬
‫ﺳﻄﺢ ﺭﻭﺷﻨﺎﻳﻲ ‪ 2i+ 1‬ﺗﺒﺪﻳﻞ ﻣﻲﺷﻮﺩ‪.‬‬
‫ﺟﺎﺳﺎﺯﻱ ﺑﻪ ﺭﻭﺵ ‪ LSB-M‬ﺭﺍ ﻣﻲﺗﻮﺍﻥ ﺑﺎ ﺍﺿﺎﻓﻪ ﺷﺪﻥ‬
‫ﺍﻏﺘﺸﺎﺵ‪ ١٨‬ﺑﻪ ﺗﺼﻮﻳﺮ ﻣﺪﻝ ﮐﺮﺩ‪ .‬ﺗﺼﻮﻳﺮ ﺍﺳﺘﮕﻮ ﺣﺎﺻﻞ ﺟﻤﻊ‬
‫ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﻭ ﻧﻮﻳﺰ ﮔﻮﺳﻲ‪ ١٩‬ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ‪ ،‬ﻧﻮﻳﺰ‬
‫ﺍﺿﺎﻓﻪ ﺷﺪﻩ ﺗﻨﻬﺎ ﺳﻪ ﻣﻘﺪﺍﺭ ‪ 0 ،+ 1‬ﻭ ‪ -1‬ﺭﺍ ﻣﻲﺗﻮﺍﻧﺪ ﺩﺍﺷﺘﻪ ﺑﺎﺷﺪ‪.‬‬
‫ﺍﺣﺘﻤﺎﻝ ﺍﺿﺎﻓﻪ ﺷﺪﻥ ﻫﺮ ﮐﺪﺍﻡ ﺍﺯ ﺍﻳﻦ ﻣﻘﺎﺩﻳﺮ ﺑﺪﻳﻦ ﺻﻮﺭﺕ ﺍﺳﺖ‪:‬‬
‫‪p(-1) = 1 4 , p(0) =1 2 , p(1) = 1 4‬‬

‫ﺩﺭ ﺍﻳﻨﺠﺎ ﻣﻨﻈﻮﺭ ﺍﺯ ‪ ، hi‬ﺗﻌﺪﺍﺩ ﭘﻴﮑﺴﻞﻫﺎﻱ ﺑﺎ ﺭﻭﺷﻨﺎﻳﻲ ‪ i‬ﺩﺭ‬ ‫ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ﺑﺎ ﺍﺣﺘﻤﺎﻝ ‪ 1 2‬ﻣﻘﺪﺍﺭ ﭘﻴﮑﺴﻞ ﺗﻐﻴﻴﺮﻱ ﻧﻤﻲﮐﻨﺪ‬

‫ﺗﺼﻮﻳﺮ ﺍﺳﺖ]‪ .[11‬ﻓﺮﺽ ﮐﻨﻴﺪ ﺑﺮﺍﻱ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ‬ ‫) ‪ ( p(0) =1 2‬ﻭ ﺑﺎ ﺍﺣﺘﻤﺎﻝ ‪ 1 4‬ﻣﻘﺪﺍﺭ ﭘﻴﮑﺴﻞ ﺍﻓﺰﺍﻳﺶ‬

‫ﻭ ﺗﺼﻮﻳﺮ ﺍﺳﺘﮕﻮ ﺑﻪ ﺗﺮﺗﻴﺐ ﺍﺯ ﻧﻤﺎﺩﻫﺎﻱ ‪ hi‬ﻭ ‪ hi¢‬ﺍﺳﺘﻔﺎﺩﻩ ﮐﻨﻴﻢ‪.‬‬ ‫) ‪ ( p(1) =1 4‬ﻳﺎ ﮐﺎﻫﺶ ) ‪ ( p(-1) =1 4‬ﻣﻲﻳﺎﺑﺪ‪.‬‬

‫ﺩﺭ ﺭﻭﺵ ‪ LSB-M‬ﻣﻘﺪﺍﺭ ‪ hi¢‬ﺗﺤﺖ ﺗﺄﺛﻴﺮ ﺳﻪ ﻣﻘﺪﺍﺭ ‪ hi ، hi -1‬ﻭ‬ ‫ﺣﺎﻝ ﻣﻲﺧﻮﺍﻫﻴﻢ ﺑﺪﺍﻧﻴﻢ ﺍﮔﺮ ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ LSB-M‬ﻭ ‪ LSB-F‬ﺭﺍ ﻳﮏ‬

‫‪ hi +1‬ﻗﺮﺍﺭ ﻣﻲﮔﻴﺮﺩ‪ .‬ﺑﻪ ﻋﺒﺎﺭﺕ ﺩﻳﮕﺮ‪ ،‬ﻣﻲﺗﻮﺍﻥ ﮔﻔﺖ‬ ‫ﺑﺎﺭ ﺭﻭﻱ ﺗﻤﺎﻡ ﭘﻴﮑﺴﻞﻫﺎﻱ ﺗﺼﻮﻳﺮ ﺍﻋﻤﺎﻝ ﮐﻨﻴﻢ‪ ،‬ﭼﻪ ﺗﻐﻴﻴﺮﺍﺗﻲ ﺩﺭ‬

‫ﺟﺪﻭﻝ‪ :١‬ﺍﺣﺘﻤﺎﻝ ﺗﻐﻴﻴﺮﺍﺕ ﺳﻄﺢ ﺭﻭﺷﻨﺎﻳﯽ ﭘﻴﮑﺴﻠﻬﺎ‬

‫‪j‬‬ ‫‪i‬‬ ‫ﺭﻭﺵ‬ ‫‪P (i ® j | d = 0) P (d = 0) + P (i ® j | d‬‬ ‫)‪= 1) P (d = 1‬‬ ‫) ‪P (i ® j‬‬
‫‪LSB-F‬‬ ‫‪0‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪0‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪0‬‬
‫ﺯﻭﺝ‬
‫‪LSB-M‬‬ ‫‪0‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪1/2‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪14‬‬
‫‪i -1‬‬
‫‪LSB-F‬‬ ‫‪1‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪0‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪12‬‬
‫ﻓﺮﺩ‬
‫‪LSB-M‬‬ ‫‪1/2‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪0‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪14‬‬
‫‪LSB-F‬‬ ‫‪1‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪0‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪12‬‬
‫ﺯﻭﺝ‬
‫‪LSB-M‬‬ ‫‪1‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪0‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪12‬‬
‫‪i‬‬
‫‪LSB-F‬‬ ‫‪0‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪1‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪12‬‬
‫ﻓﺮﺩ‬
‫‪LSB-M‬‬ ‫‪0‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪1‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪12‬‬
‫‪LSB-F‬‬ ‫‪0‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪1‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪12‬‬
‫ﺯﻭﺝ‬
‫‪LSB-M‬‬ ‫‪0‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫½‬ ‫*‬ ‫‪1/2‬‬ ‫‪14‬‬
‫‪i +1‬‬
‫‪LSB-F‬‬ ‫‪0‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪0‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪0‬‬
‫ﻓﺮﺩ‬
‫‪LSB-M‬‬ ‫‪1/2‬‬ ‫‪* 1/2‬‬ ‫‪+‬‬ ‫‪0‬‬ ‫*‬ ‫‪1/2‬‬ ‫‪14‬‬ ‫‪٢٥٢‬‬

‫‪18 Additive‬‬ ‫‪noise‬‬

‫‪20 Gray‬‬ ‫‪scale images‬‬ ‫‪19 Gaussian‬‬ ‫‪noise‬‬ ‫‪www.SID.ir‬‬
 ‫‪Archvie of SID‬‬

‫ﺷﮑﻞ‪ :۳‬ﻣﺪﻝ ﺗﻐﻴﻴﺮ ﻣﻘﺪﺍﺭ ﺳﻄﺢ ﺭﻭﺷﻨﺎﻳﻲ ﻳﮏ ﭘﻴﮑﺴﻞ ﺩﺭ ﺍﺛﺮ ﺟﺎﺳﺎﺯﻱ ﻳﮏ ﺑﻴﺖ ﺩﺍﺩﻩ ﺩﺭ ﺭﻭﺵ )ﺍﻟﻒ( ‪) LSB-M‬ﺏ( ‪LSB-F‬‬
‫‪hi -1‬‬ ‫ﻣﻘﺪﺍﺭ ﻧﻬﺎﻳﻲ ‪ hi¢‬ﺣﺎﺻﻞ ﺳﻪ ﻣﻮﺭﺩ ﺯﻳﺮ ﺍﺳﺖ‪:‬‬
‫ﺩﻭﺟﻤﻠﻪﺍﻱ ﻣﺮﺑﻮﻃﻪ ﺭﺍ ﺗﻌﺮﻳﻒ ﮐﺮﺩ‪ M +1 = å S+1 .‬ﻳﮏ‬
‫‪j =1‬‬
‫· ﺗﻌﺪﺍﺩ ﭘﻴﮑﺴﻞﻫﺎﻳﻲ ﺑﺎ ﺭﻭﺷﻨﺎﻳﻲ ‪ i - 1‬ﮐﻪ ﻧﻮﻳﺰﻱ ﺑﺎ ﻣﻘﺪﺍﺭ ‪+ 1‬‬
‫ﻣﺘﻐﻴﺮ ﺩﻭﺟﻤﻠﻪﺍﻱ ﺑﺎ ﭘﺎﺭﺍﻣﺘﺮﻫﺎﻱ ‪ n = hi -1‬ﻭ ‪ p = 1 4‬ﺍﺳﺖ‪.‬‬
‫ﺑﻪ ﺁﻥﻫﺎ ﺍﺿﺎﻓﻪ ﺷﺪﻩ ﺍﺳﺖ‪.‬‬
‫‪hi‬‬
‫‪ M 0 = å S0‬ﻧﻴﺰ ﻳﮏ ﻣﺘﻐﻴﺮ ﺩﻭﺟﻤﻠﻪﺍﻱ ﺑﺎ ﭘﺎﺭﺍﻣﺘﺮﻫﺎﻱ ‪n = hi‬‬ ‫· ﺗﻌﺪﺍﺩ ﭘﻴﮑﺴﻞﻫﺎﻳﻲ ﺑﺎ ﺭﻭﺷﻨﺎﻳﻲ ‪ i‬ﮐﻪ ﻣﻘﺪﺍﺭ ﺁﻥﻫﺎ ﺗﻐﻴﻴﺮﻱ‬
‫‪j =1‬‬
‫‪hi +1‬‬ ‫ﻧﮑﺮﺩﻩ ﺍﺳﺖ‪.‬‬
‫ﻭ ‪ p = 1 2‬ﺍﺳﺖ‪ .‬ﺑﻪ ﻫﻤﻴﻦ ﺗﺮﺗﻴﺐ ‪ M -1 = å S-1‬ﻳﮏ ﻣﺘﻐﻴﺮ‬
‫‪j =1‬‬ ‫· ﺗﻌﺪﺍﺩ ﭘﻴﮑﺴﻞﻫﺎﻳﻲ ﺑﺎ ﺭﻭﺷﻨﺎﻳﻲ ‪ i + 1‬ﮐﻪ ﻧﻮﻳﺰﻱ ﺑﺎ ﻣﻘﺪﺍﺭ ‪-1‬‬
‫ﺩﻭﺟﻤﻠﻪﺍﻱ ﺑﺎ ﭘﺎﺭﺍﻣﺘﺮﻫﺎﻱ ‪ n = hi +1‬ﻭ ‪ p = 1 4‬ﺍﺳﺖ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ‬ ‫ﺑﻪ ﺁﻥﻫﺎ ﺍﺿﺎﻓﻪ ﺷﺪﻩ ﺍﺳﺖ‪.‬‬
‫‪ H i¢‬ﻣﺠﻤﻮﻉ ﺳﻪ ﻣﺘﻐﻴﺮ ﺩﻭ ﺟﻤﻠﻪﺍﻱ ﺍﺳﺖ‪.‬‬ ‫ﻣﻲﺗﻮﺍﻥ ﻫﺮ ﮐﺪﺍﻡ ﺍﺯ ﻣﻮﺍﺭﺩ ﺑﺎﻻ ﺭﺍ ﺑﺎ ﻳﮏ ﺗﻮﺯﻳﻊ ﺑﺮﻧﻮﻟﻲ ﻣﺪﻝ‬
‫‪H i¢ = M +1 + M 0 + M -1‬‬ ‫ﮐﺮﺩ‪ .‬ﻣﻮﺭﺩ ﺍﻭﻝ ﻳﮏ ﺁﺯﻣﺎﻳﺶ ﺑﺮﻧﻮﻟﻲ ﺍﺳﺖ ﮐﻪ ‪ hi -1‬ﺑﺎﺭ ﺗﮑﺮﺍﺭ‬
‫ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺍﻳﻦ ﻧﮑﺘﻪ ﮐﻪ ﺩﺭ ﺻﻮﺭﺕ ﺑﺰﺭﮒ ﺑﻮﺩﻥ ﻣﻘﺪﺍﺭ ‪ ، n‬ﻣﻲ‪-‬‬ ‫ﻣﻲﺷﻮﺩ ﻭ ﺩﺭ ﻫﺮ ﺗﮑﺮﺍﺭ ﺍﺣﺘﻤﺎﻝ ﻣﻮﻓﻘﻴﺖ ﺁﻥ )ﺗﺒﺪﻳﻞ ‪ i - 1‬ﺑﻪ ‪( i‬‬
‫ﺗﻮﺍﻥ ﺗﻮﺯﻳﻊ ﺩﻭﺟﻤﻠﻪﺍﻱ ﺑﺎ ﭘﺎﺭﺍﻣﺘﺮﻫﺎﻱ )‪ (n, p‬ﺭﺍ ﺑﺎ ﻳﮏ ﺗﻮﺯﻳﻊ‬ ‫‪ 1 / 4‬ﻭ ﺍﺣﺘﻤﺎﻝ ﺷﮑﺴﺖ )ﻋﺪﻡ ﺗﺒﺪﻳﻞ ‪ i - 1‬ﺑﻪ ‪ 3 / 4 ( i‬ﺍﺳﺖ‪.‬‬
‫ﻧﺮﻣﺎﻝ ﺑﺎ ﭘﺎﺭﺍﻣﺘﺮﻫﺎﻱ ))‪ (np, np(1 - p‬ﺗﺨﻤﻴﻦ ﺯﺩ‪ ،‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﻣﺘﻐﻴﺮ‬ ‫ﻣﻮﺭﺩ ﺩﻭﻡ ﻧﻴﺰ ﻳﮏ ﺁﺯﻣﺎﻳﺶ ﺑﺮﻧﻮﻟﻲ ﺍﺳﺖ ﮐﻪ ‪ hi‬ﺑﺎﺭ ﺗﮑﺮﺍﺭ ﻣﻲ‪-‬‬
‫ﺗﺼﺎﺩﻓﻲ ‪ H i¢‬ﺭﺍ ﻣﻲﺗﻮﺍﻥ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﻧﻴﺰ ﺗﻌﺮﻳﻒ ﮐﺮﺩ‪:‬‬ ‫ﺷﻮﺩ ﻭ ﺩﺭ ﻫﺮ ﺗﮑﺮﺍﺭ ﺍﺣﺘﻤﺎﻝ ﻣﻮﻓﻘﻴﺖ ﺁﻥ )ﻋﺪﻡ ﺗﻐﻴﻴﺮ ‪ 1 / 2 ( i‬ﻭ‬
‫)‪H i¢ = N (hi -1 .1 4 , hi -1 . 3 16) + N (hi .1 2 , hi .1 4‬‬
‫ﺍﺣﺘﻤﺎﻝ ﺷﮑﺴﺖ )ﺗﻐﻴﻴﺮ ‪ ( i‬ﻧﻴﺰ ‪ 1 / 2‬ﺍﺳﺖ‪ .‬ﻣﻮﺭﺩ ﺳﻮﻡ ﻧﻴﺰ‬
‫)‪+ N (hi +1 .1 4 , hi +1 . 3 16‬‬
‫ﺗﻮﺯﻳﻌﻲ ﻣﺎﻧﻨﺪ ﻣﻮﺭﺩ ﺍﻭﻝ ﺩﺍﺭﺩ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﺩﺭ ﺻﻮﺭﺗﻲ ﮐﻪ ﺍﺯ ﺗﻤﺎﻡ‬
‫ﻣﻲﺩﺍﻧﻴﻢ ﮐﻪ ﺗﻮﺯﻳﻊ ﻣﺠﻤﻮﻉ ﭼﻨﺪ ﻣﺘﻐﻴﺮ ﺗﺼﺎﺩﻓﻲ ﻧﺮﻣﺎﻝ‪ ،‬ﻳﮏ‬
‫ﭘﻴﮑﺴﻞﻫﺎﻱ ﺗﺼﻮﻳﺮ ﺑﺮﺍﻱ ﺟﺎﺳﺎﺯﻱ ﺍﺳﺘﻔﺎﺩﻩ ﺷﻮﺩ‪ ،‬ﻣﻲﺗﻮﺍﻥ ﻣﺘﻐﻴﺮ‬
‫ﺗﻮﺯﻳﻊ ﻧﺮﻣﺎﻝ ﺑﺎ ﭘﺎﺭﺍﻣﺘﺮﻫﺎﻱ ﺯﻳﺮ ﺍﺳﺖ‪:‬‬
‫‪n‬‬ ‫‪n‬‬ ‫‪n‬‬ ‫ﺗﺼﺎﺩﻓﻲ ﺗﻮﺯﻳﻊ ﺗﻌﺪﺍﺩ ﭘﻴﮑﺴﻞﻫﺎﻱ ﺑﺎ ﻣﻘﺪﺍﺭ ‪ i‬ﭘﺲ ﺍﺯ ﺟﺎﺳﺎﺯﻱ‬
‫‪2‬‬ ‫‪2‬‬
‫) ‪å N (m i , s i ) = N ( å m i , å s i‬‬
‫‪i =1‬‬ ‫‪i =1‬‬ ‫‪i =1‬‬ ‫‪ ، H i¢ ،‬ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺑﻴﺎﻥ ﮐﺮﺩ‪:‬‬
‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺍﻳﻦ ﺭﺍﺑﻄﻪ‪ H i¢ ،‬ﺭﺍ ﻣﻲﺗﻮﺍﻥ ﺑﻪ ﺻﻮﺭﺕ ﻳﮏ‬ ‫‪hi -1‬‬ ‫‪hi‬‬ ‫‪hi +1‬‬
‫‪H i ¢ = å S+1 + å S0 + å S-1‬‬
‫ﻣﺘﻐﻴﺮ ﻧﺮﻣﺎﻝ ﺑﻴﺎﻥ ﮐﺮﺩ‪:‬‬ ‫‪j =1‬‬ ‫‪j =1‬‬ ‫‪j =1‬‬

‫) ‪(hi -1 + 2hi + hi +1‬‬ ‫ﺁﺯﻣﺎﻳﺶ ﺑﺮﻧﻮﻟﻲ ﺍﻭﻝ‪ ،‬ﺩﻭﻡ ﻭ ﺳﻮﻡ ﺑﻪ ﺗﺮﺗﻴﺐ ﺑﺎ ﻧﻤﺎﺩﻫﺎﻱ ‪S+1‬‬
‫= ‪H i¢ = N (m i‬‬ ‫‪,‬‬
‫‪4‬‬ ‫)ﺍﺿﺎﻓﻪ ﺷﺪﻥ ﻧﻮﻳﺰﻱ ﺑﺎ ﻣﻘﺪﺍﺭ ‪) S0 ،(+ 1‬ﺍﺿﺎﻓﻪ ﺷﺪﻥ ﻧﻮﻳﺰﻱ‬
‫) ‪(3hi -1 + 4hi + 3hi +1‬‬
‫= ‪s i2‬‬ ‫)‬ ‫ﺑﺎ ﻣﻘﺪﺍﺭ ‪ (0‬ﻭ ‪) S-1‬ﺍﺿﺎﻓﻪ ﺷﺪﻥ ﻧﻮﻳﺰﻱ ﺑﺎ ﻣﻘﺪﺍﺭ ‪ (-1‬ﻧﻤﺎﻳﺶ‬
‫‪16‬‬
‫ﺍﻟﺒﺘﻪ ﺩﺭ ﺍﻳﻦ ﺭﺍﺑﻄﻪ ﺑﺮﺍﻱ ‪ i‬ﻫﺎﻱ ﻣﻮﺟﻮﺩ ﺩﺭ ﻣﺮﺯ ﺍﺳﺘﺜﻨﺎﺋﺎﺗﻲ ﻧﻴﺰ‬ ‫ﺩﺍﺩﻩ ﺷﺪﻩﺍﻧﺪ‪ .‬ﺍﮔﺮ ‪ n‬ﺁﺯﻣﺎﻳﺶ ﺑﺮﻧﻮﻟﻲ ﻣﺴﺘﻘﻞ‪ ،‬ﻫﻤﮕﻲ ﺑﺎ ﺍﺣﺘﻤﺎﻝ‬
‫ﺑﺎﻳﺪ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺘﻪ ﺷﻮﺩ‪ h-1 .‬ﻭ ‪ h256‬ﺭﺍ ﺻﻔﺮ ﻓﺮﺽ ﻣﻲﮐﻨﻴﻢ‬ ‫ﻣﻮﻓﻘﻴﺖ ‪ p‬ﺍﻧﺠﺎﻡ ﺷﻮﻧﺪ‪ ،‬ﺁﻧﮕﺎﻩ ﻣﺘﻐﻴﺮ ﺗﺼﺎﺩﻓﻲ ‪ X‬ﮐﻪ ﺗﻌﺪﺍﺩ‬
‫ﻭ ﺑﺮﺍﻱ ‪ ١‬ﻭ ‪ ٢٥٤‬ﭘﺎﺭﺍﻣﺘﺮﻫﺎﻱ ﺗﻮﺯﻳﻊ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺍﺳﺖ‪:‬‬ ‫ﻣﻮﻓﻘﻴﺖﻫﺎ ﺭﺍ ﻧﺸﺎﻥ ﻣﻲﺩﻫﺪ‪ ،‬ﻣﺘﻐﻴﺮﻱ ﺩﻭﺟﻤﻠﻪﺍﻱ ﺑﺎ ﭘﺎﺭﺍﻣﺘﺮﻫﺎﻱ‬
‫) ‪(2h0 + 2h1 + h2‬‬ ‫‪ n‬ﻭ ‪ p‬ﺍﺳﺖ‪ .‬ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﻣﺴﺘﻘﻞ ﺑﻮﺩﻥ ﺗﮑﺮﺍﺭﻫﺎﻱ ﻣﺨﺘﻠﻒ‬
‫‪٢٥٣‬‬ ‫= ‪H 1¢ = N ( m1‬‬ ‫‪,‬‬
‫‪4‬‬
‫) ‪(4h0 + 4h1 + 3h2‬‬ ‫ﺁﺯﻣﺎﻳﺶﻫﺎﻱ ﺑﺮﻧﻮﻟﻲ ﺗﻌﺮﻳﻒ ﺷﺪﻩ ﺩﺭ ﺑﺎﻻ‪ ،‬ﻣﻲﺗﻮﺍﻥ ﻣﺘﻐﻴﺮﻫﺎﻱ‬
‫‪s 12‬‬ ‫=‬ ‫)‬
‫‪16‬‬
‫‪www.SID.ir‬‬
‫‪Archvie of SID‬‬

‫ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﻣﺪﻝ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺑﺮﺍﻱ ﺭﻭﺵ ‪ LSB-M‬ﻣﻲﺗﻮﺍﻥ‬ ‫= ‪¢ = N ( m 254‬‬

‫‪H 254‬‬
‫) ‪(h253 + 2h254 + 2h255‬‬
‫‪,‬‬
‫‪4‬‬
‫ﺗﺨﻤﻴﻨﻲ ﺍﺯ ﺧﻄﺎﻱ ﺍﻳﻦ ﺭﻭﺵ ﺭﺍ ﻧﻴﺰ ﻗﺒﻞ ﺍﺯ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺁﻥ‬
‫‪2‬‬ ‫) ‪(3h253 + 4h254 + 4h255‬‬
‫‪s 254‬‬ ‫=‬ ‫)‬
‫ﻣﺤﺎﺳﺒﻪ ﮐﺮﺩ‪ .‬ﺍﻣﻴﺪ ﺭﻳﺎﺿﻲ ﺭﺍﻫﻲ ﻣﻨﺎﺳﺐ ﺑﺮﺍﻱ ﻣﺤﺎﺳﺒﻪ ﻣﻘﺪﺍﺭ‬ ‫‪16‬‬
‫ﺑﺎ ﺩﺭ ﺩﺳﺖ ﺩﺍﺷﺘﻦ ﻣﺪﻟﻲ ﮐﻪ ﺗﺎ ﺍﻳﻨﺠﺎ ﺑﺮﺍﻱ ﺭﻭﺵ ‪LSB-M‬‬
‫ﻣﻮﺭﺩﺍﻧﺘﻈﺎﺭ ﻳﮏ ﻣﺘﻐﻴﺮ ﺗﺼﺎﺩﻓﻲ ﺍﺳﺖ‪ .‬ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺗﻌﺮﻳﻒ ﺧﻄﺎ ﻭ‬
‫ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻗﻮﺍﻋﺪ ﺁﻣﺎﺭﻱ‪ ،‬ﺍﻣﻴﺪ ﺭﻳﺎﺿﻲ ﺧﻄﺎ ﺭﺍ ﻣﻲ ﺗﻮﺍﻥ ﺑﺪﻳﻦ‬ ‫ﭘﻴﺸﻨﻬﺎﺩ ﮐﺮﺩﻳﻢ‪ ،‬ﻣﻲﺗﻮﺍﻥ ﺭﻓﺘﺎﺭ ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ LSB-F‬ﺭﺍ ﻧﻴﺰ ﻣﺪﻝ‬

‫ﺗﺮﺗﻴﺐ ﻣﺤﺎﺳﺒﻪ ﮐﺮﺩ‪:‬‬ ‫ﻧﻤﻮﺩ‪ ،‬ﺯﻳﺮﺍ ‪ LSB-F‬ﺣﺎﻟﺘﻲ ﺧﺎﺹ ﺍﺯ ﺍﻟﮕﻮﺭﻳﺘﻢ ﻋﺎﻡ ‪ LSB-M‬ﻣﻲ‪-‬‬
‫‪255‬‬ ‫‪255‬‬ ‫ﺑﺎﺷﺪ‪.‬‬
‫] ‪E ( Error ) = E[ å (hi - H i¢ ) 2 ] = å E[(hi - H i¢ ) 2‬‬
‫‪i =0‬‬ ‫‪i =0‬‬ ‫)‪H 2¢ i = Bino(ni = h2i + h2i +1 , p = 1 2‬‬
‫ﭘﺲ ﮐﺎﻓﻲ ﺍﺳﺖ ﺑﺘﻮﺍﻥ ﺍﻣﻴﺪ ﺭﻳﺎﺿﻲ ﻣﺮﺑﻊ ﺗﻔﺎﻭﺕ ﺩﻭ ﺳﺘﻮﻥ‬
‫‪H 2¢ i +1 = ni - H 2i‬‬
‫ﻣﻌﺎﺩﻝ ﺍﺯ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﻭ ﺍﺳﺘﮕﻮ ﺭﺍ ﻣﺤﺎﺳﺒﻪ ﮐﺮﺩ‪.‬‬ ‫ﺑﻌﻼﻭﻩ ﻣﻲﺗﻮﺍﻥ ﻧﺸﺎﻥ ﺩﺍﺩ ﮐﻪ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺗﻮﺯﻳﻊ ﻧﺮﻣﺎﻝ ﻧﻴﺰ‬
‫ﻣﻲﺩﺍﻧﻴﻢ‪:‬‬ ‫ﻣﻘﺪﺍﺭ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺑﻌﺪ ﺍﺯ ﺟﺎﺳﺎﺯﻱ ﺑﻪ ﺭﻭﺵ ‪ LSB-F‬ﺩﺍﺭﺍﻱ‬
‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬
‫] ‪E[(hi - H i¢ ) ] = E[hi ] + E[ H i¢ ] - 2 E[hi H i¢‬‬ ‫ﺗﻮﺯﻳﻊ ﺯﻳﺮ ﺧﻮﺍﻫﺪ ﺑﻮﺩ]‪:[١٤‬‬
‫ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺍﻳﻦ ﮐﻪ ‪ ، hi‬ﻣﻘﺪﺍﺭ ﺳﺘﻮﻥ ‪ i‬ﺩﺭ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ‬
‫)‪H 2¢ i = H 2¢ i +1 = N (m i = ni 2 , s i2 = ni 4‬‬
‫ﭘﻮﺷﺎﻧﻪ ﺍﺳﺖ ﻭ ﻣﻘﺪﺍﺭ ﺁﻥ ﻣﺸﺨﺺ ﺍﺳﺖ‪ ،‬ﺑﻨﺎﺑﺮﺍﻳﻦ ‪ hi‬ﺑﻪ‬
‫ﺻﻮﺭﺕ ﻳﮏ ﺛﺎﺑﺖ ﻓﺮﺽ ﻣﻲﺷﻮﺩ ﻭ ‪:‬‬ ‫‪ -۴‬ﺗﺨﻤﻴﻦ ﺗﻐﻴﻴﺮﺍﺕ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ‪ LSB-F‬ﻭ‪LSB-M‬‬
‫] ‪E[(hi - H i¢ ) 2 ] = hi 2 + E[ H i¢2 ] - 2hi E[ H i¢‬‬ ‫ﻳﮑﻲ ﺍﺯ ﻣﻌﻴﺎﺭﻫﺎﻱ ﻣﻘﺎﻳﺴﻪ ﺭﻭﺵﻫﺎﻱ ﻣﺨﺘﻠﻒ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ‪،‬‬
‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﺗﻨﻬﺎ ﻣﺴﺌﻠﻪ ﺑﺎﻗﻲ ﻣﺎﻧﺪﻩ ﻣﺤﺎﺳﺒﻪ ] ‪ E[ H i¢‬ﻭ ] ‪E[ H i¢‬‬
‫‪2‬‬
‫ﺑﺮﺭﺳﻲ ﺗﺄﺛﻴﺮ ﻫﺮ ﮐﺪﺍﻡ ﺍﺯ ﺭﻭﺵﻫﺎ ﺭﻭﻱ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ‬
‫ﺍﺳﺖ‪ .‬ﻧﺸﺎﻥ ﺩﺍﺩﻩ ﺷﺪ ﮐﻪ ‪ H i¢‬ﺩﺭ ﺟﺎﺳﺎﺯﻱ ﺑﻪ ﺭﻭﺵ ‪LSB-M‬‬ ‫ﭘﻮﺷﺎﻧﻪ ﺍﺳﺖ‪ .‬ﺭﻭﺷﻲ ﮐﻪ ﮐﻤﺘﺮﻳﻦ ﺗﻐﻴﻴﺮ ﺭﺍ ﺭﻭﻱ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ‬
‫ﺣﺎﺻﻞ ﻣﺠﻤﻮﻉ ﺳﻪ ﻣﺘﻐﻴﺮ ﺗﺼﺎﺩﻓﻲ ﺩﻭﺟﻤﻠﻪﺍﻱ ﺍﺳﺖ‪ .‬ﺑﺮﺍﻱ ﻫﺮ‬ ‫ﺍﻳﺠﺎﺩ ﮐﻨﺪ‪ ،‬ﺩﺭ ﺑﺮﺍﺑﺮ ﺣﻤﻼﺗﻲ ﻣﻘﺎﻭﻣﺘﺮ ﻫﺴﺘﻨﺪ ﮐﻪ ﺑﺮ ﻣﺒﻨﺎﻱ ﺗﻐﻴﻴﺮ‬
‫ﻣﺘﻐﻴﺮ ﺗﺼﺎﺩﻓﻲ ‪ X‬ﻣﻲﺩﺍﻧﻴﻢ ﮐﻪ‪:‬‬ ‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﮐﺎﺭ ﻣﻲﮐﻨﻨﺪ‪ .‬ﺑﺮﺍﻱ ﺑﻴﺎﻥ ﻋﺪﺩﻱ ﺍﺯ ﺗﺄﺛﻴﺮ ﻫﺮ ﺭﻭﺵ‬
‫) ‪Mgf X (t ) = E (e‬‬ ‫‪tx‬‬
‫‪,‬‬ ‫= ] ‪E[ X‬‬ ‫‪n‬‬
‫)‪M (Xn) (0‬‬ ‫ﺭﻭﻱ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﻣﻲﺗﻮﺍﻥ ﻣﻌﻴﺎﺭﻱ ﺑﺎ ﻋﻨﻮﺍﻥ ﺧﻄﺎ ﺗﻌﺮﻳﻒ ﮐﺮﺩ‪.‬‬
‫ﺍﮔﺮ ‪ X‬ﻳﮏ ﻣﺘﻐﻴﺮ ﺗﺼﺎﺩﻓﻲ ﺩﻭﺟﻤﻠﻪﺍﻱ ﺑﺎﺷﺪ‪:‬‬ ‫ﺧﻄﺎ ﺭﺍ ﻣﺠﻤﻮﻉ ﻣﺮﺑﻌﺎﺕ ﺗﻔﺎﺿﻞ ﺳﺘﻮﻥﻫﺎﻱ ﻣﻌﺎﺩﻝ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ‬
‫‪Mgf X (t ) = ( pe t + q ) n‬‬ ‫ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﻭ ﺗﺼﻮﻳﺮ ﺍﺳﺘﮕﻮ ﺗﻌﺮﻳﻒ ﻣﻲﮐﻨﻴﻢ‪:‬‬
‫‪E[ X ] = np‬‬ ‫‪,‬‬ ‫‪2‬‬
‫‪E[ X ] = np + n(n - 1) p‬‬ ‫‪2‬‬ ‫‪255‬‬
‫‪Error = å (hi - hi¢ ) 2‬‬
‫ﺩﻭﺟﻤﻠﻪﺍﻱ‬ ‫ﺗﺼﺎﺩﻓﻲ‬ ‫ﻣﺘﻐﻴﺮ‬ ‫ﺳﻪ‬ ‫ﻣﻮﺭﺩ‬ ‫ﺩﺭ‬ ‫ﺑﻨﺎﺑﺮﺍﻳﻦ‬ ‫‪i =0‬‬
‫‪ hi‬ﻭ ‪ ، hi¢‬ﻣﻘﺪﺍﺭ ﺳﺘﻮﻥ ‪ i‬ﺩﺭ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﻭ‬
‫‪ M -1 , M 0 , M +1‬ﻣﻲﻭﺍﻥ ﮔﻔﺖ‪:‬‬
‫ﺗﺼﻮﻳﺮ ﺍﺳﺘﮕﻮ ﺍﺳﺖ‪ .‬ﺧﻄﺎﻱ ﮐﻤﺘﺮ ﺑﻪ ﻣﻌﻨﺎﻱ ﺗﻐﻴﻴﺮ ﮐﻤﺘﺮ ﺩﺭ‬
‫‪Mgf M +1 (t ) = (1 4 e t + 3 4) hi -1‬‬ ‫‪,‬‬ ‫‪E[ M +1 ] = hi -1 4‬‬
‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﺑﺮﺍﻱ ﺑﺪﺳﺖ ﺁﻭﺭﺩﻥ ﺗﺼﻮﻳﺮ ﻣﻴﺰﺑﺎﻥ‬
‫‪Mgf M 0 (t ) = (1 2 e t + 1 2) hi‬‬ ‫‪,‬‬ ‫‪E[ M 0 ] = hi 2‬‬
‫ﻧﻬﺎﻳﻲ ﺍﺳﺖ‪ .‬ﻣﻘﺪﺍﺭ ﺧﻄﺎ‪ ،‬ﻋﻼﻭﻩ ﺑﺮ ﻧﻮﻉ ﺭﻭﺵ ﭘﻨﻬﺎﻥ ﻧﮕﺎﺭﻱ ﺑﻪ‬
‫‪Mgf M -1 (t ) = (1 4 e t + 3 4) hi +1‬‬ ‫‪,‬‬ ‫‪E[ M -1 ] = hi +1 4‬‬
‫ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﻧﻴﺰ ﺑﺴﺘﮕﻲ ﺩﺍﺭﺩ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﺍﮔﺮ ﺑﺘﻮﺍﻥ ﻗﺒﻞ ﺍﺯ‬
‫ﺑﻌﻼﻭﻩ ﻣﻲﺩﺍﻧﻴﻢ‪:‬‬
‫= ) ‪Mgf H i¢ (t ) = Mgf M +1 + M 0 + M -1 (t‬‬ ‫ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻳﮏ ﺭﻭﺵ ﭘﻨﻬﺎﻥ ﻧﮕﺎﺭﻱ ﺧﺎﺹ‪ ،‬ﻣﻘﺪﺍﺭ ﺧﻄﺎﻱ ﺭﻭﺵ‬
‫) ‪Mgf M +1 (t ).Mgf M 0 (t ).Mgf M -1 (t‬‬ ‫ﺍﻧﺘﺨﺎﺏ ﺷﺪﻩ ﺑﺮﺍﻱ ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﻣﻮﺭﺩ ﻧﻈﺮ ﺭﺍ ﺗﺨﻤﻴﻦ ﺯﺩ‪،‬‬
‫ﺑﺎ ﺟﺎﮔﺬﺍﺭﻱ ﻣﻘﺎﺩﻳﺮ ﻣﻨﺎﺳﺐ ﺩﺭ ﺍﻳﻦ ﻓﺮﻣﻮﻝ ﻭ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻓﺮﻣﻮﻝ‪-‬‬ ‫ﺁﻧﮕﺎﻩ ﺑﻬﺘﺮ ﻣﻲ ﺗﻮﺍﻥ ﺩﺭ ﻣﻮﺭﺩ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺁﻥ ﺭﻭﺵ ﺗﺼﻤﻴﻢ‬
‫ﻫﺎﻱ ﻗﺒﻠﻲ‪ ،‬ﺍﻣﻴﺪﻫﺎﻱ ﻣﻮﺭﺩﻧﻈﺮ ﺑﺪﻳﻦ ﺻﻮﺭﺕ ﻣﺤﺎﺳﺒﻪ ﻣﻲﺷﻮﻧﺪ‪:‬‬ ‫ﮔﺮﻓﺖ‪.‬‬ ‫‪٢٥٤‬‬

‫‪E[ H i¢ ] = hi -1 4 + hi 2 + hi +1 4‬‬
‫‪www.SID.ir‬‬
 ‫‪Archvie of SID‬‬

‫‪ -۵‬ﻣﻘﺎﻳﺴﻪ ﻧﺘﺎﻳﺞ ﺣﺎﺻﻞ ﺍﺯ ﺗﺌﻮﺭﻱ ﻭ ﺷﺒﻴﻪﺳﺎﺯﻱ‬ ‫))‪(hi -1 .(hi -1 - 1) + 4.hi .(hi - 1) + hi +1 (hi +1 - 1‬‬
‫= ] ‪E[ H i¢ 2‬‬
‫‪16‬‬
‫ﺑﺮﺍﻱ ﺗﺴﺖ ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺍﺭﺍﺋﻪ ﺷﺪﻩ‪ ،‬ﺩﺭ ‪ ٢٠٠‬ﺗﺼﻮﻳﺮ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ‬ ‫) ‪(2.hi -1 .hi + hi -1 .hi +1 + 2.hi .hi +1 ) (hi -1 + 2.hi + hi +1‬‬
‫‪+‬‬ ‫‪+‬‬
‫ﺍﺯ ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ LSB-F‬ﻭ ‪ LSB-M‬ﺟﺎﺳﺎﺯﻱ ﮐﺮﺩﻩ ﻭ ﻣﻴﺰﺍﻥ ﺧﻄﺎﻱ‬ ‫‪8‬‬ ‫‪4‬‬
‫ﺍﻧﺘﻈﺎﺭ ﺩﺍﺭﻳﻢ ﮐﻪ ﻣﻘﺪﺍﺭ ﻧﻬﺎﻳﻲ ‪ H i¢‬ﺩﺭ ﻭﺍﻗﻊ ﻣﺠﻤﻮﻉ ﻧﻴﻤﻲ ﺍﺯ‬
‫ﺣﺎﺻﻞ ﺍﺯ ﺷﺒﻴﻪ ﺳﺎﺯﻱ ﻭ ﺧﻄﺎﻱ ﺣﺎﺻﻞ ﺍﺯ ﻣﺤﺎﺳﺒﺎﺕ ﺭﻳﺎﺿﻲ ﺭﺍ‬
‫ﻣﻘﺪﺍﺭ ﺍﺑﺘﺪﺍﻳﻲ ‪ hi‬ﻭ ‪ 1 4‬ﺍﺯ ﻣﻘﺪﺍﺭ ﺍﺑﺘﺪﺍﻳﻲ ‪ hi -1‬ﻭ ‪ 1 4‬ﺍﺯ‬
‫ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻫﺮ ﺩﻭ ﺭﻭﺵ ﺗﻮﺯﻳﻊ ﺩﻭﺟﻤﻠﻪ ﺍﻱ ﻭ ﺗﻮﺯﻳﻊ ﻧﺮﻣﺎﻝ‬
‫ﻣﻘﺪﺍﺭ ﺍﺑﺘﺪﺍﻳﻲ ‪ hi +1‬ﺑﺎﺷﺪ‪ .‬ﻣﺸﺎﻫﺪﻩ ﻣﻲﺷﻮﺩ ﮐﻪ ﻣﻘﺪﺍﺭ ﺍﻣﻴﺪ ‪H i¢‬‬
‫ﻣﺤﺎﺳﺒﻪ ﮐﺮﺩﻳﻢ‪ .‬ﻧﺘﺎﻳﺞ ﺗﺨﻤﻴﻦ ﺧﻄﺎ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻫﺮ ﺩﻭ ﺗﻮﺯﻳﻊ‬
‫ﺑﺎ ﻣﻘﺪﺍﺭﻱ ﮐﻪ ﺑﻪ ﺭﻭﺵ ﺗﺤﻠﻴﻠﻲ ﺍﻧﺘﻈﺎﺭ ﺩﺍﺷﺘﻴﻢ ﻣﺴﺎﻭﻱ ﺷﺪﻩ‬
‫ﮐﺎﻣﻼﹰ ﻳﮑﺴﺎﻥ ﺍﺳﺖ‪ .‬ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺩﺭﺻﺪ ﺍﺧﺘﻼﻑ ﻣﻘﺪﺍﺭ ﻭﺍﻗﻌﻲ ﻭ‬
‫ﺍﺳﺖ‪ .‬ﺍﻳﻦ ﺗﺴﺎﻭﻱ ﻣﻲﺗﻮﺍﻧﺪ ﺗﻀﻤﻴﻨﻲ ﺑﺮﺍﻱ ﻣﺪﻝ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺑﺎﺷﺪ‪.‬‬
‫ﻣﻘﺪﺍﺭ ﺣﺎﺻﻞ ﺍﺯ ﺗﺨﻤﻴﻦ ﺭﻳﺎﺿﻲ ﺧﻄﺎ ﺩﺭ ﺷﮑﻞ ‪ ٤‬ﻭ‪ ٥‬ﻧﺸﺎﻥ ﺩﺍﺩﻩ‬
‫ﺍﻟﺒﺘﻪ ﺩﺭ ﺭﻭﺍﺑﻂ ﺑﺎﻻ ﺑﺮﺍﻱ ‪ i‬ﻫﺎﻱ ﻣﻮﺟﻮﺩ ﺩﺭ ﻣﺮﺯ ﺍﺳﺘﺜﻨﺎﺋﺎﺗﻲ ﻧﻴﺰ‬
‫ﺷﺪﻩ ﺍﺳﺖ‪.‬‬
‫ﺑﺎﻳﺪ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺘﻪ ﺷﻮﺩ‪ .‬ﺑﺎ ﺣﻞ ﺷﺪﻥ ﻣﺴﺌﻠﻪ ﻣﺤﺎﺳﺒﻪ ] ‪ E[ H i¢‬ﻭ‬
‫ﺍﻳﻦ ﺷﮑﻞ ﺩﻗﺖ ﺑﺎﻻﻱ ﺗﺨﻤﻴﻦ ﺣﺎﺻﻞ ﺍﺯ ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺍﺭﺍﺋﻪ ﺷﺪﻩ‬ ‫] ‪ ، E[ H i¢2‬ﺣﺎﻝ ﻣﻲﺗﻮﺍﻥ ﻣﺤﺎﺳﺒﻪ ﺍﻣﻴﺪ ﺧﻄﺎ ﺭﺍ ﻧﻴﺰ ﺗﮑﻤﻴﻞ ﮐﺮﺩ‪.‬‬
‫ﺭﺍ ﻧﺸﺎﻥ ﻣﻲﺩﻫﺪ‪ .‬ﻫﻤﺎﻧﮕﻮﻧﻪ ﮐﻪ ﺩﻳﺪﻩ ﻣﻲﺷﻮﺩ ﺩﺭ ﺍﮐﺜﺮ ﺗﺼﺎﻭﻳﺮ‪،‬‬ ‫ﺍﺯ ﻃﺮﻑ ﺩﻳﮕﺮ‪ ،‬ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺍﻳﻦ ﮐﻪ ‪ H i¢‬ﺭﺍ ﺑﺎ ﻳﮏ ﻣﺘﻐﻴﺮ ﺗﺼﺎﺩﻓﻲ‬
‫ﻧﺘﺎﻳﺞ ﺷﺒﻴﻪ ﺳﺎﺯﻱ ﻭ ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﮐﺎﻣﻼﹰ ﻣﺸﺎﺑﻪ ﺑﻮﺩﻩ‬ ‫ﻧﺮﻣﺎﻝ ﻧﻴﺰ ﻣﺪﻝ ﮐﺮﺩﻳﻢ ﻭ ﻣﻲﺩﺍﻧﻴﻢ‪:‬‬
‫ﺍﺳﺖ ﻭ ﺍﺧﺘﻼﻑ ﺧﻄﺎﻫﺎﻱ ﺗﻮﻟﻴﺪ ﺷﺪﻩ ﺑﺮﺍﺑﺮ ﺑﺎ ﺻﻔﺮ ﻣﻲﺑﺎﺷﺪ‪.‬‬ ‫‪E[ H i¢ ] = m i‬‬ ‫‪,‬‬ ‫‪E[ H i¢ 2 ] = m i2 + s i2‬‬
‫ﺑﻌﻼﻭﻩ ﻣﻘﺎﻳﺴﻪ ﺩﻭ ﻧﻤﻮﺩﺍﺭ ﻧﺸﺎﻥ ﻣﻲﺩﻫﺪ ﮐﻪ ﺗﺨﻤﻴﻦ ﺗﻐﻴﻴﺮﺍﺕ‬ ‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﺑﺎ ﺣﻞ ﺷﺪﻥ ﻣﺴﺌﻠﻪ ﻣﺤﺎﺳﺒﻪ ] ‪ E[ H i¢‬ﻭ ] ‪ ، E[ H i¢2‬ﺣﺎﻝ‬
‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺩﺭ ﺭﻭﺵ ‪ LSB-F‬ﺩﻗﻴﻖﺗﺮ ﺍﺯ ﺭﻭﺵ ‪ LSB-M‬ﺍﻧﺠﺎﻡ‬ ‫ﻣﻲﺗﻮﺍﻥ ﻣﺤﺎﺳﺒﻪ ﺍﻣﻴﺪ ﺧﻄﺎ ﺭﺍ ﻧﻴﺰ ﺗﮑﻤﻴﻞ ﮐﺮﺩ‪.‬‬
‫ﺷﺪﻩ ﺍﺳﺖ‪.‬‬ ‫‪255‬‬
‫)] ‪E ( Error ) = å (hi2 + E[ H i¢ 2 ] - 2hi E[ H i‬‬
‫‪i =0‬‬
‫‪255‬‬
‫) ‪= å (hi2 + m i2 + s i2 - 2hi m i‬‬
‫‪i =0‬‬
‫ﺗﻌﺪﺍﺩ‬
‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺗﻮﺯﻳﻊ ﻧﺮﻣﺎﻝ ﻧﻴﺰ ﻣﻲﺗﻮﺍﻧﻴﻢ ﺗﺨﻤﻴﻨﻲ ﺍﺯ‬
‫ﺗﺼﺎﻭﻳﺮ‬
‫ﺧﻄﺎﻱ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺩﺭ ﺭﻭﺵ ‪ LSB-M‬ﻣﺤﺎﺳﺒﻪ ﮐﻨﻴﻢ‪.‬‬
‫ﻣﺸﺎﺑﻪ ﻣﺤﺎﺳﺒﺎﺕ ﺑﺎﻻ ﺭﺍ ﻣﻲﺗﻮﺍﻥ ﺑﺮﺍﻱ ﺗﺨﻤﻴﻦ ﺗﻐﻴﻴﺮﺍﺕ‬
‫ﺩﺭﺻﺪ ﺧﻄﺎ‬ ‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺩﺭ ﺭﻭﺵ ‪ LSB-F‬ﻧﻴﺰ ﺗﮑﺮﺍﺭ ﮐﺮﺩ‪ .‬ﺑﺮﺍﻱ ﺍﺟﺘﻨﺎﺏ ﺍﺯ‬
‫‪LSB-F‬‬ ‫ﺷﮑﻞ‪ :۴‬ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺩﺭﺻﺪ ﺍﺧﺘﻼﻑ ﺷﺒﻴﻪﺳﺎﺯﻱ ﻭ ﻣﺪﻝ ﺩﺭ‬ ‫ﻃﻮﻻﻧﻲ ﺷﺪﻥ ﺑﺤﺚ‪ ،‬ﺗﻨﻬﺎ ﺑﻪ ﻧﺘﺎﻳﺠﻤﺪﻝ ﺭﻳﺎﺿﻲ ﺍﺷﺎﺭﻩ ﻣﻲﮐﻨﻴﻢ‪.‬‬
‫ﺩﺭ ﺻﻮﺭﺕ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺗﻮﺯﻳﻊ ﺩﻭﺟﻤﻠﻪﺍﻱ ﻭ ﺑﺎ ﺩﺭ ﻧﻈﺮﮔﺮﻓﺘﻦ‬
‫ﺭﺍﺑﻄﻪ ‪ ، ni = h2i + h2i +1‬ﺭﻭﺍﺑﻂ ﺯﻳﺮ ﺑﺮﺍﻱ ] ‪ E[ H i¢‬ﻭ ] ‪E[ H i¢2‬‬
‫ﺗﻌﺪﺍﺩ‬ ‫ﺑﺮﻗﺮﺍﺭ ﺍﺳﺖ‪:‬‬
‫ﺗﺼﺎﻭﻳﺮ‬
‫‪E[ H 2¢ i ] = E[ H 2¢ i +1 ] = n 2‬‬
‫‪E[ H 2¢ i 2 ] = E[ H 2¢ i +1 2 ] = n 2 + n(n - 1) 4‬‬
‫ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺗﻮﺯﻳﻊ ﻧﺮﻣﺎﻝ‪ ،‬ﻓﺮﻣﻮﻝ ﻣﺤﺎﺳﺒﻪ ] ‪ E[ H i¢‬ﻭ‬
‫ﺩﺭﺻﺪ ﺧﻄﺎ‬
‫] ‪ E[ H i¢2‬ﺩﺭ ﺭﻭﺵ ‪ LSB-F‬ﻧﻴﺰ ﻣﺸﺎﺑﻪ ﻓﺮﻣﻮﻝ ﻣﺤﺎﺳﺒﺎﺕ ﺗﻮﺯﻳﻊ‬
‫ﺩﺭ ‪LSB-M‬‬ ‫ﺷﮑﻞ ‪ :۵‬ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺩﺭﺻﺪ ﺍﺧﺘﻼﻑ ﺷﺒﻴﻪﺳﺎﺯﻱ ﻭ ﻣﺪﻝ‬
‫ﻧﺮﻣﺎﻝ ﺩﺭ ﺭﻭﺵ ‪ LSB-M‬ﺍﺳﺖ‪ .‬ﻓﻘﻂ ﺗﻔﺎﻭﺕ ﺩﺭ ﻣﻘﺪﺍﺭ ‪ m i‬ﻭ‬
‫‪ -۶‬ﻧﺘﻴﺠﻪ ﮔﻴﺮﻱ‬ ‫‪ s i‬ﺍﺳﺖ‪ ،‬ﮐﻪ ﺑﺮﺍﻱ ﻫﺮ ﺩﻭ ﺭﻭﺵ ﺩﺭ ﺑﺨﺶ ﻗﺒﻞ ﻣﺤﺎﺳﺒﻪ ﮐﺮﺩﻳﻢ‪.‬‬
‫‪٢٥٥‬‬
‫ﺑﺮﺭﺳﻲ ﺭﻓﺘﺎﺭ ﺍﻟﮕﻮﺭﻳﺘﻢﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺑﻪ ﺷﻨﺎﺳﺎﻳﻲ ﻫﺮ ﭼﻪ‬
‫ﺑﻬﺘﺮ ﻣﺰﺍﻳﺎ ﻭ ﻣﻌﺎﻳﺐ ﺭﻭﺵﻫﺎ‪ ،‬ﺍﺭﺍﺋﻪ ﺣﻤﻼﺕ ﻣﻮﻓﻖ ﻭ ﺑﻌﻼﻭﻩ‬
‫‪www.SID.ir‬‬
Archvie of SID
[11] A. D. Ker, “Steganalysis of LSB Matching in
Grayscale Images”, IEEE Signal Processing
Letters, Vol. 12, No. 6, June 2005.
[12] A. Westfeld, "Detecting low embedding rates," in
Proc. Inf. Hiding Workshop, Springer LNCS, vol.
2578, 2002.
[13] J. Fridrich, , M. Goljan, and R. Du, “Reliable
Detection of LSB Steganography in Grayscale and
Color Images”, Proc. of ACM: Special Session on
Multimedia Security and Watermarking, pp. 27-
30, Ottawa, Canada, 2001.
‫ "ﺭﻭﺷﻲ ﺟﺪﻳﺪ‬، .‫ ﻑ‬،‫ ﻣﻨﺼﻮﺭﻱ‬، .‫ ﺍ‬،‫ ﺫﺍﻛﺮ‬،.‫ ﺵ‬،‫ ﺳﻤﺎﻭﻱ‬،.‫ ﻡ‬،‫[ ﻣﻬﺪﻭﻱ‬14]
‫ﻣﺒﺘﻨﻲ ﺑﺮ ﮔﺮﺍﺩﻳﺎﻥ ﻣﺤﻠﻲ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﺑﺮﺍﻱ ﭘﻨﻬﺎﻥ ﺷﻜﻨﻲ ﺩﺭ‬
-‫ ﺗﻬﺮﺍﻥ‬-‫ ﺩﻭﺍﺯﺩﻫﻤﻴﻦ ﻛﻨﻔﺮﺍﻧﺲ ﺑﻴﻦ ﺍﻟﻤﻠﻠﻲ ﻛﺎﻣﭙﻴﻮﺗﺮ‬،"‫ﺍﺳﺘﮕﺎﻧﻮﮔﺮﺍﻓﻲ‬
١٣٨٥ ‫ﺍﺳﻔﻨﺪ‬
[15] A. Ker, “Improved detection of LSB
steganography in grayscale images, in Proc. Inf.
Hiding Workshop, Springer LNCS, vol. 3200,
2004.
‫ "ﺭﻭﺵ ﭘﻨﻬﺎﻥ‬، .‫ ﺹ‬،‫ ﺍﻛﺮﻣﻲ‬، .‫ ﻡ‬،‫ ﺍﺧﻮﺕ‬،.‫ ﺵ‬،‫ ﺳﻤﺎﻭﻱ‬، .‫ ﻡ‬،‫[ ﻣﻬﺪﻭﻱ‬16]
‫ ﭘﺎﻧﺰﺩﻫﻤﻴﻦ ﻛﻨﻔﺮﺍﻧﺲ‬،"‫ﻧﮕﺎﺭﻱ ﺗﻄﺒﻴﻘﻲ ﺑﺮ ﺍﺳﺎﺱ ﺍﻏﺘﺸﺎﺵ ﺟﻤﻊ ﺷﻮﻧﺪﻩ‬
۱۳۸۶ ‫ ﺍﺭﺩﻳﺒﻬﺸﺖ‬،‫ﻣﻬﻨﺪﺳﻲ ﺑﺮﻕ ﺍﻳﺮﺍﻥ‬
‫ ﺩﺭ ﺍﻳﻦ‬.‫ﭘﻴﺸﻨﻬﺎﺩ ﺭﻭﺵﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﻣﻘﺎﻡﺗﺮ ﻣﻨﺠﺮ ﻣﻲﺷﻮﺩ‬
‫ ﺭﻓﺘﺎﺭ ﺍﻟﮕﻮﺭﻳﺘﻢﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ‬،‫ﻣﻘﺎﻟﻪ ﺑﺎ ﺍﺭﺍﺋﻪ ﻳﮏ ﻣﺪﻝ ﺭﻳﺎﺿﻲ‬
.‫ ﺑﻪ ﻃﻮﺭ ﮐﺎﻣﻞ ﺑﺮﺭﺳﻲ ﺷﺪﻩ ﺍﺳﺖ‬LSB-F ‫ ﻭ‬LSB-M
‫ﺍﻟﮕﻮﺭﻳﺘﻢﻫﺎﻱ ﭘﻨﻬﺎﻥﻧﮕﺎﺭﻱ ﺗﻐﻴﻴﺮﺍﺗﻲ ﺭﺍ ﺩﺭ ﻭﻳﮋﮔﻲﻫﺎﻱ ﺗﺼﻮﻳﺮ‬
‫ ﮐﻪ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﻳﮑﻲ ﺍﺯ ﺍﻳﻦ‬،‫ﭘﻮﺷﺎﻧﻪ ﺍﻳﺠﺎﺩ ﻣﻲﮐﻨﻨﺪ‬
‫ ﺩﺭ ﺍﻳﻦ ﻣﻘﺎﻟﻪ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻣﺪﻝ ﺭﻳﺎﺿﻲ ﺍﺭﺍﺋﻪ‬.‫ﻭﻳﮋﮔﻲﻫﺎ ﺍﺳﺖ‬
‫ ﺗﺨﻤﻴﻨﻲ ﺍﺯ ﺗﻐﻴﻴﺮﺍﺕ‬،LSB-F ‫ ﻭ‬LSB-M ‫ﺷﺪﻩ ﺑﺮﺍﻱ ﺭﻭﺵﻫﺎﻱ‬
‫ ﺗﺨﻤﻴﻦ ﻣﻴﺰﺍﻥ ﺗﻐﻴﻴﺮﺍﺕ ﻫﻴﺴﺘﻮﮔﺮﺍﻡ‬.‫ﻫﻴﺴﺘﻮﮔﺮﺍﻡ ﺗﺼﻮﻳﺮ ﺍﺭﺍﺋﻪ ﺷﺪ‬
‫ ﻣﻲﺗﻮﺍﻧﺪ ﻣﺒﻨﺎﻳﻲ ﺑﺮﺍﻱ ﺍﻧﺘﺨﺎﺏ ﺗﺼﻮﻳﺮﻱ ﺑﺎ‬،‫ﻗﺒﻞ ﺍﺯ ﺟﺎﺳﺎﺯﻱ ﭘﻴﺎﻡ‬
‫ ﻣﻌﺎﺩﻝ ﺑﻮﺩﻥ ﻧﺘﺎﻳﺞ‬.‫ﮐﻤﺘﺮﻳﻦ ﺗﻐﻴﻴﺮ ﺑﻪ ﻋﻨﻮﺍﻥ ﺗﺼﻮﻳﺮ ﭘﻮﺷﺎﻧﻪ ﺑﺎﺷﺪ‬
‫ﺷﺒﻴﻪﺳﺎﺯﻱﻫﺎ ﻭ ﻣﺪﻝ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺑﻴﺎﻧﮕﺮ ﺻﺤﺖ ﻓﺮﺿﻴﺎﺕ ﺍﻳﻦ‬
.‫ﻣﻘﺎﻟﻪ ﺑﻮﺩﻩ ﺍﺳﺖ‬
‫ ﻣﺮﺍﺟﻊ‬-۷
[1] F.A.P. Petitcolas, R.J. Anderson and M.G. Kuhn,
"Information Hiding - A Survey'', Proc. of IEEE,
pp.1062-1078, July, 1999.
[2] R.J Anderson and F.A.P. Petitcolas, “On the Limits
of Steganography”, IEEE Journal of Selected
Areas in Communications, Special Issue on
Copyright and privacy Protection, Vol. 16(4), pp.
474-481, May 1998.
[3] M. M. Amin, M. Salleh, S. Ibrahim, M.R. Katmin
and M.Z.I. Shamsuddin,” Information Hiding
using Steganography”, 4th National Conference
on Telecommunication Technology Proceedings,
2003.
[4] B. ŞİMŞEK, "Steganography in JPEG Images",
Dokuz Eylül University, İZMİR, July, 2004.
[5] N. Provos and P. Honeyman, ”Hide and Seek: An
Introduction to Steganography”, IEEE Security &
Privacy, pp. 32-44, May-June, 2003.
[6] N.F. Johnson and S. Jajodia, “Exploring
Steganography: Seeing the Unseen”, Computer ,
Vol. 31, No. 2, pp.26–34, 1998.
[7] Y.K Lee and L.H. Chen, “High capacity image
steganographic model,” Vision, Image and Signal
Processing, IEE Proceedings, Vol. 147, Jun 2000.
[8] N. Provos, “Defending Against Statistical
Steganalysis”, Proc. 10th Usenix Security Symp,
Usenix Assoc., pp. 323-335, 2001.
[9] A. Westfeld, “F5-A Steganographic Algorithm
:High Capacity Despite Better Steganalysis”, Proc.
4th Int’l Information Hiding Workshop, Springer-
Verlog, Vol. 2137 , Berlin Heidelberg New York ,
pp.289-302, 2001.
[10] A. Westfeld and A. Pfitzman, “Attacks on ٢٥٦
Steganographic Systems”, Proc. 3rd Int’l
Information Hiding Workshop , Springer-Verlag,
Berlin Heidelberg New York, pp. 61-76, 1999.
www.SID.ir
Surf and download all data from SID.ir: www.SID.ir

Translate via STRS.ir: www.STRS.ir

Follow our scientific posts via our Blog: www.sid.ir/blog

Use our educational service (Courses, Workshops, Videos and etc.) via Workshop: www.sid.ir/workshop