2219 search results - page 147 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
140
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
118
Voted
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
132
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
146
Voted
CVPR
2009
IEEE
15 years 9 months ago
2009
IEEE
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
153
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...