Login / Signup
L(3, 2, 1)- and L(4, 3, 2, 1)-labeling problems on interval graphs.
Sk Amanathulla
Madhumangal Pal
Published in:
AKCE Int. J. Graphs Comb. (2017)
Keyphrases
</>
labeling problems
graph cuts
max flow
markov random field
single image
energy minimization
stereo correspondence
spatial coherence
ground truth
spanning tree
graph model
undirected graph
graph partitioning
graph structure
multi label
energy function
computer vision