-
1
-
-
38749118638
-
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
-
A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In IEEE Symp. Found. Comput. Sci., pages 459-468, 2006.
-
(2006)
IEEE Symp. Found. Comput. Sci.
, pp. 459-468
-
-
Andoni, A.1
Indyk, P.2
-
2
-
-
0025154701
-
K-D trees for semidynamic point sets
-
J. L. Bentley and B. Labo. K-d trees for semidynamic point sets. In Symp. Comput. Geom., pages 187-197, 1990.
-
(1990)
Symp. Comput. Geom.
, pp. 187-197
-
-
Bentley, J.L.1
Labo, B.2
-
3
-
-
80052874105
-
Iterative quantization: A procrustean approach to learning binary codes
-
Y. Gong and S. Lazebnik. Iterative quantization: a procrustean approach to learning binary codes. In Computer Vision and Pattern Recognition, pages 817-824, 2011.
-
(2011)
Computer Vision and Pattern Recognition
, pp. 817-824
-
-
Gong, Y.1
Lazebnik, S.2
-
6
-
-
84877744783
-
Super-bit localitysensitive hashing
-
J. Ji, J. Li, S. Yan, B. Zhang, and Q. Tian. Super-bit localitysensitive hashing. In NIPS, pages 108-116, 2012.
-
(2012)
NIPS
, pp. 108-116
-
-
Ji, J.1
Li, J.2
Yan, S.3
Zhang, B.4
Tian, Q.5
-
7
-
-
79959694273
-
Lost in binarization: Query-adaptive ranking for similar image search with compact codes
-
Y. Jiang, J. Wang, and S.-F. Chang. Lost in binarization: query-adaptive ranking for similar image search with compact codes. In ICMR, page 16, 2011.
-
(2011)
ICMR
, pp. 16
-
-
Jiang, Y.1
Wang, J.2
Chang, S.-F.3
-
8
-
-
84858740468
-
Learning to hash with binary reconstructive embeddings
-
B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In NIPS, pages 1042-1050, 2009.
-
(2009)
NIPS
, pp. 1042-1050
-
-
Kulis, B.1
Darrell, T.2
-
9
-
-
77953184849
-
Kernelized locality-sensitive hashing for scalable image search
-
B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In International Conference on Computer Vision, pages 2130-2137, 2009.
-
(2009)
International Conference on Computer Vision
, pp. 2130-2137
-
-
Kulis, B.1
Grauman, K.2
-
10
-
-
0032203257
-
Gradientbased learning applied to document recognition
-
Y. Lecun, L. E. Bottou, Y. Bengio, and P. Haffner. Gradientbased learning applied to document recognition. Proceedings of The IEEE, 86:2278-2324, 1998.
-
(1998)
Proceedings of the IEEE
, vol.86
, pp. 2278-2324
-
-
Lecun, Y.1
Bottou, L.E.2
Bengio, Y.3
Haffner, P.4
-
11
-
-
84866726818
-
Supervised hashing with kernels
-
W. Liu, J. Wang, R. Ji, Y. Jiang, and S.-F. Chang. Supervised hashing with kernels. In CVPR, pages 2074-2081, 2012.
-
(2012)
CVPR
, pp. 2074-2081
-
-
Liu, W.1
Wang, J.2
Ji, R.3
Jiang, Y.4
Chang, S.-F.5
-
12
-
-
80053456121
-
Hashing with graphs
-
W. Liu, J. Wang, S. Kumar, and S.-F. Chang. Hashing with graphs. In ICML, pages 1-8, 2011.
-
(2011)
ICML
, pp. 1-8
-
-
Liu, W.1
Wang, J.2
Kumar, S.3
Chang, S.-F.4
-
13
-
-
3042535216
-
Distinctive image features from scale-invariant keypoints
-
D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 60:91-110, 2004.
-
(2004)
IJCV
, vol.60
, pp. 91-110
-
-
Lowe, D.G.1
-
14
-
-
77955996871
-
Compact projection: Simple and efficient near neighbor search with practical memory requirements
-
K. Min, L. Yang, J. Wright, L. Wu, X.-S. Hua, and Y. Ma. Compact projection: simple and efficient near neighbor search with practical memory requirements. In Computer Vision and Pattern Recognition, pages 3477-3484, 2010.
-
(2010)
Computer Vision and Pattern Recognition
, pp. 3477-3484
-
-
Min, K.1
Yang, L.2
Wright, J.3
Wu, L.4
Hua, X.-S.5
Ma, Y.6
-
15
-
-
84955245129
-
MultiProbe LSH: Efficient indexing for high-dimensional similarity search
-
L. Qin,W. Josephson, Z. Wang, M. Charikar, and K. Li. MultiProbe LSH: Efficient Indexing for High-Dimensional Similarity Search. In VLDB, pages 950-961, 2007.
-
(2007)
VLDB
, pp. 950-961
-
-
Qin, L.1
Josephson, W.2
Wang, Z.3
Charikar, M.4
Li, K.5
-
16
-
-
79954525255
-
Locality-sensitive binary codes from shift-invariant kernels
-
M. Raginsky and S. Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. In Neural Information Processing Systems, pages 1509-1517, 2009.
-
(2009)
Neural Information Processing Systems
, pp. 1509-1517
-
-
Raginsky, M.1
Lazebnik, S.2
-
18
-
-
51949097915
-
Optimised KD-trees for fast image descriptor matching
-
C. Silpa-anan and R. Hartley. Optimised KD-trees for fast image descriptor matching. In CVPR, pages 1-8, 2008.
-
(2008)
CVPR
, pp. 1-8
-
-
Silpa-Anan, C.1
Hartley, R.2
-
20
-
-
33845569752
-
AnnoSearch: Image auto-annotation by search
-
X. Wang, L. Zhang, F. Jing, andW. Ma. AnnoSearch: Image auto-annotation by search. In CVPR, 2006.
-
(2006)
CVPR
-
-
Wang, X.1
Zhang, L.2
Jing, F.3
Ma, W.4
-
22
-
-
84866686216
-
QsRank: Querysensitive hash code ranking for efficient -neighbor search
-
L. Zhang, X. Zhang, and H.-Y. Shum. QsRank: Querysensitive hash code ranking for efficient -neighbor search. In CVPR, pages 2058-2065, 2012.
-
(2012)
CVPR
, pp. 2058-2065
-
-
Zhang, L.1
Zhang, X.2
Shum, H.-Y.3
-
23
-
-
78650975068
-
Spatial coding for large scale partial-duplicate web image search
-
W. Zhou, Y. Lu, H. Li, Y. Song, and Q. Tian. Spatial coding for large scale partial-duplicate web image search. In ACM Multimedia, pages 511-520, 2010.
-
(2010)
ACM Multimedia
, pp. 511-520
-
-
Zhou, W.1
Lu, Y.2
Li, H.3
Song, Y.4
Tian, Q.5
-
24
-
-
84871384422
-
Scalar quantization for large scale image search
-
W. Zhou, Y. Lu, H. Li, and Q. Tian. Scalar quantization for large scale image search. In ACM Multimedia, pages 169-178, 2012.
-
(2012)
ACM Multimedia
, pp. 169-178
-
-
Zhou, W.1
Lu, Y.2
Li, H.3
Tian, Q.4
|