Sampling of Bandpass Pyramids

In image analysis and image coding there have been an increased use of multiresolution images, called pyramids or quad trees. In a recent paper Burt and Adelson [2] achieved good results with a Laplacian (bandpass) pyramid to compress image data. One problem with the conventional approach is that too many dimensions (samples) are used to describe the original image. This paper describes a method to represent an image bandpass pyramid with exactly the dimensionality of the original image. Both rectangular and hexagonal sampling are considered.