Total Variation Regularization for Functions with Values in a Manifold
Abstract
While total variation is among the most popular regularizers for variational problems, its extension to functions with values in a manifold is an open problem. In this paper, we propose the first algorithm to solve such problems which applies to arbitrary Riemannian manifolds. The key idea is to reformulate the variational problem as a multilabel optimization problem with an infinite number of labels. This leads to a hard optimization problem which can be approximately solved using convex relaxation techniques. The framework can be easily adapted to different manifolds including spheres and three-dimensional rotations, and allows to obtain accurate solutions even with a relatively coarse discretization. With numerous examples we demonstrate that the proposed framework can be applied to variational models that incorporate chromaticity values, normal fields, or camera trajectories.
Cite
Text
Lellmann et al. "Total Variation Regularization for Functions with Values in a Manifold." International Conference on Computer Vision, 2013. doi:10.1109/ICCV.2013.366Markdown
[Lellmann et al. "Total Variation Regularization for Functions with Values in a Manifold." International Conference on Computer Vision, 2013.](https://mlanthology.org/iccv/2013/lellmann2013iccv-total/) doi:10.1109/ICCV.2013.366BibTeX
@inproceedings{lellmann2013iccv-total,
title = {{Total Variation Regularization for Functions with Values in a Manifold}},
author = {Lellmann, Jan and Strekalovskiy, Evgeny and Koetter, Sabrina and Cremers, Daniel},
booktitle = {International Conference on Computer Vision},
year = {2013},
doi = {10.1109/ICCV.2013.366},
url = {https://mlanthology.org/iccv/2013/lellmann2013iccv-total/}
}