Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm-Reference-Cited by-同舟云学术

Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm

Published:2016-02 Issue:2 Volume:25 Page:829-839
ISSN:1057-7149
Container-title:IEEE Transactions on Image Processing
language:
Short-container-title:IEEE Trans. on Image Process.

Author:

Lu Canyi,Tang Jinhui,Yan Shuicheng,Lin Zhouchen

Funder

Singapore National Research Foundation under its International Research Centre, Singapore Funding Initiative and administered by the IDM Programme Office

National Basic Research Program of China (973 Program)

National Natural Science Foundation (NSF) of China

Microsoft Research Asia Collaborative Research Program

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

http://xplorestaging.ieee.org/ielx7/83/7362298/7362209.pdf?arnumber=7362209

Cited by 243 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust low-rank matrix completion via sparsity-inducing regularizer;Signal Processing;2025-01

2. Generalized nonconvex nonsmooth four-directional total variation with overlapping group sparsity for image restoration;Journal of Computational and Applied Mathematics;2024-12

3. A non-convex low-rank image decomposition model via unsupervised network;Signal Processing;2024-10

4. “Sparse + Low-Rank” tensor completion approach for recovering images and videos;Signal Processing: Image Communication;2024-09

5. Group sparsity residual constraint model with weighted log-sum penalty for image restoration;Signal Processing;2024-09