From Rank Estimation to Rank Approximation: Rank Residual Constraint for Image Restoration

被引:90
作者
Zha, Zhiyuan [1 ]
Yuan, Xin [2 ]
Wen, Bihan [3 ]
Zhou, Jiantao [4 ,5 ]
Zhang, Jiachao [6 ]
Zhu, Ce [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Informat & Commun Engn, Chengdu 611731, Peoples R China
[2] Nokia Bell Labs, Murray Hill, NJ 07974 USA
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[4] Univ Macau, State Key Lab Internet Things Smart City, Macau 999078, Peoples R China
[5] Univ Macau, Dept Comp & Informat Sci, Macau 999078, Peoples R China
[6] Nanjing Inst Technol, Artificial Intelligence Inst Ind Technol, Nanjing 211167, Peoples R China
关键词
Low-rank; rank residual constraint; nuclear norm minimization; nonlocal self-similarity; group-based sparse representation; image restoration; THRESHOLDING ALGORITHM; SPARSE REPRESENTATION; QUALITY ASSESSMENT; ARTIFACTS; DCT; REGULARIZATION; REDUCTION; NOISE;
D O I
10.1109/TIP.2019.2958309
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a novel approach to the rank minimization problem, termed rank residual constraint (RRC) model. Different from existing low-rank based approaches, such as the well-known nuclear norm minimization (NNM) and the weighted nuclear norm minimization (WNNM), which estimate the underlying low-rank matrix directly from the corrupted observations, we progressively approximate the underlying low-rank matrix via minimizing the rank residual. Through integrating the image nonlocal self-similarity (NSS) prior with the proposed RRC model, we apply it to image restoration tasks, including image denoising and image compression artifacts reduction. Towards this end, we first obtain a good reference of the original image groups by using the image NSS prior, and then the rank residual of the image groups between this reference and the degraded image is minimized to achieve a better estimate to the desired image. In this manner, both the reference and the estimated image are updated gradually and jointly in each iteration. Based on the group-based sparse representation model, we further provide an analytical investigation on the feasibility of the proposed RRC model. Experimental results demonstrate that the proposed RRC method outperforms many state-of-the-art schemes in both the objective and perceptual quality.
引用
收藏
页码:3254 / 3269
页数:16
相关论文
共 78 条
  • [1] Agababov Victor, 2015, 12 USENIX S NETW SYS, P367
  • [2] K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    Aharon, Michal
    Elad, Michael
    Bruckstein, Alfred
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4311 - 4322
  • [3] [Anonymous], 2002, THESIS STANFORD U
  • [4] Contour Detection and Hierarchical Image Segmentation
    Arbelaez, Pablo
    Maire, Michael
    Fowlkes, Charless
    Malik, Jitendra
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (05) : 898 - 916
  • [5] The Perception-Distortion Tradeoff
    Blau, Yochai
    Michaeli, Tomer
    [J]. 2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 6228 - 6237
  • [6] A review of image denoising algorithms, with a new one
    Buades, A
    Coll, B
    Morel, JM
    [J]. MULTISCALE MODELING & SIMULATION, 2005, 4 (02) : 490 - 530
  • [7] A non-local algorithm for image denoising
    Buades, A
    Coll, B
    Morel, JM
    [J]. 2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 2, PROCEEDINGS, 2005, : 60 - 65
  • [8] A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION
    Cai, Jian-Feng
    Candes, Emmanuel J.
    Shen, Zuowei
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) : 1956 - 1982
  • [9] Robust Principal Component Analysis?
    Candes, Emmanuel J.
    Li, Xiaodong
    Ma, Yi
    Wright, John
    [J]. JOURNAL OF THE ACM, 2011, 58 (03)
  • [10] Exact Matrix Completion via Convex Optimization
    Candes, Emmanuel J.
    Recht, Benjamin
    [J]. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (06) : 717 - 772