Efficient Graph Cut Optimization for Full CRFs with Quantized Edges
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Pattern Analysis and Machine Intelligence"
DOI: 10.1109/tpami.2019.2906204
Abstract: 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 Full-CRFs are too expensive. Previous work develops efficient approximate optimization based… read more here.
Keywords: full crfs; optimization; crfs; crf ... See more keywords