Disparity and Optical Flow Partitioning Using Extended Potts Priors

Abstract

This paper addresses the problems of disparity and optical flow partitioning based on the brightness invariance assumption. We investigate new variational approaches to these problems with Potts priors and possibly box constraints. For the optical flow partitioning, our model includes vector-valued data and an adapted Potts regularizer. Using the notation of asymptotically level stable functions we prove the existence of global minimizers of our functionals. We propose a modified alternating direction method of minimizers. This iterative algorithm requires the computation of global minimizers of classical univariate Potts problems which can be done efficiently by dynamic programming. We prove that the algorithm converges both for the constrained and unconstrained problems. Numerical examples demonstrate the very good performance of our partitioning method.

References in corpus (1)

• Jump-sparse and sparse recovery using Potts functionals

Cited by in corpus (4)

• Uncertainty quantification for radio interferometric imaging: I. proximal MCMC methods
• Linkage between piecewise constant Mumford-Shah model and ROF model and its virtue in image segmentation
• Bi-l0-l2-Norm Regularization for Blind Motion Deblurring
• Quantifying Uncertainty in High Dimensional Inverse Problems by Convex Optimisation