Skip to main content
Top
Published in:
Cover of the book

2013 | OriginalPaper | Chapter

1. Mathematical Methods for Spectral Image Reconstruction

Authors : Wolfgang Baatz, Massimo Fornasier, Jan Haskovec

Published in: Scientific Computing and Cultural Heritage

Publisher: Springer Berlin Heidelberg

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Cai JF, Candès EJ, Shen Z (2008) A singular value thresholding algorithm for matrix completion. October. arXiv:0810.3286 Cai JF, Candès EJ, Shen Z (2008) A singular value thresholding algorithm for matrix completion. October. arXiv:0810.3286
2.
go back to reference Candès EJ, Recht B (2009) Exact matrix completion via convex optimization. Foundations of Computational Mathematics. arXiv:0805.4471v1 Candès EJ, Recht B (2009) Exact matrix completion via convex optimization. Foundations of Computational Mathematics. arXiv:0805.4471v1
3.
go back to reference Candès EJ, Tao T (in press) The power of matrix completion: near-optimal convex relaxation. IEEE Inf Theory Candès EJ, Tao T (in press) The power of matrix completion: near-optimal convex relaxation. IEEE Inf Theory
4.
go back to reference 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 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
5.
go back to reference 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 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
6.
go back to reference Fornasier M, Haskovec J, Vybiral J (in preparation) The block completion method for matrix reconstruction Fornasier M, Haskovec J, Vybiral J (in preparation) The block completion method for matrix reconstruction
7.
go back to reference Fornasier M, Rauhut H, Ward R (in preparation) Iteratively re-weighted least squares for low-rank matrix completion Fornasier M, Rauhut H, Ward R (in preparation) Iteratively re-weighted least squares for low-rank matrix completion
8.
go back to reference 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–389CrossRef 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–389CrossRef
9.
go back to reference Recht B, Fazel M, Parrilo P (2007, submitted) Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Rev. arXiv: 0706.4138 Recht B, Fazel M, Parrilo P (2007, submitted) Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Rev. arXiv: 0706.4138
10.
go back to reference 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) 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)
11.
go back to reference Wyszecki G, Stiles WS (1982) Color science: concepts and methods, quantitative data and formulae. Wiley, New York Wyszecki G, Stiles WS (1982) Color science: concepts and methods, quantitative data and formulae. Wiley, New York
Metadata
Title
Mathematical Methods for Spectral Image Reconstruction
Authors
Wolfgang Baatz
Massimo Fornasier
Jan Haskovec
Copyright Year
2013
Publisher
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-28021-4_1

Premium Partner