81 search results - page 8 / 17 » Efficient Shape Matching Via Graph Cuts |
CIARP
2009
Springer
13 years 4 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
ICIP
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
CVPR
2007
IEEE
14 years 8 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
DAGSTUHL
2006
13 years 8 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
MICCAI
2010
Springer
14 years 15 days ago
2010
Springer
While there has been substantial progress in segmenting natural im-
ages, state-of-the-art methods that perform well in such tasks unfortunately tend
to underperform ...