Color demosaicking with sparse representations
Lists
Only you see this
Abstract
Color demosaicking is an ill-posed inverse problem of image restoration. The performance of a color demosaicking algorithm depends on how thoroughly it can exploit domain knowledge to confine the solution space for the underlying true color image. We propose a sparsity-based ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> minimization technique for color demosaicking that exploits both interband and intra-band sparse representations of natural images. In some of most challenging cases of color demosaicking, the proposed technique outperforms those published in the literature by a significant margin in both PSNR and visual quality.
BibTeX
@inproceedings{wu2010color,
author = {Xiaolin Wu and Dahua Gao and Guangming Shi and Danhua Liu},
title = {{Color demosaicking with sparse representations}},
booktitle = {ICIP},
year = {2010},
url = {https://openreview.net/forum?id=PF3ehZs9NGK},
}Loading related content...