13 October 1987 Orthogonal Pyramid Transforms For Image Coding.
Author Affiliations +
Proceedings Volume 0845, Visual Communications and Image Processing II; (1987) https://doi.org/10.1117/12.976485
Event: Cambridge Symposium on Optics in Medicine and Visual Image Processing, 1987, San Diego, CA, United States
We describe a set of pyramid transforms that decompose an image into a set of basis functions that are (a) spatial frequency tuned, (b) orientation tuned, (c) spatially localized, and (d) self-similar. For computational reasons the set is also (e) orthogonal and lends itself to (f) rapid computation. The systems are derived from concepts in matrix algebra, but are closely connected to decompositions based on quadrature mirror filters. Our computations take place hierarchically, leading to a pyramid representation in which all of the basis functions have the same basic shape, and appear at many scales. By placing the high-pass and low-pass kernels on staggered grids, we can derived odd-tap QMF kernels that are quite compact. We have developed pyramids using separable, quincunx, and hexagonal kernels. Image data compression with the pyramids gives excellent results, both in terms of MSE and visual appearance. A non-orthogonal variant allows good performance with 3-tap basis kernels and the appropriate inverse sampling kernels.
© (1987) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Edward H. Adelson, Edward H. Adelson, Eero Simoncelli, Eero Simoncelli, Rajesh Hingorani, Rajesh Hingorani, } "Orthogonal Pyramid Transforms For Image Coding.", Proc. SPIE 0845, Visual Communications and Image Processing II, (13 October 1987); doi: 10.1117/12.976485; https://doi.org/10.1117/12.976485

Back to Top