.png){kind=icon}
返回
Convergence of a Sparse Representations Algorithm Applicable to Real or Complex Data
.png){kind=icon}
OA
AI
DOI：10.1109/JSTSP.2007.909363.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sparse representations has become an important topic in recent years. It consists in representing, say, a signal (vector) as a linear combination of as few as possible components (vectors) from a redundant basis (of the vector space). This is usually performed, either iteratively (adding a component at a time), or globally (selecting simultaneously all the needed components). We consider a specific algorithm, that we obtain as a fixed point algorithm, but that can also be seen as an iteratively reweighted least-squares algorithm. We analyze it thoroughly and show that it converges to the global optimum. We detail the proof in the real case and indicate how to extend it to the complex case. We illustrate the result with some easily reproducible toy simulations, that further illustrate the potential tracking properties of the proposed algorithm.
Keyword:
Convergence of numerical methods
fixed-point algorithms
iterative methods
minimization methods
spectral analysis
期刊
IF:
13.7
论文数:
1.9K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容