%0 Conference Paper %1 Boykov01graphCuts %A Boykov, Y.Y. %A Jolly, M.-P. %B Computer Vision, 2001. ICCV 2001. Proceedings. Eighth IEEE International Conference on %D 2001 %K 01 Boykov cuts graph image segmentation %P 105-112 vol.1 %R 10.1109/ICCV.2001.937505 %T Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images %U http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=937505 %V 1 %X 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

@inproceedings{Boykov01graphCuts, 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}, added-at = {2009-09-10T00:38:12.000+0200}, author = {Boykov, Y.Y. and Jolly, M.-P.}, biburl = {https://www.bibsonomy.org/bibtex/2c7ab672c7974f7b9c96d593f4243139e/lee_peck}, booktitle = {Computer Vision, 2001. ICCV 2001. Proceedings. Eighth IEEE International Conference on}, description = {Welcome to IEEE Xplore 2.0: Interactive graph cuts for optimal boundary & regionsegmentation of objects in N-D images}, doi = {10.1109/ICCV.2001.937505}, interhash = {4af3b3a17cf9ff4752659dacdab2c64d}, intrahash = {c7ab672c7974f7b9c96d593f4243139e}, keywords = {01 Boykov cuts graph image segmentation}, pages = {105-112 vol.1}, timestamp = {2009-09-10T00:38:12.000+0200}, title = {Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images}, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=937505}, volume = 1, year = 2001 }