A dynamic programming approach to sequential pattern recognition

This paper presents the dynamic programming approach to the design of optimal pattern recognition systems when the costs of feature measurements describing the pattern samples are of considerable importance. A multistage or sequential pattern classifier which requires, on the average, a substantiall...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 8(1986), 3 vom: 01. März, Seite 313-26
1. Verfasser: Fu, K S (VerfasserIn)
Weitere Verfasser: Chien, Y T, Cardillo, G P
Format: Aufsatz
Sprache:English
Veröffentlicht: 1986
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM21101608X
003 DE-627
005 20231224012722.0
007 tu
008 231224s1986 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0703.xml 
035 |a (DE-627)NLM21101608X 
035 |a (NLM)21869350 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Fu, K S  |e verfasserin  |4 aut 
245 1 2 |a A dynamic programming approach to sequential pattern recognition 
264 1 |c 1986 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 02.10.2012 
500 |a Date Revised 12.11.2019 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a This paper presents the dynamic programming approach to the design of optimal pattern recognition systems when the costs of feature measurements describing the pattern samples are of considerable importance. A multistage or sequential pattern classifier which requires, on the average, a substantially smaller number of feature measurements than that required by an equally reliable nonsequential classifier is defined and constructed through the method of recursive optimization. Two methods of reducing the dimensionality in computation are presented for the cases where the observed feature measurements are 1) statistically independent, and 2) Markov dependent. Both models, in general, provide a ready solution to the optimal sequential classification problem. A generalization in the design of optimal classifiers capable of selecting a best sequence of feature measurements is also discussed. Computer simulated experiments in character recognition are shown to illustrate the feasibility of this approach 
650 4 |a Journal Article 
700 1 |a Chien, Y T  |e verfasserin  |4 aut 
700 1 |a Cardillo, G P  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 8(1986), 3 vom: 01. März, Seite 313-26  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:8  |g year:1986  |g number:3  |g day:01  |g month:03  |g pages:313-26 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 8  |j 1986  |e 3  |b 01  |c 03  |h 313-26