Translator Disclaimer
Paper
1 February 1992 Hexagonal domain transform for shape analysis
Author Affiliations +
Abstract
Transformations play an important role in image processing. This paper describes an algorithm for transforming a discrete gray level image from square to hexagonal pixel representation. Pixels in a square grid have four closest neighbors, while those in a hexagonal grid have six. The algorithm is explained and then presented in the language Dataparallel C -- a portable high level language being developed at Oregon State University to express data parallel algorithms.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Brian Carstens, Michael J. Quinn, and Eugene Fichter "Hexagonal domain transform for shape analysis", Proc. SPIE 1607, Intelligent Robots and Computer Vision X: Algorithms and Techniques, (1 February 1992); https://doi.org/10.1117/12.57057
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Crest lines detection in gray-level images
Proceedings of SPIE (August 20 1993)
Finding distinctive colored regions in images
Proceedings of SPIE (February 01 1991)
Hierarchical Local Symmetry: 2-D Shape Representation
Proceedings of SPIE (March 01 1990)
Automatic Target Detection On The Connection Machine
Proceedings of SPIE (February 19 1988)
Locating Mushrooms For Robotic Harvesting
Proceedings of SPIE (March 01 1990)
Comparison of massively parallel hand-print segmentors
Proceedings of SPIE (November 01 1992)

Back to Top