Iterative blind separation of Gaussian data of unknown order
Author(s)Mueller, Amy, 1980-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
David H. Staelin.
MetadataShow full item record
A method for blind separation of noisy jointly Gaussian multivariate signals X is presented, where X = AP + N, X is an observed set of vectors, A is the mixing matrix, P is the unknown signal matrix, and N is white noise. The objective is to estimate all matrices on the right-hand side when even their dimensions (the system order) are unknown. The algorithms developed are extensions of the Iterative Order and Noise (ION) estimation algorithm . Improvements made within the iterative structure of ION to better estimate the order and noise yield ION'. The addition of a second-order blind identification algorithm (SOBI, ) subsequently yields ONA, which fully characterizes a data set by estimating the (O)rder, (N)oise, and mixing matrix (A). Metrics are developed to evaluate the performance of these algorithms, and their applicability is discussed. Optimum algorithm constants for ION' and ONA are derived, and their range of applicability is outlined. The algorithms are evaluated through application to three types of data: (1) simulated Gaussian data which spans the problem space, (2) a set of non-Gaussian factory data with 577 variables, and (3) a hyperspectral image with 224 channels. The ONA algorithm is extended to 2D (spatial) hyperspectral problems by exploiting spatial rather than time correlation. ONA produces a full characterization of the data with high signal-to-noise ratios for most unknown parameters in the Gaussian case, though the jointly Gaussian P is shown to be most difficult to retrieve. In all three cases, ONA reduces the noise in the data, identifies small sets of highly correlated variables, and unmixes latent signals. The spatial ONA identifies surface features in the hyperspectral image and retrieves sources(cont.) significantly more independent than those retrieved by PCA. Further exploration of the applicability of these algorithms to other types of data and further algorithmic improvement is recommended.
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.Includes bibliographical references (p. 125-126).
DepartmentMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology
Electrical Engineering and Computer Science.