Improved halftone image data hiding with intensity selection

In this paper, we propose a novel algorithm called intensity selection (IS) that can be applied to three existing halftone image data hiding algorithms DHST, DHPT and DHSPT to achieve improved visual quality. The proposed IS algorithm generalizes the hidden data representation and select the best location out of a set of candidate locations for the application of DHST/DHPT/DHSPT. It chooses pixel locations that are either very bright or very dark. The IS requires the inverse-halftoned image which implies potentially high computation requirement. Experiments suggest that significant improvement in visual quality can be achieved.

[1]  Minerva M. Yeung,et al.  Effective and ineffective digital watermarks , 1997, Proceedings of International Conference on Image Processing.

[2]  Oscar C. Au,et al.  Data hiding for halftone images , 2000, Electronic Imaging.

[3]  Robert Ulichney,et al.  Digital Halftoning , 1987 .

[4]  Oscar C. Au,et al.  Data hiding by smart pair toggling for halftone images , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[5]  Doron Shaked,et al.  Watermarking of dither halftoned images , 1999, Electronic Imaging.

[6]  Oscar C. Au,et al.  Hybrid inverse halftoning using adaptive filtering , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).