Pyramid (image processing)

From HandWiki
Revision as of 22:36, 6 February 2024 by Rjetedi (talk | contribs) (over-write)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Type of multi-scale signal representation
Feature detection
Edge detection
Corner detection
Blob detection
Ridge detection
Hough transform
Structure tensor
Affine invariant feature detection
Feature description
Scale space
Visual representation of an image pyramid with 5 levels

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. Pyramid representation is a predecessor to scale-space representation and multiresolution analysis.

Pyramid generation

There are two main types of pyramids: lowpass and bandpass.

A lowpass pyramid is made by smoothing the image with an appropriate smoothing filter and then subsampling the smoothed image, usually by a factor of 2 along each coordinate direction. The resulting image is then subjected to the same procedure, and the cycle is repeated multiple times. Each cycle of this process results in a smaller image with increased smoothing, but with decreased spatial sampling density (that is, decreased image resolution). If illustrated graphically, the entire multi-scale representation will look like a pyramid, with the original image on the bottom and each cycle's resulting smaller image stacked one atop the other.

A bandpass pyramid is made by forming the difference between images at adjacent levels in the pyramid and performing image interpolation between adjacent levels of resolution, to enable computation of pixelwise differences.[1]

Pyramid generation kernels

A variety of different smoothing kernels have been proposed for generating pyramids.[2][3][4][5][6][7] 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.[3][8][9][10][11][12] 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 motivated 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.[11] With the increasing computational efficiency of CPUs available today, it is in some situations also feasible to use wider supported Gaussian filters as smoothing kernels in the pyramid generation steps.

Gaussian pyramid

In a Gaussian pyramid, subsequent images are weighted down using a Gaussian average (Gaussian blur) and scaled down. Each pixel containing a local average corresponds to a neighborhood pixel on a lower level of the pyramid. This technique is used especially in texture synthesis.

Laplacian pyramid

A Laplacian pyramid is very similar to a Gaussian pyramid but saves the difference image of the blurred versions between each levels. Only the smallest level is not a difference image to enable reconstruction of the high resolution image using the difference images on higher levels. This technique can be used in image compression.[13]

Steerable pyramid

A steerable pyramid, developed by Simoncelli and others, is an implementation of a multi-scale, multi-orientation band-pass filter bank used for applications including image compression, texture synthesis, and object recognition. It can be thought of as an orientation selective version of a Laplacian pyramid, in which a bank of steerable filters are used at each level of the pyramid instead of a single Laplacian or Gaussian filter.[14][15][16]

Applications of pyramids

Alternative representation

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. More recent techniques include scale-space representation, which has been popular among some researchers due to its 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.[11][17][18]

Detail manipulation

Levels of a Laplacian pyramid can be added to or removed from the original image to amplify or reduce detail at different scales. However, detail manipulation of this form is known to produce halo artifacts in many cases, leading to the development of alternatives such as the bilateral filter.

Some image compression file formats use the Adam7 algorithm or some other interlacing technique. These can be seen as a kind of image pyramid. Because those file format store the "large-scale" features first, and fine-grain details later in the file, a particular viewer displaying a small "thumbnail" or on a small screen can quickly download just enough of the image to display it in the available pixels—so one file can support many viewer resolutions, rather than having to store or generate a different file for each resolution.

See also

