.png){kind=icon}
Return
Image-denoising algorithm based on improved K-singular value decomposition and atom optimization
.png){kind=icon}
OA
AI
DOI：10.1049/cit2.12044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The traditional K-singular value decomposition (K-SVD) algorithm has poor image-denoising performance under strong noise. An image-denoising algorithm is proposed based on improved K-SVD and dictionary atom optimization. First, a correlation coefficient-matching criterion is used to obtain a sparser representation of the image dictionary. The dictionary noise atom is detected according to structural complexity and noise intensity and removed to optimize the dictionary. Then, non-local regularity is incorporated into the denoising model to further improve image-denoising performance. Results of the simulated dictionary recovery problem and application on a transmission line dataset show that the proposed algorithm improves the smoothness of homogeneous regions while retaining details such as texture and edge.
Keywords:
SPARSE-REPRESENTATION
OVERCOMPLETE DICTIONARIES
SVD
Journal
IF:
7.3
Papers:
663
Citations:
2.4K
Organization
Cited Papers
Applicability of linear and nonlinear principal component analysis for damage detection.png)
2015 IEEE International Instrumentation and Measurement Technology Conference (I2MTC) Proceedings
2015 IEEE International Instrumentation and Measurement Technology Conference (I2MTC) ProceedingsIF0
PREAI
ShareSave
ShareSaveShareSave
View more