A Generalized Minor Component Extraction Algorithm and Its Analysis
Author(s) -
Hongzeng Li,
Boyang Du,
Xiangyu Kong,
Yingbin Gao,
Changhua Hu,
Xuhao Bian
Publication year - 2018
Publication title -
ieee access
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.587
H-Index - 127
ISSN - 2169-3536
DOI - 10.1109/access.2018.2852060
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
Generalized minor component analysis (GMCA) is of great use in modern signal processing. The GMCA algorithms can be simplified to extract the minor generalized eigenvector of the autocorrelation input matrices pencil. In contrast to batching methods, the Hebbian-rule-based algorithm can extract the minor generalized eigenvector online. Few Hebbian-rule-based GMCA algorithms have been reported in the literature, and most of them are not self-stabilizing. Thus, a novel algorithm for GMCA, which is advantageous in terms of good convergence speed, self-stabilizing property, and multiple generalized minor component extraction in sequence, is proposed in this paper. A theoretical analysis verifies these properties via matrix theory and the deterministic discrete-time method. Numerical simulations are conducted to further demonstrate the advantages of the proposed algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom