z-logo
open-access-imgOpen Access
Regridding reconstruction algorithm for real‐time tomographic imaging
Author(s) -
Marone F.,
Stampai M.
Publication year - 2012
Publication title -
journal of synchrotron radiation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.172
H-Index - 99
ISSN - 1600-5775
DOI - 10.1107/s0909049512032864
Subject(s) - algorithm , computer science , tomographic reconstruction , bottleneck , projection (relational algebra) , fourier transform , cartesian coordinate system , resampling , computer vision , data acquisition , noise (video) , iterative reconstruction , optics , physics , mathematics , image (mathematics) , geometry , quantum mechanics , embedded system , operating system
Sub‐second temporal‐resolution tomographic microscopy is becoming a reality at third‐generation synchrotron sources. Efficient data handling and post‐processing is, however, difficult when the data rates are close to 10 GB s −1 . This bottleneck still hinders exploitation of the full potential inherent in the ultrafast acquisition speed. In this paper the fast reconstruction algorithm gridrec , highly optimized for conventional CPU technology, is presented. It is shown that gridrec is a valuable alternative to standard filtered back‐projection routines, despite being based on the Fourier transform method. In fact, the regridding procedure used for resampling the Fourier space from polar to Cartesian coordinates couples excellent performance with negligible accuracy degradation. The stronger dependence of the observed signal‐to‐noise ratio for gridrec reconstructions on the number of angular views makes the presented algorithm even superior to filtered back‐projection when the tomographic problem is well sampled. Gridrec not only guarantees high‐quality results but it provides up to 20‐fold performance increase, making real‐time monitoring of the sub‐second acquisition process a reality.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here