Skip to main content
SpringerLink
Log in

A Fast Algorithm for Reconstructing hv-Convex Binary Images from Their Horizontal Projection

  • Conference paper
Advances in Visual Computing (ISVC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 8888))

Included in the following conference series:

  • 2416 Accesses

Abstract

The reconstruction of certain types of binary images from their projections is a frequently studied problem in combinatorial image processing. hv-convex images with fixed projections play an important role in discrete tomography. In this paper, we provide a fast polynomial-time algorithm for reconstructing canonical hv-convex images with given number of 4-connected components and with minimal number of columns satisfying a prescribed horizontal projection. We show that the method gives a solution that is always 8-connected. We also explain how the algorithm can be modified to obtain solutions with any given number of columns, and also with non-connected components.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balázs, P.: Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections. In: Wiederhold, P., Barneva, R.P. (eds.) IWCIA 2009. LNCS, vol. 5852, pp. 280–288. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Balázs, P., Balogh, E., Kuba, A.: Reconstruction of 8-connected but not 4-connected hv-convex discrete sets. Discrete Applied Mathematics 147, 149–168 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Balogh, E., Kuba, A., Dévényi, C., Del Lungo, A.: Comparison of algorithms for reconstructing hv-convex discrete sets. Linear Algebra Appl. 339, 23–35 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theor. Comput. Sci. 155, 321–347 (1996)

    Article  MATH  Google Scholar 

  5. Batenburg, K.J., Bals, S., Sijbers, J., Kuebel, C., Midgley, P.A., Hernandez, J.C., Kaiser, U., Encina, E.R., Coronado, E.R., Van Tendeloo, G.: 3D imaging of nanomaterials by discrete tomography. Ultramicroscopy 109(6), 730–740 (2009)

    Article  Google Scholar 

  6. Baumann, J., Kiss, Z., Krimmel, S., Kuba, A., Nagy, A., Rodek, L., Schillinger, B., Stephan, J.: Discrete tomography methods for nondestructive testing, ch. 14 of [13]

    Google Scholar 

  7. Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. Journal of Computer and System Sciences 7(4), 448–461 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  8. Brunetti, S., Del Lungo, A., Del Ristoro, F., Kuba, A., Nivat, M.: Reconstruction of 4- and 8-connected convex discrete sets from row and column projections. Lin. Algebra Appl. 339, 37–57 (2001)

    Article  MATH  Google Scholar 

  9. Chrobak, M., Dürr, C.: Reconstructing hv-convex polyominoes from orthogonal projections. Inform. Process. Lett. 69, 283–289 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Golomb, S.W.: Polyominoes. Charles Scriber’s Sons, New York (1965)

    Google Scholar 

  11. Hantos, N., Balázs, P.: Reconstruction and enumeration of hv-convex polyominoes with given horizontal projection. In: Ruiz-Shulcloper, J., Sanniti di Baja, G. (eds.) CIARP 2013, Part I. LNCS, vol. 8258, pp. 100–107. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Herman, G.T., Kuba, A. (eds.): Advances in Discrete Tomography and its Applications. Birkhäuser, Boston (2007)

    MATH  Google Scholar 

  13. Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Boston (1999)

    MATH  Google Scholar 

  14. Kuba, A.: Reconstruction in different classes of 2D discrete sets. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 153–163. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  15. Woeginger, G.W.: The reconstruction of polyominoes from their orthogonal projections. Inform. Process. Lett. 77, 225–229 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Algorithms and Their Applications, Eötvös Loránd University, Pázmány Péter sétány 1/C, H-1117, Budapest, Hungary

    Norbert Hantos

  2. Department of Image Processing and Computer Graphics, University of Szeged, Árpád tér 2, H-6720, Szeged, Hungary

    Péter Balázs

Authors
  1. Norbert Hantos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Péter Balázs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Nevada at Reno, USA

    George Bebis

  2. NASA Ames Research Center, Moffett Field, CA, USA

    Richard Boyle

  3. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

    Bahram Parvin

  4. Desert Research Institute, Reno, NV, USA

    Darko Koracin

  5. The University of Texas at Dallas, 75080, Richardson, TX, USA

    Ryan McMahan

  6. NextGen Interactions, 27604, Raleigh, NC, USA

    Jason Jerald

  7. Indiana University, 46202, Indianapolis, IN, USA

    Hui Zhang

  8. Microsoft Research, 1 Microsoft Way, 98052, Redmond, WA, USA

    Steven M. Drucker

  9. University of Delaware, 19716-2712, Newark, DE, USA

    Chandra Kambhamettu

  10. Intel Corp., 95054, Sata Clara, CA, USA

    Maha El Choubassi

  11. Computer Graphics and Interactive Media Lab, Department of Computer Science, University of Houston, 77004, Houston, TX, USA

    Zhigang Deng

  12. NVIDIA, 34788, Leesburg, FL, USA

    Mark Carlson

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Hantos, N., Balázs, P. (2014). A Fast Algorithm for Reconstructing hv-Convex Binary Images from Their Horizontal Projection. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2014. Lecture Notes in Computer Science, vol 8888. Springer, Cham. https://doi.org/10.1007/978-3-319-14364-4_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14364-4_76

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14363-7

  • Online ISBN: 978-3-319-14364-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation