The Laplacian Pyramid as a Compact Image Code

• Published in: I.R.E. transactions on communications systems 1983-04, Vol.31 (4), p.532-540
• Main Authors: Burt, P., Adelson, E.
• Format: Article
• Language: English
• Subjects: Data compression; Data structures; Entropy; Frequency; Image coding; Image sampling; Laplace equations; Low pass filters; Pixel; Shape
• ISSN: 0090-6778; 0096-2244; 1558-0857
• DOI: 10.1109/TCOM.1983.1095851

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.