메뉴 건너뛰기




Volumn , Issue , 2012, Pages 55-64

Boosting multi-kernel locality-sensitive hashing for scalable image retrieval

Author keywords

high dimensional indexing; image retrieval; kernel methods; locality sensitive hashing

Indexed keywords

CONTENT BASED IMAGE RETRIEVAL; CONTENT-BASED MULTIMEDIA RETRIEVAL; HIGH DIMENSIONAL SPACES; HIGH-DIMENSIONAL INDEXING; KERNEL METHODS; LOCALITY SENSITIVE HASHING; MULTI-KERNEL; MULTIMEDIA APPLICATIONS; MULTIMEDIA RETRIEVAL; MULTIPLE KERNELS; MULTIPLE RESOURCES; RETRIEVAL PERFORMANCE; SIMILARITY SEARCH; SINGLE KERNEL;

EID: 84866607239     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2348283.2348294     Document Type: Conference Paper
Times cited : (36)

References (40)
  • 1
    • 71449106113 scopus 로고    scopus 로고
    • Space-time tradeoffs for approximate nearest neighbor searching
    • S. Arya, T. Malamatos, and D. M. Mount. Space-time tradeoffs for approximate nearest neighbor searching. J. ACM, 57(1):1-54, 2009.
    • (2009) J. ACM , vol.57 , Issue.1 , pp. 1-54
    • Arya, S.1    Malamatos, T.2    Mount, D.M.3
  • 2
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
    • (1975) Commun. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 3
    • 0037870443 scopus 로고    scopus 로고
    • The x-tree: An index structure for high-dimensional data
    • San Francisco, CA, USA
    • S. Berchtold, D. A. Keim, and H.-P. Kriegel. The x-tree: An index structure for high-dimensional data. In VLDB, pages 28-39, San Francisco, CA, USA, 1996.
    • (1996) VLDB , pp. 28-39
    • Berchtold, S.1    Keim, D.A.2    Kriegel, H.-P.3
  • 4
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • C. Böhm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv., 33(3):322-373, 2001.
    • (2001) ACM Comput. Surv. , vol.33 , Issue.3 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.A.3
  • 5
    • 0036501928 scopus 로고    scopus 로고
    • An efficient indexing method for nearest neighbor searches in high-dirnensional image databases
    • G.-H. Cha, X. Zhu, P. Petkovic, and C.-W. Chung. An efficient indexing method for nearest neighbor searches in high-dirnensional image databases. IEEE Transactions on Multimedia, 4(1):76-87, 2002.
    • (2002) IEEE Transactions on Multimedia , vol.4 , Issue.1 , pp. 76-87
    • Cha, G.-H.1    Zhu, X.2    Petkovic, P.3    Chung, C.-W.4
  • 6
    • 0036040277 scopus 로고    scopus 로고
    • Similarity estimation techniques from rounding algorithms
    • M. Charikar. Similarity estimation techniques from rounding algorithms. In STOC, pages 380-388, 2002.
    • (2002) STOC , pp. 380-388
    • Charikar, M.1
  • 7
    • 0024054715 scopus 로고
    • A randomized algorithm for closest-point queries
    • K. L. Clarkson. A randomized algorithm for closest-point queries. SIAM J. Comput., 17(4):830-847, 1988.
    • (1988) SIAM J. Comput. , vol.17 , Issue.4 , pp. 830-847
    • Clarkson, K.L.1
  • 8
    • 14644401112 scopus 로고    scopus 로고
    • Indexing high-dimensional data for efficient in-memory similarity search
    • B. Cui, B. C. Ooi, J. Su, and K.-L. Tan. Indexing high-dimensional data for efficient in-memory similarity search. IEEE Trans. on Knowl. and Data Eng., 17(3):339-353, 2005.
    • (2005) IEEE Trans. on Knowl. and Data Eng. , vol.17 , Issue.3 , pp. 339-353
    • Cui, B.1    Ooi, B.C.2    Su, J.3    Tan, K.-L.4
  • 9
    • 70350566668 scopus 로고    scopus 로고
    • An efficient high-dimensional indexing method for content-based retrieval in large image databases
    • I. Daoudi, K. Idrissi, S. E. Ouatik, A. Baskurt, and D. Aboutajdine. An efficient high-dimensional indexing method for content-based retrieval in large image databases. Image Commun., 24(10):775-790, 2009.
    • (2009) Image Commun. , vol.24 , Issue.10 , pp. 775-790
    • Daoudi, I.1    Idrissi, K.2    Ouatik, S.E.3    Baskurt, A.4    Aboutajdine, D.5
  • 11
    • 57349114053 scopus 로고    scopus 로고
    • Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
    • W. Dong, M. Charikar, and K. Li. Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. In SIGIR, pages 123-130, 2008.
    • (2008) SIGIR , pp. 123-130
    • Dong, W.1    Charikar, M.2    Li, K.3
  • 12
    • 29244453931 scopus 로고    scopus 로고
    • On the nystrom method for approximating a gram matrix for improved kernel-based learning
    • P. Drineas and M. W. Mahoney. On the nystrom method for approximating a gram matrix for improved kernel-based learning. Journal of Machine Learning Research, 6:2005, 2005.
    • (2005) Journal of Machine Learning Research , vol.6 , pp. 2005
    • Drineas, P.1    Mahoney, M.W.2
  • 13
    • 0031211090 scopus 로고    scopus 로고
    • A decision-theoretic generalization of on-line learning and an application to boosting
    • Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci., 55(1):119-139, 1997.
    • (1997) J. Comput. Syst. Sci. , vol.55 , Issue.1 , pp. 119-139
    • Freund, Y.1    Schapire, R.E.2
  • 14
    • 15044355327 scopus 로고    scopus 로고
    • Similarity search in high dimensions via hashing
    • A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, 1999.
    • (1999) VLDB
    • Gionis, A.1    Indyk, P.2    Motwani, R.3
  • 15
    • 34948818208 scopus 로고    scopus 로고
    • Pyramid match hashing: Sub-linear time indexing over partial correspondences
    • K. Grauman and T. Darrell. Pyramid match hashing: Sub-linear time indexing over partial correspondences. In CVPR, 2007.
    • (2007) CVPR
    • Grauman, K.1    Darrell, T.2
  • 16
    • 80052901697 scopus 로고    scopus 로고
    • Compact hashing with joint optimization of search accuracy and time
    • J. He, S.-F. Chang, R. Radhakrishnan, and C. Bauer. Compact hashing with joint optimization of search accuracy and time. In CVPR, pages 753-760, 2011.
    • (2011) CVPR , pp. 753-760
    • He, J.1    Chang, S.-F.2    Radhakrishnan, R.3    Bauer, C.4
  • 17
    • 77956220112 scopus 로고    scopus 로고
    • Scalable similarity search with optimized kernel hashing
    • J. He, W. Liu, and S.-F. Chang. Scalable similarity search with optimized kernel hashing. In KDD, pages 1129-1138, 2010.
    • (2010) KDD , pp. 1129-1138
    • He, J.1    Liu, W.2    Chang, S.-F.3
  • 18
    • 44049089172 scopus 로고    scopus 로고
    • A multimodal and multilevel ranking scheme for large-scale video retrieval
    • S. C. H. Hoi and M. R. Lyu. A multimodal and multilevel ranking scheme for large-scale video retrieval. IEEE Transactions on Multimedia, 10(4):607-619, 2008.
    • (2008) IEEE Transactions on Multimedia , vol.10 , Issue.4 , pp. 607-619
    • Hoi, S.C.H.1    Lyu, M.R.2
  • 19
    • 33644650424 scopus 로고    scopus 로고
    • A unified log-based relevance feedback scheme for image retrieval
    • S. C. H. Hoi, M. R. Lyu, and R. Jin. A unified log-based relevance feedback scheme for image retrieval. IEEE Trans. KDE, 18(4):509-204, 2006.
    • (2006) IEEE Trans. KDE , vol.18 , Issue.4 , pp. 509-1204
    • Hoi, S.C.H.1    Lyu, M.R.2    Jin, R.3
  • 20
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbor: Towards removing the curse of dimensionality
    • P. Indyk and R. Motwani. Approximate nearest neighbor: Towards removing the curse of dimensionality. In STOC, pages 604-613, 1998.
    • (1998) STOC , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 21
    • 56749104169 scopus 로고    scopus 로고
    • Hamming embedding and weak geometric consistency for large scale image search
    • H. Jegou, M. Douze, and C. Schmid. Hamming embedding and weak geometric consistency for large scale image search. In ECCV (1), pages 304-317, 2008.
    • (2008) ECCV , Issue.1 , pp. 304-317
    • Jegou, H.1    Douze, M.2    Schmid, C.3
  • 22
    • 80052885236 scopus 로고    scopus 로고
    • Random maximum margin hashing
    • A. Joly and O. Buisson. Random maximum margin hashing. In CVPR, pages 873-880, 2011.
    • (2011) CVPR , pp. 873-880
    • Joly, A.1    Buisson, O.2
  • 23
    • 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 ICCV, 2009.
    • (2009) ICCV
    • Kulis, B.1    Grauman, K.2
  • 24
    • 33745130042 scopus 로고    scopus 로고
    • Content-based multimedia information retrieval: State of the art and challenges
    • M. S. Lew, N. Sebe, C. Djeraba, and R. Jain. Content-based multimedia information retrieval: State of the art and challenges. ACM Trans. Multimedia Comput. Commun. Appl., 2(1):1-19, 2006.
    • (2006) ACM Trans. Multimedia Comput. Commun. Appl. , vol.2 , Issue.1 , pp. 1-19
    • Lew, M.S.1    Sebe, N.2    Djeraba, C.3    Jain, R.4
  • 25
    • 84955245129 scopus 로고    scopus 로고
    • Multi-probe lsh: Efficient indexing for high-dimensional similarity search
    • Vienna, Austria
    • Q. Lv, W. Josephson, Z. Wang, M. S. Charikar, and K. Li. Multi-probe lsh: efficient indexing for high-dimensional similarity search. In VLDB. Vienna, Austria, 2007.
    • (2007) VLDB
    • Lv, Q.1    Josephson, W.2    Wang, Z.3    Charikar, M.S.4    Li, K.5
  • 26
    • 77955986970 scopus 로고    scopus 로고
    • Weakly-supervised hashing in kernel space
    • Y. Mu, J. Shen, and S. Yan. Weakly-supervised hashing in kernel space. In CVPR, pages 3344-3351, 2010.
    • (2010) CVPR , pp. 3344-3351
    • Mu, Y.1    Shen, J.2    Yan, S.3
  • 27
    • 51949104743 scopus 로고    scopus 로고
    • Fast image search for learned metrics
    • B. K. P. Jain and K. Grauman. Fast image search for learned metrics. In CVPR, 2008.
    • (2008) CVPR
    • Jain, B.K.P.1    Grauman, K.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 NIPS, pages 1509-1517, 2009.
    • (2009) NIPS , pp. 1509-1517
    • Raginsky, M.1    Lazebnik, S.2
  • 29
    • 85010847034 scopus 로고
    • The k-d-b-tree: A search structure for large multi-dimensional dynamic indexes
    • J. T. Robinson. The k-d-b-tree: A search structure for large multi-dimensional dynamic indexes. SIGMOD, pages 10-18, 1981.
    • (1981) SIGMOD , pp. 10-18
    • Robinson, J.T.1
  • 30
    • 0032166448 scopus 로고    scopus 로고
    • Relevance feedback: A power tool in interactive content-based image retrieval
    • Sept.
    • Y. Rui, T. S. Huang, M. Ortega, and S. Mehrotra. Relevance feedback: A power tool in interactive content-based image retrieval. IEEE Trans. CSVT, 8(5):644-655, Sept. 1998.
    • (1998) IEEE Trans. CSVT , vol.8 , Issue.5 , pp. 644-655
    • Rui, Y.1    Huang, T.S.2    Ortega, M.3    Mehrotra, S.4
  • 32
    • 70449535860 scopus 로고    scopus 로고
    • Geometry on probability spaces
    • S. Smale and D.-X. Zhou. Geometry on probability spaces. Constr Approx, 30:311-323, 2009.
    • (2009) Constr Approx , vol.30 , pp. 311-323
    • Smale, S.1    Zhou, D.-X.2
  • 33
  • 34
    • 70849088674 scopus 로고    scopus 로고
    • Quality and efficiency in high dimensional nearest neighbor search
    • Y. Tao, K. Yi, C. Sheng, and P. Kalnis. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD Conference, pages 563-576, 2009.
    • (2009) SIGMOD Conference , pp. 563-576
    • Tao, Y.1    Yi, K.2    Sheng, C.3    Kalnis, P.4
  • 35
    • 0026256261 scopus 로고
    • Satisfying general proximity/similarity queries with metric trees
    • J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40:175-179, 1991.
    • (1991) Information Processing Letters , vol.40 , pp. 175-179
    • Uhlmann, J.K.1
  • 36
    • 77955988108 scopus 로고    scopus 로고
    • Semi-supervised hashing for scalable image retrieval
    • J. Wang, O. Kumar, and S.-F. Chang. Semi-supervised hashing for scalable image retrieval. In CVPR, pages 3424-3431, 2010.
    • (2010) CVPR , pp. 3424-3431
    • Wang, J.1    Kumar, O.2    Chang, S.-F.3
  • 37
    • 78650977832 scopus 로고    scopus 로고
    • S3mkl: Scalable semi-supervised multiple kernel learning for image data mining
    • S. Wang, S. Jiang, Q. Huang, and Q. Tian. S3mkl: scalable semi-supervised multiple kernel learning for image data mining. In ACM Multimedia, pages 163-172, 2010.
    • (2010) ACM Multimedia , pp. 163-172
    • Wang, S.1    Jiang, S.2    Huang, Q.3    Tian, Q.4
  • 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 SIGIR, pages 18-25, 2010.
    • (2010) SIGIR , pp. 18-25
    • Zhang, D.1    Wang, J.2    Cai, D.3    Lu, J.4
  • 40
    • 84455170084 scopus 로고    scopus 로고
    • Modeling social strength in social media community via kernel-based learning
    • J. Zhuang, T. Mei, S. C. H. Hoi, X.-S. Hua, and S. Li. Modeling social strength in social media community via kernel-based learning. In ACM Multimedia, pages 113-122, 2011.
    • (2011) ACM Multimedia , pp. 113-122
    • Zhuang, J.1    Mei, T.2    Hoi, S.C.H.3    Hua, X.-S.4    Li, S.5


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