2020
DOI: 10.1109/tip.2020.2995056
|View full text |Cite
|
Sign up to set email alerts
|

An ILP Model for Multi-Label MRFs With Connectivity Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…Although our method can be used with any differentiable or non-differentiable constraint, in this paper, we illustrate it on a well-known constraint with broad applicability: connectivity. Given a segmented region G, we say that G is connected if and only if there exists a path between each pair of pixels p, q ∈ G such that all pixels in the path belong to G. Imposing connectivity in segmentation leads to a highly-complex problem which can only be solved for simplified cases, for example, by representing an image as a small set of superpixels (Shen et al, 2020). However, considering connectivity over the whole image may not be practical since it is hard to achieve in the early training stages.…”
Section: Local Connectivity Constraintsmentioning
confidence: 99%
“…Although our method can be used with any differentiable or non-differentiable constraint, in this paper, we illustrate it on a well-known constraint with broad applicability: connectivity. Given a segmented region G, we say that G is connected if and only if there exists a path between each pair of pixels p, q ∈ G such that all pixels in the path belong to G. Imposing connectivity in segmentation leads to a highly-complex problem which can only be solved for simplified cases, for example, by representing an image as a small set of superpixels (Shen et al, 2020). However, considering connectivity over the whole image may not be practical since it is hard to achieve in the early training stages.…”
Section: Local Connectivity Constraintsmentioning
confidence: 99%
“…The higher-order binary Markov random field (HoMRF) is a non-convex optimization model widely used in the fields of economy, information theory, quantum computing, machine learning and image analysis [ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 ]. Recently, a new order reduction method has been developed to optimize HoMRF energies.…”
Section: Introductionmentioning
confidence: 99%