Corpus ID: 17395675

Local Sparse Approximation for Image Restoration with Adaptive Block Size Selection

@article{Sahoo2016LocalSA,
  title={Local Sparse Approximation for Image Restoration with Adaptive Block Size Selection},
  author={S. K. Sahoo},
  journal={ArXiv},
  year={2016},
  volume={abs/1612.06738}
}
  • S. K. Sahoo
  • Published 20 December 2016
  • Computer Science, Engineering, Mathematics
  • ArXiv
In this paper the problem of image restoration (denoising and inpainting) is approached using sparse approximation of local image blocks. The local image blocks are extracted by sliding square windows over the image. An adaptive block size selection procedure for local sparse approximation is proposed, which affects the global recovery of underlying image. Ideally the adaptive local block selection yields the minimum mean square error (MMSE) in recovered image. This framework gives us a… Expand
Image Denoising via Sparse Representation Over Grouped Dictionaries With Adaptive Atom Size
TLDR
An effective image denoising algorithm with the improved dictionaries is presented by using sparse representation over the constructed grouped dictionaries with adaptive atom size and experimental results show that the proposed method achieves betterDenoising performance than related Denoising algorithms, especially in image structure preservation. Expand

References

SHOWING 1-10 OF 23 REFERENCES
Image denoising using sparse approximation with adaptive window selection
  • S. K. Sahoo, Wenmiao Lu
  • Mathematics, Computer Science
  • 2011 8th International Conference on Information, Communications & Signal Processing
  • 2011
TLDR
The problem of image denoising is approached using sparse approximation of local image patches using adaptive window selection procedure for local sparse approximation, which affects the global recovery of underlying image. Expand
Image inpainting using sparse approximation with adaptive window selection
  • S. K. Sahoo, Wenmiao Lu
  • Mathematics
  • 2011 IEEE 7th International Symposium on Intelligent Signal Processing
  • 2011
In this paper the problem of image inpainting is addressed using sparse approximation of local image patches. The small patches are extracted by sliding square windows. An adaptive window selectionExpand
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
TLDR
This work addresses the image denoising problem, where zero-mean white and homogeneous Gaussian additive noise is to be removed from a given image, and uses the K-SVD algorithm to obtain a dictionary that describes the image content effectively. Expand
A Variational Framework for Exemplar-Based Image Inpainting
TLDR
This work proposes a general variational framework for non-local image inPainting, from which important and representative previous inpainting schemes can be derived, in addition to leading to novel ones. Expand
Inpainting and Zooming Using Sparse Representations
TLDR
An easy and efficient sparse-representation-based iterative algorithm for image inpainting that allows a high degree of flexibility to recover different structural components in the image (piecewise smooth, curvilinear, texture, etc.). Expand
A Review of Image Denoising Algorithms, with a New One
TLDR
A general mathematical and experimental methodology to compare and classify classical image denoising algorithms and a nonlocal means (NL-means) algorithm addressing the preservation of structure in a digital image are defined. Expand
Image denoising via sparse representations over Sequential Generalization of K-means (SGK)
  • S. K. Sahoo, A. Makur
  • Mathematics, Computer Science
  • 2013 9th International Conference on Information, Communications & Signal Processing
  • 2013
TLDR
The obtained results suggest that the authors can successfully replace K-SVD with SGK, due to its quicker execution and comparable outcomes, and it is possible to extend the use of SGK to other applications of sparse representation. Expand
Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
This paper describes a novel inpainting algorithm that is capable of filling in holes in overlapping texture and cartoon image layers. This algorithm is a direct extension of a recently developedExpand
Clustering-Based Denoising With Locally Learned Dictionaries
TLDR
This paper proposes K-LLD: a patch-based, locally adaptive denoising method based on clustering the given noisy image into regions of similar geometric structure and introduces a novel mechanism for optimally choosing the local patch size for each cluster using Stein's unbiased risk estimators. Expand
Adapting to Unknown Smoothness via Wavelet Shrinkage
Abstract We attempt to recover a function of unknown smoothness from noisy sampled data. We introduce a procedure, SureShrink, that suppresses noise by thresholding the empirical waveletExpand
...
1
2
3
...