Technical Note: Practical implementation strategies of cycloidal computed tomography.

2021 
PURPOSE Cycloidal computed tomography is a novel imaging concept which combines a highly structured x-ray beam, offset lateral under-sampling, and mathematical data recovery to obtain high-resolution images efficiently and flexibly, even with relatively large source focal spots and detector pixels. The method reduces scanning time and, potentially, delivered dose compared to other sampling schemes. This study aims to present and discuss several implementation strategies for cycloidal computed tomography (CT) in order to increase its ease of use and facilitate uptake within the imaging community. METHODS The different implementation strategies presented are step-and-shoot, continuous unidirectional, continuous back-and-forth, and continuous pixel-wise scanning. In step-and-shoot scans the sample remains stationary while frames are acquired, whereas in all other cases the sample moves through the scanner continuously. The difference between the continuous approaches is the trajectory by which the sample moves within the field of view. RESULTS All four implementation strategies are compatible with a standard table-top x-ray setup. With the experimental setup applied here, step-and-shoot acquisitions yield the best spatial resolution (around 30 µm), but are the most time-consuming (1.4 h). Continuous unidirectional and back-and-forth images have resolution between 30 and 40 µm, and are faster (35 min). Continuous pixel-wise images are equally time-efficient, although technical challenges caused a small loss in image quality with a resolution of about 50 µm. CONCLUSION The authors show that cycloidal CT can be implemented in a variety of ways with high quality results. They believe this posits cycloidal CT as a powerful imaging alternative to more time-consuming and less flexible methods in the field.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    17
    References
    0
    Citations
    NaN
    KQI
    []