Abstract

This paper proposes an information-preserving contour coding scheme based on the decomposition of the original chain code into the smoothed code and its difference code. High data compression can be achieved by applying entropy coding technique to the proposed algorithm. This proposed algorithm using decomposition is combined with the fixed- or variable-length coding schemes to compare its performance to those of the conventional coding algorithms. Since the proposed algorithm is so simple, it can be adopted to other contour coding algorithms for high data compression.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call