Degree in Electrical Engineering from Carnegie- Problem Reduction Representation for the Linguistic Analysis of Waveforms

This paper shows how the nondirectional structural analysis of pattern data can be performed by matching a problem reduction representation (PRR) of pattern structure with sample data, using a best-first state space search algorithm called SSS*. The end result of the matching algorithm is a tree whose nodes represent recognized structures in the data. Tip nodes of the tree structure correspond to primitives which are recognized in the raw data by curve fitting routines. The operators of the algorithm allow the tree to be constructed with a combination of top-down or bottom-up steps. The matching of the structure tree to waveform segments need not be done in a left-right sequence. Moreover ambiguous matches are pursued in a best first order by using state space search with partial parse trees as states. A software system called WAPSYS (for waveform parsing system) is described, which implements this structural analysis paradigm. Experience using WAPSYS to analyze carotid pulse waves is also discussed.

[1]  Vipin Kumar,et al.  Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results , 1981, IJCAI.

[2]  Michael G. Thomason,et al.  Syntactic Methods in Pattern Recognition , 1982 .

[3]  MinkerJack,et al.  State-space problem-reduction, and theorem provingsome relationships , 1975 .

[4]  L. N. Kanal,et al.  Interactive pattern analysis and classification systems: A survey and commentary , 1972 .

[5]  Jack Minker,et al.  State-space problem-reduction, and theorem proving—some relationships , 1975, Commun. ACM.

[6]  Perry Lowell Miller,et al.  A locally-organized parser for spoken input , 1974, CACM.

[7]  G. Winkler,et al.  A combination of statistical and syntactical pattern recognition applied to classification of unconstrained handwritten numerals , 1980, Pattern Recognit..

[8]  Laveen N. Kanal,et al.  Structural pattern recognition of Carotid pulse waves using a general waveform parsing system , 1976, CACM.

[9]  J. R. Cox,et al.  Digital analysis of the electroencephalogram, the blood pressure wave, and the electrocardiogram , 1972 .

[10]  Laveen N. Kanal,et al.  Problem-Solving Models and Search Strategies for Pattern Recognition , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[12]  J. J. Florentin,et al.  A Universal Syntax-Directed Top-Down Analyzer , 1968, JACM.

[13]  George Charles Stockman,et al.  A problem-reduction approach to the linguistic analysis of waveforms. , 1977 .

[14]  Laveen N. Kanal,et al.  Parallel implementations of a structural analysis algorithm. , 1981 .

[15]  Michael L. Baird.  Structural Pattern Recognition , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  George C. Stockman,et al.  A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..

[17]  James R. Slagle,et al.  An Admissible and Optimal Algorithm for Searching AND/OR Graphs , 1971, Artif. Intell..

[18]  Rajjan Shinghal,et al.  Problem-Solving ModelsandSearchStrategies for Pattern Recognition , 1979 .

[19]  Patrick A. V. Hall,et al.  Equivalence between AND/OR graphs and context-free grammars , 1973, Commun. ACM.