GRMA: generalized range move algorithms for the efficient optimization of MRFs
From MaRDI portal
Publication:2193531
DOI10.1007/s11263-016-0944-zzbMath1458.68238OpenAlexW2510075584MaRDI QIDQ2193531
Peipei Yang, Junge Zhang, Kangwei Liu, Stephen J. Maybank, Kaiqi Huang
Publication date: 20 August 2020
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://eprints.bbk.ac.uk/id/eprint/15899/1/15899.pdf
Uses Software
Cites Work
- A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
- Multi-label moves for MRFs with truncated convex priors
- A threshold of ln n for approximating set cover
- A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: GRMA: generalized range move algorithms for the efficient optimization of MRFs