Non-local regularization of inverse problems
Reads0
Chats0
TLDR
In this article, a non-local graph is optimized to match the structures of the image to recover, which allows a better reconstruction of geometric edges and textures present in natural images.Abstract:
This article proposes a new framework to regularize imaging linear inverse problems using an adaptive non-local energy. A non-local graph is optimized to match the structures of the image to recover. This allows a better reconstruction of geometric edges and textures present in natural images. A fast algorithm computes iteratively both the solution of the regularization process and the non-local graph adapted to this solution. The graph adaptation is efficient to solve inverse problems with randomized measurements such as inpainting random pixels or compressive sensing recovery.
Our non-local regularization gives state-of-the-art results for this class of inverse problems. On more challenging problems such as image super-resolution, our method gives results comparable to sparse regularization in a translation invariant wavelet frame.read more
Citations
More filters
Journal ArticleDOI
Super-resolution: a comprehensive survey
TL;DR: The current comprehensive survey provides an overview of most of these published works by grouping them in a broad taxonomy, and common issues in super-resolution algorithms, such as imaging models and registration algorithms, optimization of the cost functions employed, dealing with color information, improvement factors, assessment of super- resolution algorithms, and the most commonly employed databases are discussed.
Journal ArticleDOI
Solving inverse problems using data-driven models
TL;DR: This survey paper aims to give an account of some of the main contributions in data-driven inverse problems.
Proceedings ArticleDOI
Patch Group Based Nonlocal Self-Similarity Prior Learning for Image Denoising
TL;DR: It is demonstrated that, owe to the learned PG-GMM, a simple weighted sparse coding model, which has a closed-form solution, can be used to perform image denoising effectively, resulting in high PSNR measure, fast speed, and particularly the best visual quality among all competing methods.
Journal ArticleDOI
A Supervised Patch-Based Approach for Human Brain Labeling
TL;DR: Experiments on simulated and in vivo magnetic resonance images show that the proposed patch-based image labeling method relying on a label propagation framework is very successful in providing automated human brain labeling.
Proceedings ArticleDOI
Single image super-resolution using Gaussian process regression
He He,Wan-Chi Siu +1 more
TL;DR: This paper proposes a framework for both magnification and deblurring using only the original low-resolution image and its blurred version, and shows that when using a proper covariance function, the Gaussian process regression can perform soft clustering of pixels based on their local structures.
References
More filters
Book
Compressed sensing
TL;DR: It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients, and a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing.
Book
A wavelet tour of signal processing
TL;DR: An introduction to a Transient World and an Approximation Tour of Wavelet Packet and Local Cosine Bases.
Journal ArticleDOI
Nonlinear total variation based noise removal algorithms
TL;DR: In this article, a constrained optimization type of numerical algorithm for removing noise from images is presented, where the total variation of the image is minimized subject to constraints involving the statistics of the noise.
Proceedings ArticleDOI
Bilateral filtering for gray and color images
Carlo Tomasi,Roberto Manduchi +1 more
TL;DR: In contrast with filters that operate on the three bands of a color image separately, a bilateral filter can enforce the perceptual metric underlying the CIE-Lab color space, and smooth colors and preserve edges in a way that is tuned to human perception.
Journal ArticleDOI
Ideal spatial adaptation by wavelet shrinkage
TL;DR: In this article, the authors developed a spatially adaptive method, RiskShrink, which works by shrinkage of empirical wavelet coefficients, and achieved a performance within a factor log 2 n of the ideal performance of piecewise polynomial and variable-knot spline methods.