01505nas a2200157   4500008004100000020002200041245008700063210006900150260003900219300001400258520089400272100002001166700002101186700001701207856012301224       2007                        eng d  a978-0-8176-3614-200aDecomposition Algorithms for Reconstructing Discrete Sets with Disjoint Components0 aDecomposition Algorithms for Reconstructing Discrete Sets with D  aCambridgebBirkhauser Bostonc2007  a153 - 1733 a<p>The reconstruction of discrete sets from their projections is a frequently studied field in discrete tomography with applications in electron microscopy, image processing, radiology, and so on. Several efficient reconstruction algorithms have been developed for certain classes of discrete sets having some good geometrical properties. On the other hand, it has been shown that the reconstruction under certain circumstances can be very time-consuming, even NP-hard. In this chapter we show how prior information that the set to be reconstructed consists of several components can be exploited in order to facilitate the reconstruction. We present some general techniques to decompose a discrete set into components knowing only its projections and thus reduce the reconstruction of a general discrete set to the reconstruction of single components, which is usually a simpler task.</p>1 aBalázs, Péter1 aHerman, Gábor T1 aKuba, Attila  uhttps://inf.u-szeged.hu/publication/decomposition-algorithms-for-reconstructing-discrete-sets-with-disjoint-components