CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1983 vol.5 Issue No.03 - March
Issue No.03 - March (1983 vol.5)
George C. Stockman , SENIOR MEMBER, IEEE, Department of Computer Science, Michigan State University, East Lansing, MI 48824.
Laveen N. Kanal , FELLOW, IEEE, Department of Computer Science, University of Maryland, College Park, MD 20742.
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.
George C. Stockman, Laveen N. Kanal, "Problem Reduction Representation for the Linguistic Analysis of Waveforms", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.5, no. 3, pp. 287-298, March 1983, doi:10.1109/TPAMI.1983.4767391