Please use this identifier to cite or link to this item:
Title: Sparsity-based image denoising via dictionary learning and structural clustering
Authors: Dong, W
Li, X
Zhang, L 
Shi, G
Keywords: Image denoising
Image representation
Image texture
Iterative methods
Learning (artificial intelligence)
Pattern clustering
Issue Date: 2011
Publisher: IEEE
Source: 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 20-25 June 2011, Providence, RI, p. 457-464 How to cite?
Abstract: Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images - the former attempts to construct or learn a dictionary of basis functions that promotes the sparsity; while the latter connects the sparsity with the self-similarity of the image source by clustering. In this paper, we present a variational framework for unifying the above two views and propose a new denoising algorithm built upon clustering-based sparse representation (CSR). Inspired by the success of l1-optimization, we have formulated a double-header l1-optimization problem where the regularization involves both dictionary learning and structural structuring. A surrogate-function based iterative shrinkage solution has been developed to solve the double-header l1-optimization problem and a probabilistic interpretation of CSR model is also included. Our experimental results have shown convincing improvements over state-of-the-art denoising technique BM3D on the class of regular texture images. The PSNR performance of CSR denoising is at least comparable and often superior to other competing schemes including BM3D on a collection of 12 generic natural images.
ISBN: 978-1-4577-0394-2
ISSN: 1063-6919
DOI: 10.1109/CVPR.2011.5995478
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 10, 2018

Page view(s)

Last Week
Last month
Citations as of Jul 16, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.