A fixed-memory moving, expanding window for obtaining scatter corrections in X-ray CT and other stochastic averages

Published: 1 January 2015| Version 1 | DOI: 10.17632/vpndsw35n7.1
Zachary H. Levine, Adam L. Pintar


Abstract A simple algorithm for averaging a stochastic sequence of 1D arrays in a moving, expanding window is provided. The samples are grouped in bins which increase exponentially in size so that a constant fraction of the samples is retained at any point in the sequence. The algorithm is shown to have particular relevance for a class of Monte Carlo sampling problems which includes one characteristic of iterative reconstruction in computed tomography. The code is available in the CPC program library ... Title of program: mewAvg Catalogue Id: AEXA_v1_0 Nature of problem Some problems require both a self-consistant solution and Monte Carlo sampling. Monte Carlo samples based on early iterates may not be useful, but discarding all samples and resampling every time solution parameters change can be wasteful. Versions of this program held in the CPC repository in Mendeley Data AEXA_v1_0; mewAvg; 10.1016/j.cpc.2015.05.019 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)



Computational Physics, Computational Method