IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v410y2021ics0096300321002605.html
   My bibliography  Save this article

Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection

Author

Listed:
  • Wu, Tingting
  • Ng, Michael K.
  • Zhao, Xi-Le

Abstract

In many sparsity-based image processing problems, compared with the convex ℓ1 norm approximation of the nonconvex ℓ0 quasi-norm, one can often preserve the structures better by taking full advantage of the nonconvex ℓp quasi-norm (0≤p<1). In this paper, we propose a nonconvex ℓp quasi-norm approximation in the total generalized variation (TGV)-shearlet regularization for image reconstruction. By introducing some auxiliary variables, the nonconvex nonsmooth objective function can be solved by an efficient alternating direction method of multipliers with convergence analysis. Especially, we use a generalized iterated shrinkage operator to deal with the ℓp quasi-norm subproblem, which is easy to implement. Extensive experimental results show clearly that the proposed nonconvex sparsity approximation outperforms some state-of-the-art algorithms in both the visual and quantitative measures for different sampling ratios and noise levels.

Suggested Citation

  • Wu, Tingting & Ng, Michael K. & Zhao, Xi-Le, 2021. "Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    • Handle: RePEc:eee:apmaco:v:410:y:2021:i:c:s0096300321002605
    DOI: 10.1016/j.amc.2021.126170
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321002605
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126170?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yang, Jing-Hua & Zhao, Xi-Le & Ji, Teng-Yu & Ma, Tian-Hui & Huang, Ting-Zhu, 2020. "Low-rank tensor train for tensor robust principal component analysis," Applied Mathematics and Computation, Elsevier, vol. 367(C).
    2. Zhongming Wu & Min Li & David Z. W. Wang & Deren Han, 2017. "A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(06), pages 1-27, December.
    3. Shama, Mu-Ga & Huang, Ting-Zhu & Liu, Jun & Wang, Si, 2016. "A convex total generalized variation regularized model for multiplicative noise and blur removal," Applied Mathematics and Computation, Elsevier, vol. 276(C), pages 109-121.
    4. Hanming Zhang & Linyuan Wang & Bin Yan & Lei Li & Ailong Cai & Guoen Hu, 2016. "Constrained Total Generalized p-Variation Minimization for Few-View X-Ray Computed Tomography Image Reconstruction," PLOS ONE, Public Library of Science, vol. 11(2), pages 1-28, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ding, Meng & Huang, Ting-Zhu & Ma, Tian-Hui & Zhao, Xi-Le & Yang, Jing-Hua, 2020. "Cauchy noise removal using group-based low-rank prior," Applied Mathematics and Computation, Elsevier, vol. 372(C).
    2. Peixuan Li & Yuan Shen & Suhong Jiang & Zehua Liu & Caihua Chen, 2021. "Convergence study on strictly contractive Peaceman–Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms," Computational Optimization and Applications, Springer, vol. 78(1), pages 87-124, January.
    3. Wang, Yugang & Huang, Ting-Zhu & Zhao, Xi-Le & Deng, Liang-Jian & Ji, Teng-Yu, 2020. "A convex single image dehazing model via sparse dark channel prior," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    4. Kai Tu & Haibin Zhang & Huan Gao & Junkai Feng, 2020. "A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems," Journal of Global Optimization, Springer, vol. 76(4), pages 665-693, April.
    5. Jing Zhao & Qiao-Li Dong & Michael Th. Rassias & Fenghui Wang, 2022. "Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems," Journal of Global Optimization, Springer, vol. 84(4), pages 941-966, December.
    6. Fanhua Shang & Yuanyuan Liu & Fanjie Shang & Hongying Liu & Lin Kong & Licheng Jiao, 2020. "A Unified Scalable Equivalent Formulation for Schatten Quasi-Norms," Mathematics, MDPI, vol. 8(8), pages 1-19, August.
    7. Min Li & Zhongming Wu, 2019. "Convergence Analysis of the Generalized Splitting Methods for a Class of Nonconvex Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 535-565, November.
    8. Zehui Jia & Xue Gao & Xingju Cai & Deren Han, 2021. "Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 188(1), pages 1-25, January.
    9. Li, Xiao & Meng, Xiaoying & Xiong, Bo, 2022. "A fractional variational image denoising model with two-component regularization terms," Applied Mathematics and Computation, Elsevier, vol. 427(C).
    10. Karim Ennouri & Slim Smaoui & Mohamed Ali Triki, 2021. "Detection of Urban and Environmental Changes via Remote Sensing," Circular Economy and Sustainability, Springer, vol. 1(4), pages 1423-1437, December.
    11. Zhao, Xueqing & Huang, Keke & Wang, Xiaoming & Shi, Meihong & Zhu, Xinjuan & Gao, Quanli & Yu, Zhaofei, 2018. "Reaction–diffusion equation based image restoration," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 588-606.
    12. Zhongming Wu & Chongshou Li & Min Li & Andrew Lim, 2021. "Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems," Journal of Global Optimization, Springer, vol. 79(3), pages 617-644, March.
    13. Keren Li & Sergey Utyuzhnikov, 2023. "Tensor Train-Based Higher-Order Dynamic Mode Decomposition for Dynamical Systems," Mathematics, MDPI, vol. 11(8), pages 1-14, April.
    14. Wu, Tingting & Shao, Jinbo & Gu, Xiaoyu & Ng, Michael K. & Zeng, Tieyong, 2021. "Two-stage image segmentation based on nonconvex ℓ2−ℓp approximation and thresholding," Applied Mathematics and Computation, Elsevier, vol. 403(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:410:y:2021:i:c:s0096300321002605. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.