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.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cai JF, Candès EJ, Shen Z (2008) A singular value thresholding algorithm for matrix completion. October. arXiv:0810.3286
Candès EJ, Recht B (2009) Exact matrix completion via convex optimization. Foundations of Computational Mathematics. arXiv:0805.4471v1
Candès EJ, Tao T (in press) The power of matrix completion: near-optimal convex relaxation. IEEE Inf Theory
Chistov AL, Grigoriev Dyu (1984) Complexity of quantier elimination in the theory of algebraically closed elds. In: Proceedings of the 11th symposium on mathematical foundations of computer science. Lecture notes in computer science, vol 176. Springer, Berlin, p 1731
Daubechies I, DeVore R, Fornassier M, Güntürk CS (2009) Iteratively re-weighted least squares minimization for sparse recovery. Commun Pure Appl Math 35
Fornasier M, Haskovec J, Vybiral J (in preparation) The block completion method for matrix reconstruction
Fornasier M, Rauhut H, Ward R (in preparation) Iteratively re-weighted least squares for low-rank matrix completion
Levinson R, Berdahl P, Akbari H (2005) Solar spectral optical properties of pigments–Part II: survey of common colorants. Sol Energ Mat Sol C 89:351–389
Recht B, Fazel M, Parrilo P (2007, submitted) Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Rev. arXiv: 0706.4138
Wright J, Ma Y, Ganesh A, Rao S (2009) Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization. J ACM (to appear)
Wyszecki G, Stiles WS (1982) Color science: concepts and methods, quantitative data and formulae. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baatz, W., Fornasier, M., Haskovec, J. (2013). Mathematical Methods for Spectral Image Reconstruction. In: Bock, H., Jäger, W., Winckler, M. (eds) Scientific Computing and Cultural Heritage. Contributions in Mathematical and Computational Sciences, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28021-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-28021-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28020-7
Online ISBN: 978-3-642-28021-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)