On minimizing distortion in secure data-hiding for binary images

Authors:
Yongsu Park;Yookun Cho
Affiliations:
Department of Computer Science and Engineering, Seoul National University, Seoul, Korea;Department of Computer Science and Engineering, Seoul National University, Seoul, Korea
Venue:
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part I
Year:
2004

Citing 5
Cited 0

Embedding robust labels into images for copyright protection

KnowRight '95 Proceedings of the conference on Intellectual property rights and new technologies
Marking Text Documents

ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 3 - Volume 3
Data hiding in binary image for authentication and annotation

IEEE Transactions on Multimedia
Image-adaptive watermarking using visual models

IEEE Journal on Selected Areas in Communications
Secure spread spectrum watermarking for multimedia

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerous digital binary images are widely used today. Because modifying or forging digital images is not difficult, it is important to develop data-hiding methods to insert authentication data. In order to minimize distortion in secure data-hiding, there is an approach to reduce the number of flipped bits in the embedded image. The most recent method (Tseng-Chen-Pan’s scheme) that appeared on IEEE Trans. on Comm. 2002, flips only 2 bits for hiding n bits in the embedded image of size 2n bits. In this paper, we show that the problem of finding the lower bound on the minimum number of flipped bits in the 2n bits embedded image to hide n bits data is closely related with finding the minimum dominating sets of the binary hypercube of dimension n. To the best of our knowledge, our work is a first approach to convert the data-hiding problem to the relatively well-known graph problem.