Efficient relaxations for dense CRFs with sparse higher-order potentials
<p>Dense conditional random fields (CRFs) have become a popular framework for modelling several problems in computer vision such as stereo correspondence and multi-class semantic segmentation. By modelling long- range interactions, dense CRFs provide a labelling that captures finer detail than...
المؤلفون الرئيسيون: | Joy, T, Desmaison, A, Ajanthan, T, Bunel, R, Salzmann, M, Kohli, P, Torr, PHS, Kumar, MP |
---|---|
التنسيق: | Journal article |
منشور في: |
Society for Industrial and Applied Mathematics
2019
|
مواد مشابهة
-
Efficient linear programming for dense CRFs
حسب: Mudigonda, P, وآخرون
منشور في: (2017) -
Exact inference in multi-label CRFs with higher order cliques
حسب: Ramalingam, S, وآخرون
منشور في: (2008) -
Efficient continuous relaxations for dense CRF
حسب: Bunel, R, وآخرون
منشور في: (2016) -
Bottom-up Instance Segmentation using Deep Higher-Order CRFs
حسب: Arnab, A, وآخرون
منشور في: (2016) -
DenseCut: densely connected CRFs for realtime GrabCut
حسب: Cheng, MM, وآخرون
منشور في: (2015)