.png){kind=icon}
.png){kind=icon}
Return
Greedy method for robust linear regression
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2017.03.010.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a greedy method to estimate the unknown vector from linear observation with sparse noise. We prove that the algorithm can reconstruct the vector provided the sampling matrix satisfies certain condition and the noise is sparse. We also prove that such a condition holds with high probability for random matrix if its scale satisfies certain assumption. Numerical results are provided to demonstrate the efficiency of the algorithm. And we also consider using the algorithm for salt&pepper noise removal in signal processing. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Greedy method
Robust linear regression
Sparse noise
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W