Doubly sparse structure in image super resolution

There are a large number of image super resolution algorithms based on the sparse coding, and some algorithms realize multi-frame super resolution. For utilizing multiple low resolution observations, 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 proposed formulation not only has a mathematically interesting structure called the double sparsity, but also offers improved numerical performance.

[1]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[2]  Hideitsu Hino,et al.  Double Sparse Multi-Frame Image Super Resolution , 2015, ArXiv.

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

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

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

[6]  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.

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

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

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

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

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

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

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

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

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

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

[17]  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.

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

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