Abstract
In this paper, we investigate an algorithm, which integrates the Box dimension’s pretreatment with self-affine fractal interpolation function (AFIF). As a result of our experiments, we conclude that the algorithm allows us to fit graphs of various complexities.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnsley, M.F.: Fractal functions and interpolation. Constr. Approx. 2, 303–329 (1986)
Barnsley, M.F., Elton, J., Hardin, D., Massopust, P.: Hidden variable fractal interpolation functions. SIAM J. Math. Anal. 20, 1218–1242 (1989)
Barnsley, M.F., Elton, J.H., Hardin, D.P.: Recurrent iterated function systems. Constr. Approx. 5, 3–31 (1989)
Barnsley, M.F., Harrington, A.N.: The calculus of fractal interpolation functions. J. Approx. Theory. 57, 14–34 (1989)
Dalla, L., Drakopoulos, V.: On the parameter identification problem in the plane and the polar fractal interpolation functions. J. Approx. Theory. 101, 202–289 (1999)
Mazel, D.S., Hayes, M.H.: Using iterated function system to model discrete sequences. IEEE Trans. on Signal 40, 1724–1734 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, M., Wang, Q., Xi, L. (2007). Investigation on Fitting Graph Based on Fractal Dimension’s Pretreatment. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74827-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-74827-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74826-7
Online ISBN: 978-3-540-74827-4
eBook Packages: Computer ScienceComputer Science (R0)