V. Masilamani and Kamala Krithivasan Algorithm for Reconstructing 3DBinary Matrix with Periodicity Constraints from Two Projections
3490 - 3495
2008
2
10
International Journal of Computer, Electrical, Automation, Control and Information Engineering http://waset.org/publications/9296
http://waset.org/publications/22
World Academy of Science, Engineering and Technology
We study the problem of reconstructing a three dimensional binary matrices whose interiors are only accessible through few projections. Such question is prominently motivated by the demand in material science for developing tool for reconstruction of crystalline structures from their images obtained by highresolution transmission electron microscopy. Various approaches have been suggested to reconstruct 3Dobject (crystalline structure) by reconstructing slice of the 3Dobject. To handle the illposedness of the problem, a priori information such as convexity, connectivity and periodicity are used to limit the number of possible solutions. Formally, 3Dobject (crystalline structure) having a priory information is modeled by a class of 3Dbinary matrices satisfying a priori information. We consider 3Dbinary matrices with periodicity constraints, and we propose a polynomial time algorithm to reconstruct 3Dbinary matrices with periodicity constraints from two orthogonal projections.
International Science Index 22, 2008