A method for encoding region boundaries based on transition points

Abstract In this paper we present an encoding algorithm for boundary maps containing only closed contours. The method relies on the location and encoding of ‘transition points’, i.e., points where rows or columns of edge elements change state. Experimental results show that this technique offers better compression ratios than differential chain-coding for boundary maps having medium or large complexity.

[1]  Murat Kunt,et al.  Recent results in high-compression image coding (Invited Papaer) , 1987 .

[2]  M. Kunt,et al.  Second-generation image-coding techniques , 1985, Proceedings of the IEEE.

[3]  Frank Bossen,et al.  Region based coding scheme with scalability features , 1996, 1996 8th European Signal Processing Conference (EUSIPCO 1996).

[4]  M. Eden,et al.  On the performance of a contour coding algorithm in the context of image coding part I: Contour segment coding , 1985 .

[5]  Toru Kaneko,et al.  Encoding of Arbitrary Curves Based on the Chain Code Representation , 1985, IEEE Trans. Commun..

[6]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[7]  Anil K. Jain.  Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

[8]  S. Fioravanti,et al.  Shape and location coding for contour images , 1995 .

[9]  Athanassios N. Skodras,et al.  A new contour simplification filter for region-based coding , 1996, 1996 8th European Signal Processing Conference (EUSIPCO 1996).

[10]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[11]  Toshi Minami,et al.  Encoding of Line Drawings with a Multiple Grid Chain Code , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Philippe Salembier,et al.  Coding of Partition Sequences , 1996 .

[13]  O. J. Morris,et al.  Segmented-image coding: Performance comparison with the discrete cosine transform , 1988 .