Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Best Kronecker Product Approximation of The Blurring Operator in Three Dimensional Image Restoration Problems
Tarbiat Modares University, Tehran, Iran.
Tarbiat Modares University, Tehran, Iran.
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-2281-856X
2014 (English)In: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 35, no 3, 1086-1104 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, we propose a method to find the best Kronecker product approximationof the blurring operator which arises in three dimensional image restoration problems. We show thatthis problem can be reduced to a well known rank-1 approximation of the scaled three dimensionalpoint spread function (PSF) array, which is much smaller. This approximation can be used as apreconditioner in solving image restoration problems with iterative methods. The comparison ofthe approximation by the new scaled PSF array and approximation by the original PSF array that is used in [J. G. Nagy and M. E. Kilmer, IEEE Trans. Image Process., 15 (2006), pp. 604–613],confirms the performance of the new proposed approximation.

Place, publisher, year, edition, pages
Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. Vol. 35, no 3, 1086-1104 p.
Keyword [en]
image restoration, Kronecker product approximation, tensor decomposition, tensor best rank-1 approximation, preconditioner
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-109945DOI: 10.1137/130917260ISI: 000343229800013OAI: oai:DiVA.org:liu-109945DiVA: diva2:741721
Available from: 2014-08-28 Created: 2014-08-28 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

fulltext(423 kB)475 downloads
File information
File name FULLTEXT01.pdfFile size 423 kBChecksum SHA-512
95fa21b4cbc0a7c4725d212fdc9a732227a94eb61998b191fce9966f4375c108a59ac47e9171cdd2df657a245ce625a3f7f9416607c2cbe4eb2809fe8ba4b68e
Type fulltextMimetype application/pdf
fulltext(423 kB)55 downloads
File information
File name FULLTEXT02.pdfFile size 423 kBChecksum SHA-512
95fa21b4cbc0a7c4725d212fdc9a732227a94eb61998b191fce9966f4375c108a59ac47e9171cdd2df657a245ce625a3f7f9416607c2cbe4eb2809fe8ba4b68e
Type fulltextMimetype application/pdf
fulltext(423 kB)4 downloads
File information
File name FULLTEXT03.pdfFile size 423 kBChecksum SHA-512
95fa21b4cbc0a7c4725d212fdc9a732227a94eb61998b191fce9966f4375c108a59ac47e9171cdd2df657a245ce625a3f7f9416607c2cbe4eb2809fe8ba4b68e
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Eldén, Lars
By organisation
Computational MathematicsThe Institute of Technology
In the same journal
SIAM Journal on Matrix Analysis and Applications
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 534 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 130 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf