Abstract
Sparse representation of signals has many important applications in signal processing. However, this issue is well known as a complex and NP problem, which is a key factor to depress the application and progress of sparse decomposition. In this work, seeker optimization algorithm(SOA)- based method is used to search for the best matching atoms in sparse decomposition. For comparision, the conventional matching pursuit (MP) method and two versions of PSO algorithms are also consid- ered in the simulation studies. The simulation results show that the proposed approach is an effective and reliable technique for time-frequency atom decomposition.
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.
