Translator Disclaimer
1 May 1986 Image Representation By Means Of Two Dimensional Polynomials
Author Affiliations +
Proceedings Volume 0594, Image Coding; (1986)
Event: 1985 International Technical Symposium/Europe, 1985, Cannes, France
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);


A stereo matching handling model in low-texture region
Proceedings of SPIE (October 07 2015)
Script determination in document images
Proceedings of SPIE (March 29 1995)
Bit-stream classification using joint and conditional entropies
Proceedings of SPIE (September 29 1996)
Data Compaction in the Polygonal Representation of Images
Proceedings of SPIE (April 30 1986)
Symmetry-based image segmentation
Proceedings of SPIE (October 28 1993)

Back to Top