Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Single image fast deblurring algorithm based on hyper‐Laplacian model

View through CrossRef
An improved single image fast deblurring algorithm based on hyper‐Laplacian constraint is proposed. The algorithm is improved in three aspects: image blur kernel estimation sub‐region selection, blur kernel precise estimation, and fast non‐blind deconvolution. First, image amplitude and gradient are used as the basis of blur kernel estimation. On the basis of analysing the edge amplitude and gradient of the image, the image sub‐region for blur kernel estimation is selected. Then the sparsity of the blur kernel is restricted by hyper‐Laplacian, and the fast solving mode of alternately solving different variables is designed. The blur kernel information is accurately estimated. In the fast non‐blind deconvolution restoration phase of the image, the regularised constraint term of the hyper‐Laplacian model is improved and the image gradient distribution is constrained. The blind growth trend of the regional gradient near the strong edge can be suppressed well, and the deblurred image with clear edge structure is generated. Experimental results show that the proposed algorithm can achieve better image deblurring effect and high efficiency.
Title: Single image fast deblurring algorithm based on hyper‐Laplacian model
Description:
An improved single image fast deblurring algorithm based on hyper‐Laplacian constraint is proposed.
The algorithm is improved in three aspects: image blur kernel estimation sub‐region selection, blur kernel precise estimation, and fast non‐blind deconvolution.
First, image amplitude and gradient are used as the basis of blur kernel estimation.
On the basis of analysing the edge amplitude and gradient of the image, the image sub‐region for blur kernel estimation is selected.
Then the sparsity of the blur kernel is restricted by hyper‐Laplacian, and the fast solving mode of alternately solving different variables is designed.
The blur kernel information is accurately estimated.
In the fast non‐blind deconvolution restoration phase of the image, the regularised constraint term of the hyper‐Laplacian model is improved and the image gradient distribution is constrained.
The blind growth trend of the regional gradient near the strong edge can be suppressed well, and the deblurred image with clear edge structure is generated.
Experimental results show that the proposed algorithm can achieve better image deblurring effect and high efficiency.

Related Results

Generative Adversarial Network Based on Multi-feature Fusion Strategy for Motion Image Deblurring
Generative Adversarial Network Based on Multi-feature Fusion Strategy for Motion Image Deblurring
<p>Deblurring of motion images is a part of the field of image restoration. The deblurring of motion images is not only difficult to estimate the motion parameters, but also ...
Advancing Image Deblurring Performance with Combined Autoencoder and Customized Hidden Layers
Advancing Image Deblurring Performance with Combined Autoencoder and Customized Hidden Layers
This article introduces a novel approach to image deblurring by combining a Fourier autoencoder model. The proposed model effectively removes blur artifacts and restores image deta...
Deblurring approach for motion camera combining FFT with α-confidence goal optimization
Deblurring approach for motion camera combining FFT with α-confidence goal optimization
Sharp images ensure success in the object detection and recognition from state-of-art deep learning methods. When there is a fast relative motion between the camera and the object ...
Hyper MV ‐ideals in hyper MV ‐algebras
Hyper MV ‐ideals in hyper MV ‐algebras
AbstractIn this paper we define the hyper operations ⊗, ∨ and ∧ on a hyper MV ‐algebra and we obtain some related results. After that by considering the notions ofhyper MV ‐ideals ...
Double Exposure
Double Exposure
I. Happy Endings Chaplin’s Modern Times features one of the most subtly strange endings in Hollywood history. It concludes with the Tramp (Chaplin) and the Gamin (Paulette Godda...
Hierarchical Patch Aggregation Transformer For Motion Deblurring
Hierarchical Patch Aggregation Transformer For Motion Deblurring
Abstract The paradigm of harnessing encoder-decoder frameworks, underpinned by Transformer constituents, has emerged as an exemplar in the realm of image deblurring archite...
MARS-seq2.0: an experimental and analytical pipeline for indexed sorting combined with single-cell RNA sequencing v1
MARS-seq2.0: an experimental and analytical pipeline for indexed sorting combined with single-cell RNA sequencing v1
Human tissues comprise trillions of cells that populate a complex space of molecular phenotypes and functions and that vary in abundance by 4–9 orders of magnitude. Relying solely ...

Back to Top