scispace - formally typeset
Proceedings ArticleDOI

Compressive image super-resolution

Reads0
Chats0
TLDR
A new algorithm to generate a super-resolution image from a single, low-resolution input without the use of a training data set is proposed by exploiting the fact that the image is highly compressible in the wavelet domain and leveraging recent results of compressed sensing theory.
Abstract
This paper proposes a new algorithm to generate a super-resolution image from a single, low-resolution input without the use of a training data set. We do this by exploiting the fact that the image is highly compressible in the wavelet domain and leverage recent results of compressed sensing (CS) theory to make an accurate estimate of the original high-resolution image. Unfortunately, traditional CS approaches do not allow direct use of a wavelet compression basis because of the coherency between the point-samples from the downsampling process and the wavelet basis. To overcome this problem, we incorporate the downsampling low-pass filter into our measurement matrix, which decreases coherency between the bases. To invert the downsampling process, we use the appropriate inverse filter and solve for the high-resolution image using a greedy, matching-pursuit algorithm. The result is a simple and efficient algorithm that can generate high quality, high-resolution images without the use of training data. We present results that show the improved performance of our method over existing super-resolution approaches.

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

PiCam: an ultra-thin high performance monolithic camera array

TL;DR: PiCam (Pelican Imaging Camera-Array), an ultra-thin high performance monolithic camera array, that captures light fields and synthesizes high resolution images along with a range image (scene depth) through integrated parallax detection and superresolution is presented.
Journal ArticleDOI

Super-Resolution Based on Compressive Sensing and Structural Self-Similarity for Remote Sensing Images

TL;DR: A super-resolution (SR) method based on compressive sensing, structural self-similarity (SSSIM), and dictionary learning is proposed for reconstructing remote sensing images to identify a dictionary that represents high resolution (HR) image patches in a sparse manner.
Journal ArticleDOI

Super-resolution for biometrics: A comprehensive survey

TL;DR: A comprehensive survey of state-of-the-art super-resolution approaches for face (2D+3D), iris, fingerprint, and gait recognition can be found in this paper.
Journal ArticleDOI

Learning Based Compressed Sensing for SAR Image Super-Resolution

TL;DR: A novel approach for the reconstruction of super-resolution (SR) synthetic aperture radar (SAR) images in the compressed sensing (CS) theory framework using a framework that combines CS with a multi-dictionary is presented.
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.
Journal ArticleDOI

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

TL;DR: In this paper, the authors considered the model problem of reconstructing an object from incomplete frequency samples and showed that with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the lscr/sub 1/ minimization problem.
Journal ArticleDOI

Robust Face Recognition via Sparse Representation

TL;DR: This work considers the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise, and proposes a general classification algorithm for (image-based) object recognition based on a sparse representation computed by C1-minimization.
Journal ArticleDOI

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

TL;DR: It is demonstrated theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal.

Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case

TL;DR: In this paper, a greedy algorithm called Orthogonal Matching Pursuit (OMP) was proposed to recover a signal with m nonzero entries in dimension 1 given O(m n d) random linear measurements of that signal.
Related Papers (5)