Vectorgraph coding: Efficient coding of line drawings

Abstract A method for the efficient coding of line drawings is discussed. The intent is to provide an extremely low bandwidth representation for images, preserving “intelligible” image content but not necessarily image quality. This has led to an image transformation involving edge enhancement, detection, line thinning, and polygonal splining which is termed the polygonal transformation . The graph-like image which results from this transformatiom is coded quite efficiently by using vectorgraph coding , which codes a series of vectors in a manner similar to that used in many computer graphics systems. This technique has been applied to a body of images of American Sign Language and the results are encouraging.

[1]  R.M. McElhaney,et al.  Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

[2]  Hitoshi Matsushima,et al.  Extraction of invariant picture sub-structures by computer , 1972, Comput. Graph. Image Process..

[3]  F. Bookstein.  Fitting conic sections to scattered data , 1979 .

[4]  Michael S. Landy,et al.  HIPS: A unix-based image processing system , 1984, Comput. Vis. Graph. Image Process..

[5]  Theodosios Pavlidis,et al.  An asynchronous thinning algorithm , 1982, Comput. Graph. Image Process..

[6]  Antonio Albano,et al.  Representation of Digitized Contours in Terms of Conic Arcs and Straight-Line Segments , 1974, Comput. Graph. Image Process..

[7]  Charles M. Williams,et al.  An Efficient Algorithm for the Piecewise Linear Approximation of Planar Curves , 1978 .

[8]  D. Proffitt,et al.  Metrication errors and coding efficiency of chain-encoding schemes for the representation of lines and edges , 1979 .

[9]  P. Burt.  Fast filter transform for image processing , 1981 .

[10]  Paul Suetens,et al.  A semiautomatic digitization method and the use of splinefunctions in processing line drawings , 1981 .

[11]  George Sperling,et al.  Video Transmission of American Sign Language and Finger Spelling: Present and Projected Bandwidth Requirements , 1981, IEEE Trans. Commun..

[12]  Fujio Yamaguchi,et al.  A new curve fitting method using a CRT computer display , 1978 .

[13]  King-Sun Fu,et al.  Using the FFT to determine digital straight line chain codes , 1982, Comput. Graph. Image Process..

[14]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[15]  Michael S. Landy,et al.  HIPS: Image processing under UNIX. Software and applications , 1984 .

[16]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[17]  T. Pavlidis.  A thinning algorithm for discrete binary images , 1980 .

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

[19]  Carlo Arcelli,et al.  Pattern thinning by contour tracing , 1981 .

[20]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[21]  Eihachiro Nakamae,et al.  An isotropic four-point interpolation based on cubic splines , 1982, Comput. Graph. Image Process..

[22]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[23]  Michael S. Landy,et al.  Image processing in perception and cognition , 1983 .

[24]  K. Ramachandran,et al.  Coding method for vector representation of engineering drawings , 1980, Proceedings of the IEEE.

[25]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[26]  K. Ramesh Babu,et al.  Linear Feature Extraction and Description , 1979, IJCAI.

[27]  P. J. Burt,et al.  Fast Filter Transforms for Image Processing , 1981 .

[28]  Jayaram K. Udupa,et al.  A search algorithm for skeletonization of thick patterns , 1974, Comput. Graph. Image Process..

[29]  Charles R. Giardina,et al.  Elliptic Fourier features of a closed contour , 1982, Comput. Graph. Image Process..

[30]  D.E. Pearson,et al.  Visual communication at very low data rates , 1985, Proceedings of the IEEE.

[31]  T. Morrin.  Chain-link compression of arbitrary black-white images , 1976 .

[32]  PAUL D. SAMPSON,et al.  Fitting conic sections to "very scattered" data: An iterative refinement of the bookstein algorithm , 1982, Comput. Graph. Image Process..

[33]  James E. Midgley.  Isotropic four-point interpolation , 1979 .

[34]  M. Nadler,et al.  The telesign project , 1985, Proceedings of the IEEE.

[35]  Michael S. Landy,et al.  Hierarchical Coding of Binary Images , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[36]  G Sperling,et al.  Bandwidth requirements for video transmission of american sign language and finger spelling. , 1980, Science.

[37]  Ugo Montanari,et al.  A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.

[38]  Theodosios Pavlidis.  Techniques for optimal compaction of pictures and maps , 1974, Comput. Graph. Image Process..

[39]  Andrew C. Sleigh,et al.  Physical and Biological Processing of Images , 1983 .

[40]  I. Chakravarty.  A single-pass, chain generating algorithm for region boundaries , 1981 .