Matrix computations (3rd ed.)
Atomic Decomposition by Basis Pursuit
SIAM Review
Combined Wavelet Domain and Temporal Video Denoising
AVSS '03 Proceedings of the IEEE Conference on Advanced Video and Signal Based Surveillance
Image Denoising Via Learned Dictionaries and Sparse representation
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Space-Time Adaptation for Patch-Based Image Sequence Restoration
IEEE Transactions on Pattern Analysis and Machine Intelligence
Wavelet video denoising with regularized multiresolution motion estimation
EURASIP Journal on Applied Signal Processing
-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
IEEE Transactions on Signal Processing
Greed is good: algorithmic results for sparse approximation
IEEE Transactions on Information Theory
Stable recovery of sparse overcomplete representations in the presence of noise
IEEE Transactions on Information Theory
Image denoising using scale mixtures of Gaussians in the wavelet domain
IEEE Transactions on Image Processing
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
IEEE Transactions on Image Processing
Sparse Representation for Color Image Restoration
IEEE Transactions on Image Processing
Wavelet-Domain Video Denoising Based on Reliability Measures
IEEE Transactions on Circuits and Systems for Video Technology
Robust Estimation Approach for NL-Means Filter
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Online dictionary learning for sparse coding
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
One Graph Is Worth a Thousand Logs: Uncovering Hidden Structures in Massive System Event Logs
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Patch-based video processing: a variational Bayesian approach
IEEE Transactions on Circuits and Systems for Video Technology
Generalizing the Nonlocal-means to super-resolution reconstruction
IEEE Transactions on Image Processing
Ramp preserving Perona-Malik model
Signal Processing
Online Learning for Matrix Factorization and Sparse Coding
The Journal of Machine Learning Research
Double sparsity: learning sparse dictionaries for sparse signal approximation
IEEE Transactions on Signal Processing
Homogeneity similarity based image denoising
Pattern Recognition
Self-similarity-based image denoising
Communications of the ACM
Enhancing video denoising algorithms by fusion from multiple views
ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part I
Efficient video denoising based on dynamic nonlocal means
Image and Vision Computing
Discriminant sparse neighborhood preserving embedding for face recognition
Pattern Recognition
Robust Video Restoration by Joint Sparse and Low Rank Matrix Approximation
SIAM Journal on Imaging Sciences
Evolution-enhanced multiscale overcomplete dictionaries learning for image denoising
Engineering Applications of Artificial Intelligence
Dictionary learning and time sparsity in dynamic MRI
MICCAI'12 Proceedings of the 15th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Dictionary learning and similarity regularization based image noise reduction
Journal of Visual Communication and Image Representation
Dictionary learning for image prediction
Journal of Visual Communication and Image Representation
Hi-index | 0.03 |
In this paper, we consider denoising of image sequences that are corrupted by zero-mean additive white Gaussian noise. Relative to single image denoising techniques, denoising of sequences aims to also utilize the temporal dimension. This assists in getting both faster algorithms and better output quality. This paper focuses on utilizing sparse and redundant representations for image sequence denoising, extending the work reported in [1], [2]. In the single image setting, the K-SVD algorithm is used to train a sparsifying dictionary for the corrupted image. This paper generalizes the above algorithm by offering several extensions: i) the atoms used are 3-D; ii) the dictionary is propagated from one frame to the next, reducing the number of required iterations; and iii) averaging is done on patches in both spatial and temporal neighboring locations. These modifications lead to substantial benefits in complexity and denoising performance, compared to simply running the single image algorithm sequentially. The algorithm's performance is experimentally compared to several state-of-the-art algorithms, demonstrating comparable or favorable results.