.png){kind=icon}
.png){kind=icon}
Return
Effective Blind Image Deblurring Using Matrix-Variable Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2021.3073856.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Blind image deblurring has been a challenging issue due to the unknown blur and computation problem. Recently, the matrix-variable optimization method successfully demonstrates its potential advantages in computation. This paper proposes an effective matrix-variable optimization method for blind image deblurring. Blur kernel matrix is exactly decomposed by a direct SVD technique. The blur kernel and original image are well estimated by minimizing a matrix-variable optimization problem with blur kernel constraints. A matrix-type alternative iterative algorithm is proposed to solve the matrix-variable optimization problem. Finally, experimental results show that the proposed blind image deblurring method is much superior to the state-of-the-art blind image deblurring algorithms in terms of image quality and computation time.
Keywords:
Kernel
Matrix decomposition
Image restoration
Matrix converters
Complexity theory
Computational modeling
Optimization methods
Blind image deblurring
kernel decomposition
matrix-variable optimization
matrix-type alternative iteration
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W