메뉴 건너뛰기




Volumn , Issue , 2014, Pages 415-424

Latent semantic sparse hashing for cross-modal similarity search

Author keywords

Correlation; Cross modal retrieval; Hashing; Heterogeneous data sources; Matrix factorization; Sparse coding

Indexed keywords

ABSTRACTING; CODES (SYMBOLS); CORRELATION METHODS; HASH FUNCTIONS; IMAGE CODING; INFORMATION RETRIEVAL; SEMANTICS;

EID: 84904546285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2600428.2609610     Document Type: Conference Paper
Times cited : (458)

References (36)
  • 1
    • 38749118638 scopus 로고    scopus 로고
    • 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 FOCS'06, 2006.
    • (2006) FOCS'06
    • Andoni, A.1    Indyk, P.2
  • 2
    • 0141607824 scopus 로고    scopus 로고
    • Latent dirichlet allocation
    • D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. JMLR, 3:993-1022, 2003.
    • (2003) JMLR , vol.3 , pp. 993-1022
    • Blei, D.M.1    Ng, A.Y.2    Jordan, M.I.3
  • 3
    • 77955989956 scopus 로고    scopus 로고
    • Data fusion through cross-modality metric learning using similarity-sensitive hashing
    • IEEE
    • M. M. Bronstein, A. M. Bronstein, F. Michel, and N. Paragios. Data fusion through cross-modality metric learning using similarity-sensitive hashing. In CVPR, pages 3594-3601. IEEE, 2010.
    • (2010) CVPR , pp. 3594-3601
    • Bronstein, M.M.1    Bronstein, A.M.2    Michel, F.3    Paragios, N.4
  • 5
    • 51949083563 scopus 로고    scopus 로고
    • Image denoising via sparse and redundant representations over learned dictionaries
    • M. Elad and M. Aharon. Image denoising via sparse and redundant representations over learned dictionaries. TIP, 2006.
    • (2006) TIP
    • Elad, M.1    Aharon, M.2
  • 6
    • 15044355327 scopus 로고    scopus 로고
    • Similarity search in high dimensions via hashing
    • A. Gionis, P. Indyk, R. Motwani, et al. Similarity search in high dimensions via hashing. In VLDB, pages 518-529, 1999.
    • (1999) VLDB , pp. 518-529
    • Gionis, A.1    Indyk, P.2    Motwani, R.3
  • 7
    • 80052874105 scopus 로고    scopus 로고
    • Iterative quantization: A procrustean approach to learning binary codes
    • IEEE
    • Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, pages 817-824. IEEE, 2011.
    • (2011) CVPR , pp. 817-824
    • Gong, Y.1    Lazebnik, S.2
  • 8
    • 84887359482 scopus 로고    scopus 로고
    • K-means hashing: An affinity-preserving quantization method for learning binary compact codes
    • K. He, F. Wen, and J. Sun. K-means hashing: an affinity-preserving quantization method for learning binary compact codes. In CVPR, 2013.
    • (2013) CVPR
    • He, K.1    Wen, F.2    Sun, J.3
  • 9
    • 0000107975 scopus 로고
    • Relations between two sets of variates
    • H. Hotelling. Relations between two sets of variates. Biometrika, 1936.
    • (1936) Biometrika
    • Hotelling, H.1
  • 10
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • ACM
    • P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STC. ACM, 1998.
    • (1998) STC
    • Indyk, P.1    Motwani, R.2
  • 11
    • 84867846122 scopus 로고    scopus 로고
    • Sequential spectral learning to hash with multiple representations
    • Springer
    • S. Kim, Y. Kang, and S. Choi. Sequential spectral learning to hash with multiple representations. In ECCV, pages 538-551. Springer, 2012.
    • (2012) ECCV , pp. 538-551
    • Kim, S.1    Kang, Y.2    Choi, S.3
  • 12
    • 85167448559 scopus 로고    scopus 로고
    • Double-bit quantization for hashing
    • W. Kong and W.-J. Li. Double-bit quantization for hashing. In AAAI, 2012.
    • (2012) AAAI
    • Kong, W.1    Li, W.-J.2
  • 13
    • 77953184849 scopus 로고    scopus 로고
    • Kernelized locality-sensitive hashing for scalable image search
    • IEEE
    • B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In ICCV, pages 2130-2137. IEEE, 2009.
    • (2009) ICCV , pp. 2130-2137
    • Kulis, B.1    Grauman, K.2
  • 14
    • 84866034209 scopus 로고    scopus 로고
    • Learning hash functions for cross-view similarity search
    • S. Kumar and R. Udupa. Learning hash functions for cross-view similarity search. In IJCAI, 2011.
    • (2011) IJCAI
    • Kumar, S.1    Udupa, R.2
  • 15
    • 85147175076 scopus 로고    scopus 로고
    • Efficient sparse coding algorithms
    • H. Lee, A. Battle, R. Raina, and A. Ng. Efficient sparse coding algorithms. In NIPS, 2006.
    • (2006) NIPS
    • Lee, H.1    Battle, A.2    Raina, R.3    Ng, A.4
  • 16
    • 84866726818 scopus 로고    scopus 로고
    • Supervised hashing with kernels
    • IEEE
    • W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang. Supervised hashing with kernels. In CVPR, pages 2074-2081. IEEE, 2012.
    • (2012) CVPR , pp. 2074-2081
    • Liu, W.1    Wang, J.2    Ji, R.3    Jiang, Y.-G.4    Chang, S.-F.5
  • 18
    • 3042535216 scopus 로고    scopus 로고
    • Distinctive image features from scale-invariant keypoints
    • D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 60(2):91-110, 2004.
    • (2004) IJCV , vol.60 , Issue.2 , pp. 91-110
    • Lowe, D.G.1
  • 19
    • 84867695659 scopus 로고    scopus 로고
    • Latent semantic learning by efficient sparse coding with hypergraph regularization
    • Z. Lu and Y. Peng. Latent semantic learning by efficient sparse coding with hypergraph regularization. In AAAI, 2011.
    • (2011) AAAI
    • Lu, Z.1    Peng, Y.2
  • 21
    • 0035328421 scopus 로고    scopus 로고
    • Modeling the shape of the scene: A holistic representation of the spatial envelope
    • A. Oliva and T.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, T.2
  • 22
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed by v1?
    • B. A. Olshausen and D. J. Field. Sparse coding with an overcomplete basis set: A strategy employed by v1? Vision research, 1997.
    • (1997) Vision Research
    • Olshausen, B.A.1    Field, D.J.2
  • 25
    • 67449128732 scopus 로고    scopus 로고
    • Semantic hashing
    • R. Salakhutdinov and G. Hinton. Semantic hashing. IJAR, 50(7):969-978, 2009.
    • (2009) IJAR , vol.50 , Issue.7 , pp. 969-978
    • Salakhutdinov, R.1    Hinton, G.2
  • 26
    • 0345414554 scopus 로고    scopus 로고
    • Fast pose estimation with parameter-sensitive hashing
    • IEEE
    • G. Shakhnarovich, P. Viola, and T. Darrell. Fast pose estimation with parameter-sensitive hashing. In ICCV. IEEE, 2003.
    • (2003) ICCV
    • Shakhnarovich, G.1    Viola, P.2    Darrell, T.3
  • 27
    • 84880548516 scopus 로고    scopus 로고
    • Inter-media hashing for large-scale retrieval from heterogeneous data sources
    • ACM
    • J. Song, Y. Yang, Y. Yang, Z. Huang, and H. T. Shen. Inter-media hashing for large-scale retrieval from heterogeneous data sources. In ICMD. ACM, 2013.
    • (2013) ICMD
    • Song, J.1    Yang, Y.2    Yang, Y.3    Huang, Z.4    Shen, H.T.5
  • 28
    • 74049158146 scopus 로고    scopus 로고
    • Nus-wide: A real-world web image database from national university of singapore
    • R. H. H. L. Z. L. T. Chua, J. Tang and Y. Zheng. Nus-wide: A real-world web image database from national university of singapore. In CIVR, 2009.
    • (2009) CIVR
    • Chua, R.H.H.L.Z.L.T.1    Tang, J.2    Zheng, Y.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
  • 31
    • 70450209196 scopus 로고    scopus 로고
    • Linear spatial pyramid matching using sparse coding for image classification
    • IEEE
    • J. Yang, K. Yu, Y. Gong, and T. Huang. Linear spatial pyramid matching using sparse coding for image classification. In CVPR. IEEE, 2009.
    • (2009) CVPR
    • Yang, J.1    Yu, K.2    Gong, Y.3    Huang, T.4
  • 32
    • 80052913149 scopus 로고    scopus 로고
    • Robust sparse coding for face recognition
    • M. Yang, L. Zhang, J. Yang, and D. Zhang. Robust sparse coding for face recognition. In CVPR, 2011.
    • (2011) CVPR
    • Yang, M.1    Zhang, L.2    Yang, J.3    Zhang, D.4
  • 33
    • 80052110460 scopus 로고    scopus 로고
    • Composite hashing with multiple information sources
    • D. Zhang, F. Wang, and L. Si. Composite hashing with multiple information sources. In SIGIR, 2011.
    • (2011) SIGIR
    • Zhang, D.1    Wang, F.2    Si, L.3
  • 34
    • 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 SIGIR, 2010.
    • (2010) SIGIR
    • Zhang, D.1    Wang, J.2    Cai, D.3    Lu, J.4
  • 35
    • 84866037322 scopus 로고    scopus 로고
    • A probabilistic model for multimodal hash function learning
    • Y. Zhen and D. Yang. A probabilistic model for multimodal hash function learning. In SIGKDD, 2012.
    • (2012) SIGKDD
    • Zhen, Y.1    Yang, D.2
  • 36
    • 84877748479 scopus 로고    scopus 로고
    • Co-regularized hashing for multimodal data
    • Y. Zhen and D.-Y. Yeung. Co-regularized hashing for multimodal data. In NIPS, pages 1385-1393, 2012.
    • (2012) NIPS , pp. 1385-1393
    • Zhen, Y.1    Yeung, D.-Y.2


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