DocumentCode :
170466
Title :
A fast image denoising algorithm via over-complete dictionary
Author :
Yanliang Chen ; Yinwei Zhan
Author_Institution :
Sch. of Comput., Guangdong Univ. of Technol., Guangzhou, China
fYear :
2014
fDate :
16-18 May 2014
Firstpage :
321
Lastpage :
325
Abstract :
This paper investigates image denoising algorithm based on sparse representation with over-complete dictionary. Here K-SVD(Singular Value Decomposition) algorithm is used to train the over-complete dictionary, followed by OMP(Orthogonal Matching Pursuit) algorithm for image sparse decomposition. While this strategy achieves good performance on image denoising, it has high computational complexity. In order to speed up computation, Batch-OMP instead of OMP algorithm is adopted to improve the denosing algorithm, which significantly shortens the running time. Finally, analysis is made on the configuration of parameters versus the performance in the denoising algorithm; we use particle swarm optimization algorithm to learn the best parameters.
Keywords :
computational complexity; image denoising; image representation; iterative methods; particle swarm optimisation; singular value decomposition; Batch-OMP algorithm; K-SVD algorithm; computational complexity; image denoising algorithm; image sparse decomposition; orthogonal matching pursuit algorithm; over-complete dictionary; particle swarm optimization algorithm; singular value decomposition algorithm; sparse representation; Algorithm design and analysis; Approximation algorithms; Dictionaries; Image denoising; Matching pursuit algorithms; Noise reduction; Signal processing algorithms; Dictionary learning; Image denoising; Sparse representation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Progress in Informatics and Computing (PIC), 2014 International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4799-2033-4
Type :
conf
DOI :
10.1109/PIC.2014.6972350
Filename :
6972350
Link To Document :
بازگشت