Visual recognition using mappings that replicate margins

Lior Wolf, Nathan Manor

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the problem of learning to map between two vector spaces given pairs of matching vectors, one from each space. This problem naturally arises in numerous vision problems, for example, when mapping between the images of two cameras, or when the annotations of each image is multidimensional. We focus on the common asymmetric case, where one vector space X is more informative than the other Y, and find a transformation from Y to X. We present a new optimization problem that aims to replicate in the transformed Y the margins that dominate the structure of X. This optimization problem is convex, and efficient algorithms are presented. Links to various existing methods such as CCA and SVM are drawn, and the effectiveness of the method is demonstrated in several visual domains.

Original languageEnglish
Title of host publication2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010
Pages810-816
Number of pages7
DOIs
StatePublished - 2010
Event2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010 - San Francisco, CA, United States
Duration: 13 Jun 201018 Jun 2010

Publication series

NameProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
ISSN (Print)1063-6919

Conference

Conference2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010
Country/TerritoryUnited States
CitySan Francisco, CA
Period13/06/1018/06/10

Fingerprint

Dive into the research topics of 'Visual recognition using mappings that replicate margins'. Together they form a unique fingerprint.

Cite this