loading...
Generalized Non-Reducible Descriptors
Barcelona, Spain September 03-September 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2000.90609515th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ventzeslav Valev, St. Louis University
Bülent Sankur, Bogazici University
Petia Radeva, Computer Vision Center
This paper provides a generalization of non-reducible descriptors. Non-reducible descriptors are used in supervised pattern recognition problems when the pattern descriptions consist of Boolean variables. This generalization extends the concept of distance between patterns of different classes. A mathematical model to construct generalized non-reducible descriptors, a computational procedure, and numerical examples are discussed.
Index Terms:
Supervised Pattern Recognition, Machine Learning, Descriptors, Non-Reducible Descriptors, Generalized Non-Reducible Descriptors
Citation:
Ventzeslav Valev, Bülent Sankur, Petia Radeva, "Generalized Non-Reducible Descriptors," icpr, vol. 2, pp.2394, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 2, 2000
Usage of this product signifies your acceptance of the Terms of Use.