Share Email Print

Proceedings Paper

Automatic feature extraction using N-dimension convexity concept in a novel neural network
Author(s): Chia-Lun John Hu
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

As we published in the last few years, when the pattern vectors used in the training of a novel neural network satisfy a generalized N-dimension convexity property (or the novel PLI condition we derived), the neural network can learn these patterns very fast in a NONITERATIVE manner. The recognition of any UNTRAINED patterns by using this learned neural network can then reach OPTIMUM ROBUSTNESS if an automatic feature extraction scheme derived from the N-dimension geometry is used in the recognition mode. The simplified physical picture of the high-robustness reached by this novel system is the automatic extraction of the most distinguished parts in all the M training pattern vectors in the N-space such that the volume of the M-dimension parallelepiped spanned by these parts of the vectors reaches a maximum.

Paper Details

Date Published: 23 September 1999
PDF: 7 pages
Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); doi: 10.1117/12.364098
Show Author Affiliations
Chia-Lun John Hu, Southern Illinois Univ. (United States)

Published in SPIE Proceedings Vol. 3811:
Vision Geometry VIII
Longin Jan Latecki; Robert A. Melter; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top