Sciweavers

20 search results - page 2 / 4
» Geodesic Star Convexity for Interactive Image Segmentation
Sort
View
ICIP
2003
IEEE
13 years 10 months ago
K-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
Rubén Cárdenes, Simon K. Warfield, A...
ISVC
2010
Springer
13 years 3 months ago
Split Bregman Method for Minimization of Region-Scalable Fitting Energy for Image Segmentation
Abstract. In this paper, we incorporated the global convex segmentation method and the split Bregman technique into the region-scalable fitting energy model. The new proposed metho...
Yunyun Yang, Chunming Li, Chiu-Yen Kao, Stanley Os...
ICIP
2008
IEEE
14 years 7 months ago
Geodesic active regions for segmentation and tracking of human gestures in sign language videos
Reliable segmentation and motion tracking algorithms are required to achieve gesture detection and tracking for human-machine interaction. In this paper we present an efficient me...
Olga Diamanti, Petros Maragos
ICCV
2011
IEEE
12 years 5 months ago
A Convex Framework for Image Segmentation with Moment Constraints
Convex relaxation techniques have become a popular approach to image segmentation as they allow to compute solutions independent of initialization to a variety of image segmentati...
Maria Klodt, Daniel Cremers
CVPR
2000
IEEE
14 years 7 months ago
Codimension - Two Geodesic Active Contours for the Segmentation of Tubular Structures
Curve evolution schemes for segmentation, implemented with level set methods, have become an important approach in computer vision. Previous work has modeled evolving contours whi...
Liana M. Lorigo, W. Eric L. Grimson, Olivier D. Fa...