Fast Slant Stack : A notion of Radon Transform for Data in a Cartesian Grid which is Rapidly

@inproceedings{Averbuch2001FastSS,
title={Fast Slant Stack : A notion of Radon Transform for Data in a Cartesian Grid which is Rapidly},
author={Amir Averbuch and Ronald R. Coifman and David L. Donoho and Moshe Israeli and Johan Walden},
year={2001}
}

We define a notion of Radon Transform for data in an n by n grid. It is based on summation along lines of absolute slope less than 1 (as a function either of x or of y), with values at non-Cartesian locations defined using trigonometric interpolation on a zero-padded grid. The definition is geometrically faithful: the lines exhibit no 'wraparound effects'. For a special set of lines equispaced in slope (rather than angle), we describe an exact algorithm which uses O(N log N) flops, where N = n… CONTINUE READING