Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
