Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error
Compressed sensing is a novel signal processing theory that it introduces a novel way of acquiring compressible signals,the test times of existing sparsity trial and error algorithms were always large.The novel algorithm,blind sparsity adaptive matching pursuit (BSAMP) was proposed,could recover the...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-04-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.04.022/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539811447406592 |
|---|---|
| author | Wen-biao TIAN Zheng FU Guo-sheng RUI |
| author_facet | Wen-biao TIAN Zheng FU Guo-sheng RUI |
| author_sort | Wen-biao TIAN |
| collection | DOAJ |
| description | Compressed sensing is a novel signal processing theory that it introduces a novel way of acquiring compressible signals,the test times of existing sparsity trial and error algorithms were always large.The novel algorithm,blind sparsity adaptive matching pursuit (BSAMP) was proposed,could recover the original signal fast in the case of unknown sparsity.Firstly,the range of sparsity was determined,and each time half of values in current range were eliminated by trial and error test.Secondly,the number of atoms was twice the sparsity,which was united with the set of signal approximation support (got by last iteration) and then reconstructed the signal by solving least-squares problems.Last but not least,the least-squares approximation was pruned by weakly matching for next iteration.The results of simulation show that the novel algorithm can reconstruct signal faster and get larger recovery probability than other similar algorithms in the same conditions. |
| format | Article |
| id | doaj-art-6aef86026577461db9813bfe623ece46 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-04-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-6aef86026577461db9813bfe623ece462025-01-14T06:35:10ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-04-013418018659671769Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and errorWen-biao TIANZheng FUGuo-sheng RUICompressed sensing is a novel signal processing theory that it introduces a novel way of acquiring compressible signals,the test times of existing sparsity trial and error algorithms were always large.The novel algorithm,blind sparsity adaptive matching pursuit (BSAMP) was proposed,could recover the original signal fast in the case of unknown sparsity.Firstly,the range of sparsity was determined,and each time half of values in current range were eliminated by trial and error test.Secondly,the number of atoms was twice the sparsity,which was united with the set of signal approximation support (got by last iteration) and then reconstructed the signal by solving least-squares problems.Last but not least,the least-squares approximation was pruned by weakly matching for next iteration.The results of simulation show that the novel algorithm can reconstruct signal faster and get larger recovery probability than other similar algorithms in the same conditions.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.04.022/signal processingcompressed sensingblind sparsityadaptive reconstruction |
| spellingShingle | Wen-biao TIAN Zheng FU Guo-sheng RUI Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error Tongxin xuebao signal processing compressed sensing blind sparsity adaptive reconstruction |
| title | Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error |
| title_full | Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error |
| title_fullStr | Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error |
| title_full_unstemmed | Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error |
| title_short | Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error |
| title_sort | blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error |
| topic | signal processing compressed sensing blind sparsity adaptive reconstruction |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.04.022/ |
| work_keys_str_mv | AT wenbiaotian blindadaptivematchingpursuitalgorithmforsignalreconstructionbasedonsparsitytrialanderror AT zhengfu blindadaptivematchingpursuitalgorithmforsignalreconstructionbasedonsparsitytrialanderror AT guoshengrui blindadaptivematchingpursuitalgorithmforsignalreconstructionbasedonsparsitytrialanderror |