Relative vector probabilities in differential chain-coded line-drawings

Abstract

A derivation is given of the probabilities of the relative vectors which represent the approximating segments in a square coding ring for differential chain coding (DCC) of line drawings. These probabilities are required to calculate rate (coding efficiency) and distortion-versus-rate characteristics. The performances of the differential and nondifferential chain codes are compared. It is established that DCC has higher efficiency.<>