Double Sparse Multi-Frame Image Super Resolution

A large number of image super resolution algorithms based on the sparse coding are proposed, and some algorithms realize the multi-frame super resolution. In multi-frame super resolution based on the sparse coding, both accurate image registration and sparse coding are required. Previous study on multi-frame super resolution based on sparse coding firstly apply block matching for image registration, followed by sparse coding to enhance the image resolution. In this paper, these two problems are solved by optimizing a single objective function. The results of numerical experiments support the effectiveness of the proposed approch.

[1]  Peng Wang,et al.  Super Resolution Reconstruction via Multiple Frames Joint Learning , 2011, 2011 International Conference on Multimedia and Signal Processing.

[2]  Hideitsu Hino,et al.  Multi-frame image super resolution based on sparse coding , 2015, Neural Networks.

[3]  David J. Field,et al.  How Close Are We to Understanding V1? , 2005, Neural Computation.

[4]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[5]  Rajat Raina,et al.  Efficient sparse coding algorithms , 2006, NIPS.

[6]  ShimizuMasao,et al.  Multi-Parameter Simultaneous Estimation on Area-Based Matching , 2006 .

[7]  Masatoshi Okutomi,et al.  Multi-Parameter Simultaneous Estimation on Area-Based Matching , 2006, International Journal of Computer Vision.

[8]  Rong Zhang,et al.  Remote sensing image compression based on double-sparsity dictionary learning and universal trellis coded quantization , 2013, 2013 IEEE International Conference on Image Processing.

[9]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[10]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[11]  Michael Elad,et al.  On Single Image Scale-Up Using Sparse-Representations , 2010, Curves and Surfaces.

[12]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[13]  Xuelong Li,et al.  A multi-frame image super-resolution method , 2010, Signal Process..

[14]  Thomas S. Huang,et al.  Image Super-Resolution Via Sparse Representation , 2010, IEEE Transactions on Image Processing.

[15]  Michael Elad,et al.  Fast and robust multiframe super resolution , 2004, IEEE Transactions on Image Processing.

[16]  Ingrid Daubechies,et al.  Ten Lectures on Wavelets , 1992 .

[17]  Kjersti Engan,et al.  Method of optimal directions for frame design , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[18]  Jan Flusser,et al.  Image registration methods: a survey , 2003, Image Vis. Comput..

[19]  R. Tibshirani.  Regression shrinkage and selection via the lasso: a retrospective , 2011 .

[20]  Michael Elad,et al.  Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation , 2010, IEEE Transactions on Signal Processing.

[21]  Lei Zhang,et al.  Image Deblurring and Super-Resolution by Adaptive Sparse Domain Selection and Adaptive Regularization , 2010, IEEE Transactions on Image Processing.

[22]  Michael Elad,et al.  Sparse and Redundant Representations - From Theory to Applications in Signal and Image Processing , 2010 .

[23]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[24]  David J. Field,et al.  Emergence of simple-cell receptive field properties by learning a sparse code for natural images , 1996, Nature.

[25]  Thomas S. Huang,et al.  Image super-resolution as sparse representation of raw image patches , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.