A thinning algorithm by contour generation

ABSTRACT

A new contour generating serial algorithm is faster and more efficient than conventional contour tracing and parallel algorithms

REFERENCES

• 1: Arcelli, C. Pattern thinning by contour tracing. Computer Graphics and Image Processing 17, 2 {Oct. 1981), 130-144.
• 2: Arcelli, C. A condition for digital points removal. Signal Processing 1 4 (1979), 283-285.
• 3: Arcelli, C., and Sanniti di Baja, G. On the sequential approach to medial line transformalion. IEEE Trans. Systems, Man and Cybernetics SMC-8, (1978}, 139-144.
• 4: Bel-Lan, A., and Montoto, L. A thinning transform for digital images Signal Processing 3, (1981), 37-47.
• 5: Beun, M. A flexible method for automatic reading of hand-written numerals. Philips Technical Review 33, 4 (1973), 89-101.
• 6: Blum, H. A transformation for extracting new descriptors of shape. Symposium on Models for the Perception of Speech and Visual Form, MIT Press, Cambridge, Mass., (1964).
• 7: Per Brinch Hansen, Concurrent Programming Concepts, ACM Computing Surveys (CSUR), v.5 n.4, p.223-245, Dec. 1973 [doi>10.1145/356622.356624]
• 8: Davies, E.R., and Plummer, A.P.N. Thinning algorithm, a critique and a new methodology. Pattern Recognition 14, I (1981), 53-63.
• 9: A. R. Dill , M. D. Levine , P. B. Noble, Multiple resolution skeletons, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.9 n.4, p.495-504, July 1987 [doi>10.1109/TPAMI.1987.4767937]
• 10: Freeman, H. On the encoding of arbitrary geometric configurations. IEEE Trans. Electronic Computers EC.-IO, (June 1961), 260-268.
• 11: Freeman, H., and Davis, L. A corner-finding algorithm for chaincoded curves. IEEE Trans. Computers C-26, 3 (Mar. 1977}, 297-303.
• 12: Freeman, H., and Garder, L. Apictorial jigsaw puzzles, the computer solution of a problem in pattern recognition. IEEE Trans. Electronic Computers EC-13, (Apr. 1964), 118-127.
• 13: Hilditch, C.J. Linear skeletons from square cupboards. In Machine Intelligence IV, B. Mertzer and D. Michie, Eds. University Press, Edinburgh, 1969, 403-420.
• 14: Christopher M. Holt , Alan Stewart , Maurice Clint , Ronald H. Perrott, An improved parallel thinning algorithm, Communications of the ACM, v.30 n.2, p.156-160, Feb. 1987 [doi>10.1145/12527.12531]
• 15: H. E. Lü , P. S. P. Wang, A comment on “a fast parallel algorithm for thinning digital patterns”, Communications of the ACM, v.29 n.3, p.239-242, March 1986 [doi>10.1145/5666.5670]
• 16: Moayer, B., and Fu, K.S. A tree system approach for fingerprint pattern recognition. IEEE Trans. Comput. C-25, 3 {Mar. 1976), 262- 275.
• 17: Naccache, N.J., and Shinghal, R. SPTA: A proposed algorithm for thinning binary patterns. IEEE Trans. Systems, Man and Cybernetics SMC- 14, 3 (May 1984), 409-418.
• 18: Theo Pavlidis, Algorithms for Graphics and Imag, W. H. Freeman & Co., New York, NY, 1983
• 19: Pavlidis, T. A thinning algorithm for discrete binary images. Computer Graphics and Image Processing I3, (1980}, 142-157.
• 20: Pavlidis, T. Filling algorithms for raster graphics. Computer Graphics and Image Processing 10, (1979), 126-141.
• 21: Perry, T.S., and Wallich, P. Computer displays--new choices, new trade-offs and From lab to lap. IEEE Spectrum 22, 7 (July 1985), 52-59.
• 22: John L. Pfaltz , Azriel Rosenfeld, Computer representation of planar regions by their skeletons, Communications of the ACM, v.10 n.2, p.119-122, Feb. 1967 [doi>10.1145/363067.363120]
• 23: Rosenfeld, A. A characterization of parallel thinning algorithms. Inform. Contr. 29, 3 (Nov. 1975), 286-291.
• 24: Azriel Rosenfeld , John L. Pfaltz, Sequential Operations in Digital Picture Processing, Journal of the ACM (JACM), v.13 n.4, p.471-494, Oct. 1966 [doi>10.1145/321356.321357]
• 25: Sobel, I. Neighbourhood coding of binary images for fast contour following and general binary array processing. Computer Graphics and Image Processing 8, (1978), 127-135.
• 26: R. Stefanelli , A. Rosenfeld, Some Parallel Thinning Algorithms for Digital Pictures, Journal of the ACM (JACM), v.18 n.2, p.255-264, April 1971 [doi>10.1145/321637.321646]
• 27: Tamura, H. A comparison of line thinning algorithms from digital geometry viewpoint. In Proceedings of 4th International Conference on n~z, .... v ..... ;11_~ T./',,,~+~ T .... ~'t n~ol -7,, r ,71n
• 28: W. Xu , C. X. Wang, CST: A fast thinning algorithm implemented on a sequential computer, IEEE Transactions on Systems, Man and Cybernetics, v.17 n.5, p.847-851, Sept./Oct. 1987
• 29: T. Y. Zhang , C. Y. Suen, A fast parallel algorithm for thinning digital patterns, Communications of the ACM, v.27 n.3, p.236-239, March 1984 [doi>10.1145/357994.358023]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.4 IMAGE PROCESSING AND COMPUTER VISION
      I.4.6 Segmentation
          Subjects: Edge and feature detection

Additional Classification:
  I. Computing Methodologies
  I.4 IMAGE PROCESSING AND COMPUTER VISION
      I.4.1 Digitization and Image Capture
          Subjects: Quantization; Sampling
  I.5 PATTERN RECOGNITION
      I.5.4 Applications
          Subjects: Computer vision

General Terms:
Algorithms, Design, Theory