Fourier-ratio deconvolution and its Bayesian equivalent

  1. Get@NRC: Fourier-ratio deconvolution and its Bayesian equivalent (Opens in a new window)
DOIResolve DOI:
AuthorSearch for: ; Search for: ; Search for: ; Search for: ; Search for:
Proceedings titleMicron (Oxford, England : 1993)
ConferenceAnnual Meeting of the Microscopical Society of Canada 2007, 12-15 June 2007, Edmonton, Alberta, Canada
Pages642647; # of pages: 6
SubjectEELS; TEM; deconvolution; Bayesian sharpening; plural scattering
AbstractWe discuss how an inner-shell electron energy-loss spectrum can be processed using Bayesian (maximum-entropy or maximum-likelihood) deconvolution to simultaneously remove plural scattering and improve the energy resolution. As in Fourier-ratio deconvolution, a low-loss spectrum (recorded from the same area of specimen) is used as a kernel or resolution function. This procedure avoids the need to record the zero-loss peak in the absence of a specimen and uncertainties related to the width of the zero-loss peak. Unlike the case of Fourier-ratio deconvolution, we find that core-loss data do not require pre-edge background subtraction and extrapolation towards zero intensity; simply matching the intensity at both ends of the region is usually sufficient to avoid oscillatory artifacts. Using the low-loss spectrum as both data and kernel yields a zero-loss peak whose width provides an indication of the energy resolution as a function of the number of iterations. Finally, we argue that Fourier-ratio deconvolution or its Bayesian equivalent is the correct way to remove the substrate or matrix contribution to an energy-loss spectrum recorded from a particle on a substrate or embedded in a matrix.
Publication date
AffiliationNational Research Council Canada; National Institute for Nanotechnology
Peer reviewedYes
NPARC number12329204
Export citationExport as RIS
Report a correctionReport a correction
Record identifier4817ac00-f977-4bbf-96fe-84f2c66f1afa
Record created2009-09-10
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: