Array set addressing (ASA) for hexagonally arranged data sampling elements
AssigneeThe United States of America as represented by the Secretary of the Air Force
InventorNicholas I. Rummelt
Life of this patent
Estimating the term…
Loading patent…
AssigneeThe United States of America as represented by the Secretary of the Air Force
InventorNicholas I. Rummelt
Estimating the term…
A new method and apparatus for addressing hexagonally arranged data sampling elements is described. Array set addressing, or ASA, is a new method for capturing information from a hexagonal grid of image sensor pixels, or any hexagonal grid of data sampling elements, for image processing or any computational manipulation of sampling data. ASA represents the hexagonal grids as a set of two rectangular arrays which can individually indexed by integer-valued row and column indices. The two arrays are distinguished using a single binary coordinate so that a full address for any point on the hexagonal grid is uniquely represented by three coordinates representing which array and the row and column. The new addressing method supports efficient linear algebra and other image processing manipulation and can be straightforwardly implemented in conventional electronic hardware and digital processing systems.
A method for capturing information from a hexagonal grid of data sampling elements, the data sampling elements arranged such that each data sampling element is centered on a point of the hexagonal grid, comprising the step of electronically capturing the addresses of the data sampling elements as a set of two interleaved rectangular arrays, wherein each array element comprises three coordinates:
An electronic circuit for capturing information from a hexagonal grid of sensor elements, the sensor elements arranged such that each element is centered on a point of the hexagonal grid, comprising:
A method for capturing information from a hexagonal grid of data sampling elements, the data sampling elements arranged such that each data sampling element is centered on a point of the hexagonal grid, and converting the hexagonal grid positions to corresponding Cartesian grid positions, comprising the steps of:
Dependencies are inferred from the claim text.