Title :
A positive linear decomposition for identifying patterns in dynamic process measurements
Author :
Woo, Oh Sang ; Salenieks, Alvis ; Mavrovouniotis, Michael
Author_Institution :
Dept. of Chem. Eng., Northwestern Univ., Evanston, IL, USA
Abstract :
The purpose of this article is to show the effectiveness of a pattern recognition method for high-dimensional dynamic measurements. The method consists of the following steps. SVD projects a matrix of dynamic process measurements on a low-dimensional subspace. A convex cone, defined by the non-negativity of measurements, is then created. For normalization purposes, a polygon is formed by intersecting the cone with a plane; its corners specify the feature vectors of the data. The polygon is reduced to a triangle with only the three most representative corners, enabling the automated selection of a feature vector for pattern recognition. Finally, a spanning tree created from the feature vectors classifies the patterns. In a case study, the feature vectors proved to be invariant to the width of the time window, and classification was possible even with feature vectors of differing time windows
Keywords :
computational geometry; data analysis; feature extraction; pattern classification; singular value decomposition; trees (mathematics); convex cone; dynamic process measurements; feature extraction; feature vectors; identification; pattern recognition; polygon; positive linear decomposition; singular value decomposition; spanning tree; time window; Functional analysis; Instruments; MATLAB; Matrix decomposition; Probes; Singular value decomposition; Time measurement; Vectors;
Conference_Titel :
American Control Conference, Proceedings of the 1995
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2445-5
DOI :
10.1109/ACC.1995.531205