What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest...
-
Upload
jody-norris -
Category
Documents
-
view
215 -
download
0
Transcript of What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest...
![Page 1: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/1.jpg)
What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast
Approximate Nearest Neighbor Search?
Masakazu Iwamura, Tomokazu Sato and Koichi Kise(Osaka Prefecture University, Japan)
ICCV’2013
Sydney, Australia
![Page 2: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/2.jpg)
Finding similar data Basic but important problem in information
processing
Possible applications include Near-duplicate detection Object recognition Document image retrieval Character recognition Face recognition Gait recognition
A typical solution: Nearest Neighbor (NN) Search
2
![Page 3: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/3.jpg)
Finding similar data by NN Search Desired properties
Fast and accurate Applicable to large-scale data
3
The paper presents a way to realizefaster approximate nearest neighbor
search for certain accuracy
Benefit from improvement of
computing power
![Page 4: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/4.jpg)
Contents NN and Approximate NN Search Performance comparison Keys to improve performance
4
![Page 5: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/5.jpg)
Contents NN and Approximate NN Search Performance comparison Keys to improve performance
5
![Page 6: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/6.jpg)
Nearest Neighbor (NN) Search This is a problem that the true NN is
always found In a naïve way
6
NN
Data Query
For more data,more time is required
![Page 7: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/7.jpg)
7
Nearest Neighbor (NN) Search Finding nearest neighbor efficiently
Before query is given
1. Index dataNN
1. Select search regions2. Calculate distances of
selected data
After query is given
The true NN must be contained in the selected search regions
Ensuring this takes so long time
Search regions
![Page 8: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/8.jpg)
8
Approximate Nearest Neighbor Search Finding nearest neighbor more efficiently
NN
Search regions Much faster
“Approximate” means that the true NN is not
guaranteed to be retrieved
![Page 9: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/9.jpg)
Contents NN and Approximate NN Search Performance comparison Keys to improve performance
10
![Page 10: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/10.jpg)
ANN search on 100M SIFT features
BAD
GOOD
Selected results
![Page 11: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/11.jpg)
ANN search on 100M SIFT features
BAD
GOOD
IMI(Babenko 2012)
IVFADC(Jegou 2011)
Selected results
![Page 12: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/12.jpg)
ANN search on 100M SIFT features
BAD
GOOD
IMI(Babenko 2012)
IVFADC(Jegou 2011)
BDH(Proposed method)
2.0 times
4.5 times
9.4 times
2.9 times
Selected results
![Page 13: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/13.jpg)
ANN search on 100M SIFT features
BAD
GOOD
IMI(Babenko 2012)
IVFADC(Jegou 2011)
BDH(Proposed method)
2.0 times
4.5 times
9.4 times
2.9 times
The novelty of BDH was reduced by IMI before we
succeeded in publishing it…(For more detail, check out the
Wakate program on Aug. 1) Selected results
![Page 14: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/14.jpg)
ANN search on 100M SIFT features
BAD
GOOD
IMI(Babenko 2012)
IVFADC(Jegou 2011)
BDH(Proposed method)
2.0 times
4.5 times
9.4 times
2.9 times
So-called binary coding is not suitable for fast
retrieval but for saving memory usage Selected
results
![Page 15: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/15.jpg)
Contents NN and Approximate NN Search Performance comparison Keys to improve performance
16
![Page 16: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/16.jpg)
Keys to improve performance Select search regions in subspaces Find the closest ones in the original space
efficiently
17
![Page 17: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/17.jpg)
Keys to improve performance Select search regions in subspaces Find the closest ones in the original space
efficiently
18
![Page 18: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/18.jpg)
Select search regions in subspaces In past methods (IVFADC, Jegou 2011 &
VQ-index, Tuncel 2002)
Search regions
Query
Indexed by k-means
clustering
![Page 19: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/19.jpg)
Select search regions in subspaces In past methods (IVFADC, Jegou 2011 &
VQ-index, Tuncel 2002)
Search regions
Query
Indexed by k-means
clustering
Taking very much time to select the search regions
Proven to be the least quantization error
Pros.
Cons.
Indexed by vector quantization
![Page 20: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/20.jpg)
Select search regions in subspaces In the past state-of-the-art (IMI, Babenko
2012)
Feature vectors
Divide into two or more
Calculate distances
in subspaces
Select the regions in the original
space
Indexed by k-means
clustering
Indexed by k-means
clustering
![Page 21: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/21.jpg)
Select search regions in subspaces In the past state-of-the-art (IMI, Babenko
2012)
Feature vectors
Divide into two or more
Calculate distances
in subspaces
Select the regions in the original
space
Less accurate(More quantization error)
Much less processing timePros.
Cons.
>
Indexed by product quantization
Realize better ratio
![Page 22: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/22.jpg)
Keys to improve performance Select search regions in subspaces Find the closest ones in the original space
efficiently
23
![Page 23: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/23.jpg)
Find the closest search regionsin original space In the past state-of-the-art (IMI, Babenko
2012)
1 3 815
1 2 4 916
2 3 510
5 6 8
11
12
Centroid in original space
1 38
15
12
5
11
Search regions are selected in the ascending order of distances in the original space
Subspace 2
Sub
space
1
Distances in subspace
2
Dis
tan
ces
in s
ub
space
1
Centroid in
subspace
![Page 24: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/24.jpg)
Find the closest search regionsin original space In the past state-of-the-art (IMI, Babenko
2012)
1 3 815
1 2 4 916
2 3 510
5 6 8
11
12
Centroid in original space
1 38
15
12
5
11
Subspace 2
Sub
space
1
Distances in subspace
2
Dis
tan
ces
in s
ub
space
1
Centroid in
subspace
This can be done more efficiently with the branch and bound
methodIt does not consider the
order of selecting buckets
Search regions are selected in the ascending order of distances in the original space
![Page 25: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/25.jpg)
Find the closest search regionsin original space efficiently In the proposed method
Centroid in original space
1 38
15
12
5
11
Subspace 2
Sub
space
1
Centroid in
subspace
0
1
3
8
15
1
2
5
11
Assume that upper limit is set to 8
Distances in subspace
1
Distances in subspace
2
![Page 26: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/26.jpg)
Find the closest search regionsin original space efficiently In the proposed method
Centroid in original space
1 38
15
12
5
11
Subspace 2
Sub
space
1
Centroid in
subspace
Distances in subspace
2
Distances in subspace
1
1
3
8
15
1
2
5
11
Assume that upper limit is set to 8
Max 8
0
![Page 27: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/27.jpg)
Find the closest search regionsin original space efficiently In the proposed method
Centroid in original space
1 38
15
12
5
11
Subspace 2
Sub
space
1
Centroid in
subspace
Distances in subspace
2
Distances in subspace
1
1
3
8
15
1
2
5
11
Assume that upper limit is set to 8
Max 8Max 8
10
![Page 28: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/28.jpg)
Find the closest search regionsin original space efficiently In the proposed method
Centroid in original space
1 38
15
12
5
11
Subspace 2
Sub
space
1
Centroid in
subspace
Distances in subspace
2
Distances in subspace
1
1
3
8
15
1
2
5
11
Assume that upper limit is set to 8
Max 8Max 8
0 2
![Page 29: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/29.jpg)
Find the closest search regionsin original space efficiently In the proposed method
Centroid in original space
1 38
15
12
5
11
Subspace 2
Sub
space
1
Centroid in
subspace
Distances in subspace
2
Distances in subspace
1
1
3
8
15
1
2
5
11
Assume that upper limit is set to 8
Max 8Max 8
0 5
![Page 30: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/30.jpg)
Find the closest search regionsin original space efficiently In the proposed method
The upper and lower bounds are increased in a step-by-step manner until enough number of data are selected
31
![Page 31: What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.](https://reader030.fdocuments.us/reader030/viewer/2022033107/56649e035503460f94aedb63/html5/thumbnails/31.jpg)
What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast
Approximate Nearest Neighbor Search?
Masakazu Iwamura, Tomokazu Sato and Koichi Kise(Osaka Prefecture University, Japan)
ICCV’2013
Sydney, Australia