Paper
8 December 2015 A high capacity multiple watermarking scheme based on Fourier descriptor and Sudoku
Author Affiliations +
Proceedings Volume 9875, Eighth International Conference on Machine Vision (ICMV 2015); 98751E (2015) https://doi.org/10.1117/12.2229524
Event: Eighth International Conference on Machine Vision, 2015, Barcelona, Spain
Abstract
Digital watermark is a type of technology to hide some significant information which is mainly used to protect digital data. A high capacity multiple watermarking method is proposed, which adapts the Fourier descriptor to pre-process the watermarks, while a Sudoku puzzle is used as a reference matrix in embedding process and a key in extraction process. It can dramatically reduce the required capacity by applying Fourier descriptor. Meanwhile, the security of watermarks can be guaranteed due to the Sudoku puzzle. Unlike previous algorithms applying Sudoku puzzle in spatial domain, the proposed algorithm works in transformed domain by applying LWT2.In addition, the proposed algorithm can detect the temper location accurately. The experimental results demonstrated that the goals mentioned above have been achieved.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Li Zhang and Huimin Zheng "A high capacity multiple watermarking scheme based on Fourier descriptor and Sudoku", Proc. SPIE 9875, Eighth International Conference on Machine Vision (ICMV 2015), 98751E (8 December 2015); https://doi.org/10.1117/12.2229524
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital watermarking

Image quality

Ytterbium

Heat treatments

Visualization

Image processing

Computer security

RELATED CONTENT

Slant transform watermarking for digital images
Proceedings of SPIE (June 23 2003)
Segmentation to diminish the mosaic effect
Proceedings of SPIE (September 16 1996)

Back to Top