436 research outputs found
Sparse Correlation Kernel Analysis and Reconstruction
This paper presents a new paradigm for signal reconstruction and superresolution, Correlation Kernel Analysis (CKA), that is based on the selection of a sparse set of bases from a large dictionary of class- specific basis functions. The basis functions that we use are the correlation functions of the class of signals we are analyzing. To choose the appropriate features from this large dictionary, we use Support Vector Machine (SVM) regression and compare this to traditional Principal Component Analysis (PCA) for the tasks of signal reconstruction, superresolution, and compression. The testbed we use in this paper is a set of images of pedestrians. This paper also presents results of experiments in which we use a dictionary of multiscale basis functions and then use Basis Pursuit De-Noising to obtain a sparse, multiscale approximation of a signal. The results are analyzed and we conclude that 1) when used with a sparse representation technique, the correlation function is an effective kernel for image reconstruction and superresolution, 2) for image compression, PCA and SVM have different tradeoffs, depending on the particular metric that is used to evaluate the results, 3) in sparse representation techniques, L_1 is not a good proxy for the true measure of sparsity, L_0, and 4) the L_epsilon norm may be a better error metric for image reconstruction and compression than the L_2 norm, though the exact psychophysical metric should take into account high order structure in images
Non-local MRI upsampling.
International audienceIn Magnetic Resonance Imaging, image resolution is limited by several factors such as hardware or time constraints. In many cases, the acquired images have to be upsampled to match a specific resolution. In such cases, image interpolation techniques have been traditionally applied. However, traditional interpolation techniques are not able to recover high frequency information of the underlying high resolution data. In this paper, a new upsampling method is proposed to recover some of this high frequency information by using a data-adaptive patch-based reconstruction in combination with a subsampling coherence constraint. The proposed method has been evaluated on synthetic and real clinical cases and compared with traditional interpolation methods. The proposed method is shown to outperform classical interpolation methods compared in terms of quantitative measures and visual observation
An Improved Observation Model for Super-Resolution under Affine Motion
Super-resolution (SR) techniques make use of subpixel shifts between frames
in an image sequence to yield higher-resolution images. We propose an original
observation model devoted to the case of non isometric inter-frame motion as
required, for instance, in the context of airborne imaging sensors. First, we
describe how the main observation models used in the SR literature deal with
motion, and we explain why they are not suited for non isometric motion. Then,
we propose an extension of the observation model by Elad and Feuer adapted to
affine motion. This model is based on a decomposition of affine transforms into
successive shear transforms, each one efficiently implemented by row-by-row or
column-by-column 1-D affine transforms.
We demonstrate on synthetic and real sequences that our observation model
incorporated in a SR reconstruction technique leads to better results in the
case of variable scale motions and it provides equivalent results in the case
of isometric motions
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
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
- …