Sciweavers

270 search results - page 42 / 54
» Graph Cuts and Efficient N-D Image Segmentation
Sort
View
ICIP
2009
IEEE
13 years 6 months ago
A hierarchical graph-based markovian clustering approach for the unsupervised segmentation of textured color images
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
Rachid Hedjam, Max Mignotte
ECCV
2006
Springer
14 years 10 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
PAMI
2008
198views more  PAMI 2008»
13 years 8 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
ICIP
2008
IEEE
14 years 3 months ago
Time-sequential extraction of motion layers
A new time-sequential approach for motion layer extraction is presented. We assume that the scene can be described by a set of layers associated to affine motion models. In one o...
Matthieu Fradet, Patrick Pérez, Philippe Ro...
MVA
2008
305views Computer Vision» more  MVA 2008»
13 years 8 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong