Description: In addition to match-tracking greedy iterative algorithms, another major category of compressed-perceptual reconstruction algorithms is the convex optimization algorithm or the optimization approximation method. This type of method finds the signal approximation by converting the nonconvex problem into a convex problem. The method is base tracking (Basis Pursuit, BP). This method proposes to use the l1 norm instead of the l0 norm to solve the optimization problem in order to use the linear programming method to solve the problem
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| BP\BP.docx | 731198 | 2018-02-01
|
| BP\BP_linprog.m | 907 | 2018-02-01
|
| BP\singletest.m | 736 | 2018-02-01
|
| BP | 0 | 2018-03-02 |
Download