High capacity data hiding for halftone image authentication

Authors:
Meng Guo;Hongbin Zhang
Affiliations:
Computer Institute, Beijing University of Technology, Beijing, China;Computer Institute, Beijing University of Technology, Beijing, China
Venue:
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Year:
2012

Citing 6
Cited 0

Digital halftoning

Digital halftoning
Reversible data hiding for ordered dithered halftone images

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
High Capacity Data Hiding for Binary Image Authentication

ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Data hiding watermarking for halftone images

IEEE Transactions on Image Processing
High-capacity data hiding in halftone images using minimal-error bit searching and least-mean square filter

IEEE Transactions on Image Processing
Halftone-Image Security Improving Using Overall Minimal-Error Searching

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an earlier paper [1], we propose a high capacity data hiding scheme for various types of binary images. The scheme ensures that in an M×N image block, the upper bound of the amount of bits that can be embedded is (nlog2((M×N)/n + 1)( by changing at most n individual pixels. However, changing individual pixels in halftone images will introduce undesirable 'salt-and-pepper' noise, or local black or white clusters. In this paper, we propose a new scheme for halftone images which improves [1] in its capability to maintain better quality of the host image after data hiding by changing pixels in pairs rather than individually. The new scheme can still offer a high embedding efficiency. Experimental results show that the new scheme can maintain better image quality.