Rank minimization via adaptive hybrid norm for image restoration

被引:10
|
作者
Yuan, Wei [1 ]
Liu, Han [1 ]
Liang, Lili [1 ]
Xie, Guo [1 ]
Zhang, Youmin [2 ]
Liu, Ding [1 ]
机构
[1] Xian Univ Technol, Sch Automation & Informat Engn, Xian 710048, Peoples R China
[2] Concordia Univ, Dept Mech Ind & Aerosp Engn, Montreal, PQ H3G 1M8, Canada
基金
中国国家自然科学基金;
关键词
Rank minimization; Singular value; Adaptive hybrid norm minimization; Significance factor; Image restoration; Nonlocal self-similarity; SPARSE REPRESENTATION; QUALITY ASSESSMENT; MATRIX COMPLETION; REGULARIZATION; APPROXIMATION; ALGORITHM;
D O I
10.1016/j.sigpro.2022.108926
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Rank minimization methods have achieved promising performance in various image processing tasks. However, there are still two challenging problems in the existing works. One is that most of the cur-rent methods only regularize singular values by using a single l 1-norm, such as the well-known nuclear norm minimization (NNM) and the weighted nuclear norm minimization (WNNM). Consequently, many small singular values are shrunk to zero, which is unbeneficial for restoring image details. The other is that how to adaptively evaluate the importance of each singular value is still a suspending prob-lem. In this paper, we propose a novel rank minimization method, namely adaptive hybrid norm min-imization (AHNM) model, to solve the above problems. Specifically, for each singular value, we employ l 2-norm to compensate for l 1-norm, and introduce a significance factor to assess its importance adap-tively. More importantly, we show that closed-form solutions for all subproblems can be derived simply by using alternating optimization. With the aid of the proposed AHNM model, we further develop a general yet effective image restoration algorithm based on the nonlocal self-similarity (NSS) of images. Numerous experimental results demonstrate that the proposed AHNM model consistently outperforms many state-of-the-art restoration methods, including model-based methods and deep learning-based methods.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 50 条
  • [41] Image decomposition and restoration using total variation minimization and the H-1 norm
    Osher, S
    Solé, A
    Vese, L
    MULTISCALE MODELING & SIMULATION, 2003, 1 (03): : 349 - 370
  • [42] Robust low tubal rank tensor completion via factor tensor norm minimization
    Jiang, Wei
    Zhang, Jun
    Zhang, Changsheng
    Wang, Lijun
    Qi, Heng
    PATTERN RECOGNITION, 2023, 135
  • [43] A hybrid GMRES and TV-norm based method for image restoration
    Calvetti, D
    Lewis, B
    Reichel, L
    ADVANCED SIGNAL PROCESSING ALGORITHMS, ARCHITECTURES, AND IMPLEMENTATIONS XII, 2002, 4791 : 192 - 200
  • [44] The Rank Residual Constraint Model with Weighted Schatten p-Norm Minimization for Image Denoising
    Tao Zhang
    Di Wu
    Xutao Mo
    Circuits, Systems, and Signal Processing, 2023, 42 : 4740 - 4758
  • [45] A mixed norm image restoration
    Hong, MC
    Stathaki, T
    Katsaggelos, AK
    INTERNATIONAL CONFERENCE ON IMAGE PROCESSING - PROCEEDINGS, VOL I, 1997, : 385 - 388
  • [46] The Rank Residual Constraint Model with Weighted Schatten p-Norm Minimization for Image Denoising
    Zhang, Tao
    Wu, Di
    Mo, Xutao
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2023, 42 (08) : 4740 - 4758
  • [47] Hybrid image restoration model with adaptive weight parameter
    Yu, Jimin
    Zhang, Xingtuo
    Zhou, Shangbo
    JOURNAL OF ELECTRONIC IMAGING, 2017, 26 (05)
  • [48] Class-specific adaptive sparse representation via reweighted l1 norm minimization for image classification
    Shi, Zhongrong
    Liu, Chuancai
    JOURNAL OF ELECTRONIC IMAGING, 2017, 26 (04)
  • [49] Iterative adaptive hybrid image restoration for fast convergence
    Hong, Min-Cheol
    OPTICAL ENGINEERING, 2010, 49 (08)
  • [50] A NULLSPACE ANALYSIS OF THE NUCLEAR NORM HEURISTIC FOR RANK MINIMIZATION
    Dvijotham, Krishnamurthy
    Fazel, Maryam
    2010 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2010, : 3586 - 3589