Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

Thinning algorithms on rectangular, hexagonal, and triangular arrays

Published: 01 September 1972 Publication History

Abstract

In this report three thinning algorithms are developed: one each for use with rectangular, hexagonal, and triangular arrays. The approach to the development of each algorithm is the same. Pictorial results produced by each of the algorithms are presented and the relative performances of the algorithms are compared. It is found that the algorithm operating with the triangular array is the most sensitive to image irregularities and noise, yet it will yield a thinned image with an overall reduced number of points. It is concluded that the algorithm operating in conjunction with the hexagonal array has features which strike a balance between those of the other two arrays.

References

[1]
Rutovitz, D. Pattern recognition. J. Royal Statistical Society {A} 1291V, (1966), 504-530.
[2]
Deutsch, E.S. Comments on a line thinning scheme. British Computer J. 12, 4 (Nov. 1969), 142.
[3]
Hilditch, C.J. Linear skeletons from square cupboards. In Machine bltelligence 4, B. Meltzer and D. Michie (Eds), American Elsevier, New York, 1969, pp. 403-420.
[4]
Deutsch, E.S. Towards isotropic image reductiam IFIP Congress 71, North Holland Pub. Co., Amsterdam; Booklet TA-2, pp. 75-85.
[5]
Rosenfeld, A. Connectivity in digital pictures. J ACM 17, 1 (Jan. 1970), 146-160.
[6]
Deutsch, E.S. Preprocessing for character recognition. I.E.E. Conf. on Pattern Recognition, July 1968, pp. 179-190.
[7]
Golay, M.J.E. Hexagonal parallel pattern transformations. Trans IEEE Comput. C18, 8 (Aug. 1969).
[8]
Freeman, H. On the encoding of arbitrary geometric configuration. IRE Trans E C (June 1961), 260-268.
[9]
Deutsch, E.S. On parallel operations on hexagonal arrays. Trans IEEE Comput. Cl9, 10 (Oct. 1970), 982-983.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 15, Issue 9
Sept. 1972
59 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/361573
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1972
Published in CACM Volume 15, Issue 9

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. hexagonal
  2. image processing
  3. rectangular
  4. skeleton
  5. thinning algorithms
  6. triangular arrays

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)123
  • Downloads (Last 6 weeks)16
Reflects downloads up to 10 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Digital continuity of rotations in the 2D regular gridsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-023-09891-w92:1(115-137)Online publication date: 1-Jan-2024
  • (2024)Rotations on the triangular grid: angles of changes of the neighborhood motion mapAequationes mathematicae10.1007/s00010-024-01062-498:4(1053-1070)Online publication date: 2-May-2024
  • (2024)On the Minimal Perimeter Polygon for Digital Objects in the Triangular TilingPattern Recognition10.1007/978-3-031-62836-8_14(141-154)Online publication date: 19-Jun-2024
  • (2024)1-Attempt and Equivalent Thinning on the Hexagonal GridDiscrete Geometry and Mathematical Morphology10.1007/978-3-031-57793-2_30(390-401)Online publication date: 15-Apr-2024
  • (2024)A Khalimsky-Like Topology on the Triangular GridDiscrete Geometry and Mathematical Morphology10.1007/978-3-031-57793-2_12(150-162)Online publication date: 15-Apr-2024
  • (2023)Weighted distances and distance transforms on the triangular tilingTransactions in GIS10.1111/tgis.1311227:7(2042-2098)Online publication date: 17-Nov-2023
  • (2023)A digital geometry on the tetrakis square tiling—Distance and coarseningTransactions in GIS10.1111/tgis.13029Online publication date: 13-Feb-2023
  • (2023)On the Size of the Bijective Regions in Digital Rotations on the Hexagonal Grid2023 International Symposium on Image and Signal Processing and Analysis (ISPA)10.1109/ISPA58351.2023.10278914(1-6)Online publication date: 18-Sep-2023
  • (2022)Equivalence, Partial Order and Lattice of Neighborhood Sequences on the Triangular GridMathematics10.3390/math1023451410:23(4514)Online publication date: 29-Nov-2022
  • (2022)A hexagon-based method for polygon generalization using morphological operatorsInternational Journal of Geographical Information Science10.1080/13658816.2022.210803637:1(88-117)Online publication date: 10-Aug-2022
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media