Abstract
In earlier works [1,2] it was concluded that image reconstruction from incomplete data can be achieved through an iterative transform algorithm which utilizes the a priori information on the object to compensate for the missing data. The iterative transform algorithm is schematically illustrated in Fig. 1. The image is transformed back and forth between the object space and the projection space, being corrected by the a priori information on the object in the object space, and by the known projections in the projection space. The a priori information in the object space includes a boundary enclosing the object, and an upper bound and a lower bound of the object density. Among these three pieces of a priori information, the object-enclosing boundary is the most important one; experience indicated that the upper and lower bound constraints usually make 1–2% difference in the image quality. The closer the enclosing boundary matches the actual shape of the object, the better will be the quality of the reconstructed image.
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.
