Computer and Modernization

Previous Articles     Next Articles

A Binary Feature Matching Method Based on Minimum Hashing

  

  1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
  • Received:2015-11-26 Online:2016-06-16 Published:2016-06-17

Abstract: Feature matching is one of basic problems in image recognition. Common matching methods are the linear scanning methods based on greedy algorithm, and they are applied to low dimensional data. When data dimension exceeds a certain degree, the time efficiency of matching will decrease sharply, even not stronger than the strong linear scanning method. This paper proposes a binary feature matching method based on minimum hashing. By the mapping transformation in minimum hashing function, the original feature set will be divided into several subsets. It can be transformed into a problem of searching the adjacent elements within a tiny set instead of a huge set, which decreases the computational cost. Using Jaccard distance, minimum hashing function can maximally ensure the similarity of similar vectors in original data after hash transformation. Experiments show that this method can obtain better matching performance than KD-Tree when it is applied to binary feature.

Key words: minimum hashing, binary feature, feature matching

CLC Number: