Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Efficient Approach for Reconstruction of Convex Binary Images Branch and Bound Method

  • Conference paper
  • First Online:
Proceedings of the Third International Conference on Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 259))

  • 1506 Accesses

Abstract

In this paper reconstruction algorithm of convex binary image in discrete tomography made efficient by implementing branch and bound method. We focus on diagonal and anti-diagonal (dad) projections and comparison done with the conventional horizontal and vertical (hv) projections. It was shown that proposed strategy is computationally strong and gives fast reconstruction.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

Similar content being viewed by others

References

  1. Chrobak, M., Durr, C.: Reconstructing hv-convex polyominoes from orthogonal projection. Inf. Process. Lett. 69(6) (1999)

    Google Scholar 

  2. Del Lungo, A.: Reconstructing permutation matrices from diagonal sums. Theor. Comput. Sci. 281(1–2), pp. 235–249 (2002)

    Google Scholar 

  3. Kuba, A.: Reconstruction of two directionally connected binary patterns from their orthogonal projections. Comput. Vis. Graph. Image Process. 27, 249–265 (1984)

    Google Scholar 

  4. Miklós, P., Csongor, G.: Discrete tomographic reconstruction of binary matrices using branch and bound method. In: 7th International Symposium on Intelligent Systems and Informatics (SISY 2009), Subotica, Serbia, 25–26 Sept 2009

    Google Scholar 

  5. Srivastava, T., Verma, S.K., Patel, D.: Reconstruction of binary images from two orthogonal projections. IJTS 21(2), 105–114 (2012)

    Google Scholar 

  6. Srivastava, T., Verma, S.K.: Uniqueness algorithm with diagonal and anti-diagonal projections. IJTS 23(2), 22–31 (2013)

    Google Scholar 

Download references

Acknowledgments

This research was supported by the MHRD (Ministry of Human Resource Development) INDIA under the QIP (Quality Improvement Program) sponsored by AICTE (All Indian Council for Technical Education) and Subhash Institute of Software Technology Kanpur.

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology-Roorkee, Roorkee, India

    Shiv Kumar Verma, Tanuja Shrivastava & Divyesh Patel

Authors
  1. Shiv Kumar Verma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tanuja Shrivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Divyesh Patel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shiv Kumar Verma .

Editor information

Editors and Affiliations

  1. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Millie Pant

  2. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Kusum Deep

  3. Department of Mathematics and Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

  4. Department of Applied Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Verma, S.K., Shrivastava, T., Patel, D. (2014). Efficient Approach for Reconstruction of Convex Binary Images Branch and Bound Method. In: Pant, M., Deep, K., Nagar, A., Bansal, J. (eds) Proceedings of the Third International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 259. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1768-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1768-8_17

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1767-1

  • Online ISBN: 978-81-322-1768-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation