COGL: Coefficient Graph Laplacians for Optimized JPEG Image Decoding
Lists
Only you see this
Abstract
We address the problem of decoding joint photographic experts group (JPEG)-encoded images with less visual artifacts. We view the decoding task as an ill-posed inverse problem and find a regularized solution using a convex, graph Laplacian-regularized model. Since the resulting problem is non-smooth and entails non-local regularization, we use fast high-dimensional Gaussian filtering techniques with the proximal gradient descent method to solve our convex problem efficiently. Our patch-based ”coefficient graph” is better suited than the traditional pixel-based ones for regularizing smooth non-stationary signals such as natural images and relates directly to classic non-local means de-noising of images. We also extend our graph along the temporal dimension to handle the decoding of M-JPEG-encoded video. Despite the minimalistic nature of our convex problem, it produces decoded images with similar quality to other more complex, state-of-the-art methods while being up to five times faster. We also expound on the relationship between our method and the classic ANCE method, reinterpreting ANCE from a graph-based regularization perspective.
BibTeX
@article{young2019cogl,
author = {Sean I. Young and Aous Thabit Naman and David Taubman},
title = {{COGL: Coefficient Graph Laplacians for Optimized JPEG Image Decoding}},
journal = {IEEE Trans. Image Process.},
year = {2019},
url = {https://openreview.net/forum?id=MhD_5n6-eyA},
}Loading related content...