IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Regular Section
Efficient Anchor Graph Hashing with Data-Dependent Anchor Selection
Hiroaki TAKEBEYusuke UEHARASeiichi UCHIDA
Author information
JOURNALS FREE ACCESS

2015 Volume E98.D Issue 11 Pages 2030-2033

Details
Abstract

Anchor graph hashing (AGH) is a promising hashing method for nearest neighbor (NN) search. AGH realizes efficient search by generating and utilizing a small number of points that are called anchors. In this paper, we propose a method for improving AGH, which considers data distribution in a similarity space and selects suitable anchors by performing principal component analysis (PCA) in the similarity space.

Information related to the author
© 2015 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top