An ILP model for multi-label MRFs with connectivity constraints
Integer Linear Programming (ILP) formulations of multi-label Markov random fields (MRFs) models with global connectivity priors were investigated previously in computer vision. In these works, only Linear Programming (LP) relaxations [1] or simplified versions [2] of the problem were solved. This pa...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
27 May 2020
|
| In: |
IEEE transactions on image processing
Year: 2020, Volume: 29, Pages: 6909-6917 |
| ISSN: | 1941-0042 |
| DOI: | 10.1109/TIP.2020.2995056 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1109/TIP.2020.2995056
|
| Author Notes: | Ruobing Shen, Bo Tang, Andrea Lodi, Andrea Tramontani, Ismail Ben Ayed |
| Summary: | Integer Linear Programming (ILP) formulations of multi-label Markov random fields (MRFs) models with global connectivity priors were investigated previously in computer vision. In these works, only Linear Programming (LP) relaxations [1] or simplified versions [2] of the problem were solved. This paper investigates the ILP of MRF with exact connectivity priors via a branch-and-cut method, which provably finds globally optimal solutions. It 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 be applied as a post-processing method on top of any existing multi-label segmentation approach. As it provides globally optimal solution, it can be used off-line to serve as quality check for any fast on-line algorithm. Furthermore, the scribble based model presented in this paper could be potentially used to generate ground-truth proposals for any deep learning based segmentation. We demonstrate the power and usefulness of our model by extensive experiments on the BSDS500 and PASCAL VOC dataset. The experiments show that our proposed model achieves great performance, yielding provably global optimum in most instances and that provably good optimization solutions also provide good segmentation accuracy, even with the limited computing time of few seconds. |
|---|---|
| Item Description: | Gesehen am 27.08.2020 |
| Physical Description: | Online Resource |
| ISSN: | 1941-0042 |
| DOI: | 10.1109/TIP.2020.2995056 |