روش حریصانه برای رگرسیون خطی قوی

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.