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...
Glavni autori: | Joy, T, Desmaison, A, Ajanthan, T, Bunel, R, Salzmann, M, Kohli, P, Torr, PHS, Kumar, MP |
---|---|
Format: | Journal article |
Izdano: |
Society for Industrial and Applied Mathematics
2019
|
Slični predmeti
-
Efficient linear programming for dense CRFs
od: Mudigonda, P, i dr.
Izdano: (2017) -
Exact inference in multi-label CRFs with higher order cliques
od: Ramalingam, S, i dr.
Izdano: (2008) -
Efficient continuous relaxations for dense CRF
od: Bunel, R, i dr.
Izdano: (2016) -
Bottom-up Instance Segmentation using Deep Higher-Order CRFs
od: Arnab, A, i dr.
Izdano: (2016) -
DenseCut: densely connected CRFs for realtime GrabCut
od: Cheng, MM, i dr.
Izdano: (2015)