Abstract
In this paper, we consider the binary tomography reconstruction problem. A new ap- proach is proposed what exploits a possibility provided by the natural structure of the triangular grid, which is not available in the case of the classical square grid. In contrast to the square grid, in the case of the triangular grid information need for the reconstruction of the unknown image is increasing when not only one, but two projections are used by lanes. In this way, the number of 4 andr shaped pixels per lane can be determined. We propose this type of projection approach and call it dense projections. The reconstruction is based on three projection directions by the lane directions of the grid (they are analogous to row and column directions on the square grid). Our algorithm is deterministic and uses energy minimization technique to find (near) optimal solution in a reasonable time. The experimental evaluation of the new method, using regular hexagon shaped test images, is given. Comparison with reconstructions based on the square grid is also considered.
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.
