Image Compression Through a Projection onto a Polyhedral Set

Authors:
F. Malgouyres
Affiliations:
LAGA/L2TI, Université Paris 13, Villetaneuse, France 93430
Venue:
Journal of Mathematical Imaging and Vision
Year:
2007

Citing 5
Cited 1

Atomic Decomposition by Basis Pursuit

SIAM Journal on Scientific Computing
New multiscale transforms, minimum total variation synthesis: applications to edge-preserving image reconstruction

Signal Processing - Image and Video Coding beyond Standards
Adapted Total Variation for Artifact Free Decompression of JPEG Images

Journal of Mathematical Imaging and Vision
The curvelet transform for image denoising

IEEE Transactions on Image Processing
Minimizing the total variation under a general convex constraint for image restoration

IEEE Transactions on Image Processing

Rank related properties for Basis Pursuit and total variation regularization

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In image denoising, many researchers have tried for several years to combine wavelet-like approaches and optimization methods (typically based on the total variation minimization). However, despite the well-known links between image denoising and image compression when solved with wavelet-like approaches, these hybrid image denoising methods have not found counterparts in image compression. This is the gap that this paper aims at filling. To do so, we provide a generalization of the standard image compression model. However, important numerical limitations still need to be addressed in order to make such models practical.