Asymmetric Mapping Quantization for Nearest Neighbor Search

Nearest neighbor search is a fundamental problem in computer vision and machine learning. The straightforward solution, linear scan, is both computationally and memory intensive in large scale high-dimensional cases, hence is not preferable in practice. Therefore, there have been a lot of interests...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 42(2020), 7 vom: 28. Juli, Seite 1783-1790
1. Verfasser: Hong, Weixiang (VerfasserIn)
Weitere Verfasser: Tang, Xueyan, Meng, Jingjing, Yuan, Junsong
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2020
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM298650827
003 DE-627
005 20231225094623.0
007 cr uuu---uuuuu
008 231225s2020 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2019.2925347  |2 doi 
028 5 2 |a pubmed24n0995.xml 
035 |a (DE-627)NLM298650827 
035 |a (NLM)31251177 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Hong, Weixiang  |e verfasserin  |4 aut 
245 1 0 |a Asymmetric Mapping Quantization for Nearest Neighbor Search 
264 1 |c 2020 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Revised 05.06.2020 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Nearest neighbor search is a fundamental problem in computer vision and machine learning. The straightforward solution, linear scan, is both computationally and memory intensive in large scale high-dimensional cases, hence is not preferable in practice. Therefore, there have been a lot of interests in algorithms that perform approximate nearest neighbor (ANN) search. In this paper, we propose a novel addition-based vector quantization algorithm, Asymmetric Mapping Quantization (AMQ), to efficiently conduct ANN search. Unlike existing addition-based quantization methods that suffer from handling the problem caused by the norm of database vector, we map the query vector and database vector using different mapping functions to transform the computation of L-2 distance to inner product similarity, thus do not need to evaluate the norm of database vector. Moreover, we further propose Distributed Asymmetric Mapping Quantization (DAMQ) to enable AMQ to work on very large dataset by distributed learning. Extensive experiments on approximate nearest neighbor search and image retrieval validate the merits of the proposed AMQ and DAMQ 
650 4 |a Journal Article 
700 1 |a Tang, Xueyan  |e verfasserin  |4 aut 
700 1 |a Meng, Jingjing  |e verfasserin  |4 aut 
700 1 |a Yuan, Junsong  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 42(2020), 7 vom: 28. Juli, Seite 1783-1790  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:42  |g year:2020  |g number:7  |g day:28  |g month:07  |g pages:1783-1790 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2019.2925347  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 42  |j 2020  |e 7  |b 28  |c 07  |h 1783-1790