Image restoration via reconciliation of group sparsity and low-rank models

Image nonlocal self-similarity (NSS) property has been widely exploited via various sparsity models such as joint sparsity (JS) and group sparse coding (GSC). However, the existing NSS-based sparsity models are either too restrictive, e.g., JS enforces the sparse codes to share the same support, or...

Full description

Saved in:
Bibliographic Details
Main Authors: Zha, Zhiyuan, Wen, Bihan, Yuan, Xin, Zhou, Jiantao, Zhu, Ce
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/10356/160519
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-160519
record_format dspace
spelling sg-ntu-dr.10356-1605192022-07-26T04:37:02Z Image restoration via reconciliation of group sparsity and low-rank models Zha, Zhiyuan Wen, Bihan Yuan, Xin Zhou, Jiantao Zhu, Ce School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Image Restoration Image Coding Image nonlocal self-similarity (NSS) property has been widely exploited via various sparsity models such as joint sparsity (JS) and group sparse coding (GSC). However, the existing NSS-based sparsity models are either too restrictive, e.g., JS enforces the sparse codes to share the same support, or too general, e.g., GSC imposes only plain sparsity on the group coefficients, which limit their effectiveness for modeling real images. In this paper, we propose a novel NSS-based sparsity model, namely, low-rank regularized group sparse coding (LR-GSC), to bridge the gap between the popular GSC and JS. The proposed LR-GSC model simultaneously exploits the sparsity and low-rankness of the dictionary-domain coefficients for each group of similar patches. An alternating minimization with an adaptive adjusted parameter strategy is developed to solve the proposed optimization problem for different image restoration tasks, including image denoising, image deblocking, image inpainting, and image compressive sensing. Extensive experimental results demonstrate that the proposed LR-GSC algorithm outperforms many popular or state-of-the-art methods in terms of objective and perceptual metrics. Ministry of Education (MOE) This work was supported in part by the Ministry of Education, Republic of Singapore, under its Academic Research Fund Tier 1 Project RG137/20 and the Start-Up Grant; in part by the National Natural Science Foundation of China under Grant 62020106011, Grant U19A2052, and Grant 61971476; and in part by the Macau Science and Technology Development Fund, Macau SAR, under Grant 077/2018/A2 and Grant 0060/2019/A1. 2022-07-26T04:37:01Z 2022-07-26T04:37:01Z 2021 Journal Article Zha, Z., Wen, B., Yuan, X., Zhou, J. & Zhu, C. (2021). Image restoration via reconciliation of group sparsity and low-rank models. IEEE Transactions On Image Processing, 30, 5223-5238. https://dx.doi.org/10.1109/TIP.2021.3078329 1057-7149 https://hdl.handle.net/10356/160519 10.1109/TIP.2021.3078329 34010133 2-s2.0-85107000291 30 5223 5238 en RG137/20 IEEE Transactions on Image Processing © 2021 IEEE. All rights reserved.
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Image Restoration
Image Coding
spellingShingle Engineering::Electrical and electronic engineering
Image Restoration
Image Coding
Zha, Zhiyuan
Wen, Bihan
Yuan, Xin
Zhou, Jiantao
Zhu, Ce
Image restoration via reconciliation of group sparsity and low-rank models
description Image nonlocal self-similarity (NSS) property has been widely exploited via various sparsity models such as joint sparsity (JS) and group sparse coding (GSC). However, the existing NSS-based sparsity models are either too restrictive, e.g., JS enforces the sparse codes to share the same support, or too general, e.g., GSC imposes only plain sparsity on the group coefficients, which limit their effectiveness for modeling real images. In this paper, we propose a novel NSS-based sparsity model, namely, low-rank regularized group sparse coding (LR-GSC), to bridge the gap between the popular GSC and JS. The proposed LR-GSC model simultaneously exploits the sparsity and low-rankness of the dictionary-domain coefficients for each group of similar patches. An alternating minimization with an adaptive adjusted parameter strategy is developed to solve the proposed optimization problem for different image restoration tasks, including image denoising, image deblocking, image inpainting, and image compressive sensing. Extensive experimental results demonstrate that the proposed LR-GSC algorithm outperforms many popular or state-of-the-art methods in terms of objective and perceptual metrics.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Zha, Zhiyuan
Wen, Bihan
Yuan, Xin
Zhou, Jiantao
Zhu, Ce
format Article
author Zha, Zhiyuan
Wen, Bihan
Yuan, Xin
Zhou, Jiantao
Zhu, Ce
author_sort Zha, Zhiyuan
title Image restoration via reconciliation of group sparsity and low-rank models
title_short Image restoration via reconciliation of group sparsity and low-rank models
title_full Image restoration via reconciliation of group sparsity and low-rank models
title_fullStr Image restoration via reconciliation of group sparsity and low-rank models
title_full_unstemmed Image restoration via reconciliation of group sparsity and low-rank models
title_sort image restoration via reconciliation of group sparsity and low-rank models
publishDate 2022
url https://hdl.handle.net/10356/160519
_version_ 1739837398451224576