Finding neighbors on bincode-based images in O (n log log n) time
Pattern Recognition Letters
Journal of Visual Communication and Image Representation
An understanding system of natural language and pictorial pattern in the world of weather report
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Set operations on constant bit-length linear quadtrees
Pattern Recognition
Recursive pyramids and their use for image coding
Pattern Recognition Letters
Decomposition of binary images-A survey and comparison
Pattern Recognition
A novel quadtree-structured scheme for transmitting Chinese calligraphy progressively
EGMM'04 Proceedings of the Seventh Eurographics conference on Multimedia
Rectangular decomposition of binary images
ACIVS'12 Proceedings of the 14th international conference on Advanced Concepts for Intelligent Vision Systems
Hi-index | 0.14 |
A method of representing a binary pictorial pattern is developed. Its original idea comes from a sequence of terminal symbols of a context-free grammar. It is a promising technique of data compression for ordinary binary-valued pictures such as texts, documents, charts, etc. Fundamental notions like complexity, primitives, simplifications, and other items about binary-valued pictures are introduced at the beginning. A simple context-free grammar G is also introduced. It is shown that every binary-valued picture is interpretable as a terminal sequence of that G. The DF-expression is defined as the reduced terminal sequence of G. It represents the original picture in every detail and contains no surplus data for reproducing it. A quantitative discussion about the total data of a DF-expression leads to the conclusion that any binary-valued picture with complexity less than 0.47 is expressed by the DF-expression with fewer data than the original ones. The coding algorithm of original data into the DF-expression is developed. It is very simple and recursively executable. Experiments were carried out using a PDS (photo digitizing system), where test pictures were texts, charts, diagrams, etc. with 20 cm x 20 cm size. Data compression techniques in facsimile were also simulated on the same test pictures. Throughout these studies it was made clear that the DF-expression is a very effective technique as a data compression for binary pictorial patterns not only because it yields high data compression but also because its coding and decoding algorithms are very feasible.