Hiding Data in Halftone Images
Informatica
A Modified Kernels-Alternated Error Diffusion Watermarking Algorithm for Halftone Images
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
Visible Watermarking for Halftone Images
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Content Adaptive Visible Watermarking during Ordered Dithering
IEICE - Transactions on Information and Systems
Watermarking in halftone images with parity-matched error diffusion
Signal Processing
New public-key authentication watermarking for JBIG2 resistant to parity attacks
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
A lossless watermarking technique for halftone images
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Alteration-locating authentication watermarking for binary images
IWDW'04 Proceedings of the Third international conference on Digital Watermarking
Reversible watermarking for error diffused halftone images using statistical features
IWDW'06 Proceedings of the 5th international conference on Digital Watermarking
Joint screening halftoning and visual cryptography for image protection
IWDW'06 Proceedings of the 5th international conference on Digital Watermarking
Journal of Systems and Software
Hi-index | 0.00 |
A low computational complexity noise-balanced error diffusion (NBEDF) technique is proposed for embedding watermarks into error-diffused images. The visual decoding pattern can be perceived when two or more similar NBEDF images are overlaid, even in a high activity region. Also, with the modified improved version of NBEDF, two halftone images can be made from two totally different gray-tone images, and still provide a clear and sharp visual decoding pattern. With self-decoding techniques, we can also decode the pattern with only one NBEDF image. However, the NBEDF method is not so robust to damage due to printing or other distortions. Thus, a kernels-alternated error diffusion (KAEDF) technique is proposed. By using them alternately in the halftone process, we find that two well-known kernels (Jarvis, J.F. et al., 1976; Stucki, P., 1981) are compatible. In the decoder, because the spectral distributions of Jarvis and Stucki kernels are different in the 2D fast Fourier transform domain, we use the cumulative squared Euclidean distance criterion to determine each cell in a watermarked halftone image belonging to either Jarvis or Stucki, and then decode the watermark. Furthermore, because the detailed textures of Jarvis and Stucki patterns are somewhat different in the spatial domain, the lookup table (LUT) technique is also used for fast decoding. From simulation results, the correct decoding rates for both techniques are high and extremely robust, even after printing and scanning processes. Finally, we extend the hybrid NBEDF and KAEDF algorithms to two color EDF halftone images, where 8 independent KAEDF watermarks and 16 NBEDF watermarks can be inserted and still achieve a high-quality result.