References

  1. ↑ E.H. Andelson and C.H. Anderson and J.R. Bergen and P.J. Burt and J.M. Ogden. "Pyramid methods in image processing". 1984.
  2. ↑ Burt, P. J. (May 1981). "Fast filter transform for image processing". Computer Graphics and Image Processing 16: 20–51. doi:10.1016/0146-664X(81)90092-7. 
  3. ↑ 3.0 3.1 Crowley, James L. (November 1981). A representation for visual information. Carnegie-Mellon University, Robotics Institute. tech. report CMU-RI-TR-82-07. http://www.ri.cmu.edu/publication_view.html?pub_id=37. 
  4. ↑ Burt, Peter; Adelson, Ted (1983). "The Laplacian Pyramid as a Compact Image Code". IEEE Transactions on Communications 9 (4): 532–540. doi:10.1109/TCOM.1983.1095851. http://persci.mit.edu/pub_pdfs/pyramid83.pdf. 
  5. ↑ Crowley, J. L. (March 1984). "A representation for shape based on peaks and ridges in the difference of low-pass transform". IEEE Transactions on Pattern Analysis and Machine Intelligence 6 (2): 156–170. doi:10.1109/TPAMI.1984.4767500. PMID 21869180. 
  6. ↑ Crowley, J. L.; Sanderson, A. C. (1987). "Multiple resolution representation and probabilistic matching of 2-D gray-scale shape". IEEE Transactions on Pattern Analysis and Machine Intelligence 9 (1): 113–121. doi:10.1109/tpami.1987.4767876. PMID 21869381. http://www-prima.inrialpes.fr/Prima/Homepages/jlc/papers/Crowley-Sanderson-PAMI87.pdf. 
  7. ↑ Meer, P.; Baugher, E. S.; Rosenfeld, A. (1987). "Frequency domain analysis and synthesis of image generating kernels". IEEE Transactions on Pattern Analysis and Machine Intelligence 9 (4): 512–522. doi:10.1109/tpami.1987.4767939. PMID 21869409. 
  8. ↑ Lindeberg, Tony, "Scale-space for discrete signals," PAMI(12), No. 3, March 1990, pp. 234-254.
  9. ↑ Haddad, R. A.; Akansu, A. N. (March 1991). "A Class of Fast Gaussian Binomial Filters for Speech and Image Processing". IEEE Transactions on Signal Processing 39 (3): 723–727. doi:10.1109/78.80892. Bibcode: 1991ITSP...39..723H. https://web.njit.edu/~akansu/PAPERS/Haddad-AkansuFastGaussianBinomialFiltersIEEE-TSP-March1991.pdf. 
  10. ↑ Lindeberg, Tony. Scale-Space Theory in Computer Vision, Kluwer Academic Publishers, 1994, ISBN:0-7923-9418-6 (see specifically Chapter 2 for an overview of Gaussian and Laplacian image pyramids and Chapter 3 for theory about generalized binomial kernels and discrete Gaussian kernels)
  11. ↑ 11.0 11.1 11.2 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.
  12. ↑ See the article on multi-scale approaches for a very brief theoretical statement
  13. ↑ Burt, Peter J.; Adelson, Edward H. (1983). "The Laplacian Pyramid as a Compact Image Code". IEEE Transactions on Communications 31 (4): 532–540. doi:10.1109/TCOM.1983.1095851. http://persci.mit.edu/pub_pdfs/pyramid83.pdf. 
  14. ↑ Simoncelli, Eero. "The Steerable Pyramid". cns.nyu.edu. http://www.cns.nyu.edu/~eero/STEERPYR/. 
  15. ↑ Manduchi, Roberto; Perona, Pietro; Shy, Doug (1997). "Efficient Deformable Filter Banks". California Institute of Technology/University of Padua. http://www.vision.caltech.edu/publications/ManduchiPeronaShy_efficient_deformable.pdf. 
    Also in Manduchi, R.; Perona, P.; Shy, D. (1998). "Efficient Deformable Filter Banks". IEEE Transactions on Signal Processing 46 (4): 1168–1173. doi:10.1109/78.668570. Bibcode: 1998ITSP...46.1168M. 
  16. ↑ Klein, Stanley A.; Carney, Thom; Barghout-Stein, Lauren; Tyler, Christopher W. (1997). "Seven models of masking". Human Vision and Electronic Imaging II. 3016. pp. 13–24. doi:10.1117/12.274510. 
  17. ↑ 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.
  18. ↑ Lowe, D. G. (2004). "Distinctive image features from scale-invariant keypoints". International Journal of Computer Vision 60 (2): 91–110. doi:10.1023/B:VISI.0000029664.99615.94. http://citeseer.ist.psu.edu/lowe04distinctive.html. 

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=Pyramid_(image_processing)&oldid=3385079"