Abstract
A ring of positron annihilation detectors capable of two independent motions in the plane of the ring is considered. It can rotate around its center, and the whole ring may move so that its center traces a circular path. Provided certain parameters are chosen according to given formulas, data collected by such a detector ring can be reorganized (rebinned), in a computationally very inexpensive fashion, so that the data items in each bin are measurements along parallel lines spaced at small equal intervals. Efficient high resolution reconstruction algorithms that assume such data organization can therefore be applied to data collected collected by a moving positron ring detector. The method is demonstrated on a realistic example.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
