Sciweavers

417 search results - page 26 / 84
» Convex Shape Decomposition
Sort
View
ICIP
2000
IEEE
14 years 9 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
On the Stretch Factor of Convex Delaunay Graphs
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
Prosenjit Bose, Paz Carmi, Sébastien Collet...
CVPR
2010
IEEE
1171views Computer Vision» more  CVPR 2010»
14 years 4 months ago
Geodesic Star Convexity for Interactive Image Segmentation
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...
ANOR
2006
69views more  ANOR 2006»
13 years 7 months ago
A splitting method for stochastic programs
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...
Teemu Pennanen, Markku Kallio
CVPR
2008
IEEE
14 years 9 months ago
Matching non-rigidly deformable shapes across images: A globally optimal solution
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...
Thomas Schoenemann, Daniel Cremers