Abstract
Binary tomography deals with the problem of reconstructing a binary image from its projections. Depending on properties of the unkown original image, the constraint that the image is binary enables accurate reconstructions from a relatively small number of projection angles. Even in cases when insufficient information is available to compute an accurate reconstruction of the complete image, it may still be possible to determine certain features of it, such as straight boundaries, or homogeneous regions. In this paper, we present a computational technique for discovering the possible presence of such features in the unknown original image. We present numerical experiments, showing that it is often possible to accurately identify the presence of certain features, even without a full reconstruction.
Chapter PDF
References
Batenburg, K.J.: A network flow algorithm for reconstructing binary images from continuous X-rays. J. Math. Im. Vision 30(3), 231–248 (2008)
Batenburg, K.J., Sijbers, J.: Dart: a practical reconstruction algorithm for discrete tomography. IEEE Trans. Image Processing 20(9), 2542–2553 (2011)
Herman, G.T.: Fundamentals of Computerized Tomography: Image reconstruction from projections. Springer (2009)
Schüle, T., Schnörr, C., Weber, S., Hornegger, J.: Discrete tomography by convex-concave regularization and D.C. programming. Discr. Appl. Math. 151, 229–243 (2005)
Alpers, A., Gritzmann, P.: On stability, error correction, and noise compensation in discrete tomography. SIAM Journal on Discrete Mathematics 20(1), 227–239 (2006)
Alpers, A., Brunetti, S.: Stability results for the reconstruction of binary pictures from two projections. Image and Vision Computing 25(10), 1599–1608 (2007)
Van Dalen, B.: Stability results for uniquely determined sets from two directions in discrete tomography. Discrete Mathematics 309, 3905–3916 (2009)
Hajdu, L., Tijdeman, R.: Algebraic aspects of discrete tomography. J. Reine Angew. Math. 534, 119–128 (2001)
Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Boston (1999)
Gara, M., Tasi, T.S., Balazs, P.: Learning connectedness and convexity of binary images from their projections. Pure Math. Appl. 20(1-2), 27–48 (2009)
Helgason, S.: The Radon transform. Birkhäuser, Boston (1980)
Stolk, A., Batenburg, K.J.: An algebraic framework for discrete tomography: Revealing the structure of dependencies. SIAM J. Discrete Math. 24(3), 1056–1079 (2010)
Batenburg, K.J., Fortes, W., Hajdu, L., Tijdeman, R.: Bounds on the Difference between Reconstructions in Binary Tomography. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 369–380. Springer, Heidelberg (2011)
Kak, A.C., Slaney, M.: Principles of Computerized Tomographic Imaging. SIAM (2001)
Björck, Å.: Numerical methods for least square problems. SIAM, Linköping University, Sweden (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fortes, W., Batenburg, K.J. (2013). A Method for Feature Detection in Binary Tomography. In: Gonzalez-Diaz, R., Jimenez, MJ., Medrano, B. (eds) Discrete Geometry for Computer Imagery. DGCI 2013. Lecture Notes in Computer Science, vol 7749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37067-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-37067-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37066-3
Online ISBN: 978-3-642-37067-0
eBook Packages: Computer ScienceComputer Science (R0)