Optimal Generating Kernels for Image Pyramids by Piecewise Fitting

Authors:
Francis Chin;Andrew Choi;Yuhua Luo
Affiliations:
-;-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1992

Citing 5
Cited 2

Frequency Domain Analysis and Synthesis of Image Pyramid Generating Kernels

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pyramidal systems for computer vision

Pyramidal systems for computer vision
Finite Prolate Spheroidal Sequences and their Applications II: Image Feature Description and Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Laplacian-of-Gaussian kernel: a formal analysis and design procedure for fast, accurate convolution and full-frame output

Computer Vision, Graphics, and Image Processing
Discrete-time signal processing

Discrete-time signal processing

A new algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane

Pattern Recognition Letters
Fitting a two-joint orthogonal chain to a point set

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.14

Visualization

Abstract

A novel class of generating kernels for image pyramids is introduced. When these kernels are convolved with intensity functions of images, continuous piecewise surfaces composed of polynomial tensor products are fitted to the intensity functions. The fittings are optimal in the sense that the mean square error between them and the original intensity functions is minimized. Two members of the class are introduced, and symmetry, normalization, unimodality, and equal contribution properties are proved. These kernels possess attractive properties such as small window size, fast inverse transformation, and minimum error. Experiments show that they compare favorably with existing ones in terms of mean square error.