|
HKUST Institutional Repository >
Computer Science and Engineering >
CSE Journal/Magazine Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/2971
|
| Title: | Kernel-based distance metric learning for content-based image retrieval |
| Authors: | Chang, Hong
Yeung, Dit-Yan |
| Keywords: | Metric learning
Kernel method
Content-based image retrieval
Relevance feedback |
| Issue Date: | 2006 |
| Citation: | Image and Vision Computing, v. 25, no. 5, May 2007, P. 695-703 |
| Abstract: | For a specific set of features chosen for representing images, the performance of a content-based image retrieval (CBIR) system depends critically on the similarity or dissimilarity measure used. Instead of manually choosing a distance function in advance, a more promising approach is to learn a good distance function from data automatically. In this paper, we propose a kernel approach to improve the retrieval performance of CBIR systems by learning a distance metric based on pairwise constraints between images as supervisory information. Unlike most existing metric learning methods which learn a Mahalanobis metric corresponding to performing linear transformation in the original image space, we define the transformation in the kernel-induced feature space which is nonlinearly related to the image space. Experiments performed on two real-world image databases show that our method not only improves the retrieval performance of Euclidean distance without distance learning, but it also outperforms other distance learning methods significantly due to its higher flexibility in metric learning. |
| Rights: | Image and Vision Computing © copyright (2006) Elsevier. The Journal's web site is located at http://www.sciencedirect.com/ |
| URI: | http://hdl.handle.net/1783.1/2971 |
| Appears in Collections: | CSE Journal/Magazine Articles
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| paperKernel.pdf | pre-published version | 552Kb | Adobe PDF | View/Open |
|
Find published version via |
All items in this Repository are protected by copyright, with all rights reserved.
|
