Skip to main content

Coverage in Biomimetic Pattern Recognition

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4482))

Abstract

Coverage is a kind of method to cover points of same class samples in feature space, which is based on Biomimetic Pattern Recognition. The mathematical description of coverage is given and the discriminant boundary of coverage is shown. Coverage is tested in face recognition on ORL database. Both the COVERAGE and SVM networks are used for covering. The results show that COVERAGE act better than SVM in generalization, especially for small sample set, which are consonant with the result of the applications of BPR.

Supported by The National Natural Science Foundation of China NO.60576055.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Wang, S.: Biomimetic Pattern Recognition (in Chinese). ACTA Electronica Sinica 30(10), 1417–1420 (2002)

    Google Scholar 

  2. Wang, S.: Priority Ordered Neural Networks with Better Similarity to Human Knowledge Representation. Chinese Journal of Electronics 8(1), 1–4 (1999)

    MathSciNet  Google Scholar 

  3. Wang, S., et al.: The Sequential Learning Ahead Masking(SLAM) model neural networks for pattern classification. In: Proceedings of JCIS’98, vol. IV, RTP, N.C. USA, pp. 199–202 (1998)

    Google Scholar 

  4. Sylvester, J.J.: On Poncelot’s approximate linear valuation of surd forms. Philos. Mag. Ser. 4(20), 203–222 (1860)

    Google Scholar 

  5. Hopp, T.H., Reeve, C.P.: An algorithm for computing the minimum covering sphere in any dimension. Technical Report NISTIR 5831, National Institute of Standards and Technology (1996)

    Google Scholar 

  6. Wang, S., Zhao, X.: Biomimetic Pattern Recognition Theory and Its Applications. Chinese Journal of Electronics 13(3), 56–60 (2004)

    MathSciNet  Google Scholar 

  7. Fischer, K., Gärtner, B.: The Smallest Enclosing Ball of Balls: Combinatorial Structure and Algorithms. In: SoCG’03, San Diego, California, USA (2003)

    Google Scholar 

  8. Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359–370. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  9. Chvatal, V.: Linear programming. W.H. Freeman, New York (1983)

    MATH  Google Scholar 

  10. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. John Wiley & Sons, New York (2001)

    MATH  Google Scholar 

  11. Wang, S., Zhao, G.: An Algorithm of Analysis Tools On Points Distribution In High Dimension Space: The Distance of A Point And An Infinite Sub-space. In: Proceedings of ICNNB05, vol. 3, pp. 1503–1506 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cao, W., Zhao, G. (2007). Coverage in Biomimetic Pattern Recognition. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_64

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72530-5_64

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72529-9

  • Online ISBN: 978-3-540-72530-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics