## Abstract

This paper studies the application of preconditioned conjugate gradient methods in high resolution image reconstruction problems. We consider reconstructing high resolution images from multiple undersampled, shifted, degraded frames with subpixel displacement errors. The resulting blurring matrices are spatially variant. The classical Tikhonov regularization and the Neumann boundary condition are used in the reconstruction process. The preconditioners are derived by taking the cosine transform approximation of the blurring matrices. We prove that when the L_{2} or H_{1} norm regularization functional is used, the spectra of the preconditioned normal systems are clustered around 1 for sufficiently small subpixel displacement errors. Conjugate gradient methods will hence converge very quickly when applied to solving these preconditioned normal equations. Numerical examples are given to illustrate the fast convergence.

Original language | English (US) |
---|---|

Pages (from-to) | 89-104 |

Number of pages | 16 |

Journal | Linear Algebra and Its Applications |

Volume | 316 |

Issue number | 1-3 |

DOIs | |

State | Published - Sep 1 2000 |

## Keywords

- Discrete cosine transform
- Image reconstruction
- Neumann boundary condition
- Toeplitz matrix

## ASJC Scopus subject areas

- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics