Abstract
Many image processing applications require computing approximate solutions of very large, ill-conditioned linear systems. Physical assumptions of the imaging system usually dictate that the matrices in these linear systems have exploitable structure. The specific structure depends on (usually simplifying) assumptions of the physical model and other considerations such as boundary conditions. When reflexive (Neumann) boundary conditions are used, the coefficient matrix is a combination of Toeplitz and Hankel matrices. Kronecker products also occur, but this structure is not obvious from measured data. In this paper we discuss a scheme for computing a (possibly approximate) Kronecker product decomposition of structured matrices in image processing, which extends previous work by Kamm and Nagy [SIAM J. Matrix Anal. Appl., 22 (2000), pp. 155--172] to a wider class of image restoration problems.
| Original language | English |
|---|---|
| Pages (from-to) | 829-841 |
| Number of pages | 13 |
| Journal | SIAM Journal on Matrix Analysis and Applications |
| Volume | 25 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Jan 2003 |
User-Defined Keywords
- image restoration
- Kronecker product
- singular value decomposition
Fingerprint
Dive into the research topics of 'Kronecker Product Approximations forImage Restoration with Reflexive Boundary Conditions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver