Skip to main content

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

  • 1154 Accesses

Abstract

Point pattern matching is a fundamental problem in computer vision and pattern recognition. Membrane computing is an emergent branch of bio-inspired computing, which provides a novel idea to solve computationally hard problems. In this paper, a new point pattern matching algorithm with local elitism strategy is proposed based on membrane computing models. Local elitism strategy is used to keep good correspondences of point pattern matching found during the search, so the matching rate and the convergence speed are improved. Five heuristic mutation rules are introduced to avoid the local optimum. Experiment results on both synthetic data and real world data illustrate that the proposed algorithm is of higher matching rate and better stability.

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

Access this chapter

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

References

  1. Cho M, Lee J, Lee KM (2010) Reweighted random walks for graph matching. European conference on computer vision. Heraklion, Greece, pp 492–450

    Google Scholar 

  2. Yuan Y, Pang YW, Wang KQ, Shang MY (2012) Efficient image matching using weighted voting. Pattern Recogn Lett 33(4):471–475

    Article  Google Scholar 

  3. Yin PY (2006) Particle swarm optimization for point pattern matching. J Vis Commun Image Represent 17(1):143–162

    Article  Google Scholar 

  4. Pan LQ, Păun G (2009) Spiking neural P systems with antispikes. Int J Comput Commun Control IV(3):273–282

    Google Scholar 

  5. Pan LQ, Păun G (2010) Spiking neural P systems: an improved normal form. Theoret Comput Sci 411(6):906–918

    Article  MathSciNet  MATH  Google Scholar 

  6. Wang J, Hoogeboom HJ, Pan LQ, Păun G, Pérez-Jiménez MJ (2010) Spiking neural P systems with weights. Neural Comput 22(10):2615–2646

    Article  MathSciNet  MATH  Google Scholar 

  7. Pan LQ, Martín-Vide C (2005) Solving multidimensional 0–1 knapsack problem by P systems with input and active membranes. J Parallel Distrib Comput 65(12):1578–1584

    Article  MATH  Google Scholar 

  8. Pan LQ, Martín-Vide C (2006) Further remark on P systems with active membranes and two polarizations. J Parallel Distrib Comput 66(6):867–872

    Article  MATH  Google Scholar 

  9. Alhazov A, Martín-Vide C, Pan LQ (2003) Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes. Fundamenta Informaticae 58(2):67–77

    MathSciNet  MATH  Google Scholar 

  10. Nishida TY (2004) An application of P systems: a new algorithm for NP-complete optimization problems. In: Callaos N et al (eds) Proceedings of the 8th world multi-conference on systems, cybernetics and informatics, vol 5, pp 109–112

    Google Scholar 

  11. Zhang GX, Pan LQ (2010) A survey of membrane computing as a new branch of natural computing. Chin J Comput 32(2):208–214

    Article  Google Scholar 

  12. Huang L, Suh IH, Abraham A (2011) Dynamic multi-objective optimization based on membrane computing for control of time-varying unstable plants. Inf Sci 181:2370–2391

    Article  Google Scholar 

  13. Xiao JH, Zhang XY, Xu J (2012) A membrane evolutionary algorithm for DNA sequence design in DNA computing. Chin Sci Bull 57(6):698–706

    Article  Google Scholar 

  14. Păun G (2007) Tracing some open problems in membrane computing. Romanian J Inf Sci Technol 10(4):303–314

    Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (61073116, 61272152 and 60903105), Scientific Research Foundation for Doctor of Anhui University (02203104), Natural Science Foundation of Anhui Higher Education Institutions of China (J2012A010, KJ2012A008).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jin Tang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, Z., Tang, J., Zhang, X., Luo, B. (2013). A Local Elitism Based Membrane Evolutionary Algorithm for Point Pattern Matching. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_103

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37502-6_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37501-9

  • Online ISBN: 978-3-642-37502-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics