Parameter estimation in sparse representation based face hallucination

Abstract Owning to the excellent ability to characterize the sparsity of natural images, l 1 norm sparse representation is widely applied to face hallucination. However, the determination on two key parameters such as patch size and regularization parameter has not been satisfactorily resolved yet. To this end, we proposed a novel parameter estimation method to identify them in an analytical way. In particular, the optimal patch size is derived from the sufficient condition for reliable sparse signal recovery established in compressive sensing theory. Furthermore, by interpreting l 1 norm SR as the corresponding maximum a posteriori estimator with Laplace prior constraint, we obtain an explicit expression for regularization parameter in statistics of reconstruction errors and coefficients. Our proposed method can significantly reduce the computational cost of parameter determination while without sacrificing numerical precision and eventual face hallucination performance. Experimental results on degraded images in simulation and real-world scenarios validate its effectiveness.

[1]  Wen Gao,et al.  The CAS-PEAL Large-Scale Chinese Face Database and Baseline Evaluations , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[3]  Harry Shum,et al.  Face Hallucination: Theory and Practice , 2007, International Journal of Computer Vision.

[4]  Kin-Man Lam,et al.  A novel face-hallucination scheme based on singular value decomposition , 2013, Pattern Recognit..

[5]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[6]  Nirmal K. Bose,et al.  Advances in superresolution using L-curve , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[7]  Robert L. Stevenson,et al.  A Bayesian approach to image expansion for improved definitio , 1994, IEEE Trans. Image Process..

[8]  Allen Y. Yang,et al.  Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Jian-Huang Lai,et al.  Face hallucination based on morphological component analysis , 2013, Signal Process..

[10]  David L. Donoho,et al.  Neighborly Polytopes And Sparse Solution Of Underdetermined Linear Equations , 2005 .

[11]  Zixiang Xiong,et al.  Face hallucination via weighted sparse representation , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[12]  Irfan A. Essa,et al.  Graphcut textures: image and video synthesis using graph cuts , 2003, ACM Trans. Graph..

[13]  Wilfried Philips,et al.  Sparse representation and position prior based face hallucination upon classified over-complete dictionaries , 2012, Signal Process..

[14]  Takeo Kanade,et al.  Limits on super-resolution and how to break them , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[15]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[16]  Lei Zhang,et al.  Nonlocally Centralized Sparse Representation for Image Restoration , 2013, IEEE Transactions on Image Processing.

[17]  Weiguo Gong,et al.  Single-image super-resolution reconstruction based on global non-zero gradient penalty and non-local Laplacian sparse coding , 2014, Digit. Signal Process..

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

[19]  Debin Zhao,et al.  Image super-resolution via dual-dictionary learning and sparse representation , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[20]  Peyman Milanfar,et al.  A computationally efficient superresolution image reconstruction algorithm , 2001, IEEE Trans. Image Process..

[21]  Ronald A. DeVore,et al.  Deterministic constructions of compressed sensing matrices , 2007, J. Complex..