Paper
1 May 1986 Image Representation By Means Of Two Dimensional Polynomials
Michel Kocher
Author Affiliations +
Proceedings Volume 0594, Image Coding; (1986) https://doi.org/10.1117/12.952215
Event: 1985 International Technical Symposium/Europe, 1985, Cannes, France
Abstract
In this paper, two different methods of representing an image using 2-D polynomials will be presented. In the first approach, the image is segmented into adjacent regions using a region growing algorithm. At the completion of this step, the grey level evolution of every region is approximated by a 2-D polynomial using the least square error method. In the second approach, the segmentation and approximation procedures are merged together. This is achieved by representing the matrix's image by a graph where every node is a mapping of a square of n times n pixels and every edge is a measure of similarity between the two nodes it connects. The graph is then iteratively transformed by using an isotropic node merging algorithm. Lastly, the reduced graph is transformed back to a matrix representation giving the final image. The two algorithms will be compared in terms of growing homogeneity, error control and optimality, and their respective results will be presented.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michel Kocher "Image Representation By Means Of Two Dimensional Polynomials", Proc. SPIE 0594, Image Coding, (1 May 1986); https://doi.org/10.1117/12.952215
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image processing

Image processing algorithms and systems

Error control coding

Image compression

Data compression

Error analysis

Back to Top