A Scalable Algorithm for Learning a Mahalanobis Distance Metric
A distance metric that can accurately reflect the intrinsic characteristics of data is critical for visual recognition tasks. An effective solution to defining such a metric is to learn it from a set of training samples. In this work, we propose a fast and scalable algorithm to learn a Mahalanobis distance. By employing the principle of margin maximization to secure better generalization performances, this algorithm formulates the metric learning as a convex optimization problem with a positive...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of Asian Conference on Computer Vision (ACCV 2009)|
|01_Kim_A_Scalable_Algorithm_for_2009.pdf||235.35 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.