워터마크(watermarking) 정보은닉의 최적화 알고리즘

목차

1. 서론
2. Watermarking
2.1 주파수 영역의 워터마킹
2.2 Scaling 파라미터
2.3. Cox 방법
3 연구 결과

본문내용

T(I)) APPROX alpha DCT(I)
가 되도록 양자화 한 후 1을 적용
2) 양자화를 하지 않을 경우
{ alpha DCT}^{-1 } (DCT(I))
에서
| { DCT}^{-1}(DCT(I))|
을 극대화하도록 함.
[참고문헌]
Hiding, [1] I. Cox et al. "Secure spread specturm watermarking for multi-
media," IEEE Trans. On Image Processing, vol.6, no. 12, pp 1673-1687, Dec.1997.
[2] I.J. Cox, J. Kalian, T. Leighton, T. Shamoon, "A Secure, Robust Watermark for Multimedia," Workshop on Information Hiding, Newton Institute, Univ. of Cambridge, May, 1996.
[3] Brain et al., "DCT-domain system for robust image watermarking," Signal Processing.
[4] J. Fridrich, "On Digital Watermarks,"
:http://ssie.binghamton.edu/~jirif/resume.html
[5]J. Zhao, E. Koch, "Embedding Robust Labels into Images for Copyright Protection," Proc. of the International Congress on Intellectual Property Rights for Specialize Information, Knowledge and New Technologies, Vienna, Austria, Aug. 1995.
[6] G. Caronni, "Assuring Ownership Rights for Digital Images," Proc. of Reliable IT Systems, VIS '95, Viewing Publishing Co., Germany, 1995.
[7] I.J. Cox, J. Kalian, T. Leighton, T. Shamoon, "A Secure, Robust Watermark for Multimedia," Workshop on InformationNewton Institute, Univ. of Cambridge, May, 1996.

키워드

워터마크,   정보은닉,   알고리즘