32 search results - page 2 / 7 » Convex relaxations for quadratic distance problems |
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
EMMCVPR
2005
Springer
13 years 10 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
JGO
2010
13 years 3 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
NIPS
2003
13 years 6 months ago
2003
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...
NIPS
2007
13 years 6 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...