Robust Hashing via Global and Local Invariant Features for Image Copy Detection
ACM Transactions on Multimedia Computing, Communications, and Applications · 31.01.2024 · 20 (1) · 1-22
DOI: 10.1145/3600234 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Multimedia Computing, Communications, and Applications, online erschienen am 24.08.2023. Verfasst von Xiaoping Liang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: Guangxi Natural Science Foundation, National Natural Science Foundation of China, Guangxi “Bagui Scholar” Team for Innovation and Research, Guangxi Talent Highland Project of Big Data Intelligence and Application.
Abstract (Originalsprache)
Robust hashing is a powerful technique for processing large-scale images. Currently, many reported image hashing schemes do not perform well in balancing the performances of discrimination and robustness, and thus they cannot efficiently detect image copies, especially the image copies with multiple distortions. To address this, we exploit global and local invariant features to develop a novel robust hashing for image copy detection. A critical contribution is the global feature calculation by gray level co-occurrence moment learned from the saliency map determined by the phase spectrum of quaternion Fourier transform, which can significantly enhance discrimination without reducing robustness. Another essential contribution is the local invariant feature computation via Kernel Principal Component Analysis (KPCA) and vector distances. As KPCA can maintain the geometric relationships within image, the local invariant features learned with KPCA and vector distances can guarantee discrimination and compactness. Moreover, the global and local invariant features are encrypted to ensure security. Finally, the hash is produced via the ordinal measures of the encrypted features for making a short length of hash. Numerous experiments are conducted to show efficiency of our scheme. Compared with some well-known hashing schemes, our scheme demonstrates a preferable classification performance of discrimination and robustness. The experiments of detecting image copies with multiple distortions are tested and the results illustrate the effectiveness of our scheme.
Förderung
- Guangxi Natural Science Foundation
- National Natural Science Foundation of China
- Guangxi “Bagui Scholar” Team for Innovation and Research, Guangxi Talent Highland Project of Big Data Intelligence and Application
- Guangxi Collaborative Innovation Center of Multi-source Information Integration and Intelligent Processing
Zitieren
APA
Liang, X., Tang, Z., Li, Z., Yu, M., Zhang, H., & Zhang, X. (2024). Robust Hashing via Global and Local Invariant Features for Image Copy Detection. ACM Transactions on Multimedia Computing, Communications, and Applications, 20(1), 1-22. https://doi.org/10.1145/3600234
Vancouver
Liang X, Tang Z, Li Z, Yu M, Zhang H, Zhang X. Robust Hashing via Global and Local Invariant Features for Image Copy Detection. ACM Transactions on Multimedia Computing, Communications, and Applications. 2024;20(1):1-22. doi:10.1145/3600234
BibTeX
@article{Liang2024,
author = {Liang, Xiaoping and Tang, Zhenjun and Li, Zhixin and Yu, Mengzhu and Zhang, Hanyun and Zhang, Xianquan},
title = {Robust Hashing via Global and Local Invariant Features for Image Copy Detection},
journal = {ACM Transactions on Multimedia Computing, Communications, and Applications},
year = {2024},
volume = {20},
number = {1},
pages = {1--22},
doi = {10.1145/3600234}
}
EUVIMED