메뉴 건너뛰기




Volumn 07-12-June-2015, Issue , 2015, Pages 37-45

Supervised Discrete Hashing

Author keywords

[No Author keywords available]

Indexed keywords

BINS; CLUSTERING ALGORITHMS; COMPUTER VISION; DIGITAL STORAGE; HASH FUNCTIONS; IMAGE RETRIEVAL; PATTERN RECOGNITION;

EID: 84951869843     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2015.7298598     Document Type: Conference Paper
Times cited : (1281)

References (40)
  • 1
    • 0042378381 scopus 로고    scopus 로고
    • Laplacian eigenmaps for dimensionality reduction and data representation
    • M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003
    • (2003) Neural Computation , vol.15 , Issue.6 , pp. 1373-1396
    • Belkin, M.1    Niyogi, P.2
  • 2
    • 81855191888 scopus 로고    scopus 로고
    • LDAHash: Improved matching with smaller descriptors
    • M. M. Bronstein and P. Fua. LDAHash: Improved matching with smaller descriptors. IEEE TPAMI, 34(1):66-78, 2012
    • (2012) IEEE TPAMI , vol.34 , Issue.1 , pp. 66-78
    • Bronstein, M.M.1    Fua, P.2
  • 3
    • 0010442827 scopus 로고    scopus 로고
    • On the algorithmic implementation of multiclass kernel-based vector machines
    • K. Crammer and Y. Singer. On the algorithmic implementation of multiclass kernel-based vector machines. JMLR, 2:265-292, 2002
    • (2002) JMLR , vol.2 , pp. 265-292
    • Crammer, K.1    Singer, Y.2
  • 6
    • 50949133669 scopus 로고    scopus 로고
    • Liblinear: A library for large linear classification
    • R. Fan, K. Chang, C. Hsieh, X. Wang, and C. Lin. Liblinear: A library for large linear classification. JMLR, 9:1871-1874, 2008
    • (2008) JMLR , vol.9 , pp. 1871-1874
    • Fan, R.1    Chang, K.2    Hsieh, C.3    Wang, X.4    Lin, C.5
  • 7
    • 85013457758 scopus 로고    scopus 로고
    • Graph cuts for supervised binary coding
    • T. Ge, K. He, and J. Sun. Graph cuts for supervised binary coding. In Proc. ECCV, 2014
    • (2014) Proc. ECCV
    • Ge, T.1    He, K.2    Sun, J.3
  • 8
    • 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
  • 9
    • 84887391600 scopus 로고    scopus 로고
    • Learning binary codes for high-dimensional data using bilinear projections
    • Y. Gong, S. Kumar, H. A. Rowley, and S. Lazebnik. Learning binary codes for high-dimensional data using bilinear projections. In Proc. CVPR, 2013
    • (2013) Proc. CVPR
    • Gong, Y.1    Kumar, S.2    Rowley, H.A.3    Lazebnik, S.4
  • 10
    • 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
  • 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
  • 12
    • 84877741460 scopus 로고    scopus 로고
    • Isotropic hashing
    • W. Kong and W.-J. Li. Isotropic hashing. In NIPS 25, 2012
    • (2012) NIPS , vol.25
    • Kong, W.1    Li, W.-J.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 NIPS 22, 2009
    • (2009) NIPS , vol.22
    • 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 A.Van4    Suter, D.5
  • 18
    • 84898826577 scopus 로고    scopus 로고
    • A general two-step approach to learning-based hashing
    • G. Lin, C. Shen, D. Suter, and A. v. d. Hengel. A general two-step approach to learning-based hashing. In Proc. ICCV, 2013
    • (2013) Proc. ICCV
    • Lin, G.1    Shen, C.2    Suter, D.3    Hengel, A.V.D.4
  • 24
    • 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
  • 26
    • 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(3):145-175, 2001
    • (2001) IJCV , vol.42 , Issue.3 , pp. 145-175
    • Oliva, A.1    Torralba, A.2
  • 27
    • 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 NIPS 22, 2009
    • (2009) NIPS , vol.22
    • Raginsky, M.1    Lazebnik, S.2
  • 28
    • 80052885240 scopus 로고    scopus 로고
    • A direct formulation for totallycorrective multi-class boosting
    • C. Shen and Z. Hao. A direct formulation for totallycorrective multi-class boosting. In Proc. CVPR, 2011
    • (2011) Proc. CVPR
    • Shen, C.1    Hao, Z.2
  • 31
    • 84880548516 scopus 로고    scopus 로고
    • Intermedia hashing for large-scale retrieval from heterogeneous data sources
    • J. Song, Y. Yang, Y. Yang, Z. Huang, and H. T. Shen. Intermedia hashing for large-scale retrieval from heterogeneous data sources. In Proc. SIGMOD, 2013
    • (2013) Proc. SIGMOD
    • Song, J.1    Yang, Y.2    Yang, Y.3    Huang, Z.4    Shen, H.T.5
  • 32
    • 54749092170 scopus 로고    scopus 로고
    • 80 million tiny images: A large data set for nonparametric object and scene recognition
    • A. Torralba, R. Fergus, and W. Freeman. 80 million tiny images: A large data set for nonparametric object and scene recognition. IEEE TPAMI, 30(11):1958-1970, 2008
    • (2008) IEEE TPAMI , vol.30 , Issue.11 , pp. 1958-1970
    • Torralba, A.1    Fergus, R.2    Freeman, W.3
  • 33
    • 57249084011 scopus 로고    scopus 로고
    • Visualizing data using t-SNE
    • L. Van der Maaten and G. Hinton. Visualizing data using t-SNE. JMLR, 9:2579-2605, 2008
    • (2008) JMLR , vol.9 , pp. 2579-2605
    • Maaten Der L.Van1    Hinton, G.2
  • 34
    • 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
  • 36
    • 84908187186 scopus 로고    scopus 로고
    • The role of dimensionality reduction in classification
    • W. Wang and M. A. Carreira-Perpinán. The role of dimensionality reduction in classification. In Proc. AAAI, 2014
    • (2014) Proc. AAAI
    • Wang, W.1    Carreira-Perpinán, M.A.2
  • 39
    • 77956027394 scopus 로고    scopus 로고
    • Self-taught hashing for fast similarity search
    • D. Zhang, J. Wang, D. Cai, and J. Lu. Self-taught hashing for fast similarity search. In Proc. SIGIR, 2010
    • (2010) Proc. SIGIR
    • Zhang, D.1    Wang, J.2    Cai, D.3    Lu, J.4
  • 40
    • 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가 분석하여 추출한 것입니다.