메뉴 건너뛰기




Volumn 2015 International Conference on Computer Vision, ICCV 2015, Issue , 2015, Pages 4148-4156

Learning binary codes for maximum inner product search

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; BINS; COMPUTER VISION; IMAGE CODING;

EID: 84962287497     PISSN: 15505499     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2015.472     Document Type: Conference Paper
Times cited : (161)

References (42)
  • 1
    • 33947167478 scopus 로고    scopus 로고
    • Face description with local binary patterns: Application to face recognition
    • T. Ahonen, A. Hadid, and M. Pietikainen. Face description with local binary patterns: Application to face recognition. IEEE TPAMI, 28(12):2037-2041, 2006.
    • (2006) IEEE TPAMI , vol.28 , Issue.12 , pp. 2037-2041
    • Ahonen, T.1    Hadid, A.2    Pietikainen, M.3
  • 2
    • 84911413714 scopus 로고    scopus 로고
    • Additive quantization for extreme vector compression
    • A. Babenko and V. Lempitsky. Additive quantization for extreme vector compression. In Proc. CVPR, pages 931-938, 2014.
    • (2014) Proc. CVPR , pp. 931-938
    • Babenko, A.1    Lempitsky, V.2
  • 5
    • 57349114053 scopus 로고    scopus 로고
    • Asymmetric distance estimation with sketches for similarity search in highdimensional spaces
    • W. Dong, M. Charikar, and K. Li. Asymmetric distance estimation with sketches for similarity search in highdimensional spaces. In Proc. SIGIR, pages 123-130, 2008.
    • (2008) Proc. SIGIR , pp. 123-130
    • Dong, W.1    Charikar, M.2    Li, K.3
  • 6
    • 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, pages 2946-2953, 2013.
    • (2013) CVPR , pp. 2946-2953
    • Ge, T.1    He, K.2    Ke, Q.3    Sun, J.4
  • 7
    • 0001944742 scopus 로고    scopus 로고
    • Similarity search in high dimensions via hashing
    • A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In Proc. VLDB, 1999.
    • (1999) Proc. VLDB
    • Gionis, A.1    Indyk, P.2    Motwani, R.3
  • 8
    • 84887601251 scopus 로고    scopus 로고
    • Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval
    • Y. Gong, S. Lazebnik, A. Gordo, and F. Perronnin. Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE TPAMI, 35(12):2916-2929, 2013.
    • (2013) IEEE TPAMI , vol.35 , Issue.12 , pp. 2916-2929
    • Gong, Y.1    Lazebnik, S.2    Gordo, A.3    Perronnin, F.4
  • 9
    • 84906352772 scopus 로고    scopus 로고
    • Multi-scale orderless pooling of deep convolutional activation features
    • Springer
    • Y. Gong, L. Wang, R. Guo, and S. Lazebnik. Multi-scale orderless pooling of deep convolutional activation features. In Proc. ECCV, pages 392-407. Springer, 2014.
    • (2014) Proc. ECCV , pp. 392-407
    • Gong, Y.1    Wang, L.2    Guo, R.3    Lazebnik, S.4
  • 10
    • 78649317568 scopus 로고    scopus 로고
    • Product quantization for nearest neighbor search
    • H. Jegou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. IEEE TPAMI, 33(1):117-128, 2011.
    • (2011) IEEE TPAMI , vol.33 , Issue.1 , pp. 117-128
    • Jegou, H.1    Douze, M.2    Schmid, C.3
  • 11
    • 80052885236 scopus 로고    scopus 로고
    • Random maximum margin hashing
    • A. Joly and O. Buisson. Random maximum margin hashing. In Proc. CVPR, 2011.
    • (2011) Proc. CVPR
    • Joly, A.1    Buisson, O.2
  • 13
    • 84858740468 scopus 로고    scopus 로고
    • Learning to hash with binary reconstructive embeddings
    • B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In Proc. NIPS, 2009.
    • (2009) Proc. NIPS
    • Kulis, B.1    Darrell, T.2
  • 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 Proc. ICCV, 2009.
    • (2009) Proc. ICCV
    • Kulis, B.1    Grauman, K.2
  • 15
    • 70350618771 scopus 로고    scopus 로고
    • Fast similarity search for learned metrics
    • B. Kulis, P. Jain, and K. Grauman. Fast similarity search for learned metrics. IEEE TPAMI, 31(12):2143-2157, 2009.
    • (2009) IEEE TPAMI , vol.31 , Issue.12 , pp. 2143-2157
    • Kulis, B.1    Jain, P.2    Grauman, K.3
  • 17
    • 84911393360 scopus 로고    scopus 로고
    • Fast supervised hashing with decision trees for highdimensional data
    • G. Lin, C. Shen, Q. Shi, A. van den Hengel, and D. Suter. Fast supervised hashing with decision trees for highdimensional data. In Proc. CVPR, 2014.
    • (2014) Proc. CVPR
    • Lin, G.1    Shen, C.2    Shi, Q.3    Hengel Den Van, A.4    Suter, D.5
  • 21
    • 84911430500 scopus 로고    scopus 로고
    • Collaborative hashing
    • X. Liu, J. He, C. Deng, and B. Lang. Collaborative hashing. In Proc. CVPR, pages 2147-2154, 2014.
    • (2014) Proc. CVPR , pp. 2147-2154
    • Liu, X.1    He, J.2    Deng, C.3    Lang, B.4
  • 22
    • 84887385383 scopus 로고    scopus 로고
    • Hash bit selection: A unified solution for selection problems in hashing
    • X. Liu, J. He, B. Lang, and S.-F. Chang. Hash bit selection: A unified solution for selection problems in hashing. In Proc. CVPR, pages 1570-1577, 2013.
    • (2013) Proc. CVPR , pp. 1570-1577
    • Liu, X.1    He, J.2    Lang, B.3    Chang, S.-F.4
  • 23
    • 84973901375 scopus 로고    scopus 로고
    • Multi-view complementary hash tables for nearest neighbor search
    • X. Liu, L. Huang, C. Deng, J. Lu, and B. Lang. Multi-view complementary hash tables for nearest neighbor search. In Proc. ICCV, 2015.
    • (2015) Proc. ICCV
    • Liu, X.1    Huang, L.2    Deng, C.3    Lu, J.4    Lang, B.5
  • 24
    • 84969931958 scopus 로고    scopus 로고
    • On symmetric and asymmetric lshs for inner product search
    • B. Neyshabur and N. Srebro. On symmetric and asymmetric lshs for inner product search. In Proc. ICML, pages 1926-1934, 2015.
    • (2015) Proc. ICML , pp. 1926-1934
    • Neyshabur, B.1    Srebro, N.2
  • 25
    • 80053457714 scopus 로고    scopus 로고
    • Minimal loss hashing for compact binary codes
    • M. Norouzi and D. M. Blei. Minimal loss hashing for compact binary codes. In Proc. ICML, 2011.
    • (2011) Proc. ICML
    • Norouzi, M.1    Blei, D.M.2
  • 27
    • 84887387629 scopus 로고    scopus 로고
    • Cartesian k-means
    • M. Norouzi and D. J. Fleet. Cartesian k-means. In Proc. CVPR, pages 3017-3024, 2013.
    • (2013) Proc. CVPR , pp. 3017-3024
    • Norouzi, M.1    Fleet, D.J.2
  • 28
    • 79954525255 scopus 로고    scopus 로고
    • Locality-sensitive binary codes from shift-invariant kernels
    • M. Raginsky and S. Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. In Proc. NIPS, 2009.
    • (2009) Proc. NIPS
    • Raginsky, M.1    Lazebnik, S.2
  • 32
    • 84937868714 scopus 로고    scopus 로고
    • Asymmetric lsh (ALSH) for sublinear time maximum inner product search (MIPS)
    • A. Shrivastava and P. Li. Asymmetric lsh (ALSH) for sublinear time maximum inner product search (MIPS). In Proc. NIPS, pages 2321-2329. 2014.
    • (2014) Proc. NIPS , pp. 2321-2329
    • Shrivastava, A.1    Li, P.2
  • 33
    • 84865410773 scopus 로고    scopus 로고
    • Semi-supervised hashing for large scale search
    • J. Wang, S. Kumar, and S.-F. Chang. Semi-supervised hashing for large scale search. IEEE TPAMI, 34(12):2393-2406, 2012.
    • (2012) IEEE TPAMI , vol.34 , Issue.12 , pp. 2393-2406
    • Wang, J.1    Kumar, S.2    Chang, S.-F.3
  • 38
    • 80052899838 scopus 로고    scopus 로고
    • Face recognition in unconstrained videos with matched background similarity
    • L. Wolf, T. Hassner, and I. Maoz. Face recognition in unconstrained videos with matched background similarity. In Proc. CVPR, pages 529-534, 2011.
    • (2011) Proc. CVPR , pp. 529-534
    • Wolf, L.1    Hassner, T.2    Maoz, I.3
  • 39
    • 77955988947 scopus 로고    scopus 로고
    • Sun database: Large-scale scene recognition from abbey to zoo
    • J. Xiao, J. Hays, K. A. Ehinger, A. Oliva, and A. Torralba. Sun database: Large-scale scene recognition from abbey to zoo. In Proc. CVPR, pages 3485-3492, 2010.
    • (2010) Proc. CVPR , pp. 3485-3492
    • Xiao, J.1    Hays, J.2    Ehinger, K.A.3    Oliva, A.4    Torralba, A.5
  • 40
    • 84973906749 scopus 로고    scopus 로고
    • Composite quantization for approximate nearest neighbor search
    • T. Zhang, C. Du, and J. Wang. Composite quantization for approximate nearest neighbor search. In Proc. ICML, pages 838-846, 2014.
    • (2014) Proc. ICML , pp. 838-846
    • Zhang, T.1    Du, C.2    Wang, J.3
  • 41
    • 84959198229 scopus 로고    scopus 로고
    • Sparse composite quantization
    • T. Zhang, G.-J. Qi, J. Tang, and J. Wang. Sparse composite quantization. In Proc. CVPR, pages 4548-4556, 2015.
    • (2015) Proc. CVPR , pp. 4548-4556
    • Zhang, T.1    Qi, G.-J.2    Tang, J.3    Wang, J.4
  • 42
    • 84878612787 scopus 로고    scopus 로고
    • Sparse hashing for fast multimedia search
    • X. Zhu, Z. Huang, H. Cheng, J. Cui, and H. T. Shen. Sparse hashing for fast multimedia search. ACM TOIS, 31(2):9:1-9:24, 2013.
    • (2013) ACM TOIS , vol.31 , Issue.2 , pp. 91-924
    • Zhu, X.1    Huang, Z.2    Cheng, H.3    Cui, J.4    Shen, H.T.5


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