32 search results - page 3 / 7 » Convex relaxations for quadratic distance problems |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
CVPR
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
JMLR
2006
13 years 6 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
We introduce a linearly weighted variant of the total
variation for vector fields in order to formulate regularizers
for multi-class labeling problems with non-trivial interclass...
CVPR
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...