✦ LIBER ✦

The Interpolation-Based Bintree and encoding of binary images

✍ Scribed by M.Aris Ouksel; Anan Yaagoub

Publisher: Elsevier Science
Year: 1992
Weight: 959 KB
Volume: 54
Category: Article
ISSN: 1049-9652
DOI: 10.1016/1049-9652(92)90035-v

No coin nor oath required. For personal study only.

✦ Synopsis

A new structure for representing binary images, called the Interpolation-Based Bintree, is introduced. This structure combines the features of some existing representations such as linear quadtrees, binary trees, and interpolation-based codes to improve the performance of operations manipulating graphics images. The implementation of this method is performed on both randomly generated and actual images and is shown to be very simple and efficient. It is also shown to compare favorably with several popular techniques in both storage and processing requirements. Although this structure is mainly for binary images, it can also be utilized for a class of "color-coded" images, where the color code has a nominal value, the difference between two codes has no meaning, and areas of uniform color values are larger with respect to resolution.

📜 SIMILAR VOLUMES

Boolean function-based approach for enco

Boolean function-based approach for encoding of binary images

✍ Debranjan Sarkar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 722 KB

On the encoding and representing of imag

On the encoding and representing of images

✍ Giora Ram 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 469 KB

For an image to be processed in a computer, it must be represented in a specific form which is understood by the computer. This is the "encoding phase." Image representation and compression are correlated concepts. This paper describes general compression algorithms in which the emphasis is on effic

An interval-based temporal algebra based

An interval-based temporal algebra based on binary encoding of point relations

✍ Vincent J. Kovarik Jr.; Avelino J. Gonzalez 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

This paper presents a method for representing temporal interval relations using a bit-encoded form of the relationships between interval end points. The set of bit patterns for each interval relationship yields a unique, single-byte signature that forms the basis of a binary temporal algebra. Also p

The future of 3-D range image measuremen

The future of 3-D range image measurement using binary-encoded pattern projection

✍ Anthony J.E. Goodall; David R. Burton; Michael J. Labor 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 763 KB

Young children's encoding of images base

Young children's encoding of images based on motor and verbal modes of mediation

✍ Steven B. Silvern; Thomas Daniels Yawkey 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 3 views

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