• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Trellis ºÎÈ£ ¹× ¿£Æ®·ÎÇÇ ¸¶½ºÅ·À» ÀÌ¿ëÇÑ Á¤º¸ºÎȣȭ ±â¹Ý ¿öÅ͸¶Å·
¿µ¹®Á¦¸ñ(English Title) A Watermarking Method Based on the Informed Coding and Embedding Using Trellis Code and Entropy Masking
ÀúÀÚ(Author) ÀÌÁ¤È¯   Jeong Hwan Lee  
¿ø¹®¼ö·Ïó(Citation) VOL 13 NO. 12 PP. 2677 ~ 2684 (2009. 12)
Çѱ۳»¿ë
(Korean Abstract)
º» ³í¹®¿¡¼­´Â trellis ºÎÈ£ ¹× ¿£Æ®·ÎÇÇ ¸¶½ºÅ·À» ÀÌ¿ëÇÑ Á¤º¸ºÎȣȭ ±â¹Ý ¿öÅ͸¶Å· ¹æ¹ý¿¡ ´ëÇÏ¿© ¿¬±¸ÇÏ¿´´Ù. ¿µ»óÀ» 8x8ºí·ÏÀ¸·Î Áߺ¹µÇÁö ¾Ê°Ô ³ª´©¾î DCTº¯È¯À» ¼öÇàÇÏ°í °¢ ºí·ÏÀ¸·ÎºÎÅÍ 16°³ÀÇ Áß°£ÁÖÆļö ´ë¿ªÀÇ °è¼ö¸¦ ÃßÃâÇÑ´Ù. À̸¦ trellis ºÎȣȭÀÇ °¢ ´Ü°è¿¡¼­ Æò±ÕÀÌ 0ÀÌ°í ºÐ»êÀÌ 1ÀÎ °¡¿ì½Ã¾È ³­¼ö¿Í ºñ±³ÇÏ¿© ¼±Çü»ó°ü°è¼ö ¹× ¿Ó½¼°Å¸®ÀÇ ¼±Çü°áÇÕÀÌ ÃÖ¼ÒÀÎ º¤Å͸¦ Viterbi ¾Ë°í¸®ÁòÀ¸·Î ±¸ÇÏ°í À̸¦ ¿ø ¿µ»ó¿¡ »ðÀÔÇÏ¿© ¿öÅ͸¶Å·µÈ ¿µ»óÀ» ¾ò´Â´Ù. ¿µ»óÀÇ Æ¯¼ºÀ» °í·ÁÇϱâÀ§ÇØ »ðÀÔº¤Å͸¦ ±¸ÇÒ ¶§ ¿£Æ®·ÎÇÇ ¸¶½ºÅ· ÇÔ¼ö¸¦ »ç¿ëÇÏ¿© ¼±Çü»ó°ü°è¼ö¿Í ¿Ó½¼°Å¸®ÀÇ °¡ÁßÄ¡¸¦ ´Ù¸£°Ô Àû¿ëÇÑ´Ù. Á¦¾È ¹æ¹ýÀÇ ¼º´ÉÀ» Æò°¡Çϱâ À§ÇØ ´Ù¼öÀÇ ¿µ»ó¿¡ ´ëÇÑ Æò±Õ ºñÆ®¿ÀÂ÷À²À» °è»êÇÏ¿© ¼º´ÉÀ» ºñ±³ÇÏ¿´À¸¸ç, Æò±ÕºñÆ®¿ÀÂ÷À² Ãø¸é¿¡¼­ ¼º´É °³¼±ÀÌ ÀÖ¾ú´Ù.
¿µ¹®³»¿ë
(English Abstract)
In this paper, we study a watermarking method based on the informed coding and embedding by means of trellis code and entropy masking. An image is divided as 8x8 block with no overlapping and the discrete cosine transform(DCT) is applied to each block. Then the 16 medium-frequency AC terms of each block are extracted. Next it is compared with gaussian random vectors having zero mean and unit variance. As these processing, the embedding vectors with minimum value of linear combination between linear correlation and Watson distance can be obtained by Viterbi algorithm at each stage of trellis coding. For considering the image characteristics, we apply different weight value between the linear correlation and the Watson distance using the entropy masking. To evaluate the performance of proposed method, the average bit error rate of watermark message is calculated from different several images. By the experiments the proposed method is improved in terms of the average bit error rate.
Å°¿öµå(Keyword) ¿öÅ͸¶Å·   Æ®·¼¸®½ººÎÈ£   Á¤º¸ºÎÈ£ ¹× »ðÀÔ   ¿£Æ®·ÎÇÇ ¸¶½ºÅ·   watermarking   trellis code   informed coding and embedding   entropy masking  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå