Publication Type

Conference Proceeding Article

Version

acceptedVersion

Publication Date

6-2006

Abstract

Relevant Component Analysis (RCA) has been proposed for learning distance metrics with contextual constraints for image retrieval. However, RCA has two important disadvantages. One is the lack of exploiting negative constraints which can also be informative, and the other is its incapability of capturing complex nonlinear relationships between data instances with the contextual information. In this paper, we propose two algorithms to overcome these two disadvantages, i.e., Discriminative Component Analysis (DCA) and Kernel DCA. Compared with other complicated methods for distance metric learning, our algorithms are rather simple to understand and very easy to solve. We evaluate the performance of our algorithms on image retrieval in which experimental results show that our algorithms are effective and promising in learning good quality distance metrics for image retrieval.

Keywords

Algorithm design and analysis, Asia, Clustering algorithms, Euclidean distance, Image analysis, Image retrieval, Information retrieval, Kernel, Machine learning algorithms, Shape

Discipline

Computer Sciences | Databases and Information Systems

Research Areas

Data Science and Engineering

Publication

CVPR 2006: IEEE International Conference on Computer Vision and Pattern Recognition: Proceedings: New York, 17-22 June

First Page

2072

Last Page

2078

ISBN

9780769525976

Identifier

10.1109/CVPR.2006.167

Publisher

IEEE Computer Society

City or Country

Los Alamitos, CA

Copyright Owner and License

Authors

Additional URL

https://doi.ieeecomputersociety.org/10.1109/CVPR.2006.167

Download

Share

COinS