메뉴 건너뛰기




Volumn 19, Issue 2, 2017, Pages 382-392

Hashing with Pairwise Correlation Learning and Reconstruction

Author keywords

Binary codes; correlation learning; correlation reconstruction; hashing

Indexed keywords

BINARY CODES; BINS; CODES (SYMBOLS); HASH FUNCTIONS; SET THEORY; TOPOLOGY;

EID: 85027522454     PISSN: 15209210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMM.2016.2614858     Document Type: Article
Times cited : (14)

References (44)
  • 2
    • 80052874105 scopus 로고    scopus 로고
    • Iterative quantization: A procrustean approach to learning binary codes
    • Jun
    • Y. Gong and S. Lazebnik, "Iterative quantization: A procrustean approach to learning binary codes," in Proc. IEEEConf.Comput.Vis.PatternRecog., Jun. 2011, pp. 817-824.
    • (2011) Proc. IEEEConf.Comput.Vis.PatternRecog , pp. 817-824
    • Gong, Y.1    Lazebnik, S.2
  • 5
    • 84887359482 scopus 로고    scopus 로고
    • K-means hashing: An affinity-preserving quantization method for learning binary compact codes
    • Jun
    • K. He, F. Wen, and J. Sun, "K-means hashing: An affinity-preserving quantization method for learning binary compact codes," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., Jun. 2013, pp. 2938-2945.
    • (2013) Proc. IEEE Conf. Comput. Vis. Pattern Recog , pp. 2938-2945
    • He, K.1    Wen, F.2    Sun, J.3
  • 8
    • 84898791305 scopus 로고    scopus 로고
    • Complementary projection hashing
    • Dec. 1-8
    • Z. Jin et al., "Complementary projection hashing," in Proc. IEEE Int. Conf. Comput. Vis., Dec. 1-8, 2013, pp. 257-264.
    • (2013) Proc. IEEE Int. Conf. Comput. Vis , pp. 257-264
    • Jin, Z.1
  • 11
    • 84906335982 scopus 로고    scopus 로고
    • Graph cuts for supervised binary coding
    • Sep 6-12
    • T. Ge, K. He, and J. Sun, "Graph cuts for supervised binary coding," in Proc. 13th Eur. Conf. Comput. Vis., Part VII, Sep. 6-12, 2014, pp. 250-264.
    • (2014) Proc. 13th Eur. Conf. Comput. Vis. , pp. 250-264
    • Ge, T.1    He, K.2    Sun, J.3
  • 13
    • 84906495994 scopus 로고    scopus 로고
    • Optimizing ranking measures for compact binary code learning
    • Sep. 6-12
    • G. Lin, C. Shen, and J. Wu, "Optimizing ranking measures for compact binary code learning," in Proc. 13th Eur. Conf., Comput. Vis., Part III, Sep. 6-12, 2014, pp. 613-627.
    • (2014) Proc. 13th Eur. Conf., Comput. Vis., Part III , pp. 613-627
    • Lin, G.1    Shen, C.2    Wu, J.3
  • 14
    • 84893377154 scopus 로고    scopus 로고
    • Sparse multi-modal hashing
    • Feb
    • F. Wu et al., "Sparse multi-modal hashing," IEEE Trans. Multimedia, vol. 16, no. 2, pp. 427-439, Feb. 2014.
    • (2014) IEEE Trans. Multimedia , vol.16 , Issue.2 , pp. 427-439
    • Wu, F.1
  • 15
    • 84939232131 scopus 로고    scopus 로고
    • Learning compact hash codes for multimodal representations using orthogonal deep structure
    • Sep
    • D. Wang, P. Cui, M. Ou, and W. Zhu, "Learning compact hash codes for multimodal representations using orthogonal deep structure," IEEE Trans. Multimedia, vol. 17, no. 9, pp. 1404-1416, Sep. 2015.
    • (2015) IEEE Trans. Multimedia , vol.17 , Issue.9 , pp. 1404-1416
    • Wang, D.1    Cui, P.2    Ou, M.3    Zhu, W.4
  • 16
    • 84929304812 scopus 로고    scopus 로고
    • Weighted component hashing of binary aggregated descriptors for fast visual search
    • Jun
    • L. Duan, J. Lin, Z. Wang, T. Huang, and W. Gao, "Weighted component hashing of binary aggregated descriptors for fast visual search," IEEE Trans. Multimedia, vol. 17, no. 6, pp. 828-842, Jun.2015.
    • (2015) IEEE Trans. Multimedia , vol.17 , Issue.6 , pp. 828-842
    • Duan, L.1    Lin, J.2    Wang, Z.3    Huang, T.4    Gao, W.5
  • 17
    • 84942369823 scopus 로고    scopus 로고
    • Fast approximate matching of binary codes with distinctive bits
    • C. C. Yan, H. Xie, B. Zhang, Y. Ma, Q. Dai, and Y. Liu, "Fast approximate matching of binary codes with distinctive bits," Front. Comput. Sci., vol. 9, no. 5, p. 741, 2015.
    • (2015) Front. Comput. Sci , vol.9 , Issue.5 , pp. 741
    • Yan, C.C.1    Xie, H.2    Zhang, B.3    Ma, Y.4    Dai, Q.5    Liu, Y.6
  • 19
    • 80053457714 scopus 로고    scopus 로고
    • Minimal loss hashing for compact binary codes
    • Jun. 28-Jul.2
    • M. Norouzi and D. J. Fleet, "Minimal loss hashing for compact binary codes," in Proc. 28th Int. Conf. Mach. Learn., Jun. 28-Jul.2, 2011, pp. 353-360.
    • (2011) Proc. 28th Int. Conf. Mach. Learn , pp. 353-360
    • Norouzi, M.1    Fleet, D.J.2
  • 20
    • 84865410773 scopus 로고    scopus 로고
    • Semi-supervised hashing for largescale search
    • Dec
    • J. Wang, S. Kumar, and S. Chang, "Semi-supervised hashing for largescale search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 12, pp. 2393-2406, Dec. 2012.
    • (2012) IEEE Trans. Pattern Anal. Mach. Intell , vol.34 , Issue.12 , pp. 2393-2406
    • Wang, J.1    Kumar, S.2    Chang, S.3
  • 24
    • 84867496527 scopus 로고    scopus 로고
    • Learning binary hash codes for large-scale image search
    • NewYork, NY, USA: Springer
    • K. Grauman and R. Fergus, "Learning binary hash codes for large-scale image search," in Machine Learning for Computer Vision, NewYork, NY, USA: Springer, 2013, vol. 411, pp. 49-87.
    • (2013) Machine Learning for Computer Vision , vol.411 , pp. 49-87
    • Grauman, K.1    Fergus, R.2
  • 25
    • 78649317568 scopus 로고    scopus 로고
    • Product quantization for nearest neighbor search
    • Jan
    • H. Jégou, M. Douze, and C. Schmid, "Product quantization for nearest neighbor search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 1, pp. 117-128, Jan.2011.
    • (2011) IEEE Trans. Pattern Anal. Mach. Intell , vol.33 , Issue.1 , pp. 117-128
    • Jégou, H.1    Douze, M.2    Schmid, C.3
  • 27
    • 84911451951 scopus 로고    scopus 로고
    • Locally optimized product quantization for approximate nearest neighbor search
    • Jun.23-28
    • Y. Kalantidis and Y. S. Avrithis, "Locally optimized product quantization for approximate nearest neighbor search," in Proc. 2014 IEEE Conf. Comput. Vis. Pattern Recog., Jun.23-28, 2014, pp. 2329-2336.
    • (2014) Proc. 2014 IEEE Conf. Comput. Vis. Pattern Recog , pp. 2329-2336
    • Kalantidis, Y.1    Avrithis, Y.S.2
  • 28
    • 84954487454 scopus 로고    scopus 로고
    • Optimizing top-k retrieval: Submodularity analysis and search strategies
    • C. Sha, K. Wang, D. Zhang, X. Wang, and A. Zhou, "Optimizing top-k retrieval: Submodularity analysis and search strategies," Front. Comput. Sci., vol. 10, no. 3, p. 477, 2016.
    • (2016) Front. Comput. Sci , vol.10 , Issue.3 , pp. 477
    • Sha, C.1    Wang, K.2    Zhang, D.3    Wang, X.4    Zhou, A.5
  • 29
    • 84858740468 scopus 로고    scopus 로고
    • Learning to hash with binary reconstructive embeddings
    • B. Kulis and T. Darrell, "Learning to hash with binary reconstructive embeddings," in Proc. Adv. Neural Inform. Process. Syst., 2009, pp. 1042-1050.
    • (2009) Proc. Adv. Neural Inform. Process. Syst , pp. 1042-1050
    • Kulis, B.1    Darrell, T.2
  • 30
    • 80053457714 scopus 로고    scopus 로고
    • Minimal loss hashing for compact binary codes
    • M. Norouzi and D. J. Fleet, "Minimal loss hashing for compact binary codes," in Proc. Int. Conf. Mach. Learn., 2011, pp. 353-360.
    • (2011) Proc. Int. Conf. Mach. Learn , pp. 353-360
    • Norouzi, M.1    Fleet, D.J.2
  • 31
    • 84908192527 scopus 로고    scopus 로고
    • Supervised hashing for image retrieval via image representation learning
    • Jul 27-31
    • R. Xia, Y. Pan, H. Lai, C. Liu, and S. Yan, "Supervised hashing for image retrieval via image representation learning," in Proc. 28th AAAI Conf. Artif. Intell., Jul. 27-31, 2014, pp. 2156-2162.
    • (2014) Proc. 28th AAAI Conf. Artif. Intell , pp. 2156-2162
    • Xia, R.1    Pan, Y.2    Lai, H.3    Liu, C.4    Yan, S.5
  • 33
    • 77956529193 scopus 로고    scopus 로고
    • Robust subspace segmentation by low-rank representation
    • G. Liu, Z. Lin, and Y. Yu, "Robust subspace segmentation by low-rank representation," in Proc. Int. Conf. Mach. Learn., 2010, pp. 663-670.
    • (2010) Proc. Int. Conf. Mach. Learn , pp. 663-670
    • Liu, G.1    Lin, Z.2    Yu, Y.3
  • 35
    • 84884541998 scopus 로고    scopus 로고
    • Sparse subspace clustering: Algorithm, theory, and applications
    • Nov
    • E. Elhamifar and R. Vidal, "Sparse subspace clustering: Algorithm, theory, and applications," IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 11, pp. 2765-2781, Nov.2013.
    • (2013) IEEE Trans. Pattern Anal. Mach. Intell , vol.35 , Issue.11 , pp. 2765-2781
    • Elhamifar, E.1    Vidal, R.2
  • 37
    • 84866660023 scopus 로고    scopus 로고
    • Non-negative low rank and sparse graph for semisupervised learning
    • Jun
    • L. Zhuang et al., "Non-negative low rank and sparse graph for semisupervised learning," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., Jun. 2012, pp. 2328-2335.
    • (2012) Proc. IEEE Conf. Comput. Vis. Pattern Recog , pp. 2328-2335
    • Zhuang, L.1
  • 38
    • 0000988974 scopus 로고
    • A generalized solution of the orthogonal procrustes problem
    • P. Schönemann, "A generalized solution of the orthogonal procrustes problem," Psychometrika, vol. 31, no. 1, pp. 1-10, 1966.
    • (1966) Psychometrika , vol.31 , Issue.1 , pp. 1-10
    • Schönemann, P.1
  • 39
    • 84860241633 scopus 로고    scopus 로고
    • Kernelized locality-sensitive hashing
    • Jun
    • B. Kulis and K. Grauman, "Kernelized locality-sensitive hashing," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 6, pp. 1092-1104, Jun. 2012.
    • (2012) IEEE Trans. Pattern Anal. Mach. Intell , vol.34 , Issue.6 , pp. 1092-1104
    • Kulis, B.1    Grauman, K.2
  • 43
    • 84901833048 scopus 로고    scopus 로고
    • Fast exact search in hamming space with multi-index hashing
    • Jun
    • M. Norouzi, A. Punjani, and D. J. Fleet, "Fast exact search in hamming space with multi-index hashing," IEEE Trans. Pattern Anal. Mach. Intell., vol. 36, no. 6, pp. 1107-1119, Jun. 2014.
    • (2014) IEEE Trans. Pattern Anal. Mach. Intell , vol.36 , Issue.6 , pp. 1107-1119
    • Norouzi, M.1    Punjani, A.2    Fleet, D.J.3
  • 44
    • 84960485177 scopus 로고    scopus 로고
    • Supervised hashing using graph cuts and boosted decision trees
    • Nov
    • G. Lin, C. Shen, and A. van den Hengel, "Supervised hashing using graph cuts and boosted decision trees," IEEE Trans. Pattern Anal. Mach. Intell., vol. 37, no. 11, pp. 2317-2331, Nov. 2015.
    • (2015) IEEE Trans. Pattern Anal. Mach. Intell , vol.37 , Issue.11 , pp. 2317-2331
    • Lin, G.1    Shen, C.2    Van den Hengel, A.3


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