Paper
7 March 2022 Application of image hash algorithm in copyright protection system
Xiaoyu Yang, Liuping Feng, Tingting Lu, Qianxu Dong
Author Affiliations +
Proceedings Volume 12167, Third International Conference on Electronics and Communication; Network and Computer Technology (ECNCT 2021); 121673B (2022) https://doi.org/10.1117/12.2628802
Event: 2021 Third International Conference on Electronics and Communication, Network and Computer Technology, 2021, Harbin, China
Abstract
Because of the sensitivity of traditional hash algorithms to original data, it is not suitable for image content authentication. In this paper, we analyze and compare image hashing algorithms, realized a difference-value hashing algorithm (dHash), and apply the dHash algorithm to a blockchain-based image copyright protection system. dHash algorithm determines the similarity of images to ensure the uniqueness of image copyright.The test shows that the dHash algorithm has high accuracy and faster speed of images with Gaussian noise.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaoyu Yang, Liuping Feng, Tingting Lu, and Qianxu Dong "Application of image hash algorithm in copyright protection system", Proc. SPIE 12167, Third International Conference on Electronics and Communication; Network and Computer Technology (ECNCT 2021), 121673B (7 March 2022); https://doi.org/10.1117/12.2628802
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image registration

Digital watermarking

Data storage

Image analysis

Image compression

RELATED CONTENT

Secure graphical data storage by full spectrum image coding
Proceedings of SPIE (February 09 2006)
Watermark template attack
Proceedings of SPIE (August 01 2001)
Eigen-decomposition-based analysis of video images
Proceedings of SPIE (December 17 1998)
Perceptual mask estimation from watermarked images
Proceedings of SPIE (June 20 2003)

Back to Top