An ILP Solver for Multi-label MRFS with Connectivity Constraints

12/16/2017
by   Ruobing Shen, et al.
0

Integer Linear Programming (ILP) formulations of Markov random fields (MRFs) models with global connectivity priors were investigated previously in computer vision, e.g., globalinter,globalconn. In these works, only Linear Programming (LP) relaxations globalinter,globalconn or simplified versions graphcutbase of the problem were solved. This paper investigates the ILP of multi-label MRF with exact connectivity priors via a branch-and-cut method, which provably finds globally optimal solutions. The method enforces connectivity priors iteratively by a cutting plane method, and provides feasible solutions with a guarantee on sub-optimality even if we terminate it earlier. The proposed ILP can also be applied as a post-processing method on top of any existing multi-label segmentation approach. We demonstrate the power and usefulness of our model by several experiments on the BSDS500 image dataset, as well as on medical images with trained probability maps.

READ FULL TEXT

page 5

page 6

page 7

page 8

research
11/24/2014

Iteratively Reweighted Graph Cut for Multi-label MRFs with Non-convex Priors

While widely acknowledged as highly effective in computer vision, multi-...
research
09/06/2019

Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes

Resource Constrained Project Scheduling Problems (RCPSPs) without preemp...
research
08/26/2019

Constraint Generation Algorithm for the Minimum Connectivity Inference Problem

Given a hypergraph H, the Minimum Connectivity Inference problem asks fo...
research
06/05/2019

Anatomical Priors for Image Segmentation via Post-Processing with Denoising Autoencoders

Deep convolutional neural networks (CNN) proved to be highly accurate to...
research
06/18/2020

An Integer Linear Programming Framework for Mining Constraints from Data

Various structured output prediction problems (e.g., sequential tagging)...
research
12/13/2022

Connectivity-constrained Interactive Panoptic Segmentation

We address interactive panoptic annotation, where one segment all object...
research
06/24/2020

Post-DAE: Anatomically Plausible Segmentation via Post-Processing with Denoising Autoencoders

We introduce Post-DAE, a post-processing method based on denoising autoe...

Please sign up or login with your details

Forgot password? Click here to reset