Skip to main content

Convex Discriminant Analysis Tools for Non Convex Pattern Recognition

  • Conference paper
Classification, Automation, and New Media
  • 367 Accesses

Abstract

The estimation of convex sets when inside and outside observations are available is often needed in current research applications.

The key idea of this paper is to propose a solution based on convex and discriminant analysis tools, even when non convex domains are considered. Simulations are done and comparisons are made with respect to a natural candidate for estimation of non convex bodies, based on the Voronoi tessellation. A part of this paper is devoted to a theoretical framework showing how convex sets can be used to approximate non convex sets in IR 2.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

  • Baufays, P. and Rasson, J.-P. (1985): A new geometric discriminant rule. Computational Statistics Quarterly, 2, 15–30.

    MATH  Google Scholar 

  • Grenander, U. (1976): Pattern Synthesis: Lectures in Pattern Theory, vol.1, Springer Verlag, New York.

    Book  MATH  Google Scholar 

  • Hachtel, G.D., Meilijson, I. and Nadas, A. (1981): The estimation of a convex subset of IR k and its probability content, IBM research report, Yorktown Heights N.Y.

    Google Scholar 

  • Remon, M. (1994): The estimation of a convex domain when inside and outside observations are available, Supplemento ai Rendiconti del Circolo Matematico di Palermo, 35, 227–235.

    MathSciNet  Google Scholar 

  • Remon, M. (1996): A discriminant analysis algorithm for the inside/outside problem, Comput. Stat. and Data Analysis, 23, 125–133.

    Article  MATH  Google Scholar 

  • Remon, M. (1997): Utility of discriminant analysis in pattern recognition, Supplemento ai Rendiconti del Circolo Matematico di Palermo, 50, 335–345.

    MathSciNet  Google Scholar 

  • Remon, M. (2000): Discriminant analysis tools for non convex pattern recognition. In: Kiers, H.A.L. et al. (eds.), Data Analysis, Classification, and Related Methods, Springer Verlag, Berlin, 241–246.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rémon, M. (2002). Convex Discriminant Analysis Tools for Non Convex Pattern Recognition. In: Gaul, W., Ritter, G. (eds) Classification, Automation, and New Media. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55991-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55991-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43233-3

  • Online ISBN: 978-3-642-55991-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics