By Topic

A study on the speed of top-down and bottom-up DF-encoding/decoding algorithms for binary pictures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kawaguchi, E. ; Dept. of Electr. Eng. & Comput. Eng., Kyushu Inst. of Technol., Japan ; Hirano, H. ; Kamata, S.

The depth-first picture expression (DF-Expression) is an effective data compression technique for binary images. When one applies it to real equipment, one needs a practical encoding/decoding scheme which should be fast and simple in the operation. The authors study two types of coding algorithm, one is the top-down and the other is the bottom-up methods. These algorithms are put into two C programs to compare the speed. The authors have designed an encoding/decoding hardware device, and built it on a breadboard which is linked to a workstaton. The hardware encoder/decoder can achieve a 50-100 times faster operation than the C programs run on a 4 MIPS workstation

Published in:

Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings., 11th IAPR International Conference on

Date of Conference:

30 Aug-3 Sep 1992