Title: for Optimal Boundary & Region Segmentation of Objects in N-D Images
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 soji 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 satishing the constraints. The topology o$our segmentation is unrestricted and both “object” and “background” segments may consist of several isolatedparts. Some experimental results are presented in the context ofphotohideo editing and medical image segmentation. We also demonstrate an interesting Gestalt example. A fast implementation of our segmentation method is possible via a new mar-$ow algorithm in [2].
Publication Year: 2001
Publication Date: 2001-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot