By Topic

Towards a better compression of self similar images. II. Proofing the edge maxima matching algorithm for the IFS encoding of affine self similar binary images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

An iterated function system (IFS) is a set of affine and contractive transformations. The union (so-called collage) of the subimages generated by transforming the whole image produces the image again. In the edge maxima matching algorithm the IFS-codes for a single image are calculated by affinely mapping maxima of the edge of the entire image to the corresponding maxima of the edge of each of the subimages. The three principle ideas of this algorithm to be proofed are as follows: the decomposition of the image in a minimal set of subimages is found by two adjacent edge points (so-called touching points of a subimage). These touching points are recognized by being the only points which have no affine and expanded equivalent in the image. A unique representation for each of the subimages is found by choosing the most expanded affine mappings of four edge extremes to characterise each of these image parts. An affine mapping (the IFS-code) between the image and the subimages is calculated by using an affine invariant representation through such quadruples of edge extremes

Published in:

Signal Processing, 1996., 3rd International Conference on  (Volume:2 )

Date of Conference:

14-18 Oct 1996