A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal

Poisson noise removal is a fundamental image restoration task in imaging science due to the Poisson statistics of the noise. The total variation (TV) image restoration has been promising for Poisson noise removal. However, TV-based denoising methods suffer from the staircase artifacts which makes th...

Full description

Saved in:
Bibliographic Details
Main Authors: Adam, Tarmizi, Paramesran, Raveendran, Ratnavelu, Kuru
Format: Article
Published: Springer Science and Business Media Deutschland GmbH 2022
Subjects:
Online Access:http://eprints.utm.my/103356/
http://dx.doi.org/10.1007/s40314-022-01828-z
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
id my.utm.103356
record_format eprints
spelling my.utm.1033562023-11-05T09:40:55Z http://eprints.utm.my/103356/ A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal Adam, Tarmizi Paramesran, Raveendran Ratnavelu, Kuru QA75 Electronic computers. Computer science Poisson noise removal is a fundamental image restoration task in imaging science due to the Poisson statistics of the noise. The total variation (TV) image restoration has been promising for Poisson noise removal. However, TV-based denoising methods suffer from the staircase artifacts which makes the restored image blocky. Apart from that, the l1-norm penalization in TV restoration tends to over-penalize signal entries. To address these shortcomings, in this paper, we propose a combined regularization method that uses two regularization functions. Specifically, a combination of a non-convex lp-norm, 0 < p< 1 higher order TV, and an overlapping group sparse TV (OGSTV) is proposed as a regularizer. The combination of a higher order non-convex TV and an overlapping group sparse (OGS) regularization serves as a means to preserve natural-looking images with sharp edges and eliminate the staircase artifacts. Meanwhile, to effectively denoise Poisson noise, a Kullback–Leibler (KL) divergence data fidelity is used for the data fidelity which better captures the Poisson noise statistic. To solve the resulting non-convex minimization problem of the proposed method, an alternating direction method of multipliers (ADMM)-based iterative re-weighted l1 (IRl1) based algorithm is formulated. Comparative analysis against KL-TV, KL-TGV and, KL-OGS TV for restoring blurred images contaminated with Poisson noise attests to the good performance of the proposed method in terms of peak signal-to-noise ratio (PSNR) and structure similarity index measure (SSIM). Springer Science and Business Media Deutschland GmbH 2022 Article PeerReviewed Adam, Tarmizi and Paramesran, Raveendran and Ratnavelu, Kuru (2022) A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal. Computational and Applied Mathematics, 41 (4). NA-NA. ISSN 2238-3603 http://dx.doi.org/10.1007/s40314-022-01828-z DOI : 10.1007/s40314-022-01828-z
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Adam, Tarmizi
Paramesran, Raveendran
Ratnavelu, Kuru
A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
description Poisson noise removal is a fundamental image restoration task in imaging science due to the Poisson statistics of the noise. The total variation (TV) image restoration has been promising for Poisson noise removal. However, TV-based denoising methods suffer from the staircase artifacts which makes the restored image blocky. Apart from that, the l1-norm penalization in TV restoration tends to over-penalize signal entries. To address these shortcomings, in this paper, we propose a combined regularization method that uses two regularization functions. Specifically, a combination of a non-convex lp-norm, 0 < p< 1 higher order TV, and an overlapping group sparse TV (OGSTV) is proposed as a regularizer. The combination of a higher order non-convex TV and an overlapping group sparse (OGS) regularization serves as a means to preserve natural-looking images with sharp edges and eliminate the staircase artifacts. Meanwhile, to effectively denoise Poisson noise, a Kullback–Leibler (KL) divergence data fidelity is used for the data fidelity which better captures the Poisson noise statistic. To solve the resulting non-convex minimization problem of the proposed method, an alternating direction method of multipliers (ADMM)-based iterative re-weighted l1 (IRl1) based algorithm is formulated. Comparative analysis against KL-TV, KL-TGV and, KL-OGS TV for restoring blurred images contaminated with Poisson noise attests to the good performance of the proposed method in terms of peak signal-to-noise ratio (PSNR) and structure similarity index measure (SSIM).
format Article
author Adam, Tarmizi
Paramesran, Raveendran
Ratnavelu, Kuru
author_facet Adam, Tarmizi
Paramesran, Raveendran
Ratnavelu, Kuru
author_sort Adam, Tarmizi
title A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
title_short A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
title_full A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
title_fullStr A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
title_full_unstemmed A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
title_sort combined higher order non-convex total variation with overlapping group sparsity for poisson noise removal
publisher Springer Science and Business Media Deutschland GmbH
publishDate 2022
url http://eprints.utm.my/103356/
http://dx.doi.org/10.1007/s40314-022-01828-z
_version_ 1781777684322320384