Knowledge Commons of Institute of Automation,CAS
Double Least Squares Pursuit for Sparse Decomposition | |
Wanyi Li; Peng Wang; Hong Qiao | |
2012 | |
会议名称 | IFIP 7th International Conference on Intelligent Information Processing |
会议录名称 | IFIP 7th International Conference on Intelligent Information Processing |
会议日期 | 无 |
会议地点 | 无 |
摘要 | Sparse decomposition has been widely used in numerous applications, such as image processing, pattern recognition, remote sens-ing and computational biology. Despite plenty of theoretical develop-ments have been proposed, developing, implementing and analyzing novel fast sparse approximation algorithm is still an open problem. In this paper, a new pursuit algorithm Double Least Squares Pursuit (DLSP) is proposed for sparse decomposition. In this algorithm, the support of the solution is obtained by sorting the coefficients which are calculated by the first Least-Squares, and then the non-zero values over this sup-port are detected by the second Least-Squares. The results of numerical experiment demonstrate the effectiveness of the proposed method, which is with less time complexity, more simple form, and gives close or even better performance compared to the classical Orthogonal Matching Pursuit (OMP) method. |
关键词 | Sparse Decomposition Sparse Representation Sparseapproximation Algorithm Double Least-squares Pursuit |
文献类型 | 会议论文 |
条目标识符 | http://ir.ia.ac.cn/handle/173211/12860 |
专题 | 多模态人工智能系统全国重点实验室_机器人理论与应用 |
通讯作者 | Wanyi Li |
作者单位 | Institute of Automation, Chinese Academy of Sciences |
推荐引用方式 GB/T 7714 | Wanyi Li,Peng Wang,Hong Qiao. Double Least Squares Pursuit for Sparse Decomposition[C],2012. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论