Please use this identifier to cite or link to this item:

Data hiding in halftone images with parity coding

Authors Fu, MS
Au, OC
Issue Date 2001
Source Proceedings of SPIE--the international society for optical engineering , v. 4314, 2001, p. 360-368
Summary In this paper, we propose a novel halftone image data hiding method called Data Hiding in Block Parity (DHBP), which hides data in the block-sum parity. DHBP assumes that the original multi-tone image is available and the halftoning method is ordered dithering. DHBP can hide a relatively large amount of invisible watermarking data in halftone images while retaining good visual quality. In DHBP, one bit of information is hidden in a block of size MxN by forcing the parity of the sum of the MN pixels to be even or odd according to the data bit to be embedded. To alter the parity, one out of the MN pixels is chosen by minimizing the local image intensity change. Some custom-made quality measures are proposed to evaluate DHBP. Simulation results suggest that DHBP can hide a large amount of data while maintaining good visual quality.
ISSN 0277-786X
ISBN 0-8194-3992-4
Rights Copyright 2001 Society of Photo-Optical Instrumentation Engineers. This paper was published in Security and Watermarking of Multimedia Contents III, Ping Wah Wong, Edward J. Delp III, Editors, Proceedings of SPIE Vol. 4314, p. 360-8 (2001) and is made available as an electronic reprint with permission of SPIE. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Web of Science
Files in this item:
File Description Size Format
43143.pdf 1684935 B Adobe PDF