稀疏逼近
规范(哲学)
分解
数学
算法
计算机科学
稀疏矩阵
应用数学
数学优化
物理
政治学
生态学
量子力学
生物
高斯分布
法学
作者
Hosein Mohimani,Massoud Babaie‐Zadeh,Christian Jutten
标识
DOI:10.1109/tsp.2008.2007606
摘要
In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermined systems of linear equations, and its applications include underdetermined sparse component analysis (SCA), atomic decomposition on overcomplete dictionaries, compressed sensing, and decoding real field codes. Contrary to previous methods, which usually solve this problem by minimizing thel1norm using linear programming (LP) techniques, our algorithm tries to directly minimize thel1norm. It is experimentally shown that the proposed algorithm is about two to three orders of magnitude faster than the state-of-the-art interior-point LP solvers, while providing the same (or better) accuracy.
科研通智能强力驱动
Strongly Powered by AbleSci AI