Online Multiple Kernel Similarity Learning for Visual Search. Xia, H., Hoi, S., Jin, R., & Zhao, P. IEEE Transactions on Pattern Analysis and Machine Intelligence, 36(3):536--549, March, 2014. 00004doi abstract bibtex Recent years have witnessed a number of studies on distance metric learning to improve visual similarity search in content-based image retrieval (CBIR). Despite their successes, most existing methods on distance metric learning are limited in two aspects. First, they usually assume the target proximity function follows the family of Mahalanobis distances, which limits their capacity of measuring similarity of complex patterns in real applications. Second, they often cannot effectively handle the similarity measure of multimodal data that may originate from multiple resources. To overcome these limitations, this paper investigates an online kernel similarity learning framework for learning kernel-based proximity functions which goes beyond the conventional linear distance metric learning approaches. Based on the framework, we propose a novel online multiple kernel similarity (OMKS) learning method which learns a flexible nonlinear proximity function with multiple kernels to improve visual similarity search in CBIR. We evaluate the proposed technique for CBIR on a variety of image data sets in which encouraging results show that OMKS outperforms the state-of-the-art techniques significantly.
@article{ xia_online_2014,
title = {Online {Multiple} {Kernel} {Similarity} {Learning} for {Visual} {Search}},
volume = {36},
issn = {0162-8828},
doi = {10.1109/TPAMI.2013.149},
abstract = {Recent years have witnessed a number of studies on distance metric learning to improve visual similarity search in content-based image retrieval (CBIR). Despite their successes, most existing methods on distance metric learning are limited in two aspects. First, they usually assume the target proximity function follows the family of Mahalanobis distances, which limits their capacity of measuring similarity of complex patterns in real applications. Second, they often cannot effectively handle the similarity measure of multimodal data that may originate from multiple resources. To overcome these limitations, this paper investigates an online kernel similarity learning framework for learning kernel-based proximity functions which goes beyond the conventional linear distance metric learning approaches. Based on the framework, we propose a novel online multiple kernel similarity (OMKS) learning method which learns a flexible nonlinear proximity function with multiple kernels to improve visual similarity search in CBIR. We evaluate the proposed technique for CBIR on a variety of image data sets in which encouraging results show that OMKS outperforms the state-of-the-art techniques significantly.},
number = {3},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
author = {Xia, Hao and Hoi, S.C.H. and Jin, Rong and Zhao, Peilin},
month = {March},
year = {2014},
note = {00004},
pages = {536--549}
}
Downloads: 0
{"_id":"R7uEaCKYNTkM9FgQk","bibbaseid":"xia-hoi-jin-zhao-onlinemultiplekernelsimilaritylearningforvisualsearch-2014","downloads":0,"creationDate":"2015-09-03T07:18:47.163Z","title":"Online Multiple Kernel Similarity Learning for Visual Search","author_short":["Xia, H.","Hoi, S.","Jin, R.","Zhao, P."],"year":2014,"bibtype":"article","biburl":"http://bibbase.org/zotero/fred.qi","bibdata":{"abstract":"Recent years have witnessed a number of studies on distance metric learning to improve visual similarity search in content-based image retrieval (CBIR). Despite their successes, most existing methods on distance metric learning are limited in two aspects. First, they usually assume the target proximity function follows the family of Mahalanobis distances, which limits their capacity of measuring similarity of complex patterns in real applications. Second, they often cannot effectively handle the similarity measure of multimodal data that may originate from multiple resources. To overcome these limitations, this paper investigates an online kernel similarity learning framework for learning kernel-based proximity functions which goes beyond the conventional linear distance metric learning approaches. Based on the framework, we propose a novel online multiple kernel similarity (OMKS) learning method which learns a flexible nonlinear proximity function with multiple kernels to improve visual similarity search in CBIR. We evaluate the proposed technique for CBIR on a variety of image data sets in which encouraging results show that OMKS outperforms the state-of-the-art techniques significantly.","author":["Xia, Hao","Hoi, S.C.H.","Jin, Rong","Zhao, Peilin"],"author_short":["Xia, H.","Hoi, S.","Jin, R.","Zhao, P."],"bibtex":"@article{ xia_online_2014,\n title = {Online {Multiple} {Kernel} {Similarity} {Learning} for {Visual} {Search}},\n volume = {36},\n issn = {0162-8828},\n doi = {10.1109/TPAMI.2013.149},\n abstract = {Recent years have witnessed a number of studies on distance metric learning to improve visual similarity search in content-based image retrieval (CBIR). Despite their successes, most existing methods on distance metric learning are limited in two aspects. First, they usually assume the target proximity function follows the family of Mahalanobis distances, which limits their capacity of measuring similarity of complex patterns in real applications. Second, they often cannot effectively handle the similarity measure of multimodal data that may originate from multiple resources. To overcome these limitations, this paper investigates an online kernel similarity learning framework for learning kernel-based proximity functions which goes beyond the conventional linear distance metric learning approaches. Based on the framework, we propose a novel online multiple kernel similarity (OMKS) learning method which learns a flexible nonlinear proximity function with multiple kernels to improve visual similarity search in CBIR. We evaluate the proposed technique for CBIR on a variety of image data sets in which encouraging results show that OMKS outperforms the state-of-the-art techniques significantly.},\n number = {3},\n journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},\n author = {Xia, Hao and Hoi, S.C.H. and Jin, Rong and Zhao, Peilin},\n month = {March},\n year = {2014},\n note = {00004},\n pages = {536--549}\n}","bibtype":"article","doi":"10.1109/TPAMI.2013.149","id":"xia_online_2014","issn":"0162-8828","journal":"IEEE Transactions on Pattern Analysis and Machine Intelligence","key":"xia_online_2014","month":"March","note":"00004","number":"3","pages":"536--549","title":"Online Multiple Kernel Similarity Learning for Visual Search","type":"article","volume":"36","year":"2014","bibbaseid":"xia-hoi-jin-zhao-onlinemultiplekernelsimilaritylearningforvisualsearch-2014","role":"author","urls":{},"downloads":0},"search_terms":["online","multiple","kernel","similarity","learning","visual","search","xia","hoi","jin","zhao"],"keywords":[],"authorIDs":[],"dataSources":["y8en6y5RHukfeLuPH"]}