کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4973898 | 1451718 | 2017 | 30 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A robust correntropy based subspace tracking algorithm in impulsive noise environments
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The maximum correntropy criterion (MCC) demonstrates the inherent robustness to outliers in adaptive filtering. By employing the MCC based cost function in projection approximation subspace tracking (PAST) algorithm, the MCC-PAST algorithm is deduced and utilized for the subspace tracking under impulsive noise environments. To handle the fast varying subspaces circumstances, the variable forgetting factor (VFF) technique is developed and incorporated into the MCC-PAST algorithm. To assess the robustness of the proposed MCC-PAST with VFF algorithm, SαS processes are employed to comprehensively model different scenarios of impulsive noises. The simulation results show the proposed MCC-PAST algorithm with VFF performs better than the other two PAST algorithms developed for subspace tracking in impulsive noise environments, namely, the robust PAST algorithm and the robust Kalman filter based algorithm with variable number of measurements (KFVNM), especially when the noise is extremely impulsive or the GSNR (generalized signal to noise ratio) is relatively low.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Digital Signal Processing - Volume 62, March 2017, Pages 168-175
Journal: Digital Signal Processing - Volume 62, March 2017, Pages 168-175
نویسندگان
Jin-feng Zhang, Tian-shuang Qiu,