On a Method of Binary-Picture Representation and Its Application to Data Compression

DOI10.1109/TPAMI.1980.4766967MaRDI QIDQ3877073zbMATH OpenOpenAlexWikidataFDO

Authors Eiji Kawaguchi, Tsutomu Endo

Publication date 1980

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tpami.1980.4766967

zbMATH Keywords

binary-picture representationcoding and decoding algorithmcomplexity of picturecontext-free grammardata compressionfacsimile transmission codingpicture processing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(6)

• Properties and applications of forests of quadtrees for pictorial data representation
• On the size of quadtrees generalized to d-dimensional binary pictures
• Morphological decomposition and compression of binary images via a minimum set cover algorithm
• Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
• Semantic-syntax-directed translation and its application to image processing
• Determination of the 3D border by repeated elimination of internal surfaces

This page was built for publication: On a Method of Binary-Picture Representation and Its Application to Data Compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3877073)