Journal of the Institute of Electronics Engineers of Korea CI (전자공학회논문지CI)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Robust Hierarchical GLOCAL Hash Generation based on Image Histogram

히스토그램 기반의 강인한 계층적 GLOCAL 해쉬 생성 방법

  • Choi, Yong-Soo (Graduate School of Information Management & Security, Korea University) ;
  • Kim, Hyoung-Joong (Graduate School of Information Management & Security, Korea University) ;
  • Lee, Dal-Ho (Department of Electronic Engineering, Kyungwon University)
  • 최용수 (고려대학교 정보경영공학전문대학원) ;
  • 김형중 (고려대학교 정보경영공학전문대학원) ;
  • 이달호 (경원대학교 전자공학과)
  • Received : 2010.11.19
  • Accepted : 2010.12.30
  • Published : 2011.01.25
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, Web applications, such as Stock Image and Image Library, are developed to provide the integrated management for user's images. Image hash techniques are used for the image registration, management and retrieval as the identifier and many researches have been performed to raise the hash performance. This paper proposes GLOCAL image hashing method utilizing the hierarchical histogram which based on histogram bin population method. So far, many researches have proven that image hashing techniques based on histogram are robust image processing and geometrical attack. We modified existing image hashing method developed by our research team. The main idea is that it makes more fluent hash string if we have histogram bin of specific length as shown in the body of paper. Finally, we can raise the magnitude of hash string within same context or feature and strengthen the robustness of hash.

최근 들어, 웹 응용의 하나로 이미지를 통합 관리하는 이미지 거래소(Image Stock), 이미지 도서관(Image Library)과 같은 응용들이 많이 만들어 지고 있다. 이미지의 등록, 관리, 검색에는 주로 이미지 해쉬라는 기술이 구분자(Identifier)로서 쓰이며 해쉬의 분별력을 높이기 위한 연구들이 많이 진행되어지고 있다. 본 논문에서는 계층적 히스토그램을 이용한 GLOCAL(Global to Local) 이미지 해쉬 생성 방법을 제안하였다. 많은 연구들이 이미지 처리 및 기하학적 공격에 강한 히스토그램 기반의 이미지 해쉬 기법들을 제안하였으며 제안된 논문에서는 GLOCAL 해쉬 생성과 가중치(Weighting Factor)를 적용하여 해쉬의 안정성을 높이는데 기여하였다. GLOCAL 해쉬 생성 방법에 의해 기존의 알고리즘들은 좀더 풍부한 길이의 이미지 해쉬를 생성하였다. 즉, 이미지 해쉬의 근본 목적인 Identification과 Discrimination 이라는 두 가지 목적을 잘 달성하였으며 그 결과는 통계학적 가설 검정 (Statistical Hypothesis Testing)을 통해 기존의 알고리즘과 비교하였으며 대부분의 공격종류에 대해 제안된 알고리즘이 향상된 성능을 보여줌을 확인하였다.

Keywords

References

  1. M. Johnson and K. Ramchandran, "Dither-Based Secure Image Hashing Using Distributed Coding," Proc. IEEE Int. Conf. Image Processing, September 2003.
  2. K. Mikolajczyk and C. Schmid, "A performance evaluation of local descriptors," Proceedings of the Computer Vision and Pattern Recognition, pp. 257-263, 2003.
  3. H. J. Kim, S. Y. Kim, and H. Kim, "A new image hash computation method," International Workshop on Ubiquitous Convergence Technology, 2007.
  4. J. Fridrich, D. Soukal, and J. Lukas, "Detection of copymove forgery in digital images" Proceedings of Digital Forensic Research Workshop, 2003.
  5. 이석환, 권기룡, "키 기반 블록 표면 계수를 이용한 강인한 3D 모델 해싱," 전자공학회논문지, 제47권 CI편, 제 1호, 1-14쪽, 2010년.
  6. V. Monga and M.K. Mhcak, "Robust and Secure Image Hashing via Non-Negative Matrix Factorizations," IEEE Transactions on Information Forensics and Security, Vol. 27, No. 3, pp. 379-391, 2005.
  7. N. L. Johnson, S. Kotz, and N. Balakrishnan, "Continuous Uni-variate Distributions," John Wiley \& Sons Inc, vol 2, New York, 1995.
  8. Suleyman S. Kozat, and R. Venkatesan, M. Kivanc Mihcak, "Robust Perceptual Image Hashing via Matrix Invariants," Proceedings of International Conference on Image Processing, pp.3443-3446, 2004.
  9. A. Swaminathan, Y. Mao, and M. Wu, "Robust and secure image hashing," IEEE Transactions on Information Forensics and Security, Vol. 1, No. 2, pp. 215-230, June 2006. https://doi.org/10.1109/TIFS.2006.873601
  10. Z. J. Tang, S. Z. Wang, X. P. Zhang, W. M. Wei and S. J. Su, "Robust Image Hashing for Tamper Detection Using Non-Negative Matrix Factorization," Journal of Ubiquitous Convergence Technology, Vol.2 No.1, pp. 18-26, 2008.
  11. E. Y. Chang, C. Li, J. Z. Wang, P. Mork, and G. Wiederhold, "Searching near replicas of images via clustering," SPIE Multimedia Storage and Archiving Systems VI, pp. 281-292, 1999.
  12. Y. Ke, R. Sukthankar, and L. Huston, "An efficient parts-based near-duplicate and sub-image retrieval system," Proceedings of the ACM International Conference on Multimedia, pp. 869-876, 2004.
  13. Li Chen and F. W. M. Stentiford, "Comparison of near-duplicate image matching," European Conference on Visual Media Production, pp. 38-42, 2006.
  14. J. J. Foo, J. Zobel, R. Sinha, and S. M. M. Tahaghoghi, "Detection of near duplicate images versions for web search," Proceedings of the ACM International Conference on Image and Video Retrieval, 2007.
  15. A. W. M. Smeulders, M. Worring, S. Santini, A. Gupta, and R. Jain, "Content based image retrieval at the end of the early years," IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 22, pp. 1349-1380, 2000. https://doi.org/10.1109/34.895972
  16. B. Wang, Z. Li, M. Li, and W.-Y. Ma, "Large-scale duplicate detection for Web image search," IEEE International Conference on Multimedia and Expo, pp. 353-356, 2006.
  17. M. Yang, G. Qiu, J. Huang, and D. Elliman, "Near-duplicate image recognition and content- based image retrieval using adaptive hierarchical geometric centroids," International Conference on Pattern Recognition, pp. 958-961, 2006.
  18. S. Xiang, H. J. Kim, and J. Huang, "Histogram-based image hashing scheme robust against geometric deformations," Proceedings of the ACM Multimedia and Security Workshop, pp. 121-128, 2007.