2016
DOI: 10.14257/ijsip.2016.9.6.16
|View full text |Cite
|
Sign up to set email alerts
|

A Non-Convex Approximating Norm Regularization Algorithm for Image Deconvolution

Abstract: Up to now, the non-convex ℓ p (0 < p

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
(26 reference statements)
0
0
0
Order By: Relevance
“…The application of the L p -norm results in augmented sparsity, along with highlighting significant edges while suppressing intricate textures of images, which positively influences the estimation of the blur kernels [48]. To achieve a fast solution, Liu et al [20] used a series of weighted norms to approximate the L p -norm. Pinetz et al [28] discussed a loss function that utilizes the L p -norm to penalize the deviation between the reconstructed image and the ground truth image.…”
Section: P -Norm Regularizationmentioning
confidence: 99%
“…The application of the L p -norm results in augmented sparsity, along with highlighting significant edges while suppressing intricate textures of images, which positively influences the estimation of the blur kernels [48]. To achieve a fast solution, Liu et al [20] used a series of weighted norms to approximate the L p -norm. Pinetz et al [28] discussed a loss function that utilizes the L p -norm to penalize the deviation between the reconstructed image and the ground truth image.…”
Section: P -Norm Regularizationmentioning
confidence: 99%