A MAP-based algorithm for spectroscopic semi-blind deconvolution

• Published in: Analyst (London) Vol. 137; no. 16; pp. 3862 - 3873
• Main Authors: Liu, Hai, Zhang, Tianxu, Yan, Luxin, Fang, Houzhang, Chang, Yi
• Format: Journal Article
• Language: English
• Published: Cambridge Royal Society of Chemistry 21.08.2012
• Subjects: Algorithms; Analytical chemistry; Chemistry; Deconvolution; Estimates; Exact sciences and technology; Kernels; Mathematical models; Probability density functions; Spectra; Spectroscopy; Random noise; Deconvolution; Estimation; Use; Probability density function; Peak; Method; Algorithm; Optimization; Likelihood function
• ISSN: 0003-2654; 1364-5528; 1364-5528
• DOI: 10.1039/c2an16213j

Spectroscopic data often suffer from common problems of bands overlapping and random noise. In this paper, we show that the issue of overlapping peaks can be considered as a maximum a posterior (MAP) problem and be solved by minimizing an object functional that includes a likelihood term and two prior terms. In the MAP framework, the likelihood probability density function (PDF) is constructed based on a spectral observation model, a robust Huber-Markov model is used as spectra prior PDF, and the kernel prior is described based on a parametric Gaussian function. Moreover, we describe an efficient optimization scheme that alternates between latent spectrum recovery and blur kernel estimation until convergence. The major novelty of the proposed algorithm is that it can estimate the kernel slit width and latent spectrum simultaneously. Comparative results with other deconvolution methods suggest that the proposed method can recover spectral structural details as well as suppress noise effectively. Overlapping bands and random noise create problems in spectroscopy. We describe an algorithm that estimates kernel slit width and latent spectrum simultaneously.