15 search results - page 2 / 3 » Sperner labellings: A combinatorial approach |
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
MIAR
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
MICCAI
2007
Springer
14 years 8 months ago
2007
Springer
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
CORR
2008
Springer
13 years 8 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 ...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds wi...