2020
DOI: 10.1109/jstars.2020.2999961
|View full text |Cite
|
Sign up to set email alerts
|

Texture-Aware Deblurring for Remote Sensing Images Using $ \ell _0$-Based Deblurring and $ \ell _2$-Based Fusion

Abstract: This paper presents an image deblurring method using 0-norm based deblurring and 2-norm based textureaware image fusion for remote sensing images. To restore the details of blurred texture, the proposed method first perform texture restoration by fusing the restored results using Richardson-Lucy deconvolution and unsharp masking. Next, we analyzed the intensity and dark channel properties of remote sensing images and perform the 0-norm based deblurring using the intensity and dark channel priors. Although the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 35 publications
0
9
0
Order By: Relevance
“…Here, W denotes the Gaussian noise added to the original image. One approach is to use the plug-andplay framework, which involves applying the trained denoiser within the proposed update rules described in (14) and iterating until convergence is achieved. However, as the neural network optimization is independent of the blurring kernel and the blurred data, the HQS solver requires a significant number of iterations to converge and produce desirable results.…”
Section: Proposed Hqs Solvermentioning
confidence: 99%
See 2 more Smart Citations
“…Here, W denotes the Gaussian noise added to the original image. One approach is to use the plug-andplay framework, which involves applying the trained denoiser within the proposed update rules described in (14) and iterating until convergence is achieved. However, as the neural network optimization is independent of the blurring kernel and the blurred data, the HQS solver requires a significant number of iterations to converge and produce desirable results.…”
Section: Proposed Hqs Solvermentioning
confidence: 99%
“…Taking into account the drawbacks of the plug-and-play methodology, our aim is to develop a deep unrolling hyperspectral deconvolution network based on the proposed well-justified optimization solver (14). To accomplish this, a small number of iterations of the HQS solver (14), for instance, K = 5 − 10, are unrolled to establish a highly interpretable network. Each iteration of the proposed solver corresponds to a distinct layer within this K-layer unrolling architecture.…”
Section: A Proposed Deep Unrolling Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…Further, Henrot et al [150] introduced the Huber-Markov variational model with spatially local adaptive edge-preserving ability for HSIs deblurring. From the spectral viewpoint, Cao et al [151] and Lim et al [152] presented the dark channel prior for HSIs deblurring, along with the ℓ 0 -and ℓ 1 -based TV regularizer…”
Section: ) Sparsity Optimization Modelsmentioning
confidence: 99%
“…Non-blind deblurring algorithms assume that the blur kernel is known or pre-estimated, whereas blind deblurring algorithms estimate both the blur kernel and the clear image or output the clear image directly. Early conventional deblurring models used natural image priors to design the corresponding algorithms [ 6 , 7 , 8 ]; however, when dealing with images with null-variant properties, most a priori models do not capture the complex blurring variations in real images well. To ameliorate this problem, a number of deep learning-based deblurring algorithms have been proposed, with neural networks themselves offering unique advantages that are unmatched by traditional algorithms: They generate images directly from the network without estimating fuzzy kernels, avoiding the problem of error superposition during the estimation of fuzzy kernels; There is no need to consider whether the motion blur has a spatially varying property, extending the applicability of the algorithm.…”
Section: Introductionmentioning
confidence: 99%