Scalable coding of shape contours in scale

A method of improving the traditional polygonal approximation methods is described. It has properties such as scalability, resilience to noise, controlled levels of approximation and good visual representation. These properties are a direct result of the use of scale space information to derive the vertices positions of the polygonal approximation. The vertices are situated on the contour points where the changes of the contour directions are at their major sharp positions. An encoding method with a scalable polygonal approximation of shapes is defined, which results in a good relation between the distortion and the bit rate.

[1]  Edward J. Delp,et al.  On detecting dominant points , 1991, Pattern Recognit..

[2]  Glen G. Langdon,et al.  An Introduction to Arithmetic Coding , 1984, IBM J. Res. Dev..

[3]  Kevin J. O'Connell Object-adaptive vertex-based shape coding method , 1997, IEEE Trans. Circuits Syst. Video Technol..

[4]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Aggelos K. Katsaggelos,et al.  An optimal polygonal boundary encoding scheme in the rate distortion sense , 1998, IEEE Trans. Image Process..

[6]  Touradj Ebrahimi,et al.  Progressive polygon encoding of shape contours , 1997 .

[7]  Alan L. Yuille,et al.  Scaling Theorems for Zero Crossings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.