Results 181 to 190 of about 20,045 (225)
Some of the next articles are maybe not open access.
Near-lossless compression of large alphabet sources
2012 46th Annual Conference on Information Sciences and Systems (CISS), 2012We study universal compression of independent and identically distributed sources over large alphabets using fixed-rate codes. To model large alphabets, we use sequences of discrete alphabets that increase in size with the blocklength. We show that universal compression is possible using deterministic codes provided that the alphabet growth is sub ...
Benjamin G. Kelly, Aaron B. Wagner
openaire +1 more source
IEEE Transactions on Image Processing, 2012 International audienceWe propose a new hierarchical approach for lossless and near-lossless resolution scalable compression. It combines the adaptability of DPCM schemes with new hierarchical oriented predictors in order to provide resolution scalability
C Labit
exaly +1 more source
Near lossless image compression system
2012 Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics, 2012Image compression has become an important issue in relation to storage and transmission. A very simple and efficient near lossless image compression system is suggested in this paper. In the forward compression algorithm, image pixels are shifted right by the base value.
A. S. Mamatha, Vipula Singh
openaire +1 more source
Region-based near-lossless image compression
2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 2002We present a near-lossless technique for the compression of images, which is based on the partitioning of the image into regions of constant intensity. The boundary information associated with the image partition is encoded with the method of the transition points. The compression of the intensities of the regions is based on the usual entropy encoding
openaire +1 more source
Single-rate near lossless compression of animated geometry
Computer-Aided Design, 2009Representing mesh geometry in local rather than the world coordinate systems is very useful in many 3D animation processing applications. One can investigate the representation of vertex locations relative to a local coordinate frame (LCF) in the compression of dynamic 3D meshes.
Rachida Amjoun, Wolfgang Straßer
openaire +1 more source
A new error criterion for near-lossless image compression
Proceedings of International Conference on Image Processing, 2002This paper presents a new criterion for near-lossless image compression and compares it with the more familiar maximum pixel error criterion in terms of compression performance and coded image subjective quality. In this new framework we compress an image in such a way that at each pixel the total error between the original and the coded images over a ...
Nasir D. Memon, Nader Moayeri
openaire +1 more source
An Efficient Near-lossless Compression Algorithm for Multichannel EEG signals
2021 IEEE International Symposium on Medical Measurements and Applications (MeMeA), 2021In many biomedical measurement procedures, it is important to record a huge amount of data, to monitor the state of health of a subject. In such a context, electroencephalograph (EEG) data are one of the most demanding in terms of size and signal behavior. In this paper, we propose a near-lossless compression algorithm for EEG signals able to achieve a
Campobello G. +8 more
openaire +2 more sources
Scalable near-lossless video compression based on HEVC
2017 IEEE Visual Communications and Image Processing (VCIP), 2017Lossless or near-lossless video compression with a certain maximum absolute reconstruction error is required in many professional applications like archiving or medical imaging. However, lossless coding resulting in rather high bit rates and near-lossless coding being traditionally used and especially optimized for still image coding prevents these ...
Andreas Heindel, André Kaup
openaire +1 more source
Lossless and near-lossless compression of still color images
Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348), 2003This paper proposes a unified coding algorithm for lossless and near-lossless color image compression that exploits the correlations between RGB signals. For lossless coding, a reversible color transform is proposed that removes the correlations between RGB signals while avoiding any finite word length limitation.
Takayuki Nakachi +2 more
openaire +1 more source
Lossless and near-lossless image compression with color transformations
Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205), 2002A comparison of lossless compression results is given for RGB, YC/sub R/C/sub B/ and reversible JPEG 2000 color space. The paper describes the general conditions that rounding errors of a color transformation do not cumulate in the consecutive cycles of forward and inverse transformation.
Marek Domanski, Krzysztof Rakowski
openaire +1 more source