299 search results - page 3 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
IVC
2007
13 years 5 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
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...
PAMI
2011
13 years 7 days ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
CVPR
2011
IEEE
12 years 9 months ago
2011
IEEE
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...