论文信息 - A fast algorithm for the restoration of images based on chain codes description and its applications

A fast algorithm for the restoration of images based on chain codes description and its applications

Abstract A fast algorithm for the restoration of an image is presented. The image is described by using chain codes which record the contours of the image. The algorithm gives a simple idea for region filling. Some geometric properties for the image can be easily derived by our method. Comparison of the proposed method and one existing method is also provided.

Long-Wen Chang | Kuen-Long Leu

[1] Ian T. Young,et al. An Analysis Technique for Biological Shape. I , 1974, Inf. Control..

[2] Dana H. Ballard,et al. Strip trees: a hierarchical representation for curves , 1981, CACM.

[3] Herbert Freeman,et al. Computer Processing of Line-Drawing Images , 1974, CSUR.

[4] Theo Pavlidis,et al. Filling algorithms for raster graphics , 1979 .

[5] R. E. Burge,et al. A new algorithm for extracting the interior of bounded regions based on chain coding , 1988, Comput. Vis. Graph. Image Process..

[6] Bryan D. Ackland,et al. The edge flag algorithm — A fill method for raster scan displays , 1981, IEEE Transactions on Computers.

[7] Gregory Y. Tang,et al. Region filling with the use of the discrete green theorem , 1988, Comput. Vis. Graph. Image Process..

[8] R. D. Merrill. Representation of contours and regions for efficient computer search , 1973, CACM.

[9] Zuguang Cai. Restoration of binary images using contour direction chain codes description , 1988, Comput. Vis. Graph. Image Process..

[10] Uri Shani,et al. Filling regions in binary raster images: A graph-theoretic approach , 1980, SIGGRAPH '80.

[11] Gregory Y. Tang. A Discrete Version of Green's Theorem , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.