earticle

논문검색

A Probabilistic Dissimilarity Matching for the DFT-Domain Image Hashing

원문정보

초록

영어

An image hash, a discriminative and robust summary of an image, should be robust against quality-preserving signal processing steps, while being pairwise independent for perceptually different inputs. In order to improve the hash matching performance, this paper proposes a probabilistic dissimilarity matching. Instead of extracting the binary hash from the query image, we compute the probability that the intermediate hash vector of the query image belongs to each quantization bin, which is referred to as soft quantization binning. The probability is used as a weight in comparing the binary hash of the query with that stored in a database. A performance evaluation over sets of image distortions shows that the proposed probabilistic matching method effectively improves the hash matching performance as compared with the conventional Hamming distance.

목차

Abstract
 1. Introduction
 2. Polar DFT image hashing
 3. Proposed weighted hash matching
 4. Performance evaluation
 5. Conclusion
 6. Acknowledgement
 References

저자정보

  • Jin S. Seo Gangneung-Wonju National University, Gangneung, Korea
  • Myung-Suk Jo Gangneung-Wonju National University, Gangneung, Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 기관로그인 시 무료 이용이 가능합니다.

      • 4,000원

      0개의 논문이 장바구니에 담겼습니다.