Abstract
We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixel-to-pixel correlations are first removed by subtracting a lowpass filtered copy of the image from the image itself. The result is a net data compression since the difference, or error, image has low variance and entropy, and the low-pass filtered image may represented at reduced sample density. Further data compression is achieved by quantizing the difference image. These steps are then repeated to compress the low-pass image. Iteration of the process at appropriately expanded scales generates a pyramid data structure. The encoding process is equivalent to sampling the image with Laplacian operators of many scales. Thus, the code tends to enhance salient image features. A further advantage of the present code is that it is well suited for many image analysis tasks as well as for image compression. Fast algorithms are described for coding and decoding.
Keywords
Artificial intelligenceImage compressionComputer visionPixelPyramid (geometry)MathematicsComputer scienceAlgorithmPattern recognition (psychology)Image (mathematics)Image processing
Affiliated Institutions
Related Publications
Super-resolution from a single image
Methods for super-resolution can be broadly classified into two families of methods: (i) The classical multi-image super-resolution (combining images obtained at subpixel misali...
Example-based super-resolution
We call methods for achieving high-resolution enlargements of pixel-based images super-resolution algorithms. Many applications in graphics or image processing could benefit fro...
Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions
Although convolutional neural networks (CNNs) have achieved great success in computer vision, this work investigates a simpler, convolution-free backbone network use-fid for man...
Swin Transformer: Hierarchical Vision Transformer using Shifted Windows
This paper presents a new vision Transformer, called Swin Transformer, that capably serves as a general-purpose backbone for computer vision. Challenges in adapting Transformer ...
High-Resolution Image Synthesis with Latent Diffusion Models
By decomposing the image formation process into a sequential application of denoising autoencoders, diffusion models (DMs) achieve state-of-the-art synthesis results on image da...
Publication Info
- Year
- 1983
- Type
- article
- Volume
- 31
- Issue
- 4
- Pages
- 532-540
- Citations
- 5963
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
5963
OpenAlex
Cite This
P.M.S. Burt,
Edward H. Adelson
(1983).
The Laplacian Pyramid as a Compact Image Code.
IRE Transactions on Communications Systems
, 31
(4)
, 532-540.
https://doi.org/10.1109/tcom.1983.1095851
Identifiers
- DOI
- 10.1109/tcom.1983.1095851