Nguyen, Linh Trung and Nguyen, Viet Dung and Thameri, Messaoud and Truong, Minh Chinh and Abed-Meraim, Karim (2018) Low-complexity adaptive algorithms for robust subspace tracking. IEEE Journal of Selected Topics in Signal Processing . ISSN 1932-4553
Full text not available from this repository. (Request a copy)Abstract
This paper introduces new, low-complexity, adaptive algorithms for robust subspace tracking in certain adverse scenarios of noisy data. First, an adequate weighted least-squares criterion is considered for the design of a robust subspace tracker that is most efficient in the burst noise case. Second, by using data pre-processing and robust statistics estimate, we introduce a second method that is shown to be the most efficient for subspace tracking in the case of impulsive noise (e.g. α-stable noise). Finally, a ‘detect-and-skip’ approach is adopted where the corrupted measurements are detected and treated as ‘missing’ data. The resulting algorithm is particularly effective in the case where the data is affected by sparse ‘outliers’. All these approaches were analyzed and their convergence properties were investigated. Moreover, the proposed subspace tracking algorithms were compared by simulated experiments to some state-of-the-art methods, in different noise/outliers contexts.
Item Type: | Article |
---|---|
Additional Information: | Early access |
Subjects: | Electronics and Communications Information Technology (IT) ISI-indexed journals |
Divisions: | Advanced Insitute of Engineering and Technology (AVITECH) Faculty of Electronics and Telecommunications (FET) |
Depositing User: | A/Prof. Linh Trung Nguyen |
Date Deposited: | 17 Dec 2018 04:09 |
Last Modified: | 17 Dec 2018 19:19 |
URI: | http://eprints.uet.vnu.edu.vn/eprints/id/eprint/3317 |
Actions (login required)
View Item |