Title: A greedy pursuit algorithm for arbitrary block sparse signal recovery
Abstract:In this paper, we propose a novel greedy iteration algorithm, called block matching pursuit (BMP), for arbitrary block sparse signal recovery. BMP can recover the target signal without prior informati...In this paper, we propose a novel greedy iteration algorithm, called block matching pursuit (BMP), for arbitrary block sparse signal recovery. BMP can recover the target signal without prior information of block structure or block length and can estimate the true sparsity level. In each iteration, BMP processes a correlation test to estimate nonzero entries of signal with a fixed step size, and then gathers all possible nonzero entries to form a candidate list, finally checks the list to choose correct entries according to current estimated sparsity level. The simulation results show that BMP can recover the signal of interest in noiseless or noisy case and achieves an outstanding recovery performance.Read More
Publication Year: 2016
Publication Date: 2016-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 7
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot