Please use this identifier to cite or link to this item:

Low-Rank Modeling and Its Applications in Image Analysis

Authors Zhou, Xiaowei HKUST affiliated (currently or previously)
Yang, Can View this author's profile
Zhao, Hongyu
Yu, Weichuan View this author's profile
Issue Date 2015
Source ACM Computing Surveys , v. 47, (2), January 2015, article number 36
Summary Low-rank modeling generally refers to a class of methods that solves problems by representing variables of interest as low-rank matrices. It has achieved great success in various fields including computer vision, data mining, signal processing, and bioinformatics. Recently, much progress has been made in theories, algorithms, and applications of low-rank modeling, such as exact low-rank matrix recovery via convex programming and matrix completion applied to collaborative filtering. These advances have brought more and more attention to this topic. In this article, we review the recent advances of low-rank modeling, the state-of-the-art algorithms, and the related applications in image analysis. We first give an overview of the concept of low-rank modeling and the challenging problems in this area. Then, we summarize the models and algorithms for low-rank matrix recovery and illustrate their advantages and limitations with numerical experiments. Next, we introduce a few applications of low-rank modeling in the context of image analysis. Finally, we conclude this article with some discussions.
ISSN 0360-0300
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
1401.3409v3.pdf Pre-published version 1627845 B Adobe PDF