Skip to main content
SpringerLink
Log in
Book cover

Soft Computing for Problem Solving pp 185–197Cite as

Use of Improved Gravitational Search Algorithm for 3D Reconstruction of Space Curves Using NURBS

  • Conference paper
  • First Online:

  • 833 Accesses

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

Abstract

Gravitational Search Algorithm (GSA) is a memory-less, nature-inspired algorithm for nonlinear continuous optimization problems. In Singh et al. (a new Improved Gravitational Search Algorithm for function optimization using a novel “best-so-far” update mechanism. IEEE, pp. 35–39 (2015) [21]), Singh and Deep proposed an Improved GSA using best-so-far mechanism. In this paper, the problem of 3D reconstruction is modelled as a nonlinear optimization problem. GSA and Improved GSA are used to solve three reconstruction problems. Based on the several computational experiments and analysis, it is concluded that the performance of improved GSA is better than original GSA in terms of convergence and solution quality.

This is a preview of subscription content, 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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

References

  1. Back, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford Univ. Press, New York, USA (1996)

    MATH  Google Scholar 

  2. Kennedy, J.: Particle swarm optimization. In: Encyclopedia of Machine Learning, pp. 760–766. Springer, US, (2010)

    Google Scholar 

  3. Karaboga, D., Basturk, B.: Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: Foundations of Fuzzy Logic and Soft Computing, pp. 789–798. Springer, Berlin Heidelberg (2007)

    Google Scholar 

  4. Singh, A., Deep, K.: How improvements in glowworm swarm optimization can solve real-Life problems. In: Proceedings of Fourth International Conference on Soft Computing for Problem Solving, Advances in Intelligent Systems and Computing, vol. 336, pp. 279–291. Springer, India (2015)

    Google Scholar 

  5. Singh, A., Deep, K.: New variants of glowworm swarm optimization based on step size. Int. J. Syst. Assur. Eng. Manage. 6(3), 286–296 (2015)

    Article  Google Scholar 

  6. Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)

    Article  Google Scholar 

  7. Sabri, N.M., Puteh, M., Mahmood, M.R.: A review of gravitational search algorithm. Int. J. Adv. Soft Comput. Appl. 5(3), 1–39 (2013)

    Google Scholar 

  8. Sarafrazi, S., Nezamabadi-pour, H., Saryazdi, S.: Disruption: a new operator in gravitational search algorithm. Sci. Iranica 18(3), 539–548 (2011)

    Article  Google Scholar 

  9. Doraghinejad, M., Nezamabadi-pour, H.: Black hole: a new operator for gravitational search algorithm. Int. J. Comput. Intell. Syst. 7(5), 809–826 (2014)

    Article  Google Scholar 

  10. Xu, B.C., Zhang, Y.Y.: An improved gravitational search algorithm for dynamic neural network identification. Int. J. Autom. Comput. 11(4), 434–440 (2014)

    Article  MathSciNet  Google Scholar 

  11. Singh, A., Deep, K.: Real coded genetic algorithm operators embedded in gravitational search algorithm for continuous optimization. Int. J. Intell. Syst. Appl. 7(12), 1–22 (2015)

    Google Scholar 

  12. Singh, A., Deep, K.: Novel Hybridized variants of gravitational search algorithm for constrained optimization. Int. J. Swarm Intell. 3(1), 1–22 (2017)

    Article  MathSciNet  Google Scholar 

  13. Singh, A., Deep, K.: Hybridized gravitational search algorithms with real coded genetic algorithms for integer and mixed integer optimization problems. In: Proceedings of Sixth International Conference on Soft Computing for Problem Solving, pp. 84–112. Springer, Singapore (2017)

    Google Scholar 

  14. Saini, S., Rambli, B.A., Rohaya, D., Zakaria, M.N.B., Bt Sulaiman, S.: A review on particle swarm optimization algorithm and its variants to human motion tracking. Math. Prob. Eng. 2014, 1–16 (2014)

    Article  Google Scholar 

  15. Voisin, S., Abidi, M.A., Foufou, S., Truchetet, F.: Genetic algorithms for 3D reconstruction with supershapes. In: 16th International Conference on Image Processing, pp. 529–532. IEEE (2009)

    Google Scholar 

  16. Ning, J., McClean, S., Cranley, K.: 3D reconstruction from two orthogonal views using simulated annealing approach. In: Third International Conference on 3-D Digital Imaging and Modeling, pp. 309–313 (2001)

    Google Scholar 

  17. Ogura, T., Sato, C.: A fully automatic 3D reconstruction method using simulated annealing enables accurate posterioric angular assignment of protein projections. J. Struct. Biol. 156(3), 371–386 (2006)

    Article  Google Scholar 

  18. Siddique, M. T., Zakaria, M. N.: 3D Reconstruction of geometry from 2D image using Genetic Algorithm. In: 2010 International Symposium in Information Technology, vol. 1, pp. 1–5 (2010)

    Google Scholar 

  19. Wong, Y.P., Ng, B.Y.: 3D reconstruction from multiple views using Particle Swarm Optimization. In: Congress on Evolutionary Computation, pp. 1-8. IEEE (2010)

    Google Scholar 

  20. Koch, A., Dipanda, A.: Evolutionary-based 3D reconstruction using an uncalibrated stereovision system: application of building a panoramic object view. Multimedia Tools Appl. 57(3), 565–586 (2012)

    Article  Google Scholar 

  21. Singh, A., Deep, K., Nagar, A.: A new improved gravitational search algorithm for function optimization using a novel “best-so-far” update mechanism. In: Second International Conference on Soft Computing and Machine Intelligence, IEEE 2015, pp. 35–39 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Janki Devi Memorial College, University of Delhi, New Delhi, 110060, India

    Amarjeet Singh

  2. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, 247667, Uttrakhand, India

    Kusum Deep

Authors
  1. Amarjeet Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kusum Deep
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amarjeet Singh .

Editor information

Editors and Affiliations

  1. Department of Mathematics, South Asian University New Delhi , New Delhi, India

    Jagdish Chand Bansal

  2. Department of Mathematics, National Institute Of Technology Silchar Department of Mathematics, Silchar, Assam, India

    Kedar Nath Das

  3. Department of Mathematics and Computer Science, Faculty of Science, , Liverpool Hope University, Liverpool, UK

    Atulya Nagar

  4. Department of Mathematics, Indian Institute of Technology Roor Department of Mathematics, Roorkee, Uttarakhand, India

    Kusum Deep

  5. School of Basic Sciences, Indian Institute of Technology Bhubanesw School of Basic Sciences, Bhubaneswar, Odisha, India

    Akshay Kumar Ojha

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Singh, A., Deep, K. (2019). Use of Improved Gravitational Search Algorithm for 3D Reconstruction of Space Curves Using NURBS. In: Bansal, J., Das, K., Nagar, A., Deep, K., Ojha, A. (eds) Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 816. Springer, Singapore. https://doi.org/10.1007/978-981-13-1592-3_14

Download citation

Publish with us

Policies and ethics

Search

Navigation