Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints

Summary, in English

Indisputably Normalized Cuts is one of the most popular segmentation algorithms in pattern recognition and computer vision. It has been applied to a wide range of segmentation tasks with great success. A number of extensions to this approach have also been proposed, including ones that can deal with multiple classes or that can incorporate a priori information in the form of grouping constraints. However, what is common for all these methods is that they are noticeably limited in the type of constraints that can be incorporated and can only address segmentation problems on a very specific form. In this paper, we present a reformulation of Normalized Cut segmentation that in a unified way can handle linear equality constraints for an arbitrary number of classes. This is done by restating the problem and showing how linear constraints can be enforced exactly in the optimization scheme through duality. This allows us to add group priors, for example, that certain pixels should belong to a given class. In addition, it provides a principled way to perform multi-class segmentation for tasks like interactive segmentation. The method has been tested on real data showing good performance and improvements compared to standard normalized cuts.

• Author: Anders P Eriksson; Carl Olsson; Fredrik Kahl
• Department/s: Mathematics (Faculty of Engineering); Mathematical Imaging Group; ELLIIT: the Linköping-Lund initiative on IT and mobile communication; eSSENCE: The e-Science Collaboration
• Publishing year: 2011
• Language: English
• Pages: 45-61
• Publication/Series: Journal of Mathematical Imaging and Vision
• Volume: 39
• Issue: 1
• Links: http://dx.doi.org/10.1007/s10851-010-0223-5
• Document type: Journal article
• Publisher: Springer
• Topic: Computer Vision and Robotics (Autonomous Systems); Mathematics
• Status: Published
• Research group: Mathematical Imaging Group
• ISBN/ISSN/Other: ISSN: 0924-9907