Fast approximate matching of binary codes with distinctive bits

• Published in: Frontiers of Computer Science Vol. 9; no. 5; pp. 741 - 750
• Main Authors: YAN, Chenggang Clarence, XIE, Hongtao, ZHANG, Bing, MA, Yanping, DAI, Qiong, LIU, Yizhi
• Format: Journal Article
• Language: English
• Published: Beijing Higher Education Press 01.10.2015; Springer Nature B.V
• Subjects: Algorithms; approximate nearest neighbor search; Binary codes; Cluster analysis; Clustering; Codes; Computer Science; Datasets; hierarchical clustering index; Performance degradation; Performance indices; Research Article; Searching; hierarchical clustering index; binary codes; approximate nearest neighbor search

Although the distance between binary codes can be computed fast in Hamming space, linear search is not practical for large scale datasets. Therefore attention has been paid to the efficiency of performing approximate nearest neighbor search, in which hierarchical clustering trees (HCT) are widely us...