Pyramid (image processing): Difference between revisions

Revision as of 14:26, 27 February 2008

Revision as of 15:47, 27 February 2008

Line 7:

==Pyramid generation kernels==

A variety of different smoothing kernels have proposed for generating pyramids (Burt 1981; Crowley 1981; Burt and Adelson 1983; Crowley and Sanderson 1984; Meer et al 1987). Among the suggestions that have been given, the ''binomial kernels'' arising from the [[binomial coefficient]]s stand out as a particularly useful and theoretically well-founded class (Crowley 1981; Lindeberg 1990, 1994) (see the article on [[multi-scale approaches]] for a very brief theoretical statemetn). Thus, given a two-dimensional image, we may apply the binomial filter (1, 2, 1) typically twotwice or more times 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 left out, leading to an ''oversampled'' or ''hybrid pyramid''. With the increasing computational efficiency of [[CPU]]s available today, it is in some situations also feasible to use wider support [[Gaussian filter]]s as smoothing kernels in the pyramid generation steps.

==Applications of pyramids==