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...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 36(2014), 2 vom: 20. Feb., Seite 388-403
|
|---|
| 1. Verfasser: |
Wang, Jingdong
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Wang, Naiyan,
Jia, You,
Li, Jian,
Zeng, Gang,
Zha, Hongbin,
Hua, Xian-Sheng |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2014
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Schlagworte: | Journal Article
Research Support, Non-U.S. Gov't |
|---|