Pyramid (image processing)

Pyramid (image processing)

Pyramid or 'pyramid representation' is a type of multi-scale signal representation developed by the computer vision, image processing and signal processing communities, in which a signal or an image is subject to repeated smoothing and subsampling. Historically, pyramid representation is a predecessor to scale space representation and multiresolution analysis.

Pyramid generation

There are two main types of pyramids; lowpass pyramids and bandpass pyramids. A "lowpass pyramid" is generated by first smoothing the image with an appropriate smoothing filter and then subsampling the smoothed image, usually by a factor of two along each coordinate direction. As this process proceeds, the result will be a set of gradually more smoothed images, where in addition the spatial sampling density decreases level by level. If illustrated graphically, this multi-scale representation will look like a pyramid, from which the name has been obtained. A "bandpass pyramid" is obtained by forming the difference between adjacent levels in a pyramid, where in addition some kind of interpolation is performed between representations at adjacent levels of resolution, to enable the computation of pixelwise differences.

Pyramid generation kernels

A variety of different smoothing kernels have proposed for generating pyramids. [Burt, P.J. "Fast filter transforms for image processing", Computer Vision, Graphics and Image Processing, vol 16, pages 20-51, 1981.] Crowley, James "A representation for visual information", PhD thesis, Carnegie-Mellon University, Robotics Institute, Pittsburgh, Pennsylvania 1981.] [Burt, Peter and Adelson, Ted, "The Laplacian Pyramid as a Compact Image Code", IEEE Trans. Communications, 9:4, 532–540, 1983.] [Crowley, J. and Parker, A.C, "A Representation for Shape Based on Peaks and Ridges in the Difference of Low Pass Transform", IEEE Transactions on PAMI, 6(2), pp 156-170, March 1984.] [Crowley, J. L. and Sanderson, A. C. " [ Multiple resolution representation and probabilistic matching of 2-D gray-scale shape] ", IEEE Transactions on Pattern Analysis and Machine Intelligence, 9(1), pp 113-121, 1987.] [P. Meer, E. S. Baugher and A. Rosenfeld "Frequency domain analysis and synthesis of image generating kernels", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol 9, pages 512-522, 1987.] Among the suggestions that have been given, the "binomial kernels" arising from the binomial coefficients stand out as a particularly useful and theoretically well-founded class. [Lindeberg, Tony, " [ Scale-space for discrete signals] ," PAMI(12), No. 3, March 1990, pp. 234-254.] [Lindeberg, Tony. [ Scale-Space Theory in Computer Vision] , Kluwer Academic Publishers, 1994, ISBN 0-7923-9418-6] [See the article on multi-scale approaches for a very brief theoretical statement] Thus, given a two-dimensional image, we may apply the (normalized) binomial filter (1/4, 1/2, 1/4) typically twice or more along each spatial dimension and then subsample the image by a factor of two. This operation may then proceed as many times as desired, leading to a compact and efficient multi-scale representation. If motivatived by specific requirements, intermediate scale levels may also be generated where the subsampling stage is sometimes left out, leading to an "oversampled" or "hybrid pyramid". With the increasing computational efficiency of CPUs available today, it is in some situations also feasible to use wider support Gaussian filters as smoothing kernels in the pyramid generation steps.

Applications of pyramids

In the early days of computer vision, pyramids were used as the main type of multi-scale representation for computing multi-scale image features from real-world image data. Today, this role has been taken over by scale space representation, motivated by the more solid theoretical foundation, the ability to decouple the subsampling stage from the multi-scale representation, the more powerful tools for theoretical analysis as well as the ability to compute a representation at "any" desired scale, thus avoiding the algorithmic problems of relating image representations at different resolution. Nevertheless, pyramids are still frequently used for expressing computationally efficient approximations to scale-space representation. [Crowley, J, Riff O. [ Fast computation of scale normalised Gaussian receptive fields] , Proc. Scale-Space'03, Isle of Skye, Scotland, Springer Lecture Notes in Computer Science, volume 2695, 2003.] [Lindeberg, T. and Bretzner, L. [ Real-time scale selection in hybrid multi-scale representations] , Proc. Scale-Space'03, Isle of Skye, Scotland, Springer Lecture Notes in Computer Science, volume 2695, pages 148-163, 2003.] [Lowe, D. G., “ [ Distinctive image features from scale-invariant keypoints] ”, International Journal of Computer Vision, 60, 2, pp. 91-110, 2004.]


ee also

*Scale space implementation

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Pyramid (disambiguation) — A pyramid is any three dimensional structure where the upper surfaces are triangular and converge at one point. Pyramid may also refer to:* Pyramid (geometry), a conic solid with polygonal base * Egyptian pyramids, the pyramids of Egypt **… …   Wikipedia

  • Image fusion — In computer vision, Multisensor Image Fusion is the process of combining relevant information from two or more images into a single image. The resulting image will be more informative than any of the input images. In remote sensing applications,… …   Wikipedia

  • Gaussian Pyramid — A Gaussian Pyramid is a technique used in image processing, especially in texture synthesis. The technique involves creating a series of images which are weighted down using a Gaussian average (Gaussian Blur) and scaled down. When this technique… …   Wikipedia

  • Scale space — theory is a framework for multi scale signal representation developed by the computer vision, image processing and signal processing communities with complementary motivations from physics and biological vision. It is a formal theory for handling …   Wikipedia

  • Scale space implementation — Scale space Scale space axioms Scale space implementation Feature detection Edge detection Blob detection Corner detection …   Wikipedia

  • HSL and HSV — Fig. 1. HSL (a–d) and HSV (e–h). Above (a, e): cut away 3D models of each. Below: two dimensional plots showing two of a model’s three parameters at once, holding the other constant: cylindrical shells (b, f) of constant saturation, in this case… …   Wikipedia

  • Template matching — is a technique in Digital image processing for finding small parts of an image which match a template image. It can be used in manufacturing as a part of quality control, [Aksoy, M. S., O. Torkul, and I. H. Cedimoglu. An industrial visual… …   Wikipedia

  • Datacube Inc. — Datacube Inc. (1978 2005) was an image processing company that developed real time hardware and software products for the industrial, medical, military and scientific markets. Contents 1 Early history 2 MaxVideo 10 3 MaxVideo 20 …   Wikipedia

  • ILWIS — Infobox Software name = ILWIS developer = 52° North latest release version = 3.5 Open latest release date = July 1, 2007 operating system = MS Windows genre = Geographic information system license = GPL | website =… …   Wikipedia

  • Maximally stable extremal regions — Feature detection Output of a typical corner detection algorithm …   Wikipedia