A PCA-based super-resolution algorithm for short image sequences

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. C. Miravet, and F. B. Rodríguez, "A PCA-based super-resolution algorithm for short image sequences", 17th IEEE International Conference on Image Processing (ICIP), Hong Kong, China, 2010, pp. 2025 - 2028In this paper, we present a novel, learning-based, two-step super-resolution (SR) algorithm well suited to solve the specially demanding problem of obtaining SR estimates from short image sequences. The first step, devoted to increase the sampling rate of the incoming images, is performed by fitting linear combinations of functions generated from principal components (PC) to reproduce locally the sparse projected image data, and using these models to estimate image values at nodes of the high-resolution grid. PCs were obtained from local image patches sampled at sub-pixel level, which were generated in turn from a database of high-resolution images by application of a physically realistic observation model. Continuity between local image models is enforced by minimizing an adequate functional in the space of model coefficients. The second step, dealing with restoration, is performed by a linear filter with coefficients learned to restore residual interpolation artifacts in addition to low-resolution blurring, providing an effective coupling between both steps of the method. Results on a demanding five-image scanned sequence of graphics and text are presented, showing the excellent performance of the proposed method compared to several state-of-the-art two-step and Bayesian Maximum a Posteriori SR algorithms.This work was supported by the Spanish Ministry of Education and Science under TIN 2007-65989 and CAM S-SEM-0255- 2006, and by COINCIDENTE project DN8644, RESTAURA

Real Time Turbulent Video Perfecting by Image Stabilization and Super-Resolution

Image and video quality in Long Range Observation Systems (LOROS) suffer from atmospheric turbulence that causes small neighbourhoods in image frames to chaotically move in different directions and substantially hampers visual analysis of such image and video sequences. The paper presents a real-time algorithm for perfecting turbulence degraded videos by means of stabilization and resolution enhancement. The latter is achieved by exploiting the turbulent motion. The algorithm involves generation of a reference frame and estimation, for each incoming video frame, of a local image displacement map with respect to the reference frame; segmentation of the displacement map into two classes: stationary and moving objects and resolution enhancement of stationary objects, while preserving real motion. Experiments with synthetic and real-life sequences have shown that the enhanced videos, generated in real time, exhibit substantially better resolution and complete stabilization for stationary objects while retaining real motion.Comment: Submitted to The Seventh IASTED International Conference on Visualization, Imaging, and Image Processing (VIIP 2007) August, 2007 Palma de Mallorca, Spai

An Efficient Algorithm for Video Super-Resolution Based On a Sequential Model

In this work, we propose a novel procedure for video super-resolution, that is the recovery of a sequence of high-resolution images from its low-resolution counterpart. Our approach is based on a "sequential" model (i.e., each high-resolution frame is supposed to be a displaced version of the preceding one) and considers the use of sparsity-enforcing priors. Both the recovery of the high-resolution images and the motion fields relating them is tackled. This leads to a large-dimensional, non-convex and non-smooth problem. We propose an algorithmic framework to address the latter. Our approach relies on fast gradient evaluation methods and modern optimization techniques for non-differentiable/non-convex problems. Unlike some other previous works, we show that there exists a provably-convergent method with a complexity linear in the problem dimensions. We assess the proposed optimization method on {several video benchmarks and emphasize its good performance with respect to the state of the art.}Comment: 37 pages, SIAM Journal on Imaging Sciences, 201

Holographic opto-fluidic microscopy.

Over the last decade microfluidics has created a versatile platform that has significantly advanced the ways in which micro-scale organisms and objects are controlled, processed and investigated, by improving the cost, compactness and throughput aspects of analysis. Microfluidics has also expanded into optics to create reconfigurable and flexible optical devices such as reconfigurable lenses, lasers, waveguides, switches, and on-chip microscopes. Here we present a new opto-fluidic microscopy modality, i.e., Holographic Opto-fluidic Microscopy (HOM), based on lensless holographic imaging. This imaging modality complements the miniaturization provided by microfluidics and would allow the integration of microscopy into existing on-chip microfluidic devices with various functionalities. Our imaging modality utilizes partially coherent in-line holography and pixel super-resolution to create high-resolution amplitude and phase images of the objects flowing within micro-fluidic channels, which we demonstrate by imaging C. elegans, Giardia lamblia, and Mulberry pollen. HOM does not involve complicated fabrication processes or precise alignment, nor does it require a highly uniform flow of objects within microfluidic channels

IMAGE AND VIDEO ENHANCEMENT USING SPARSE CODING, BELIEF PROPAGATION AND MATRIX COMPLETION

Super resolution as an exciting application in image processing was studied widely in the literature. This dissertation presents new approaches to video super resolution, based on sparse coding and belief propagation. First, find candidate match pixels on multiple frames using sparse coding and belief propagation. Second, incorporate information from these candidate pixels with weights computed using the Nonlocal-Means (NLM) method in the first approach or using SCoBeP method in the second approach. The effectiveness of the proposed methods is demonstrated for both synthetic and real video sequences in the experiment section. In addition, the experimental results show that my models are naturally robust in handling super resolution on video sequences affected by scene motions and/or small camera motions. Moreover, in this dissertation, I describe a denoising method using low-rank matrix completion. In the proposed denoising approach, I present a patch-based video denoising algorithm by grouping similar patches and then formulating the problem of removing noise using a decomposition approach for low-rank matrix completion. Experiments show that the proposed approach robustly removes mixed noise such as impulsive noise, Poisson noise, and Gaussian noise from any natural noisy video. Moreover, my approach outperforms state-of-the-art denoising techniques such as VBM3D and 3DWTF in terms of both time and quality. My technique also achieves significant improvement over time against other matrix completion methods