1 January 2006 Robust watermarking scheme for binary images using a slice-based large-cluster algorithm with a Hamming Code
Author Affiliations +
Abstract
The problems with binary watermarking schemes are that they have only a small amount of embeddable space and are not robust enough. We develop a slice-based large-cluster algorithm (SBLCA) to construct a robust watermarking scheme for binary images. In SBLCA, a small-amount cluster selection (SACS) strategy is used to search for a feasible slice in a large-cluster flappable-pixel decision (LCFPD) method, which is used to search for the best location for concealing a secret bit from a selected slice. This method has four major advantages over the others: (a) SBLCA has a simple and effective decision function to select appropriate concealment locations, (b) SBLCA utilizes a blind watermarking scheme without the original image in the watermark extracting process, (c) SBLCA uses slice-based shuffling capability to transfer the regular image into a hash state without remembering the state before shuffling, and finally, (d) SBLCA has enough embeddable space that every 64 pixels could accommodate a secret bit of the binary image. Furthermore, empirical results on test images reveal that our approach is a robust watermarking scheme for binary images.
© (2006) Society of Photo-Optical Instrumentation Engineers (SPIE)
Wen-Yuan Chen, Wen-Yuan Chen, Chen-Chung Liu, Chen-Chung Liu, } "Robust watermarking scheme for binary images using a slice-based large-cluster algorithm with a Hamming Code," Optical Engineering 45(1), 017005 (1 January 2006). https://doi.org/10.1117/1.2150810 . Submission:
JOURNAL ARTICLE
10 PAGES


SHARE
RELATED CONTENT

Error-resilient image compression based on JPEG
Proceedings of SPIE (March 12 1996)
Blurriness estimation in video frames a study on smooth...
Proceedings of SPIE (February 08 2010)

Back to Top