Journal
ACM COMPUTING SURVEYS
Volume 47, Issue 2, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2674559
Keywords
Algorithms; Low-rank modeling; matrix factorization; optimization; image analysis
Categories
Funding
- Research Grant Council of the Hong Kong Special Administrative Region, China [T12-402/13-N]
- NIH [GM59507, CA154295]
- NSF [DMS1106738]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available