An algorithmic framework, based on the difference of convex functions algorithm （D- CA）, is proposed for minimizing a class of concave sparse metrics for compressed sensing problems. The resulting algorithm iterates...An algorithmic framework, based on the difference of convex functions algorithm （D- CA）, is proposed for minimizing a class of concave sparse metrics for compressed sensing problems. The resulting algorithm iterates a sequence ofl1 minimization problems. An exact sparse recovery theory is established to show that the proposed framework always improves on the basis pursuit （l1 minimization） and inherits robustness from it. Numerical examples on success rates of sparse solution recovery illustrate further that, unlike most existing non-convex compressed sensing solvers in the literature, our method always out- performs basis pursuit, no matter how ill-conditioned the measurement matrix is. Moreover, the iterative l1 （ILl） algorithm lead by a wide margin the state-of-the-art algorithms on l1/2 and logarithimic minimizations in the strongly coherent （highly ill-conditioned） regime, despite the same objective functions. Last but not least, in the application of magnetic resonance imaging （MRI）, IL1 algorithm easily recovers the phantom image with just 7 line projections.展开更多
本文首先阐述了矩阵填充的应用背景,给出了矩阵填充的数学模型,详细分析了矩阵填充中的低秩特性和非相干特性,重点介绍了矩阵填充三种典型的重构算法:SVT(Singular Value Thresholding)算法、ADMiRA(Atomic Decomposition for Minimum R...本文首先阐述了矩阵填充的应用背景,给出了矩阵填充的数学模型,详细分析了矩阵填充中的低秩特性和非相干特性,重点介绍了矩阵填充三种典型的重构算法:SVT(Singular Value Thresholding)算法、ADMiRA(Atomic Decomposition for Minimum Rank Approximation)算法和SVP(Singular Value Projection)算法,文中的仿真实验对这三种算法的重构性能进行了比较;文章随后分析了矩阵填充和压缩感知的联系;最后介绍了矩阵填充在协同过滤、系统识别、传感器网络、图像处理、稀疏信道估计、频谱感知以及多媒体编码和通信等方面的的应用。展开更多
文摘An algorithmic framework, based on the difference of convex functions algorithm （D- CA）, is proposed for minimizing a class of concave sparse metrics for compressed sensing problems. The resulting algorithm iterates a sequence ofl1 minimization problems. An exact sparse recovery theory is established to show that the proposed framework always improves on the basis pursuit （l1 minimization） and inherits robustness from it. Numerical examples on success rates of sparse solution recovery illustrate further that, unlike most existing non-convex compressed sensing solvers in the literature, our method always out- performs basis pursuit, no matter how ill-conditioned the measurement matrix is. Moreover, the iterative l1 （ILl） algorithm lead by a wide margin the state-of-the-art algorithms on l1/2 and logarithimic minimizations in the strongly coherent （highly ill-conditioned） regime, despite the same objective functions. Last but not least, in the application of magnetic resonance imaging （MRI）, IL1 algorithm easily recovers the phantom image with just 7 line projections.
文摘本文首先阐述了矩阵填充的应用背景,给出了矩阵填充的数学模型,详细分析了矩阵填充中的低秩特性和非相干特性,重点介绍了矩阵填充三种典型的重构算法:SVT(Singular Value Thresholding)算法、ADMiRA(Atomic Decomposition for Minimum Rank Approximation)算法和SVP(Singular Value Projection)算法,文中的仿真实验对这三种算法的重构性能进行了比较;文章随后分析了矩阵填充和压缩感知的联系;最后介绍了矩阵填充在协同过滤、系统识别、传感器网络、图像处理、稀疏信道估计、频谱感知以及多媒体编码和通信等方面的的应用。
