Trinary-projection trees for approximate nearest neighbor search
We address the problem of approximate nearest neighbor (ANN) search for visual descriptor indexing. Most spatial partition trees, such as KD trees, VP trees, and so on, follow the hierarchical binary space partitioning framework. The key effort is to design different partition functions (hyperplane...
Description complète
Détails bibliographiques
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 36(2014), 2 vom: 20. Feb., Seite 388-403
|
|---|
| Auteur principal: |
Wang, Jingdong
(Auteur) |
|---|
| Autres auteurs: |
Wang, Naiyan,
Jia, You,
Li, Jian,
Zeng, Gang,
Zha, Hongbin,
Hua, Xian-Sheng |
|---|
| Format: | Article en ligne
|
|---|
| Langue: | English |
|---|
| Publié: |
2014
|
|---|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Sujets: | Journal Article
Research Support, Non-U.S. Gov't |
|---|