Abstract
Many problems of computer-aided tomography, pattern recognition, image processing and data compression involve a reconstruction of bidimensional discrete sets from their projections. [3–5,10,12,16,17]. The main difficulty involved in reconstructing a set Λ starting out from its orthogonal projections ( V,H) is the ‘ambiguity’ arising from the fact that, in some cases, many different sets have the same projections ( V,H). In this paper, we study this problem of ambiguity with respect to convex polyominoes, a class of bidimensional discrete sets that satisfy some connection properties similar to those used by some reconstruction algorithms. We determine an upper and lower bound to the maximum number of convex polyominoes having the same orthogonal projections ( V,H), with V ∈ N n and H ∈ N m . We prove that under these connection conditions, the ambiguity is sometimes exponential. We also define a construction in order to obtain some convex polyominoes having the same orthogonal projections.
Published Version
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.
