Matrix Structures and Parallel Algorithms for Image Superresolution Reconstruction
Authors:
- Qiang ZhangQZQiang Zhang
- Richard T. GuyRGRichard T. Guy
- Robert J. PlemmonsRPRobert J. Plemmons
- 1 January 2010
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 31 (4) , 1873-1893
Abstract
Computational resolution enhancement (superresolution) is generally regarded as a memory-intensive process due to the large matrix-vector calculations involved. In this paper, a detailed study of the structure of the $n^2\times n^2$ superresolution matrix is used to decompose the matrix into nine matrices of size $l^2\times l^2$, where l is the upsampling factor. As a result, previously large matrix-vector products can be broken into many small, parallelizable products. An algorithm is presented that utilizes the structural results to perform superresolution on compact, highly parallel architectures such as field-programmable gate arrays.
Keywords
This publication has 15 references indexed in Scilit:
- High-resolution iris image reconstruction from low-resolution imagery2006
- Numerical methods for coupled super-resolutionInverse Problems, 2006
- Image superresolution for improved automatic target recognition2004
- Advances and challenges in super‐resolutionInternational Journal of Imaging Systems and Technology, 2004
- Super-resolution image reconstruction: a technical overviewIEEE Signal Processing Magazine, 2003
- A computationally efficient superresolution image reconstruction algorithmIEEE Transactions on Image Processing, 2001
- Iterative image restoration using approximate inverse preconditioningIEEE Transactions on Image Processing, 1996
- Field-Programmable Gate Arrays1992
- Permutations by Cutting and ShufflingSIAM Review, 1961
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952