Training image classifiers with similarity metrics, linear programming, and minimal supervision
| Autor: | Nadya T. Bliss, Ethan Phelps, Katherine L. Bouman, Karl Ni |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Mahalanobis distance
Optimization problem Contextual image classification Linear programming business.industry Feature vector Pattern recognition Machine learning computer.software_genre Automatic image annotation Convex optimization Artificial intelligence business computer Mathematics Feature detection (computer vision) |
| Zdroj: | ACSCC |
| DOI: | 10.1109/acssc.2012.6489386 |
| Popis: | Image classification is a classical computer vision problem with applications to semantic image annotation, querying, and indexing. Recent and effective generative techniques assume Gaussianity, rely on distance metrics, and estimate distributions, but are unfortunately not convex nor keep computational architecture in mind. We propose image content classification through convex linear programming using similarity metrics rather than commonly-used Mahalanobis distances. The algorithm is solved through a hybrid iterative method that takes advantage of optimization space properties. Our optimization problem uses dot products in the feature space exclusively, and therefore can be extended to non-linear kernel functions in the transductive setting. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|