A Description Method of Binary Figures by Means of a String of Labeled Regions and Its Applications

Takeshi AGUI; Koichi IWATA

A Description Method of Binary Figures by Means of a String of Labeled Regions and Its Applications

Takeshi AGUI, Koichi IWATA

Full Text Views

0

Cite this

Summary :

A fundamental study for labeling and painting of line drawings is described, and its applications to an animation cel and alphabet are exemplified. Multiple closed regions included in binary line drawings are extracted, and they, both enclosed by image pixels and by non-image pixels, are labeled from the outermost boundary into inner boundaries. After that, a set of these labeled regions is transformed into a simple string by using inclusion relation and disjoint relation defined among them. In the method, the contour of every closed region is automatically traced, and the coordinates of the traces points are stored in the memory of a computer. Inclusion relation and disjoint relation among multiple closed regions are obtained by comparing the numbers (areas) of image pixels and non-image pixels.

Publication: IEICE TRANSACTIONS on transactions Vol.E64-E No.7 pp.478-485

Publication Date: 1981/07/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Data Processing

Authors

Takeshi AGUI
Koichi IWATA

Keyword

Cite this

Copy

Takeshi AGUI, Koichi IWATA, "A Description Method of Binary Figures by Means of a String of Labeled Regions and Its Applications" in IEICE TRANSACTIONS on transactions, vol. E64-E, no. 7, pp. 478-485, July 1981, doi: .
Abstract: A fundamental study for labeling and painting of line drawings is described, and its applications to an animation cel and alphabet are exemplified. Multiple closed regions included in binary line drawings are extracted, and they, both enclosed by image pixels and by non-image pixels, are labeled from the outermost boundary into inner boundaries. After that, a set of these labeled regions is transformed into a simple string by using inclusion relation and disjoint relation defined among them. In the method, the contour of every closed region is automatically traced, and the coordinates of the traces points are stored in the memory of a computer. Inclusion relation and disjoint relation among multiple closed regions are obtained by comparing the numbers (areas) of image pixels and non-image pixels.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e64-e_7_478/_p

Copy

@ARTICLE{e64-e_7_478,
author={Takeshi AGUI, Koichi IWATA, },
journal={IEICE TRANSACTIONS on transactions},
title={A Description Method of Binary Figures by Means of a String of Labeled Regions and Its Applications},
year={1981},
volume={E64-E},
number={7},
pages={478-485},
abstract={A fundamental study for labeling and painting of line drawings is described, and its applications to an animation cel and alphabet are exemplified. Multiple closed regions included in binary line drawings are extracted, and they, both enclosed by image pixels and by non-image pixels, are labeled from the outermost boundary into inner boundaries. After that, a set of these labeled regions is transformed into a simple string by using inclusion relation and disjoint relation defined among them. In the method, the contour of every closed region is automatically traced, and the coordinates of the traces points are stored in the memory of a computer. Inclusion relation and disjoint relation among multiple closed regions are obtained by comparing the numbers (areas) of image pixels and non-image pixels.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - A Description Method of Binary Figures by Means of a String of Labeled Regions and Its Applications
T2 - IEICE TRANSACTIONS on transactions
SP - 478
EP - 485
AU - Takeshi AGUI
AU - Koichi IWATA
PY - 1981
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E64-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1981
AB - A fundamental study for labeling and painting of line drawings is described, and its applications to an animation cel and alphabet are exemplified. Multiple closed regions included in binary line drawings are extracted, and they, both enclosed by image pixels and by non-image pixels, are labeled from the outermost boundary into inner boundaries. After that, a set of these labeled regions is transformed into a simple string by using inclusion relation and disjoint relation defined among them. In the method, the contour of every closed region is automatically traced, and the coordinates of the traces points are stored in the memory of a computer. Inclusion relation and disjoint relation among multiple closed regions are obtained by comparing the numbers (areas) of image pixels and non-image pixels.
ER -