Author(s): WANG Xiumei, DING Lijie, GAO Xinbo, School of Electronic Engineering, Xidian Univ.
Pages: 94-98
Year: 2016 Issue:  1
Journal: Journal of Xidian University(Natural Science)
Keyword:  approximate nearest neighbor search; hashing; similarity predicted function; precision; recall;
Abstract: In order to implement quick and effective search,save the storage space and improve the poor performance of affinity relationshaps between high dimensional data and its codes in image retrieval,a new linear embedding hashing is proposed by introducing the preserving similarity.First,the whole data set is clustered into several classes,and then the similarity predicted function is used to maintain affinity relationships between high dimensional data and its codes so as to establish the objective function.By minimizing the margin loss function,the optimal embedded matrix can be obtained.Compared with the existing classic hashing algorithm,experimental results show that the performance of the linear embedding hash algorithm is superior to the other binary encoding strategy on precision and recall.