Name
Abstract | ||
|---|---|---|
Aiming at the disadvantages of greedy algorithms in sparse solution, a modified adaptive orthogonal matching pursuit algorithm (MAOMP) is proposed in this paper. It is obviously improved to introduce sparsity and variable step size for the MAOMP. The algorithm estimates the initial value of sparsity by matching test, and will decrease the number of subsequent iterations. Finally, the step size is adjusted to select atoms and approximate the true sparsity at different stages. The simulation results show that the algorithm which has proposed improves the recognition accuracy and efficiency comparing with other greedy algorithms. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10586-017-1231-7 | Cluster Computing |
Keywords | Field | DocType |
Pursuit algorithm, Gesture recognition, Pattern recognition, Sparse representation, Estimation | Matching test,Matching pursuit,Pattern recognition,Computer science,Sparse approximation,Gesture recognition,Greedy algorithm,Initial value problem,Artificial intelligence,Orthogonal matching pursuit algorithm | Journal |
Volume | Issue | ISSN |
22 | SUPnan | 1573-7543 |
Citations | PageRank | References |
12 | 0.52 | 18 |
Authors | ||
9 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bei Li | 1 | 12 | 0.52 |
| Ying Sun | 2 | 291 | 40.03 |
| Gongfa Li | 3 | 239 | 43.45 |
| Jianyi Kong | 4 | 80 | 13.32 |
| Guozhang Jiang | 5 | 172 | 27.25 |
| Du Jiang | 6 | 97 | 14.40 |
| Bo Tao | 7 | 52 | 2.43 |
| Shuang Xu | 8 | 274 | 32.53 |
| Honghai Liu | 9 | 1974 | 178.69 |