Patch-disagreement as away to improve K-SVD denoising

Yaniv Romano; Michael Elad

ICASSP 2015accepted0 citations

Patch-disagreement as away to improve K-SVD denoising

Abstract

In this paper we propose a way to improve the K-SVD image denoising algorithm. The suggested method aims to reduce the gap that exists between the local processing (sparse-coding of overlapping patches) and the global image recovery (obtained by averaging the overlapping patches). Inspired by game-theory ideas, we define a disagreement-patch as the difference between the intermediate locally denoised patch and its corresponding part in the final outcome. Our algorithm iterates the denoising process several times, applied on modified patches. Those are obtained by subtracting the disagreement-patches from their corresponding input noisy ones, thus pushing the overlapping patches towards an agreement. Experimental results demonstrate the improvement this algorithm leads to.

BibTeX

@inproceedings{icassp2015_patchdisagreemen,
  title = {Patch-disagreement as away to improve K-SVD denoising},
  author = {Yaniv Romano and Michael Elad},
  booktitle = {ICASSP 2015},
  year = {2015}
}