Frequency Domain Analysis and Synthesis of Image Pyramid Generating Kernels

Construction of image pyramids is described as a two-di-mensional decimation process. Frequently employed generating kernels are compared to the optimal kernel that assures minimal information loss after the resolution reduction, i.e., the one corresponding to an ideal low pass filter. Physically realizable, optimal generating kernels are presented. The amount of computation required for generation of the image pyramid can be reduced significantly by employing half-band filters as components of the optimal kernel. Image pyramids generated by the optimal kernel show a better command of details than the ones generated by a simple 4 × 4 averaging, or a computationally equivalent kernel.

[1]  Azriel Rosenfeld,et al.  Compact Region Extraction Using Weighted Pixel Linking in a Pyramid , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Azriel Rosenfeld,et al.  Multiresolution image processing and analysis , 1984 .

[3]  L. Rabiner,et al.  A computer program for designing optimum FIR linear phase digital filters , 1973 .

[4]  William M. Wells,et al.  Efficient Synthesis of Gaussian Filters by Cascaded Uniform Filters , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Azriel Rosenfeld,et al.  Boundary localization in an image pyramid , 1986, Pattern Recognit..

[6]  P. J. Burt,et al.  Fast Filter Transforms for Image Processing , 1981 .

[7]  S. Biyiksiz,et al.  Multirate digital signal processing , 1985, Proceedings of the IEEE.

[8]  P. Burt Fast filter transform for image processing , 1981 .