Ñæàòèå èçîáðàæåíèé áåç ïîòåðü:
Ñæàòèå ÷åðíî-áåëûõ èçîáðàæåíèé
Àíãëèéñêèå ìàòåðèàëû Èñõîäíûå òåêñòû êîìïðåññîðîâ Òåñòîâûå äàííûå Ïîëåçíûå ññûëêè
|
Ðóññêèå ìàòåðèàëû |
|||
| Àâòîðû | Íàçâàíèå | Îïèñàíèå | Ðåéòèíã |
| Àãååíêî Å.È, Franti P. | Ñæàòèå áèíàðíîé ãðàôèêè â èíôîðìàöèîííûõ è òåëåêîììóíèêàöèîííûõ ñèñòåìàõ. |
Îïèñàíà ìîäèôèêàöèÿ ìåòîäà JBIG, ïîçâîëÿþùàÿ óñêîðèòü êîäèðîâàíèå â 2-3 ðàçà.
Proc. Conf. "Role of new information technologies in development of education, science and culture in Russia", Ulyanovsk (Simbirsk), Russia, 1997. PDF 309 êáàéò |
|
|
Òåêñòû ñòàíäàðòîâ |
|||
| Àâòîðû | Íàçâàíèå | Îïèñàíèå | Ðåéòèíã |
| ITU-T Recommendation T.4 (Previously "CCITT Recommendation") | CCITT Group 3. Standardization of Group facsimile terminals for document transmission |
Àêòèâíî èñïîëüçóþùèéñÿ ñòàíäàðò íà ñæàòèå ôàêñèìèëüíûõ èçîáðàæåíèé
RAR 992 êáàéò |
|
| ITU-T Recommendation T.6 (Extract from the "Blue Book") | CCITT Group 4. Facsimile coding schemes and coding control functions for Group 4 facsimile apparatus |
Ðàçâèòèå ñòàíäàðòà CCITT G3
RAR 172 êáàéò |
|
|
Àíãëèéñêèå ìàòåðèàëû | |||
| Howard P. | Text Image Compression Using Soft Pattern Matching | We present a method for both lossless and lossy compression of bi-level images that consist mostly of printed or typed text. The key feature of the method is soft pattern matching, a way of making use of the information in previously encountered characters without risking the introduction of character substitution errors. We can obtain lossless compression which is about 20% better than that of the JBIG standard by direct application of this method...
The Computer Journal, Vol. 40, No. 2/3, pp.146-156, 1997. PDF.RAR 97 êáàéò |
|
| Inglis S. | Lossless Document Image Compression | Äîêòîðñêàÿ äèññåðòàöèÿ Ñòüþàðòà Èíãëèñà. Ðàññìàòðèâàþòñÿ ìåòîäû ñæàòèÿ òåêñòîâûõ èçîáðàæåíèé áåç ïîòåðü, ñåãìåíòàöèè îáëàñòåé òåêñòîâûõ è íåòåêñòîâûõ èçîáðàæåíèé, âûÿâëåíèÿ ñêîñîâ.
Ph.D thesis, Department of Computer Science, The University of Waikato, March 1999. PDF.RAR 1825 êáàéò |
|
| Ye Y., Schilling D., Cosman P., Koy H.H. | Symbol Dictionary Design for the JBIG2 Standard | ...We propose a two-pass technique for choosing the dictionary entries, and discuss the trade-offs in bit allocation that these choices entail. The proposed dictionary design technique outperforms simpler dictionary formation techniques by up to 7-9% and 10-18% for lossless and lossy compression, respectively. In the lossy case, we further point out one way to significantly speed up the symbol bitmap compression procedure.
Proceedings of IEEE Data Compression Conference, Snowbird, Utah, March 28-30, 2000. PDF.RAR 49 êáàéò PS.RAR 37 êáàéò |
|
| Malvar H.S. | Fast Adaptive Encoder for Bi-Level Images | ...The proposed bi-level coder (BLC) uses two simple adaptation rules: the first to compute context-dependent probability estimates that control a pixel prediction module, and the second to adjust a run-length parameter in a Run-Length-Rice (RLR) coder... Due to its simplicity, in many applications BLC may be a better choice than JBIG or JBIG-2.
Proceedings of IEEE Data Compression Conference, Snowbird, Utah, March 27-29, 2001. PDF.RAR 146 êáàéò |
|
| Ageenko E., Franti P. | Compression of large binary images in digital spatial libraries |
Îïèñàí ìåòîä ñòàòè÷åñêîãî ïîñòðîåíèÿ äåðåâà êîíòåêñòîâ äëÿ ìîíîõðîìíûõ
èçîáðàæåíèé. Ïî ñðàâíåíèþ ñ JBIG1 äàåò î÷åíü íåïëîõèå ðåçóëüòàòû, íî
ðàñïàêîâêà ìåäëåííåå, à óïàêîâêà ñèëüíî ìåäëåííåå, ÷åì ó JBIG1.
Computers & Graphics, 24 (1), pp.91-98, Elsevier Science, February 2000. PDF 651 êáàéò |
|
| 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 êáàéò |
|
| E. Ageenko | Context-based Compression of Binary Images |
Äàííàÿ äèññåðòàöèÿ ïîñâÿùåíà ñæàòèþ è îáðàáîòêå áîëüøèõ ìîíîõðîìíûõ èçîáðàæåíèé.
University of Joensuu, 2000 PDF.RAR 3.8 ÌÁ |
|
| Tong Zhang | Compression by Model Combination |
Äåìîíñòðàöèÿ ñìåøèâàíèÿ ìîäåëåé ìàëûõ ïîðÿäêîâ íà ïðèìåðå ìîíîõðîìíûõ
èçîáðàæåíèé.
Proceedings of IEEE Data Compression Conference, Snowbird, Utah, March 30, 1998. PDF.RAR 81 êáàéò |
|
| H.Helfgott and M.Cohn | LINEAR-TIME CONSTRUCTION OF OPTIMAL CONTEXT TREES |
We show how to construct an optimal context tree for a given
plaintext and context order. Our algorithm runs in time linear in the size
of the plaintext and the size of the context, and consumes space linear in
the size of the plaintext. We evaluate the algorithm's performance on the
CCITT test set for bilevel images with the Euclidean-norm context order.
Proceedings of IEEE Data Compression Conference, Snowbird, Utah, March 30, 1998. (áèòûé)PDF.RAR 217 êáàéò |
|
| S. M. Aghito and S. Forchhammer | Context Based Coding of Binary Shapes by Object Boundary Straightness Analysis |
A new lossless compression scheme for bi-level images targeted at binary shapes
of image and video objects is presented. The scheme is based on a local analysis
of the digital straightness of the causal part of the object boundary, which is used
in the context definition for arithmetic encoding.
IEEE Data Compression Conference, pp.399-408. Utah, USA, March 2004. PDF.RAR 144 êáàéò |
|
|
Èñõîäíûå òåêñòû êîìïðåññîðîâ | |||
| Markus Kuhn | JBIG-KIT library |
Ðåàëèçàöèÿ àëãîðèòìà JBIG (JBIG1). Ñäåëàíî ïî-íåìåöêè îñíîâàòåëüíî.
ßçûê: C. Ñàéò ïðîåêòà ïîëíàÿ âåðñèÿ 1.4 313 êáàéò âåðñèÿ 1.4 ñ óäàëåííûìè òåñòîâûìè èçîáðàæåíèÿìè 64 êáàéò |
|
| Leon Bottou and Yann Le Cun | DjVu reference library |
Ðåàëèçàöèÿ àëãîðèòìîâ è ôîðìàòà DjVu (âàðèàöèÿ íà òåìó JBIG2). Ïðåäíàçíà÷åíî
äëÿ þíèêñîèäîâ, íî, ñ ïîìîùüþ çóáèëà, ìîæíî ïîðòèðîâàòü è íà Win32. Àãà, è åùå
îòñþäà ìîæíî âûêîâûðÿòü Z-coder.
ßçûê: C++. Ñàéò ïðîåêòà âåðñèÿ 3.5.9 1.03 ÌÁ |
|
|
Òåñòîâûå äàííûå | |||
| Ñàéò | Êîììåíòàðèé | ||
| Íàáîð ñòàíäàðòíûõ èçîáðàæåíèé CCITT | Íàáîð äàâíî óñòàðåë, íî äðóãîãî íåò. | ||
|
Ïîëåçíûå ññûëêè | |||
| Îôèöèàëüíûé ñàéò ïðîåêòà JBIG | |||
| Îôèöèàëüíûé ñàéò ïðîåêòà JBIG2 | |||
| Ñòðàíè÷êà Å.Àãååíêî | Èìååòñÿ ââîäíûé ðàçäåë ïî ñæàòèþ ìîíîõðîìíûõ èçîáðàæåíèé. | ||
íàâåðõ