A constrained optimization approach for an adaptive generalized subspace tracking algorithm

Authors:
Amir Valizadeh;Mahsa Najibi
Affiliations:
Electrical Engineering Department, School of Engineering, Shiraz University, Shiraz, Iran;Electrical Engineering Department, School of Engineering, Shiraz University, Shiraz, Iran
Venue:
Computers and Electrical Engineering
Year:
2010

Citing 10
Cited 1

An algorithm for Ax = &lgr;Bx with symmetric and positive-definite A and B

SIAM Journal on Matrix Analysis and Applications
Globally and rapidly convergent algorithms for symmetric eigenproblems

SIAM Journal on Matrix Analysis and Applications
Original Contribution: Principal components, minor components, and linear neural networks

Neural Networks
Original Contribution: Least mean square error reconstruction principle for self-organizing neural-nets

Neural Networks
Principal component neural networks: theory and applications

Principal component neural networks: theory and applications
Extraction of Visual Features for Lipreading

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient, high performance, subspace tracking for time-domain data

IEEE Transactions on Signal Processing
Bi-iteration SVD subspace tracking algorithms

IEEE Transactions on Signal Processing
RLS-based adaptive algorithms for generalized eigen-decomposition

IEEE Transactions on Signal Processing
Self-organizing algorithms for generalized eigen-decomposition

IEEE Transactions on Neural Networks

Improvement of mean shift tracking performance using a convex kernel function and extracting motion information

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an orthonormal version of the generalized signal subspace tracking. It is based on an interpretation of the generalized signal subspace as the solution of a constrained minimization task. This algorithm, referred to as the CGST algorithm, guarantees the C"x-orthonormality of the estimated generalized signal subspace basis at each iteration which C"x denotes the correlation matrix of the sequence x(t). An efficient implementation of the proposed algorithm enhances applicability of it in real time applications.