Efficient anchor graph hashing with data-dependent anchor selection

Hiroaki Takebe, Yusuke Uehara, Seiichi Uchida

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)2030-2033
Number of pages4
JournalIEICE Transactions on Information and Systems
Issue number11
Publication statusPublished - Nov 2015

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'Efficient anchor graph hashing with data-dependent anchor selection'. Together they form a unique fingerprint.

Cite this