Mathematical Methods for Spectral Image Reconstruction

Abstract

We present a method for recovery of damaged parts of old paintings (frescoes), caused by degradation of the pigments contained in the paint layer. The original visible colour information in the damaged parts can be faithfully recovered from measurements of absorption spectra in the invisible region (IR and UV) and from the full spectral data of the well preserved parts of the image. We test algorithms recently designed for low-rank matrix recovery from few observations of their entries. In particular, we address the singular value thresholding (SVT) algorithm by Cai, Candès and Shen, and the iteratively re-weighted least squares minimization (IRLS) by Daubechies, DeVore, Fornasier and Güntürk, suitably adapted to work for low-rank matrices. In addition to these two algorithms, which are iterative in nature, we propose a third non-iterative method (which we call block completion, BC), which can be applied in the situation when the missing elements of a low-rank matrix constitute a block (submatrix); this is always true in our application. We shortly introduce the SVT and IRLS algorithms and present a simple analysis of the BC method. We eventually demonstrate the performance of these three methods on a sample fresco.