Paper
5 September 1989 Recursive, In-Place Algorithm For The Hexagonal Orthogonal Oriented Quadrature Image Pyramid
Andrew B. Watson
Author Affiliations +
Abstract
Pyramid image transforms have proven useful in image coding and pattern recognition. The Hexagonal orthogonal Oriented quadrature image Pyramid (HOP), transforms an image into a set of orthogonal, oriented, odd and even bandpass sub-images. It operates on a hexagonal input lattice, and employs seven kernels, each of which occupies a neighborhood consisting of a point and a hexagon of six nearest neighbors. The kernels consist of one lowpass and six bandpass kernels that are orthogonal, self-similar, and localized in space, spatial frequency, orientation, and phase. The kernels are first applied to the image samples to create the first level of the pyramid, then to the lowpass coefficients to create the next level. The resulting pyramid is a compact, efficient image code. Here we describe a recursive, in-place algorithm for computation of the HOP transform. The transform may be regarded as a depth-first traversal of a tree structure. We show that the algorithm requires a number of operations that is on the order of the number of pixels.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Andrew B. Watson "Recursive, In-Place Algorithm For The Hexagonal Orthogonal Oriented Quadrature Image Pyramid", Proc. SPIE 1099, Advances in Image Compression and Automatic Target Recognition, (5 September 1989); https://doi.org/10.1117/12.960468
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Transform theory

Image compression

Automatic target recognition

Image processing

Detection and tracking algorithms

Image resolution

Pattern recognition

Back to Top