Ñæàòèå èçîáðàæåíèé áåç ïîòåðü:
Ñæàòèå ïàëèòðîâûõ èçîáðàæåíèé
Àíãëèéñêèå ìàòåðèàëû Èñõîäíûå òåêñòû êîìïðåññîðîâ Òåñòîâûå äàííûå Ïîëåçíûå ññûëêè
|
Ðóññêèå ìàòåðèàëû |
|||
| Àâòîðû | Íàçâàíèå | Îïèñàíèå | Ðåéòèíã |
|
Àíãëèéñêèå ìàòåðèàëû | |||
| Paul J. Ausbeck Jr. | The Piecewise-Constant Image Model. |
The piecewise-constant image model (PWC) is a new technique for lossless
compression of palette images. PWC is a blend of traditional scanline
oriented and newer object based methods. Remarkably, PWC delivers the
best known compression across a wide variety palette image types while
delivering translation speeds comparable to highly tuned one dimensional
methods.
Èñòî÷íèê: Proceedings of the IEEE, Vol. 88, No. 11, November 2000, pp. 1779-1789. DOC.RAR 64 êáàéò PDF.RAR 107 êáàéò |
|
| V. Ratnakar | RAPP: Lossless Image Compression with Runs of Adaptive Pixel Patterns. |
We propose a lossless compression technique specifically designed for
palettized synthetic images. The proposed algorithm uses patterns of
neighborhood pixels to predict and code each pixel.
Èñòî÷íèê: 32nd Asilomar Conference on Signals, Systems and Computers, Nov. 1998 PDF.RAR 41 êáàéò PS.RAR 26 êáàéò |
|
| Paul J. Ausbeck Jr. | The Skip-Innovation Model for Sparse Images |
On sparse images, contiguous runs of identical symbols often occur in the same
coding context. This paper proposes a model for efficiently encoding such runs
in a two-dimensional setting. Because it is model based, the method can be
used with any coding scheme.
Proceedings of IEEE Data Compression Conference, Snowbird, Utah, March 28-30, 2000. PDF 89 êáàéò DOC.RAR 25 êáàéò |
|
| S.R.Tate | Lossless Compression of Region Edge Maps |
In this note, we describe a lossless compression technique that has been
applied to bitmaps defining regions of images. The results show considerable
improvement over previous methods. The basic technique is to use context-based
statistical modeling fed into an arithmetic coder.
Duke University Computer Science Technical Report CS-1992-09. PDF.RAR 46 êáàéò PS.RAR 24 êáàéò |
|
| M.J.Gormish | Compression of palettized images by color |
Palettized or indexed color images are the dominant type of image used on
the "information super highway." In spite of this, most image compression
algorithms are designed for continuous-tone images. This paper presents a
method of losslessly compressing these palettized images, which treats
each color independently. This color-plane method provides substantial
compression improvement over other known methods for most images.
Èñòî÷íèê: International Conference on Image Processing, 1995, Washington D.C. PDF.RAR 68 êáàéò |
|
| B.O.Christiansen, K.E.Schauser, M.Munke | Streaming Thin Client Compression. |
Îïèñàíèå àëãîðèòìà ñæàòèÿ screendumps, âî ìíîãîì ïîõîæåãî íà JBIG2.
Èñòî÷íèê: Proceedings Data Compression Conference, Snowbird Utah, March 2001. PDF.RAR 201 êáàéò |
|
| J.M.Gilbert, R.W.Brodersen | A Lossless 2-D Image Compression Technique for Synthetic Discrete-Tone Images |
A new image compression technique, Flexible Automatic Block Decomposition
(FABD), losslessly compresses typical discrete-tone pseudo-color images 1.5 to
5.5 times more compactly than GIF, and up to twice as compactly as JBIG.
Proceedings of IEEE Data Compression Conference, Snowbird, Utah, March 30, 1998. PDF.RAR 294 êáàéò |
|
| P.Kopylov, P.Franti | Context tree compression of multi-component map images |
We consider compression of multi-component map images by context
modeling and arithmetic coding...
Proceedings Data Compression Conference, Snowbird Utah, March 2003. PDF.RAR 427 êáàéò |
|
| B.O.Christiansen, K.E.Schauser | Fast Motion Detection for Thin Client Compression |
In this paper, we present a novel algorithm for detecting block
movements in image sequences that is fast enough for interactive logins. We
also integrate our algorithm in to TCC, the best previously known codec for
thin client computing...
Proceedings Data Compression Conference, Snowbird Utah, March 2003. PDF.RAR 449 êáàéò |
|
| S.Forchhammer and J.M.Salinas | Progressive Coding of Palette Images and Digital Maps |
A 2-D version of PPM (Prediction by Partial Matching) coding is introduced
simply by combining a 2-D template with the standard PPM coding scheme.
A simple scheme for resolution reduction is given and the 2-D PPM scheme
extended to resolution progressive coding by placing pixels in a lower resolution
image layer...
Proceedings Data Compression Conference, Snowbird Utah, March 2003. PDF.RAR 223 êáàéò |
|
|
Èñõîäíûå òåêñòû êîìïðåññîðîâ | |||
|
Òåñòîâûå äàííûå | |||
| Ñàéò | Êîììåíòàðèé | ||
|
Ïîëåçíûå ññûëêè | |||
| Càéò êîìïðåññîðà PWC | |||
íàâåðõ