Sciweavers

270 search results - page 11 / 54
» Graph Cuts and Efficient N-D Image Segmentation
Sort
View
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
14 years 9 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
ICMCS
2008
IEEE
165views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Graph cuts by using local texture features of wavelet coefficient for image segmentation
This paper proposes an approach to image segmentation using Iterated Graph Cuts based on local texture features of wavelet coefficient. Using Multiresolution Analysis based on Ha...
Keita Fukuda, Tetsuya Takiguchi, Yasuo Ariki
ICIP
2005
IEEE
14 years 9 months ago
Graph cuts segmentation using an elliptical shape prior
We present a graph cuts-based image segmentation technique that incorporates an elliptical shape prior. Inclusion of this shape constraint restricts the solution space of the segm...
Gregory G. Slabaugh, Gozde B. Unal
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 16 days ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
CVPR
2011
IEEE
13 years 3 months ago
Submodularity beyond submodular energies: coupling edges in graph cuts
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an ef...
Stefanie Jegelka, Jeff Bilmes