Parameter identification of 1D fractal interpolation functions using bounding volumes

Fractal interpolation functions are very useful in capturing data that exhibit an irregular (non-smooth) structure. Two new methods to identify the vertical scaling factors of such functions are presented. In particular, they minimize the area of the symmetric difference between the bounding volumes of the data points and their transformed images. Comparative results with existing methods are given that establish the proposed ones as attractive alternatives. In general, they outperform existing methods for both low and high compression ratios. Moreover, lower and upper bounds for the vertical scaling factors that are computed by the first method are presented.

[1]  Joseph O'Rourke,et al.  Computational geometry in C (2nd ed.) , 1998 .

[2]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[3]  Monson H. Hayes,et al.  Using iterated function systems to model discrete sequences , 1992, IEEE Trans. Signal Process..

[4]  H. Groemer On the symmetric difference metric for convex bodies. , 2000 .

[5]  Mazda A. Marvasti,et al.  Fractal geometry analysis of turbulent data , 1995, Signal Process..

[6]  A. M. Andrew,et al.  Another Efficient Algorithm for Convex Hulls in Two Dimensions , 1979, Inf. Process. Lett..

[7]  Leoni Dalla,et al.  Regular Article: On the Parameter Identification Problem in the Plane and the Polar Fractal Interpolation Functions , 1999 .

[8]  Christos H. Skiadas,et al.  Topics on chaotic systems : selected papers from CHAOS 2008 International Conference, Chania, Crete, Greece, 3-6 June 2008 , 2009 .

[9]  V. Drakopoulos,et al.  On the Computation of the Hausdorff Metric between Digitised Images in Three Dimensions , 2006 .

[10]  Polychronis Manousopoulos,et al.  One Dimensional Fractal Interpolation: Determination of the Vertical Scaling Factors using Convex Hulls , 2009 .

[11]  Vasileios Drakopoulos,et al.  Efficient computation of the Hutchinson metric between digitized images , 2004, IEEE Transactions on Image Processing.

[12]  Michael F. Barnsley,et al.  Fractal functions and interpolation , 1986 .

[13]  K. Ball CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .

[14]  Miki Haseyama,et al.  Efficient contour shape description by using fractal interpolation functions , 2002, Proceedings. International Conference on Image Processing.

[15]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[16]  Yong Deng,et al.  A new Hausdorff distance for image matching , 2005, Pattern Recognit. Lett..

[17]  Avraham A. Melkman,et al.  On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..

[18]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[19]  Philip D. Plowright,et al.  Convexity , 2019, Optimization for Chemical and Biochemical Engineering.