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

Eiji Kawaguchi, Hidemitsu Hirano, Seiichiro Kamata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The Depth - First Picture Expression (DF - Expression) is an effective data compression technique for binary images. When we apply it to a real eqip-ment, we need a practical encoding/decoding scheme which should be fast and simple in the operation. In the present paper, we study two types of coding algorithm, one is the top-down and the other is the bottom-up methods. Those algorithms are put into two C programs to compare the speed. We also designed an encoding/decoding hardware device, and built it on a breadboad which is linked to a workstation. As a result, it became certain that the hardware encoder/decoder can achieve a 50-100 times faster operation than the C programs run on a 4 MIPS workstation.

Original languageEnglish
Title of host publicationIAPR 1992 - 11th IAPR International Conference on Pattern Recognition
Subtitle of host publicationImage, Speech, and Signal Analysis
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages577-581
Number of pages5
Volume3
ISBN (Electronic)0818629207
DOIs
Publication statusPublished - 1992
Externally publishedYes
Event11th IAPR International Conference on Pattern Recognition, IAPR 1992 - The Hague, Netherlands
Duration: 1992 Aug 301992 Sep 1

Other

Other11th IAPR International Conference on Pattern Recognition, IAPR 1992
CountryNetherlands
CityThe Hague
Period92/8/3092/9/1

Fingerprint

Decoding
Hardware
Binary images
Data compression

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Cite this

Kawaguchi, E., Hirano, H., & Kamata, S. (1992). A study on the speed of top-down and bottom-up DF-encoding/decoding algorithms for binary pictures. In IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis (Vol. 3, pp. 577-581). [202053] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPR.1992.202053

A study on the speed of top-down and bottom-up DF-encoding/decoding algorithms for binary pictures. / Kawaguchi, Eiji; Hirano, Hidemitsu; Kamata, Seiichiro.

IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis. Vol. 3 Institute of Electrical and Electronics Engineers Inc., 1992. p. 577-581 202053.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kawaguchi, E, Hirano, H & Kamata, S 1992, A study on the speed of top-down and bottom-up DF-encoding/decoding algorithms for binary pictures. in IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis. vol. 3, 202053, Institute of Electrical and Electronics Engineers Inc., pp. 577-581, 11th IAPR International Conference on Pattern Recognition, IAPR 1992, The Hague, Netherlands, 92/8/30. https://doi.org/10.1109/ICPR.1992.202053
Kawaguchi E, Hirano H, Kamata S. A study on the speed of top-down and bottom-up DF-encoding/decoding algorithms for binary pictures. In IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis. Vol. 3. Institute of Electrical and Electronics Engineers Inc. 1992. p. 577-581. 202053 https://doi.org/10.1109/ICPR.1992.202053
Kawaguchi, Eiji ; Hirano, Hidemitsu ; Kamata, Seiichiro. / A study on the speed of top-down and bottom-up DF-encoding/decoding algorithms for binary pictures. IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis. Vol. 3 Institute of Electrical and Electronics Engineers Inc., 1992. pp. 577-581
@inproceedings{ae1698fe457141f3822a1d124ae40b3c,
title = "A study on the speed of top-down and bottom-up DF-encoding/decoding algorithms for binary pictures",
abstract = "The Depth - First Picture Expression (DF - Expression) is an effective data compression technique for binary images. When we apply it to a real eqip-ment, we need a practical encoding/decoding scheme which should be fast and simple in the operation. In the present paper, we study two types of coding algorithm, one is the top-down and the other is the bottom-up methods. Those algorithms are put into two C programs to compare the speed. We also designed an encoding/decoding hardware device, and built it on a breadboad which is linked to a workstation. As a result, it became certain that the hardware encoder/decoder can achieve a 50-100 times faster operation than the C programs run on a 4 MIPS workstation.",
author = "Eiji Kawaguchi and Hidemitsu Hirano and Seiichiro Kamata",
year = "1992",
doi = "10.1109/ICPR.1992.202053",
language = "English",
volume = "3",
pages = "577--581",
booktitle = "IAPR 1992 - 11th IAPR International Conference on Pattern Recognition",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

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

AU - Kawaguchi, Eiji

AU - Hirano, Hidemitsu

AU - Kamata, Seiichiro

PY - 1992

Y1 - 1992

N2 - The Depth - First Picture Expression (DF - Expression) is an effective data compression technique for binary images. When we apply it to a real eqip-ment, we need a practical encoding/decoding scheme which should be fast and simple in the operation. In the present paper, we study two types of coding algorithm, one is the top-down and the other is the bottom-up methods. Those algorithms are put into two C programs to compare the speed. We also designed an encoding/decoding hardware device, and built it on a breadboad which is linked to a workstation. As a result, it became certain that the hardware encoder/decoder can achieve a 50-100 times faster operation than the C programs run on a 4 MIPS workstation.

AB - The Depth - First Picture Expression (DF - Expression) is an effective data compression technique for binary images. When we apply it to a real eqip-ment, we need a practical encoding/decoding scheme which should be fast and simple in the operation. In the present paper, we study two types of coding algorithm, one is the top-down and the other is the bottom-up methods. Those algorithms are put into two C programs to compare the speed. We also designed an encoding/decoding hardware device, and built it on a breadboad which is linked to a workstation. As a result, it became certain that the hardware encoder/decoder can achieve a 50-100 times faster operation than the C programs run on a 4 MIPS workstation.

UR - http://www.scopus.com/inward/record.url?scp=5844346533&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5844346533&partnerID=8YFLogxK

U2 - 10.1109/ICPR.1992.202053

DO - 10.1109/ICPR.1992.202053

M3 - Conference contribution

AN - SCOPUS:5844346533

VL - 3

SP - 577

EP - 581

BT - IAPR 1992 - 11th IAPR International Conference on Pattern Recognition

PB - Institute of Electrical and Electronics Engineers Inc.

ER -