IEEE - Institute of Electrical and Electronics Engineers, Inc. - Efficient Graph Cut Optimization for Full CRFs with Quantized Edges

Author(s): Olga Veksler
Sponsor(s): IEEE Computer Society
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Volume: PP
Page(s): 1
ISSN (CD): 2160-9292
ISSN (Electronic): 1939-3539
ISSN (Paper): 0162-8828
DOI: 10.1109/TPAMI.2019.2906204
Regular:

Fully connected pairwise Conditional Random Fields (Full-CRF) with Gaussian edge weights can achieve superior results compared to sparsely connected CRFs. However, traditional methods for... View More

Advertisement