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

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

by Yuri Y. Boykov , Marie-Pierre Jolly

Citations:

413 - 8 self

User correction supplied by mph

Datum	Value	Source
TITLE	Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images	SVM HeaderParse 0.2
AUTHOR NAME	Yuri Y. Boykov	user correction
AUTHOR NAME	Marie-Pierre Jolly	user correction
ABSTRACT	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 cuts are used to find the globally optimal segmentation of the N-dimensional image. The obtained solution gives the best balance of boundary and region properties among all segmentations satisfying the constraints. The topology of our segmentation is unrestricted and both “object” and “background” segments may consist of several isolated parts. Some experimental results are presented in the context of photo/video editing and medical image segmentation. We also demonstrate an interesting Gestalt example. A fast implementation of our segmentation method is possible via a new max-flow algorithm in [2].	user correction
YEAR	2001	user correction
CITATIONS	22 found	ParsCit 1.0