论文信息 - Quickly converging iterative algorithm for measurand reconstruction

Quickly converging iterative algorithm for measurand reconstruction

Abstract Among the various methods used to solve the problem of measurand reconstruction, the iteratives ones are popular owing to their simplicity. However, the long computation time they usually require is a serious drawback. A new quickly converging iterative algorithm, derived from the Jansson iterative algorithm is proposed. The study of the algorithm is carried out using synthetic and real-world data. The results of reconstruction are compared with those obtained by means of the Jansson iterative algorithm and the Tikhonov regularization-based algorithm.

Leszek Szczecinski | A. Barwicz

[1] V. A. Morozov,et al. Methods for Solving Incorrectly Posed Problems , 1984 .

[2] Roman Z. Morawski,et al. Original-domain Tikhonov regularization and non-negativity constraint improve resolution of spectrophotometric analyses☆ , 1996 .

[3] P. Jansson. Deconvolution : with applications in spectroscopy , 1984 .

[4] Dianne P. O'Leary,et al. The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems , 1993, SIAM J. Sci. Comput..

[5] P. Crilly. A quantitative evaluation of various iterative deconvolution algorithms , 1991 .

[6] A. Carasso. Determining Surface Temperatures from Interior Observations , 1982 .

[7] Roman Z. Morawski. Unified approach to measurement signal reconstruction , 1991 .

[8] P. B. Crilly,et al. A digital signal processing chip for iterative deconvolution restoration algorithms , 1991, [1991] Conference Record. IEEE Instrumentation and Measurement Technology Conference.