Sciweavers

2702 search results - page 420 / 541
» constraints 2008
Sort
View
CVPR
2008
IEEE
15 years 12 months ago
Superpixel lattices
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Ideally, every pixel within each superpixel region will be...
Alastair P. Moore, Simon Prince, Jonathan Warrell,...
CVPR
2008
IEEE
15 years 12 months ago
Object recognition and segmentation by non-rigid quasi-dense matching
In this paper, we present a non-rigid quasi-dense matching method and its application to object recognition and segmentation. The matching method is based on the match propagation...
Esa Rahtu, Janne Heikkilä, Juho Kannala, Sami...
CVPR
2008
IEEE
15 years 12 months ago
Globally optimal shape-based tracking in real-time
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
Thomas Schoenemann, Daniel Cremers
CVPR
2008
IEEE
15 years 12 months ago
Coherent Laplacian 3-D protrusion segmentation
In this paper, an analysis of locally linear embedding (LLE) in the context of clustering is developed. As LLE conserves the local affine coordinates of points, shape protrusions ...
Fabio Cuzzolin, Diana Mateus, David Knossow, Edmon...
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
15 years 12 months ago
Graph cut based image segmentation with connectivity priors
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...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother