Abstract
Probabilistic decision-based neural networks (PDBNNs) were originally proposed by Lin, Kung and Lin for human face recognition. Although high recognition accuracy has been achieved, not many illustrations were given to highlight the characteristic of the decision boundaries. This paper aims at providing detailed illustrations to compare the decision boundaries of PDBNNs with that of Gaussian mixture models through a pattern recognition task, namely the classification of two-dimensional vowel data. The original PDBNNs use elliptical basis functions with diagonal covariance matrices, which may be inefficient for modeling feature vectors with correlated components. This paper attempts to tackle this problem by using full covariance matrices. The paper also highlights the strengths of PDBNNs by demonstrating that the PDBNN's thresholding mechanism is very effective in rejecting data not belonging to any known classes.
Original language | English |
---|---|
Title of host publication | International Conference on Signal Processing Proceedings, ICSP |
Publisher | IEEE |
Pages | 1378-1381 |
Number of pages | 4 |
Publication status | Published - 1 Dec 1998 |
Event | Proceedings of the 1998 4th International Conference on Signal Processing Proceedings, ICSP '98 - Beijing, China Duration: 12 Oct 1998 → 16 Oct 1998 |
Conference
Conference | Proceedings of the 1998 4th International Conference on Signal Processing Proceedings, ICSP '98 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 12/10/98 → 16/10/98 |
ASJC Scopus subject areas
- Signal Processing