메뉴 건너뛰기




Volumn , Issue , 2013, Pages 2938-2945

K-means hashing: An affinity-preserving quantization method for learning binary compact codes

Author keywords

binary embedding; hash; nearest neighbor search

Indexed keywords

BINARY EMBEDDING; DATA SIMILARITY; ENCODING METHODS; HASH; HASHING FUNCTIONS; K-MEANS ALGORITHM; K-MEANS CLUSTERING; NEAREST NEIGHBOR SEARCH;

EID: 84887359482     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2013.378     Document Type: Conference Paper
Times cited : (444)

References (31)
  • 1
    • 38749118638 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • IEEE
    • A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS, pages 459-468. IEEE, 2006.
    • (2006) FOCS , pp. 459-468
    • Andoni, A.1    Indyk, P.2
  • 2
    • 51949090223 scopus 로고    scopus 로고
    • In defense of nearest-neighbor based image classification
    • O. Boiman, E. Shechtman, and M. Irani. In defense of nearest-neighbor based image classification. In CVPR, pages 1-8, 2008.
    • (2008) CVPR , pp. 1-8
    • Boiman, O.1    Shechtman, E.2    Irani, M.3
  • 3
    • 77955994559 scopus 로고    scopus 로고
    • Transform coding for fast approximate nearest neighbor search in high dimensions
    • J. Brandt. Transform coding for fast approximate nearest neighbor search in high dimensions. In CVPR, pages 1815-1822, 2010.
    • (2010) CVPR , pp. 1815-1822
    • Brandt, J.1
  • 4
    • 84887348338 scopus 로고    scopus 로고
    • Optimized product quantization for approximate nearest neighbor search
    • T. Ge, K. He, Q. Ke, and J. Sun. Optimized product quantization for approximate nearest neighbor search. In CVPR, 2013.
    • (2013) CVPR
    • Ge, T.1    He, K.2    Ke, Q.3    Sun, J.4
  • 5
    • 80052874105 scopus 로고    scopus 로고
    • Iterative quantization: A procrustean approach to learning binary codes
    • Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, pages 817-824, 2011.
    • (2011) CVPR , pp. 817-824
    • Gong, Y.1    Lazebnik, S.2
  • 7
    • 0021412027 scopus 로고
    • Vector quantization
    • R. Gray. Vector quantization. ASSP Magazine, IEEE, 1(2):4-29, 1984.
    • (1984) ASSP Magazine, IEEE , vol.1 , Issue.2 , pp. 4-29
    • Gray, R.1
  • 8
    • 84866651203 scopus 로고    scopus 로고
    • Mobile product search with bag of hash bits and boundary reranking
    • J. He, J. Feng, X. Liu, T. Cheng, T.-H. Lin, H. Chung, and S.-F. Chang. Mobile product search with bag of hash bits and boundary reranking. In CVPR, pages 3005-3012, 2012.
    • (2012) CVPR , pp. 3005-3012
    • He, J.1    Feng, J.2    Liu, X.3    Cheng, T.4    Lin, T.-H.5    Chung, H.6    Chang, S.-F.7
  • 9
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, pages 604-613, 1998.
    • (1998) STOC , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 10
    • 78649317568 scopus 로고    scopus 로고
    • Product quantization for nearest neighbor search
    • H. Jegou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. TPAMI, 33, 2011.
    • (2011) Int PAMI , vol.33
    • Jegou, H.1    Douze, M.2    Schmid, C.3
  • 11
    • 77956004473 scopus 로고    scopus 로고
    • Aggregating local descriptors into a compact image representation
    • H. Jegou, M. Douze, C. Schmid, and P. Perez. Aggregating local descriptors into a compact image representation. In CVPR, pages 3304-3311, 2010.
    • (2010) CVPR , pp. 3304-3311
    • Jegou, H.1    Douze, M.2    Schmid, C.3    Perez, P.4
  • 12
    • 80051606616 scopus 로고    scopus 로고
    • Searching in one billion vectors: Re-rank with source coding
    • H. Jegou, R. Tavenard, M. Douze, and L. Amsaleg. Searching in one billion vectors: re-rank with source coding. In ICASSP, pages 861-864, 2011.
    • (2011) ICASSP , pp. 861-864
    • Jegou, H.1    Tavenard, R.2    Douze, M.3    Amsaleg, L.4
  • 14
    • 77953184849 scopus 로고    scopus 로고
    • Kernelized locality-sensitive hashing for scalable image search
    • B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In ICCV, 2009.
    • (2009) ICCV
    • Kulis, B.1    Grauman, K.2
  • 17
    • 3042535216 scopus 로고    scopus 로고
    • 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
  • 19
    • 80053457714 scopus 로고    scopus 로고
    • Minimal loss hashing for compact binary codes
    • M. E. Norouzi and D. J. Fleet. Minimal loss hashing for compact binary codes. In ICML, pages 353-360, 2011.
    • (2011) ICML , pp. 353-360
    • Norouzi, M.E.1    Fleet, D.J.2
  • 20
    • 84866714589 scopus 로고    scopus 로고
    • Fast search in hamming space with multi-index hashing
    • M. E. Norouzi, A. Punjani, and D. J. Fleet. Fast search in hamming space with multi-index hashing. In CVPR, 2012.
    • (2012) CVPR
    • Norouzi, M.E.1    Punjani, A.2    Fleet, D.J.3
  • 21
    • 0035328421 scopus 로고    scopus 로고
    • Modeling the shape of the scene: A holistic representation of the spatial envelope
    • A. Oliva and A. Torralba. Modeling the shape of the scene: a holistic representation of the spatial envelope. IJCV, 42:145-175, 2001.
    • (2001) IJCV , vol.42 , pp. 145-175
    • Oliva, A.1    Torralba, A.2
  • 22
    • 77953324416 scopus 로고    scopus 로고
    • Locality sensitive hashing: A comparison of hash function types and querying mechanisms
    • L. Paulevé, H. Jégou, and L. Amsaleg. Locality sensitive hashing: a comparison of hash function types and querying mechanisms. PR Letters, 2010.
    • (2010) PR Letters
    • Paulevé, L.1    Jégou, H.2    Amsaleg, L.3
  • 23
    • 34948815101 scopus 로고    scopus 로고
    • Fisher kernels on visual vocabularies for image categorization
    • F. Perronnin and C. Dance. Fisher kernels on visual vocabularies for image categorization. In CVPR, 2007.
    • (2007) CVPR
    • Perronnin, F.1    Dance, C.2
  • 26
    • 84968497764 scopus 로고
    • Conditioning of quasi-newton methods for function minimization
    • D. Shanno et al. Conditioning of quasi-newton methods for function minimization. Mathematics of computation, 24(111):647-656, 1970.
    • (1970) Mathematics of Computation , vol.24 , Issue.111 , pp. 647-656
    • Shanno, D.1
  • 27
    • 0345414182 scopus 로고    scopus 로고
    • Video google: A text retrieval approach to object matching in videos
    • J. Sivic and A. Zisserman. Video google: a text retrieval approach to object matching in videos. In ICCV, 2003.
    • (2003) ICCV
    • Sivic, J.1    Zisserman, A.2
  • 28
    • 54749092170 scopus 로고    scopus 로고
    • 80 million tiny images: A large data set for nonparametric object and scene recognition
    • A. B. Torralba, R. Fergus, and W. T. Freeman. 80 million tiny images: A large data set for nonparametric object and scene recognition. TPAMI, 30:1958-1970, 2008.
    • (2008) TPAMI , vol.30 , pp. 1958-1970
    • Torralba, A.B.1    Fergus, R.2    Freeman, W.T.3
  • 29
    • 77955988108 scopus 로고    scopus 로고
    • Semi-supervised hashing for scalable image retrieval
    • J. Wang, S. Kumar, and S.-F. Chang. Semi-supervised hashing for scalable image retrieval. In CVPR, 2010.
    • (2010) CVPR
    • Wang, J.1    Kumar, S.2    Chang, S.-F.3
  • 30
    • 84890392701 scopus 로고    scopus 로고
    • Multidimensional spectral hashing
    • Y. Weiss, R. Fergus, and A. Torralba. Multidimensional spectral hashing. In ECCV, 2012.
    • (2012) ECCV
    • Weiss, Y.1    Fergus, R.2    Torralba, A.3
  • 31


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.