| 从压缩传感到低秩矩阵恢复: 理论与应用 |
| |
| 引用本文： | 彭义刚,索津莉,戴琼海,徐文立.从压缩传感到低秩矩阵恢复: 理论与应用[J].自动化学报,2013,39(7):981-994. |
| |
| 作者姓名： | 彭义刚 索津莉 戴琼海 徐文立 |
| |
| 作者单位： | 1.清华大学清华国家信息实验室,清华大学自动化系 北京 100084; |
| |
| 基金项目： | 国家重点基础研究发展计划 (973计划) (2010CB731800),国家自然科学基金(61035002, 61171119)资助 |
| |
| 摘 要： | 综述了压缩传感、矩阵秩最小化和低秩矩阵恢复等方面的基础理论及典型应用. 基于凸优化的压缩传感及由其衍生的矩阵秩最小化和低秩矩阵恢复是近年来的研究热点,在信号处理、 推荐系统、高维数据分析、图像处理、计算机视觉等很多研究领域具有重要和成功的应用. 在这些实际的应用中,往往涉及到对高维数据的分析与处理,需要充分和合理利用数据中的如稀疏性或其所构成矩阵的低秩性等性质. 尽管在最坏情况下,最小化诸如稀疏性或矩阵秩这样的目标函数是 NP 难的,但是在某些合理的假设条件下,通过优化目标函数的凸松弛替代函数, 采用凸优化的方法,能够精确地给出原问题的最优解. 有很多高效的凸优化算法对之进行求解且适用于大规模问题.本文首先分别综述了压缩传感、 矩阵秩最小化和低秩矩阵恢复的相关基础理论,然后对其在图像处理、计算机视觉和计算摄像学等领域的典型应用予以举例介绍,并展望了相关领域未来的研究工作.
|
| 关 键 词： | 压缩传感 矩阵秩最小化 低秩矩阵恢复 凸优化 |
| 收稿时间： | 2012-02-20 |
From Compressed Sensing to Low-rank Matrix Recovery: Theory and Applications |
| |
| PENG Yi-Gang,SUO Jin-Li,DAI Qiong-Hai,XU Wen-Li.From Compressed Sensing to Low-rank Matrix Recovery: Theory and Applications[J].Acta Automatica Sinica,2013,39(7):981-994. |
| |
| Authors: | PENG Yi-Gang SUO Jin-Li DAI Qiong-Hai XU Wen-Li |
| |
| Affiliation: | 1.Tsinghua National Laboratory for Information Science and Technology (TNLIST) and Department of Automation, Tsinghua University, Beijing 100084;2.National Computer Network Emergency Response Technical Team Coordination Center of China (CNCERT or CNCERT/CC), Beijing 100029 |
| |
| Abstract: | This paper reviews the basic theory and typical applications of compressed sensing, matrix rank minimization, and low-rank matrix recovery. Compressed sensing based on convex optimization and related matrix rank minimization and low-rank matrix recovery are hot research topics in recent years. They find many important and successful applications in different research fields, including signal processing, recommending system, high-dimensional data analysis, image processing, computer vision and many others. In these real applications, analysis and processing of high-dimensional data are often involved, which needs to utilize the structure of data, such as sparsity or low rank property of the data matrix, sufficiently and reasonably. Although minimization of objective functions like sparsity or matrix rank is NP-hard in the worst case, by optimizing the convex relaxation of the original objective function under certain reasonable assumptions, convex optimization could give the optimal solution of the original problem. Moreover, many efficient convex optimization algorithms could be used for solving the problem and are also applicable to large-scale problems. In this paper, we first review the fundamental theories about compressed sensing, matrix rank minimization, and low-rank matrix recovery. Then, we introduce the typical applications of these theories in image processing, computer vision, and computational photography. We also look into the future work in related research areas. |
| |
| Keywords: | Compressed sensing matrix rank minimization low-rank matrix recovery convex optimization |
|
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
|
