𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast and efficient compression method for binary images

✍ Scribed by Pasi Fränti

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
815 KB
Volume
6
Category
Article
ISSN
0923-5965

No coin nor oath required. For personal study only.

✦ Synopsis

The use of arithmetic coding for binary image compression achieves a high compression ratio while the running time remains rather slow. A composite modelling method presented in this paper reduces the size of the data to be coded by arithmetic coding. The method is to code the uniform areas with less computation and apply arithmetic coding to the areas with more variation.

📜 SIMILAR VOLUMES

Lossless compression for storing similar
Lossless compression for storing similar binary images
✍ Tsong-Wuu Lin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

Consecutive images keep some extra information which is not stored in each of them. These consecutive images form a gradually changing data set. The dynamic changes are kept wholly in such a data set. A gradually changing data set occupies a large amount of memory space unless it overlays the same p

Forward-adaptive method for context-base
Forward-adaptive method for context-based compression of large binary images
✍ Eugene I. Ageenko; Pasi Fränti 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 1 views

A method for compressing large binary images is proposed for applications where spatial access to the image is required. The proposed method is a two-stage combination of forward-adaptive modeling and backwardadaptive context based compression with re-initialization of statistics. The method improve

Methods for fast morphological image tra
Methods for fast morphological image transforms using bitmapped binary images
✍ Rein van den Boomgaard; Richard van Balen 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 727 KB

In this paper we present new implementations for morphological binary image processing on a general-purpose computer, using a bitmap representation of binary images instead of representing binary images as bitplanes inserted in gray value images. The bitmap data representation is a very efficient on

Method for efficient fast spin echo Dixo
Method for efficient fast spin echo Dixon imaging
✍ Jingfei Ma; Sanjay K. Singh; Ashok J. Kumar; Norman E. Leeds; Lyle D. Broemeling 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 385 KB

In order to satisfy the Carr-Purcell-Meiboom-Gill (CPMG) condition, echo shift as dictated in fast-spin-echo (FSE)-based Dixon imaging was previously achieved by applying a time shift to the readout gradient and the data acquisition window. Accordingly, interecho spacing is increased, which entails

A minute lossy method for 2D-gel images
A minute lossy method for 2D-gel images compression
✍ Yung-Kuan Chan; Duan-Li Liau; Yung-Fu Chen; Hsien-Chu Wu; Yen-Ping Chu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 613 KB

## Abstract This article presents a compression method to encode a 2D‐gel image by using hybrid lossless and lossy techniques. In this method, areas containing protein spots are encoded using lossless method while the background is encoded using the lossy method. A 2D‐gel image usually covers a lar