@article{SisLab3317,
           month = {October},
          author = {Linh Trung Nguyen and Viet Dung Nguyen and Messaoud Thameri and Minh Chinh Truong and Karim Abed-Meraim},
            note = {Early access},
           title = {Low-complexity adaptive algorithms for robust subspace tracking},
       publisher = {IEEE},
         journal = {IEEE Journal of Selected Topics in Signal Processing},
             doi = {10.1109/JSTSP.2018.2876626},
            year = {2018},
             url = {https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3317/},
        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. {\ensuremath{\alpha}}-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.}
}