Hexagonal domain transform for shape analysis

Brian Carstens; Michael J. Quinn; Eugene Fichter

doi:10.1117/12.57057

1 February 1992 Hexagonal domain transform for shape analysis

Brian Carstens, Michael J. Quinn, Eugene Fichter

Proceedings Volume 1607, Intelligent Robots and Computer Vision X: Algorithms and Techniques; (1992) https://doi.org/10.1117/12.57057
Event: Robotics '91, 1991, Boston, MA, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available