Share Email Print

Proceedings Paper

Variational Bayesian super resolution acceleration using preconditioned conjugate gradient
Author(s): Jingyu Chen M.D.; Yigang Wang; Shi Li
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The high computational complex of Super Resolution (SR) is a focused topic in many imaging applications, which involves to solve huge sparse linear systems. Solving such systems usually employs the iterative methods, such as Conjugate Gradient (CG). But in most variational Bayesian SR algorithms, CG method converges slowly with the coefficient matrix being ill-conditioned and takes long execution time. In this paper, we propose Preconditioned Conjugate Gradient (PCG) to solve the problem and analyze the performance of the different PCG solvers, Jacobi and incomplete Cholesky decomposition(IC). Experimental results demonstrate that the new method achieves accelerations compared with the traditional one while maintaining high visual quality of the reconstructed HR image, and, especially, the IC solver has a better performance.

Paper Details

Date Published: 9 August 2018
PDF: 6 pages
Proc. SPIE 10806, Tenth International Conference on Digital Image Processing (ICDIP 2018), 108066O (9 August 2018); doi: 10.1117/12.2502870
Show Author Affiliations
Jingyu Chen M.D., Hangzhou Dianzi Univ. (China)
Yigang Wang, Hangzhou Dianzi Univ. (China)
Shi Li, Hangzhou Dianzi Univ. (China)

Published in SPIE Proceedings Vol. 10806:
Tenth International Conference on Digital Image Processing (ICDIP 2018)
Xudong Jiang; Jenq-Neng Hwang, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?