Loading…

A MAP-based algorithm for spectroscopic semi-blind deconvolution

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 pri...

Full description

Saved in:
Bibliographic Details
Published in:Analyst (London) 2012-08, Vol.137 (16), p.3862-3873
Main Authors: Liu, Hai, Zhang, Tianxu, Yan, Luxin, Fang, Houzhang, Chang, Yi
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0003-2654
1364-5528
DOI:10.1039/c2an16213j