Faithful Recovery of Vector Valued Functions from Incomplete Data

On March 11, 1944, the famous Eremitani Church in Padua (Italy) was destroyed in an Allied bombing along with the inestimable frescoes by Andrea Mantegna et al. contained in the Ovetari Chapel. In the last 60 years, several attempts have been made to restore the fresco fragments by traditional methods, but without much success. We have developed an efficient pattern recognition algorithm to map the original position and orientation of the fragments, based on comparisons with an old gray level image of the fresco prior to the damage. This innovative technique allowed for the partial reconstruction of the frescoes. Unfortunately, the surface covered by the fragments is only 77 m 2, while the original area was of several hundreds. This means that we can reconstruct only a fraction (less than 8%) of this inestimable artwork. In particular the original color of the blanks is not known. This begs the question of whether it is possible to estimate mathematically the original colors of the frescoes by making use of the potential information given by the available fragments and the gray level of the pictures taken before the damage. Can one estimate how faithful such restoration is? In this paper we retrace the development of the recovery of the frescoes as an inspiring and challenging real-life problem for the development of new mathematical methods. We introduce two models for the recovery of vector valued functions from incomplete data, with applications to the fresco recolorization problem. The models are based on the minimization of a functional which is formed by the discrepancy with respect to the data and additional regularization constraints. The latter refer to joint sparsity measures with respect to frame expansions for the first functional and functional total variation for the second. We establish the relations between these two models. As a byproduct we develop the basis of a theory of fidelity in color recovery, which is a crucial issue in art restoration and compression.

[1]  Emmanuel Candes,et al.  Stable signal recovery from incomplete observations , 2005, SPIE Optics + Photonics.

[2]  Guillermo Sapiro,et al.  Filling-in by joint interpolation of vector fields and gray levels , 2001, IEEE Trans. Image Process..

[3]  Guillermo Sapiro,et al.  Image inpainting , 2000, SIGGRAPH.

[4]  Simon Masnou,et al.  Disocclusion: a variational approach using level lines , 2002, IEEE Trans. Image Process..

[5]  Tony F. Chan,et al.  Error Analysis for Image Inpainting , 2006, Journal of Mathematical Imaging and Vision.

[6]  Guillermo Sapiro,et al.  Inpainting the colors , 2005, IEEE International Conference on Image Processing 2005.

[7]  Riccardo March,et al.  Variational Models for Image Colorization via Chromaticity and Brightness Decomposition , 2007, IEEE Transactions on Image Processing.

[8]  Jean-Michel Morel,et al.  Geometry and Color in Natural Images , 2002, Journal of Mathematical Imaging and Vision.

[9]  Guillermo Sapiro,et al.  Fast image and video colorization using chrominance blending , 2006, IEEE Transactions on Image Processing.

[10]  D. Donoho,et al.  Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA) , 2005 .

[11]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[12]  Dani Lischinski,et al.  Colorization using optimization , 2004, ACM Trans. Graph..

[13]  T. Chan,et al.  Variational image inpainting , 2005 .

[14]  Jean-Michel Morel,et al.  Level lines based disocclusion , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[15]  E. Candès,et al.  New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities , 2004 .

[16]  Massimo Fornasier,et al.  Nonlinear Projection Recovery in Digital Inpainting for Color Image Restoration , 2006, Journal of Mathematical Imaging and Vision.

[17]  J. Tropp Algorithms for simultaneous sparse approximation. Part II: Convex relaxation , 2006, Signal Process..

[18]  Massimo Fornasier,et al.  Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints , 2008, SIAM J. Numer. Anal..

[19]  A. Bruce,et al.  WAVESHRINK WITH FIRM SHRINKAGE , 1997 .

[20]  Tony F. Chan,et al.  Mathematical Models for Local Nontexture Inpaintings , 2002, SIAM J. Appl. Math..

[21]  Massimo Fornasier,et al.  Fast, robust and efficient 2D pattern recognition for re-assembling fragmented images , 2005, Pattern Recognit..

[22]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[23]  Tony F. Chan,et al.  Inpainting based on nonlinear transport and diffusion , 2002 .

[24]  Tony F. Chan,et al.  Euler's Elastica and Curvature-Based Inpainting , 2003, SIAM J. Appl. Math..

[25]  Richard G. Baraniuk,et al.  An Information-Theoretic Approach to Distributed Compressed Sensing ∗ , 2005 .

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

[27]  Richard G. Baraniuk,et al.  Distributed Compressed Sensing Dror , 2005 .

[28]  S. Mallat A wavelet tour of signal processing , 1998 .

[29]  Joel A. Tropp,et al.  ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATION , 2006 .

[30]  Tony F. Chan,et al.  6. Image Inpainting , 2005 .

[31]  D. Mumford Elastica and Computer Vision , 1994 .

[32]  Simon Masnou Filtrage et désocclusion d'images par méthodes d'ensembles de niveau , 1998 .

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

[34]  Massimo Fornasier,et al.  Restoration of Color Images by Vector Valued BV Functions and Variational Calculus , 2007, SIAM J. Appl. Math..