Dilation and Erosion on the Triangular Tessellation: An Independent Approach

In this paper, a new idea for morphological operations, i.e., dilation and erosion on the regular triangular tessellation is presented. The triangles have two orientations; they are addressed by zero-sum and one-sum triplets and called even and odd pixels, respectively. The triangular grid is not a lattice, that is, there are grid vectors that do not translate the grid to itself. Different sets of vectors translate the even and odd pixels into the grid: for even pixels vectors with sum 0 and 1 can be used, while for odd pixels vectors with sum 0 and −1 are appropriate. Based on this fact, we introduce a technique in which one can work “independently” with the even and the odd pixels in morphological operations. Examples and various properties of the “independent” dilation and erosion are analyzed.

[1]  Benedek Nagy GENERALISED TRIANGULAR GRIDS IN DIGITAL GEOMETRY , 2004 .

[2]  B. Nagy Isometric transformations of the dual of the hexagonal lattice , 2009, 2009 Proceedings of 6th International Symposium on Image and Signal Processing and Analysis.

[3]  Benedek Nagy Finding shortest path with neighbourhood sequences in triangular grids , 2001, ISPA 2001. Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis. In conjunction with 23rd International Conference on Information Technology Interfaces (IEEE Cat..

[4]  Péter Kardos,et al.  On Topology Preservation for Triangular Thinning Algorithms , 2012, IWCIA.

[5]  Cris L. Luengo Hendriks,et al.  Adaptive mathematical morphology - A survey of the field , 2014, Pattern Recognit. Lett..

[6]  Robin Strand,et al.  Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid , 2011, Theor. Comput. Sci..

[7]  Petra Wiederhold,et al.  Thinning on Quadratic, Triangular, and Hexagonal Cell Complexes , 2008, IWCIA.

[8]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[9]  B. Nagy Optimal Neighborhood Sequences on the Hexagonal Grid , 2007, 2007 5th International Symposium on Image and Signal Processing and Analysis.

[10]  Jos B. T. M. Roerdink Adaptivity and group invariance in mathematical morphology , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[11]  Benedek Nagy A family of triangular grids in digital geometry , 2003, 3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the.

[12]  Masafumi Yamashita,et al.  Distance functions defined by variable neighborhood sequences , 1984, Pattern Recognit..

[13]  Marcel J. E. Golay,et al.  Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.

[14]  Azriel Rosenfeld,et al.  Distance on a Hexagonal Grid , 1976, IEEE Transactions on Computers.

[15]  Péter Kardos,et al.  Unified Characterization of P-Simple Points in Triangular, Square, and Hexagonal Grids , 2016, CompIMAGE.

[16]  Benedek Nagy Characterization of digital circles in triangular grid , 2004, Pattern Recognit. Lett..

[17]  Benedek Nagy Weighted Distances on a Triangular Grid , 2014, IWCIA.

[18]  Frank Y. Shih,et al.  Image Processing and Mathematical Morphology: Fundamentals and Applications , 2017 .

[19]  Benedek Nagy,et al.  Cellular Topology on the Triangular Grid , 2012, IWCIA.

[20]  Benedek Nagy,et al.  On the Chamfer Polygons on the Triangular Grid , 2017, IWCIA.

[21]  Jayanta Mukherjee Error analysis of octagonal distances defined by periodic neighborhood sequences for approximating Euclidean metrics in arbitrary dimension , 2016, Pattern Recognit. Lett..

[22]  Partha Bhowmick,et al.  A linear-time algorithm to compute the triangular hull of a digital object , 2017, Discret. Appl. Math..

[23]  Edward S. Deutsch,et al.  Thinning algorithms on rectangular, hexagonal, and triangular arrays , 1972, Commun. ACM.

[24]  Benedek Nagy,et al.  Concepts of Binary Morphological Operations Dilation and Erosion on the Triangular Grid , 2016, CompIMAGE.

[25]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[26]  Péter Kardos,et al.  On topology preservation of mixed operators in triangular, square, and hexagonal grids , 2017, Discret. Appl. Math..

[27]  Azriel Rosenfeld,et al.  Digital geometry - geometric methods for digital picture analysis , 2004 .

[28]  Koichiro Deguchi,et al.  Mathematics of Shape Description: A Morphological Approach to Image Processing and Computer Graphics , 2008 .

[29]  Péter Kardos,et al.  On topology preservation in triangular, square, and hexagonal grids , 2013, 2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA).

[30]  Hugues Talbot,et al.  Mathematical Morphology: from theory to applications , 2013 .

[31]  Innchyn Her,et al.  Geometric transformations on the hexagonal grid , 1995, IEEE Trans. Image Process..

[32]  Péter Kardos,et al.  Topology preservation on the triangular grid , 2014, Annals of Mathematics and Artificial Intelligence.

[33]  Henk J. A. M. Heijmans,et al.  The algebraic basis of mathematical morphology. I Dilations and erosions , 1990, Comput. Vis. Graph. Image Process..

[34]  P. P. Das,et al.  Octagonal distances for digital pictures , 1990, Inf. Sci..

[35]  Benedek Nagy Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids , 2014, Annals of Mathematics and Artificial Intelligence.

[36]  Henk J. A. M. Heijmans,et al.  The algebraic basis of mathematical morphology : II. Openings and closings , 1991, CVGIP Image Underst..

[37]  Carmen Rodrigo,et al.  On geometric multigrid methods for triangular grids using three-coarsening strategy , 2009 .