Double Least Squares Pursuit for Sparse Decomposition
文献类型：会议论文
| 作者 | Wanyi Li ; Peng Wang; Hong Qiao
|
| 出版日期 | 2012 |
| 会议名称 | IFIP 7th International Conference on Intelligent Information Processing |
| 会议日期 | 无 |
| 会议地点 | 无 |
| 关键词 | Sparse decomposition, Sparse representation, Sparseapproximation algorithm,Double Least-Squares Pursuit |
| 通讯作者 | Wanyi Li |
| 英文摘要 | 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. |
| 会议录 | IFIP 7th International Conference on Intelligent Information Processing
 |
| 源URL | [http://ir.ia.ac.cn/handle/173211/12860]  |
| 专题 | 自动化研究所_复杂系统管理与控制国家重点实验室_机器人应用与理论组 |
| 作者单位 | Institute of Automation, Chinese Academy of Sciences |
| 推荐引用方式 GB/T 7714 | Wanyi Li,Peng Wang,Hong Qiao. Double Least Squares Pursuit for Sparse Decomposition[C]. 见:IFIP 7th International Conference on Intelligent Information Processing. 无. 无. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。