Sublabel-Accurate Convex Relaxation with Total Generalized Variation Regularization

We propose a novel idea to introduce regularization based on second order total generalized variation (\(\text {TGV}\)) into optimization frameworks based on functional lifting. The proposed formulation extends a recent sublabel-accurate relaxation for multi-label problems and thus allows for accurate solutions using only a small number of labels, significantly improving over previous approaches towards lifting the total generalized variation. Moreover, even recent sublabel accurate methods exhibit staircasing artifacts when used in conjunction with common first order regularizers such as the total variation (\(\text {TV}\)). This becomes very obvious for example when computing derivatives of disparity maps computed with these methods to obtain normals, which immediately reveals their local flatness and yields inaccurate normal maps. We show that our approach is effective in reducing these artifacts, obtaining disparity maps with a smooth normal field in a single optimization pass.

[1]  Daniel Cremers,et al.  Sublabel-Accurate Discretization of Nonconvex Free-Discontinuity Problems , 2016, 2017 IEEE International Conference on Computer Vision (ICCV).

[2]  Karl Kunisch,et al.  Total Generalized Variation , 2010, SIAM J. Imaging Sci..

[3]  Bastian Goldlücke,et al.  Accurate Depth and Normal Maps from Occlusion-Aware Focal Stack Symmetry , 2017, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[4]  Marc Pollefeys,et al.  What is optimized in convex relaxations for multilabel problems: connecting discrete and continuously inspired MAP inference. , 2014, IEEE transactions on pattern analysis and machine intelligence.

[5]  Daniel Cremers,et al.  Tight Convex Relaxations for Vector-Valued Labeling , 2013, SIAM J. Imaging Sci..

[6]  Michael Möller,et al.  Sublabel–Accurate Relaxation of Nonconvex Energies , 2015, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[7]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Horst Bischof,et al.  Image Guided Depth Upsampling Using Anisotropic Total Generalized Variation , 2013, 2013 IEEE International Conference on Computer Vision.

[9]  A. Chambolle Convex Representation for Lower Semicontinuous Envelopes of Functionals in L1 , 2001 .

[10]  Olga Veksler,et al.  Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[11]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[12]  Horst Bischof,et al.  Pushing the limits of stereo using variational stereo estimation , 2012, 2012 IEEE Intelligent Vehicles Symposium.

[13]  Daniel Cremers,et al.  Total Cyclic Variation and Generalizations , 2013, Journal of Mathematical Imaging and Vision.

[14]  Horst Bischof,et al.  Minimizing TGV-Based Variational Models with Non-convex Data Terms , 2013, SSVM.

[15]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[16]  Bastian Goldlücke,et al.  A Dataset and Evaluation Methodology for Depth Estimation on 4D Light Fields , 2016, ACCV.

[17]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[18]  Daniel Cremers,et al.  Global Solutions of Variational Models with Convex Regularization , 2010, SIAM J. Imaging Sci..

[19]  Christoph Schnörr,et al.  Convex optimization for multi-class image labeling with a novel family of total variation based regularizers , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[20]  G. D. Maso The Calibration Method for Free Discontinuity Problems , 2000, math/0006016.

[21]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.