arrow
Return

Normal mesh based geometrical image compression

delete2009-03-01
delete1
delete
OA
AI
W
Ward Van Aerschot *
M
Maarten Jansen
A
Adhemar Bultheel
DOI:10.1016/j.imavis.2008.06.017delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Recently the performance of nonlinear transforms have been given a lot of attention to overcome the suboptimal n-terms approximation power of tensor product wavelet methods on higher dimensions. The suboptimal performance prevails when the latter are used for a sparse representation of functions consisting of smoothly varying areas separated by smooth contours. This paper introduces a method creating normal meshes with nonsubdivision connectivity to approximate the nonsmoothness of such images efficiently. From a domain decomposition viewpoint, the method is a triangulation refinement method preserving contours. The transform is nonlinear as it depends on the actual image. This paper proposes an normal offset based compression algorithm for digital images. The discretisation causes the transform to become redundant. We further propose a model to encode the obtained coefficients. We show promising rate distortion curves and compare the results with the JPEG2000 encoder. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Normal multiresolution mesh
Image compression
Piecewise smooth
Wavelets
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Image and Vision Computing cover
Image and Vision Computing
IF:
4.2
Papers:
4.0K
Citations:
6.7K

Organization

K
KU Leuven
Scholars:
5.7W
Papers: 5.2W
Citations: 8.1W