On Equivalence of l1 Norm Based Basic Sparse Representation Problems
文献类型：会议论文
| 作者 | Jiang, Rui2 ; Qiao, Hong2; Zhang, Bo1; Jiang R(姜锐)
|
| 出版日期 | 2015-09 |
| 会议名称 | IEEE Conference of Signal Processing, Communications and Computing (ICSPCC), 2015 |
| 会议日期 | September 19-22, 2015 |
| 会议地点 | Ningbo, Zhejiang, China |
| 关键词 | Equivalence l1 norm regularization problem l1 norm minimization problem l1 norm constraint problem |
| 通讯作者 | 姜锐 |
| 英文摘要 |
The l1 norm regularization problem, the l1 norm minimization problem and the l1 norm constraint problem are known collectively as the l1 norm based Basic Sparse
Representation Problems (BSRPs), and have been popular basic models in the field of signal processing and machine learning. The equivalence of the above three problems is one of the crucial bases for the corresponding algorithms design. However, to the best our knowledge, this equivalence issue has not been addressed appropriately in the existing literature. In this paper, we will give a rigorous proof of the equivalence of the three l1 norm based BSRPs in the case when the dictionary is an overcomplete and row full rank matrix. |
| 会议录 | Proceedings of IEEE Conference of Signal Processing, Communications and Computing (ICSPCC), 2015
 |
| 源URL | [http://ir.ia.ac.cn/handle/173211/12464]  |
| 专题 | 自动化研究所_复杂系统管理与控制国家重点实验室_机器人应用与理论组 |
| 通讯作者 | Jiang R(姜锐) |
| 作者单位 | 1.Chinese Acad Sci, LSEC, Beijing 100190, Peoples R China 2.Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | Jiang, Rui,Qiao, Hong,Zhang, Bo,et al. On Equivalence of l1 Norm Based Basic Sparse Representation Problems[C]. 见:IEEE Conference of Signal Processing, Communications and Computing (ICSPCC), 2015. Ningbo, Zhejiang, China. September 19-22, 2015. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。