메뉴 건너뛰기




Volumn 2014-September, Issue Septmber, 2014, Pages

Scalable forest hashing for fast similarity search

Author keywords

Approximated Nearest Neighbor Search; Random Projection Trees; Scalable Hashing; Sematic Search

Indexed keywords

CODES (SYMBOLS); HASH FUNCTIONS; NEAREST NEIGHBOR SEARCH; SEMANTICS;

EID: 84937501110     PISSN: 19457871     EISSN: 1945788X     Source Type: Conference Proceeding    
DOI: 10.1109/ICME.2014.6890219     Document Type: Conference Paper
Times cited : (11)

References (22)
  • 1
    • 78649317568 scopus 로고    scopus 로고
    • Product quantization for nearest neighbor search
    • H. Jegou, M. Douze, C. Schmid, " Product quantization for nearest neighbor search," PAMI, 2011
    • (2011) PAMI
    • Jegou, H.1    Douze, M.2    Schmid, C.3
  • 3
    • 79954525255 scopus 로고    scopus 로고
    • Locality sensitive binary codes from shift-invariant kernels
    • M. Raginsky, S. Lazebnik, " Locality Sensitive Binary Codes from Shift-Invariant Kernels," NIPS, 2009
    • (2009) NIPS
    • Raginsky, M.1    Lazebnik, S.2
  • 4
    • 80052874105 scopus 로고    scopus 로고
    • Iterative quantization: A procrustean approach to learning binary codes
    • Y. Gong, S. Lazebnik, " Iterative Quantization: A Procrustean Approach to Learning Binary Codes," CVPR 2011
    • (2011) CVPR
    • Gong, Y.1    Lazebnik, S.2
  • 5
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • J. L. Bentley, "Multidimensional binary search trees used for associative searching, " Communications of the ACM, 18(9):509-517, 1975
    • (1975) Communications of the ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 6
    • 80052885236 scopus 로고    scopus 로고
    • Random maximum margin hashing
    • A. Joly, O. Buisson, "Random maximum margin hashing, " CVPR, 2011
    • (2011) CVPR
    • Joly, A.1    Buisson, O.2
  • 7
    • 0027188633 scopus 로고
    • Data structures and algorithms for nearest neighbor search in general metric spaces
    • P.N. Yianilos, " Data structures and algorithms for nearest neighbor search in general metric spaces," ACM-SIAM Symposium on Discrete algorithms, 1993
    • (1993) ACM-SIAM Symposium on Discrete Algorithms
    • Yianilos, P.N.1
  • 8
    • 85161978528 scopus 로고    scopus 로고
    • Learning the structure of manifolds using random projections
    • Y. Freund, S. Dasgupt a, M. Kabra, and N. Verma, " Learning the structure of manifolds using random projections," NIPS 2007
    • (2007) NIPS
    • Freund, Y.1    Dasgupta, S.2    Kabra, M.3    Verma, N.4
  • 9
    • 80052901697 scopus 로고    scopus 로고
    • Compact hashing with joint optimization of search accuracy and time
    • J. He,S.F. Chang,R. Radhakrishnan,C. Bauer Compact hashing with joint optimization of search accuracy and time CVPR 2011
    • (2011) CVPR
    • He, J.1    Chang, S.F.2    Radhakrishnan, R.3    Bauer, C.4
  • 10
    • 15044355327 scopus 로고    scopus 로고
    • Similarity search in high dimensions via hashing
    • A. Gionis, P. Indyk, R. Motwani, " Similarity Search in High Dimensions via Hashing," VLDB 1999
    • (1999) VLDB
    • Gionis, A.1    Indyk, P.2    Motwani, R.3
  • 11
    • 77956496400 scopus 로고    scopus 로고
    • Sequential projection learning for hashing with compact codes
    • J. Wang, S. Kumar, S.F. Ch ang, " Sequential projection learning for hashing with compact codes," ICML 2010
    • (2010) ICML
    • Wang, J.1    Kumar, S.2    Chang, S.F.3
  • 13
    • 70449560133 scopus 로고    scopus 로고
    • Hamming embedding and weak geometric consistency for large scale image search
    • H. Jegou, M. Douze, C. Schmid, " Hamming embedding and weak geometric consistency for large scale image search," ECCV 2008
    • (2008) ECCV
    • Jegou, H.1    Douze, M.2    Schmid, C.3
  • 14
    • 79959696213 scopus 로고    scopus 로고
    • Learning to hash with binary reconstructive embeddings
    • B. Kulis, T. Darrell, "Learning to hash with binary reconstructive embeddings, " NIPS 2011
    • (2011) NIPS
    • Kulis, B.1    Darrell, T.2
  • 16
    • 80052892990 scopus 로고    scopus 로고
    • Unsupervised random forest indexing for fast action search
    • G.Yu, J.Yuan, Z. Liu, " Unsupervised Random Forest Indexing for Fast Action Search," CVPR 2011
    • (2011) CVPR
    • Yu, G.1    Yuan, J.2    Liu, Z.3
  • 17
    • 0031623888 scopus 로고    scopus 로고
    • On approximating arbitrary metrics by tree metrics
    • Y. Bartal, "On Approximating Arbitrary Metrics By Tree Metrics, " STOC, 1998
    • (1998) STOC
    • Bartal, Y.1
  • 19
    • 84865410773 scopus 로고    scopus 로고
    • Semi-supervised hashing for large scale search
    • J. Wang, S. Kumar, S.F. Chang, " Semi-Supervised Hashing for Large Scale Search," PAMI Vol.34, pp. 2393-2406, 2012
    • (2012) PAMI , vol.34 , pp. 2393-2406
    • Wang, J.1    Kumar, S.2    Chang, S.F.3
  • 20
    • 84860241633 scopus 로고    scopus 로고
    • Kernelized locality-sensitive h ashing
    • B. Kulis, K. Grauman, "Kernelized locality-sensitive h ashing," PAMI Vol.34(6), 2012
    • (2012) PAMI , vol.34 , Issue.6
    • Kulis, B.1    Grauman, K.2
  • 21
    • 51949097915 scopus 로고    scopus 로고
    • Optimised kd-trees for fast image descriptor matching
    • C. Silpa-Anan, R. Hartley, "Optimised KD-trees for fast image descriptor matching, " CVPR, 2008
    • (2008) CVPR
    • Silpa-Anan, C.1    Hartley, R.2
  • 22
    • 79957463368 scopus 로고    scopus 로고
    • Fast action detection via discriminative random forest voting and top-k subvolume search
    • G. Yu, A. Norberto, J. Yuan, Z. Liu, " Fast Action Detection via Discriminative Random Forest Voting and Top-K Subvolume Search," IEEE Trans. on Multimedia, Vol.13, Issue 3, pp. 507-517, 2011
    • (2011) IEEE Trans. on Multimedia , vol.13 , Issue.3 , pp. 507-517
    • Yu, G.1    Norberto, A.2    Yuan, J.3    Liu, Z.4


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