Sciweavers

5 search results - page 1 / 1
» Arithmetic Coding of a Lossless Contour-Based Representation...
Sort
View
ICIP
1998
IEEE
14 years 6 months ago
Arithmetic Coding of a Lossless Contour-Based Representation of Label Images
Lilian Labelle, Daniel Lauzon, Janusz Konrad, Eric...
ICASSP
2011
IEEE
12 years 8 months ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu
ICIP
1998
IEEE
14 years 6 months ago
Efficient Representation and Decoding of Static Huffman Code Tables in a Very Low Bit Rate Environment
The lossless entropy coding used in many image coding schemes often is overlooked as most research is based around the lossy stages of image compression. This paper examines the r...
Nick B. Body, Donald G. Bailey
ICIP
2005
IEEE
14 years 6 months ago
A context adaptation model for the compression of images with a reduced number of colors
Recently, Chen et al. proposed a method for compressing color-quantized images that is based on a binary tree representation of colors and on context-based arithmetic coding with ...
António J. R. Neves, Armando J. Pinho
3DPVT
2002
IEEE
131views Visualization» more  3DPVT 2002»
13 years 9 months ago
Octree approximation and compression methods
Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as well as objects of arbitrary dimensionality). The ...
Hanan Samet, Andrzej Kochut