The design of hexagonal sampling structures for image digitization and their use with local operators

Abstract An optimum hexagonal sampling structure for use with a raster scan input device is described. A set of local operators for detecting object edges within the image is designed and the accuracy shown to be high when compared with similar operators for use in the conventional square structure. It is also noted that hexagonal Fourier plane operators exist. A comparison between equivalent processing times for systems implemented on a popular processor is presented and a saving in excess of 40% is demonstrated.

[1]  Tomaso A. Poggio,et al.  On Edge Detection , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Bruce G. Batchelor,et al.  Automated Visual Inspection , 1985 .

[3]  Werner Frei,et al.  Fast Boundary Detection: A Generalization and a New Algorithm , 1977, IEEE Transactions on Computers.

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

[5]  Paul Wintz,et al.  Instructor's manual for digital image processing , 1987 .

[6]  R. Haralick.  Edge and region analysis for digital image data , 1980 .

[7]  R.M. Mersereau,et al.  The processing of hexagonally sampled two-dimensional signals , 1979, Proceedings of the IEEE.

[8]  E. R. Davies,et al.  Circularity - a new principle underlying the design of accurate edge orientation operators , 1984, Image Vis. Comput..

[9]  Joan S. Weszka,et al.  A survey of threshold selection techniques , 1978 .

[10]  Berthold K. P. Horn.  Robot vision , 1986, MIT electrical engineering and computer science series.

[11]  S. L. Tanimoto,et al.  A hexagonal pyramid data structure for image processing , 1984, IEEE Transactions on Systems, Man, and Cybernetics.