Non-Local Regularization of Inverse Problems
Abstract
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This non-local graph allows to adapt the penalization to the geometry of the underlying function to recover. A fast algorithm computes iteratively both the solution of the regularization process and the non-local graph adapted to this solution. We show numerical applications of this method to the resolution of image processing inverse problems such as inpainting, super-resolution and compressive sampling.
Cite
Text
Peyré et al. "Non-Local Regularization of Inverse Problems." European Conference on Computer Vision, 2008. doi:10.1007/978-3-540-88690-7_5Markdown
[Peyré et al. "Non-Local Regularization of Inverse Problems." European Conference on Computer Vision, 2008.](https://mlanthology.org/eccv/2008/peyre2008eccv-non/) doi:10.1007/978-3-540-88690-7_5BibTeX
@inproceedings{peyre2008eccv-non,
title = {{Non-Local Regularization of Inverse Problems}},
author = {Peyré, Gabriel and Bougleux, Sébastien and Cohen, Laurent D.},
booktitle = {European Conference on Computer Vision},
year = {2008},
pages = {57-68},
doi = {10.1007/978-3-540-88690-7_5},
url = {https://mlanthology.org/eccv/2008/peyre2008eccv-non/}
}