An efficient encoding scheme for arbitrary curves, based on the chain code representation, has been proposed. The encoding scheme takes advantage of the property that a curve with gentle curvature is divided into somewhat long curve sections (segments), each of which is represented by a sequence of two adjacent-direction chain codes. The coding efficiency of the scheme becomes higher as the segments become longer, while a variable-length coding technique makes it possible to encode short segments without an extreme increase in code amount. An experiment with complicated curves obtained from geographic maps has shown a high data compression rate of the proposed scheme, whose code amount is about 50-60 percent of that required for the conventional chain encoding scheme.
[1]
Azriel Rosenfeld,et al.
Connectivity in Digital Pictures
,
1970,
JACM.
[2]
M. Kunt,et al.
Efficient coding of high resolution typographic characters
,
1982,
ICASSP.
[3]
Herbert Freeman,et al.
Computer Processing of Line-Drawing Images
,
1974,
CSUR.
[4]
Herbert Freeman,et al.
Application of the Generalized Chain Coding Scheme to Map Data Processing.
,
1978
.
[5]
C. J. Hilditch,et al.
Linear Skeletons From Square Cupboards
,
1969
.
[6]
Herbert Freeman,et al.
On the Encoding of Arbitrary Geometric Configurations
,
1961,
IRE Trans. Electron. Comput..