29 November 2007 IFS-based image geometry transform
Author Affiliations +
In this paper, a method of IFS-based image geometry transform is proposed. Suppose the original image can be approximated with the attractor (denoted by A) of an Iterated Function System (IFS) consisting of N contractive mappings of wn (n=1, 2, ..., N), whose coefficients have been determined by fractal encoding. G(A) is used to denote the geometry transform on the attractor A. The result is equivalent to make a corresponding geometry transform on the original image. It is demonstrated in the paper that G(A) is the attractor of a new iterated function system (denoted by IFS') derived from the mappings of wn (n = 1, 2, ...N). In another word, we can modify the coefficients of wn (n=1, ..., N) to construct the IFS', and the result by decoding IFS' is A' = G(A), which is the approximation of the expected geometry transform of the original image. In order to translate, rotate and dilate images in the domain of IFS coefficients, formulas to construct the IFS' from wn are deduced in this paper. The experimental results have validated the proposed method.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhengbing Zhang, Zhengbing Zhang, Xiaodong Xiong, Xiaodong Xiong, Zhenhua Xia, Zhenhua Xia, } "IFS-based image geometry transform", Proc. SPIE 6833, Electronic Imaging and Multimedia Technology V, 683322 (29 November 2007); doi: 10.1117/12.755522; https://doi.org/10.1117/12.755522


Fast fractal image compression based on HV partition
Proceedings of SPIE (August 24 1999)
Fractal-based image coding with polyphase decomposition
Proceedings of SPIE (October 22 1993)
Magnifying partial image using fractal method
Proceedings of SPIE (August 30 2002)
An eliminated fractal compression algorithm by variance
Proceedings of SPIE (September 25 2003)
Fractal image coding based on replaced domain pools
Proceedings of SPIE (January 09 1998)

Back to Top