The Normalized Distance Preserving Binary Codes and Distance Table





Key Words

approximate nearest neighbors search ; binary codes ; hashing algorithm ; semisupervised learning ; entropy


Journal of Information Science and Engineering

Volume or Term/Year and Month of Publication

33卷2期(2017 / 03 / 01)

Page #

499 - 515

Content Language


Chinese Abstract

In the Euclidean space, the approximate nearest neighbors (ANN) search measures the similarity degree through computing the Euclidean distances, which owns high time complexity and large memory overhead. To address these problems, this paper maps the data from the Euclidean space into the Hamming space, and the normalized distance similarity restriction and the quantization error are required to satisfy. Firstly, the encoding centers and their binary labels are obtained through a lookup-based mechanism. Then, the candidate hashing functions are learnt under supervision of the binary labels, and the ones which satisfy the entropy criterion are selected to boost the distinctiveness of the learnt binary codes. During the training procedure, multiple groups of the hashing functions are generated based on different kinds of centers, which can weaken the inferior influence of the initial centers. The data with minimal average Hamming distances are returned as the nearest neighbors. In the Hamming space, different Euclidean distances may be substituted by one identical value, thus a distance table is predefined to distinguish the similarity degrees among the data pairs with the same Hamming distance. The final experimental results show that our algorithm is superior to many state-of-the-art methods.

Topic Category 基礎與應用科學 > 資訊科學
Times Cited
  1. 邱怡嘉(2010)。以射頻磁控濺鍍製備p型類鑽碳薄膜應用於太陽能電池。臺北科技大學材料科學與工程研究所學位論文。2010。1-70。 
  2. 劉璽鎔(2015)。利用過度耦合及步階阻抗諧振器設計製作微型化帶通濾波器。逢甲大學通訊工程學系學位論文。2015。1-72。 
  3. 何聖彥(2010)。氧化鋅奈米結構於有機溶液相中的製備。清華大學化學工程學系學位論文。2010。1-76。
  4. 張景棠(2016)。雲端環境上的複合式知識融合與推論。臺北大學資訊工程學系學位論文。2016。1-46。