A Generalized Information Criterion for Generalized Minor Component Extraction
| Autor: | Li Hongzeng, Gao Yingbin, Hu Changhua, Kong Xiangyu, Hou Li'an |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Normalization (statistics)
Signal processing Mathematical optimization Autocorrelation Minor (linear algebra) 020206 networking & telecommunications 02 engineering and technology Signal Processing Convergence (routing) 0202 electrical engineering electronic engineering information engineering Matrix pencil 020201 artificial intelligence & image processing Algorithm design Electrical and Electronic Engineering Algorithm Mathematics Matrix method |
| Zdroj: | IEEE Transactions on Signal Processing. 65:947-959 |
| ISSN: | 1941-0476 1053-587X |
| DOI: | 10.1109/tsp.2016.2631444 |
| Popis: | Generalized minor component analysis (GMCA) is an essential technique in data classification and signal processing. In this paper, we propose an information criterion for GMCA and derive a fast GMCA algorithm for extracting the first generalized minor component (GMC) by using quasi-Newton method to this information criterion. In order to extract multiple GMCs, through the weighed matrix method, this information criterion is extended into a weighted one, which has a unique global maximum attained if and only if its state matrices converge to the GMCs of the matrix pencil composed of the autocorrelation matrices of two stochastic processes. A gradient algorithm is also derived based on this weighted information criterion. Theoretical analysis shows that the gradient algorithm has self-stabilizing property and does not need the normalization operation required in other algorithms. The global convergence analysis of the proposed algorithm is accomplished through the Lyapunov method. Numerical simulations and real application are carried out to further demonstrate the accuracy and speed advantages of the proposed algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|