Biomedical Imaging GroupSTI
English only   BIG > Publications > Polynomial Pictures

 Home Page
 News & Events
 Tutorials and Reviews
 Download Algorithms

 All BibTeX References

Polynomial Representation of Pictures

M. Eden, M. Unser, R. Leonardi

Signal Processing, vol. 10, no. 4, pp. 385-393, June 1986.

In many image processing applications, the discrete values of an image can be embedded in a continuous function. This type of representation can be useful for interpolation, geometrical transformations or special features extraction. Given a rectangular M × N discrete image (or sub-image), it is shown how to compute a continuous polynomial function that guarantees an exact fit at the considered pixel locations. The polynomials coefficients can be expressed as a linear one-to-one separable transform of the pixels. The transform matrices can be computed using a fast recursive algorithm which enables efficient inversion of a Vandermonde matrix. It is also shown that the least square polynomial approximation with M' × M' coefficients, in separable formulation, involves the inversion of two M' × M' and N' × N' Hankel matrices.

AUTHOR="Eden, M. and Unser, M. and Leonardi, R.",
TITLE="Polynomial Representation of Pictures",
JOURNAL="Signal Processing",

© 1986 Elsevier. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from Elsevier.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.