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

Filename	Size	Update
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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．