Distributed non-convex ADMM-based inference in large-scale random fields
We propose a parallel and distributed algorithm for solving discrete labeling problems in large scale random fields. Our approach is motivated by the following observations: i) very large scale image and video processing problems, such as labeling dozens of million pixels with thousands of labels, a...
Huvudupphovsmän: | Miksik, O, Vineet, V, Pérez, P, Torr, PHS |
---|---|
Materialtyp: | Conference item |
Språk: | English |
Publicerad: |
British Machine Vision Association
2014
|
Liknande verk
Liknande verk
-
Filter-based mean-field inference for random fields with higher-order terms and product label-spaces
av: Vineet, V, et al.
Publicerad: (2014) -
Filter-based mean-field inference for random fields with higher-order terms and product label-spaces
av: Vineet, V, et al.
Publicerad: (2012) -
Improved initialization and Gaussian mixture pairwise terms for dense random fields with mean-field inference
av: Vineet, V, et al.
Publicerad: (2012) -
Dynamic graph cuts for efficient inference in Markov random fields
av: Kohli, P, et al.
Publicerad: (2007) -
Smoothing ADMM for Sparse-Penalized Quantile Regression With Non-Convex Penalties
av: Reza Mirzaeifard, et al.
Publicerad: (2024-01-01)