DeepAI AI Chat
Log In Sign Up

Convexity Shape Constraints for Image Segmentation

by   Loic A. Royer, et al.

Segmenting an image into multiple components is a central task in computer vision. In many practical scenarios, prior knowledge about plausible components is available. Incorporating such prior knowledge into models and algorithms for image segmentation is highly desirable, yet can be non-trivial. In this work, we introduce a new approach that allows, for the first time, to constrain some or all components of a segmentation to have convex shapes. Specifically, we extend the Minimum Cost Multicut Problem by a class of constraints that enforce convexity. To solve instances of this APX-hard integer linear program to optimality, we separate the proposed constraints in the branch-and-cut loop of a state-of-the-art ILP solver. Results on natural and biological images demonstrate the effectiveness of the approach as well as its advantage over the state-of-the-art heuristic.


page 7

page 8


Convex Shape Representation with Binary Labels for Image Segmentation: Models and Fast Algorithms

We present a novel and effective binary representation for convex shapes...

Convexity Shape Prior for Level Set based Image Segmentation Method

We propose a geometric convexity shape prior preservation method for var...

High-level Prior-based Loss Functions for Medical Image Segmentation: A Survey

Today, deep convolutional neural networks (CNNs) have demonstrated state...

Automatic Image Pixel Clustering based on Mussels Wandering Optimiz

Image segmentation as a clustering problem is to identify pixel groups o...

A-expansion for multiple "hedgehog" shapes

Overlapping colors and cluttered or weak edges are common segmentation p...

3D Model Assisted Image Segmentation

The problem of segmenting a given image into coherent regions is importa...

Convex Shape Prior for Deep Neural Convolution Network based Eye Fundus Images Segmentation

Convex Shapes (CS) are common priors for optic disc and cup segmentation...