Multipath Matching Pursuit with Breadth-First (MMP-BF) is a greedy algorithm that provides approximate solution to the sparse reconstruction/approximation problem: min ||x||_0 such that Phi * x = y. The algorithm is from the paper: [*] S. Kwon, J. Wang, and B. Shim, "Multipath matching pursuit", IEEE Trans. Inform. Theory, vol. 60, no. 5, pp. 2986-3001, May 2014.
引用
Jian Wang (2026). Multipath matching pursuit with breadth-first (MMP-BF) (https://jp.mathworks.com/matlabcentral/fileexchange/57994-multipath-matching-pursuit-with-breadth-first-mmp-bf), MATLAB Central File Exchange. に取得済み.
MATLAB リリースの互換性
プラットフォームの互換性
Windows macOS Linuxカテゴリ
タグ
謝辞
ヒントを得たファイル: Sparse Approximate Solutions to Linear Systems, Compressive Sensing Simple Example, Sparse representations classifier, sparse estimation / compressed sensing linear system solver
| バージョン | 公開済み | リリース ノート | |
|---|---|---|---|
| 1.0.0.0 |
