Positive Semidefinite Metric Learning with Boosting

Details Positive Semidefinite Metric Learning with Boosting Positive Semidefinite Metric Learning with Boosting

2009-10-13

arxiv.org/abs/0910.2279v1

Computer Science

Computer Vision and Pattern Recognition

11 pages, Twenty-Third Annual Conference on Neural Information Processing Systems (NIPS 2009), Vancouver, Canada

Scientific paper

The learning of appropriate distance metrics is a critical problem in image classification and retrieval. In this work, we propose a boosting-based technique, termed \BoostMetric, for learning a Mahalanobis distance metric. One of the primary difficulties in learning such a metric is to ensure that the Mahalanobis matrix remains positive semidefinite. Semidefinite programming is sometimes used to enforce this constraint, but does not scale well. \BoostMetric is instead based on a key observation that any positive semidefinite matrix can be decomposed into a linear positive combination of trace-one rank-one matrices. \BoostMetric thus uses rank-one positive semidefinite matrices as weak learners within an efficient and scalable boosting-based learning process. The resulting method is easy to implement, does not require tuning, and can accommodate various types of constraints. Experiments on various datasets show that the proposed algorithm compares favorably to those state-of-the-art methods in terms of classification accuracy and running time.

Affiliated with

Also associated with

No associations

Rating

Positive Semidefinite Metric Learning with Boosting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Positive Semidefinite Metric Learning with Boosting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Positive Semidefinite Metric Learning with Boosting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-640015