A sequential organization of the computations arising from pattern recognizers by absolute comparison is suggested in order to reduce the mean computational time involved. This optimization problem is solved by means of a supervising system which exploits the information obtained from the pattern-vector through a preclassifier: this information has the form of a conditional probability distribution of the classes to which the pattern-vector may belong. The results are extended to pattern recognizers by relative comparison.
Optimization of computational time in pattern recognizers
VISCOLANI, BRUNO
1982
Abstract
A sequential organization of the computations arising from pattern recognizers by absolute comparison is suggested in order to reduce the mean computational time involved. This optimization problem is solved by means of a supervising system which exploits the information obtained from the pattern-vector through a preclassifier: this information has the form of a conditional probability distribution of the classes to which the pattern-vector may belong. The results are extended to pattern recognizers by relative comparison.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
