81 search results - page 2 / 17 » Efficient Shape Matching Via Graph Cuts |
ACCV
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
ECCV
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...