Efficient Block Noise Removal Based on Nonlinear Manifolds
Abstract
The problem of block noise removal is considered. It is assumed that the original image is on or close to a sub-space of admissible images in the form of a low dimensional nonlinear manifold. We propose to use a close variant of the total variation regularizer for measuring block noise. Based on this noise measure, we present an effective approach that reconstructs the original image in the presence of block noise. Our main computational task is the solution of a quadratic programming problem, for which we propose a very efficient interior point method. The effectiveness and efficiency of our approach is demonstrated by an example.
Cite
Text
Fu et al. "Efficient Block Noise Removal Based on Nonlinear Manifolds." IEEE/CVF International Conference on Computer Vision, 2005. doi:10.1109/ICCV.2005.82Markdown
[Fu et al. "Efficient Block Noise Removal Based on Nonlinear Manifolds." IEEE/CVF International Conference on Computer Vision, 2005.](https://mlanthology.org/iccv/2005/fu2005iccv-efficient/) doi:10.1109/ICCV.2005.82BibTeX
@inproceedings{fu2005iccv-efficient,
title = {{Efficient Block Noise Removal Based on Nonlinear Manifolds}},
author = {Fu, Haoying and Zha, Hongyuan and Barlow, Jesse L.},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2005},
pages = {549-556},
doi = {10.1109/ICCV.2005.82},
url = {https://mlanthology.org/iccv/2005/fu2005iccv-efficient/}
}