Results 1 - 10 of 6,062

Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images

by Yuri Y. Boykov , Marie-Pierre Jolly , 2001
"... In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and region information. Graph ..."
Abstract - Cited by 1010 (20 self) - Add to MetaCart
In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and region information. Graph

Efficient graph-based image segmentation.

by Pedro F Felzenszwalb , Daniel P Huttenlocher - International Journal of Computer Vision, , 2004
"... Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show ..."
Abstract - Cited by 940 (1 self) - Add to MetaCart
Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show

Segment Boundary Estimation Using Recurrent Neural Networks

by Toshiaki Fukada, Sophie Aveline, Mike Schuster, Yoshinori Sagisaka , 1996
"... This paper describes a segment (e.g. phoneme) boundary estimation method based on recurrent neural networks (RNNs). The proposed method only requires acoustic observations to accurately estimate segment boundaries. Experimental results show that the proposed method can estimate segment boundaries si ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This paper describes a segment (e.g. phoneme) boundary estimation method based on recurrent neural networks (RNNs). The proposed method only requires acoustic observations to accurately estimate segment boundaries. Experimental results show that the proposed method can estimate segment boundaries

Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multi-band Image Segmentation

by Song Chun Zhu, Alan Yuille - IEEE Transactions on Pattern Analysis and Machine Intelligence , 1996
"... We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum and c ..."
Abstract - Cited by 774 (20 self) - Add to MetaCart
We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum

A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model

by Luminita A. Vese, Tony F. Chan - INTERNATIONAL JOURNAL OF COMPUTER VISION , 2002
"... We propose a new multiphase level set framework for image segmentation using the Mumford and Shah model, for piecewise constant and piecewise smooth optimal approximations. The proposed method is also a generalization of an active contour model without edges based 2-phase segmentation, developed by ..."
Abstract - Cited by 498 (22 self) - Add to MetaCart
We propose a new multiphase level set framework for image segmentation using the Mumford and Shah model, for piecewise constant and piecewise smooth optimal approximations. The proposed method is also a generalization of an active contour model without edges based 2-phase segmentation, developed

HIERARCHICAL EVALUATION OF SEGMENT BOUNDARY DETECTION

by Brian Mcfee, Oriol Nieto, Juan P. Bello
"... Structure in music is traditionally analyzed hierarchically: large-scale sections can be sub-divided and refined down to the short melodic ideas at the motivic level. However, typ-ical algorithmic approaches to structural annotation pro-duce flat temporal partitions of a track, which are com-monly e ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
exist to measure an algorithm’s accuracy against these rich structural annotations. In this work, we propose a method to evaluate structural boundary detec-tion with hierarchical annotations. The proposed method transforms boundary detection into a ranking problem, and facilitates the comparison of both

TextTiling: Segmenting text into multi-paragraph subtopic passages

by Marti A. Hearst - Computational Linguistics , 1997
"... TextTiling is a technique for subdividing texts into multi-paragraph units that represent passages, or subtopics. The discourse cues for identifying major subtopic shifts are patterns of lexical co-occurrence and distribution. The algorithm is fully implemented and is shown to produce segmentation t ..."
Abstract - Cited by 458 (2 self) - Add to MetaCart
that corresponds well to human judgments of the subtopic boundaries of 12 texts. Multi-paragraph subtopic segmentation should be useful for many text analysis tasks, including information retrieval and summarization. 1.

Segment Boundaries in Low Latency Phonetic Recognition

by Itrw On Nonlinear Speech, Giampiero Salvi
"... Abstract. This study analyses how the reduction of the look-ahead length of a two pass phonetic decoder influences the alignment of the segment boundaries. It is shown how the optimization of some tuning parameters, such as the insertion penalty, is dependent on the look-ahead length. It is also sug ..."
Abstract - Add to MetaCart
Abstract. This study analyses how the reduction of the look-ahead length of a two pass phonetic decoder influences the alignment of the segment boundaries. It is shown how the optimization of some tuning parameters, such as the insertion penalty, is dependent on the look-ahead length. It is also

Geodesic Active Contours

by Vicent Caselles, Ron Kimmel, Guillermo Sapiro , 1997
"... A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the image. The evolving contours naturally split and merge, allowing the simultaneous detection of several objects and both in ..."
Abstract - Cited by 1425 (47 self) - Add to MetaCart
segmentation allows to connect classical “snakes ” based on energy minimization and geometric active contours based on the theory of curve evolution. Previous models of geometric active contours are improved, allowing stable boundary detection when their gradients suffer from large variations, including gaps

"GrabCut” -- interactive foreground extraction using iterated graph cuts

by Carsten Rother, Vladimir Kolmogorov, Andrew Blake - ACM TRANS. GRAPH , 2004
"... The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently ..."
Abstract - Cited by 1130 (36 self) - Add to MetaCart
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors
Results 1 - 10 of 6,062