Decomposition Algorithms for Reconstructing Discrete Sets with Disjoint Components
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.
Unable to display preview. Download preview PDF.
- 1.Balazs, P.: A decomposition technique for reconstructing discrete sets from four projections. Image and Vision Computing, submitted.Google Scholar
- 10.Del Lungo, A., Nivat, M.: Reconstruction of connected sets from two projections. In , pp. 163–188 (1999).Google Scholar
- 12.Gardner, R.J., Gritzmann, P.: Uniqueness and complexity in discrete tomography. In , pp. 85–113 (1999).Google Scholar
- 13.Golomb, S.W.: Polyominoes. Scribner, New York, NY (1965).Google Scholar