Resampling on a Pseudohexagonal Grid

doi:10.1006/cgip.1994.1030

CVGIP: Graphical Models and Image Processing

Volume 56, Issue 4, July 1994, Pages 336-347

CVGIP: Graphical Mod...

https://doi.org/10.1006/cgip.1994.1030 Get rights and content

Abstract

This paper investigates resampling techniques on a pseudohexagonal grid. Hexagonal grids are known to be advantageous in many respects for sampling and representing digital images in various computer vision and graphics applications. Currently, a real hexagonal grid device is still difficult to find. A good alternative for obtaining the advantages of a hexagonal grid is to construct a pseudohexagonal grid on a regular rectangular grid device. In this paper we first describe the options and procedures for constructing such a pseudo-hexagonal grid and then demonstrate techniques of resampling digital images on the pseudohexagonal grid. Four distinct resampling kernels are tested, and their results are illustrated and compared.

References (0)

Cited by (35)

Designing aperture 2<sup>2k</sup> hexagonal grids and their indexing as factor rings of Eisenstein integers
2024, Theoretical Computer Science
This paper proposes apertures of size $2^{2 k}$ for hexagonal grids together with their indexing scheme, where k may be any positive integer. Hexagonal grid can be represented by an ideal $I (2 + ω)$ of a unit-ring $Z (ω)$ of Eisenstein integers, where, for the set $Z$ of integers and the cube root $ω$ of 1, $Z (ω)$ denotes ${a + b ω | a, b \in Z}$ , and, for any $λ \in Z (ω)$ , $I (λ)$ denotes an ideal ${κ λ | κ \in Z (ω)}$ of $Z (ω)$ . We show that a factor ring $I (2 + ω) / I (2^{k} (2 + ω))$ represents an aperture $2^{2 k}$ hexagonal grid, and prove that it is isomorphic to a factor ring $Z (ω) / I (2^{k})$ . The latter represents a trigonal grid in a rhombus-shaped aperture with its edge length $2^{k}$ , where we can address each of its $2^{2 k}$ grid points as $i + j ω$ using two k-bit positive binary integers. We show that each grid point $α = a + b ω$ in $I (2 + ω) / I (2^{k} (2 + ω))$ can be indexed by the address of its isomorphic image in $Z (ω) / I (2^{k})$ , and that this index is identical to the pair of the k-bit 2′s complements of $a$ and $b$ . Based on these findings, we clarify how indices may change for different resolutions, how to define the hierarchical indexing, how to geometrically interpret algebraic operations on indices, and, as one of the applications, how the quantization of trajectories of $10^{6}$ ∼ $10^{7}$ mobile objects on hexagonal grids may reduce the communication capacity required for their quasi-real-time simultaneous monitoring and sharing through the Internet. We also show how our indexing scheme can be applied to the design of DGGSs (Discrete Global Grid Systems) that cover the entire Earth's surface and 3D regular grids.
Simplified square to hexagonal lattice conversion based on 1-D multirate processing
2021, Signal Processing: Image Communication
Citation Excerpt :
That is, according to the sampling theory, if the Nyquist criterion has been fulfilled, the original analog image can be completely reconstructed, and then the lattice conversion can be done by resampling the reconstructed image [29]. In practice, simple interpolation kernels are often used [30,31], e.g., nearest-neighbor [32] and bilinear [33]. To reduce the aliasing artifacts in the classical interpolation methods, Ville et al. [34] proposed to use the hexagonal spline functions.
Hexagonal image sampling and processing are theoretically superior to the most commonly used square lattice based sampling and processing, but due to the lack of commercial image sensors, current research mainly relies on virtually hexagonally sampled data through square to hexagonal lattice conversion, which is a typical 2-D interpolation problem. This paper presents a simplified and efficient square to hexagonal lattice conversion method. The method firstly utilizes the separable nature of the interpolation kernel to simplify the original 2-D interpolation into 1-D interpolation along the horizontal direction only, and then it applies the 1-D multirate technique to further simplify the shift-variant 1-D interpolation into shift-invariant 1-D convolutions. Compared with the original 2-D interpolation version, the proposed method becomes both simple and computationally efficient, and it is also suitable for implementation with parallel processing and hardware. Finally, experiments are performed and the results are consistent with the analysis.
Watershed delineation on a hexagonal mesh grid
2020, Environmental Modelling and Software
Spatial discretization is the cornerstone of all spatially-distributed numerical simulations including watershed hydrology. Traditional square grid spatial discretization has several limitations including inability to represent adjacency uniformly. In this study, we developed a watershed delineation model (HexWatershed) based on the hexagon grid spatial discretization. We applied this model to two different types of watershed in the US and we evaluated its performance against the traditional method. The comparisons show that the hexagon grid spatial discretization exhibits many advantages over the tradition method. We propose that spatially distributed hydrologic simulations should consider using a hexagon grid spatial discretization.
Hexagonal diffractive optical elements
2023, Optics Express
Multi-target search in bounded and heterogeneous environments: a lattice random walk perspective
2023, arXiv
Exact Spatio-Temporal Dynamics of Lattice Random Walks in Hexagonal and Honeycomb Domains
2023, arXiv

View all citing articles on Scopus

View full text

Regular ArticleResampling on a Pseudohexagonal Grid

Abstract

Regular Article
Resampling on a Pseudohexagonal Grid