Avoiding the inverse fractal problem for compressive sampling of 1/f data sets
Holger M. Jaenisch
Abstract
Holger M. Jaenisch
Abstract
We present a novel fractal Iterated Function System (IFS based) data interpolation algorithm enabling compressive sampling of 1/f data sets. We avoid the classical inverse IFS parameter estimation problem by using a novel analytical function driven variant of the random Iterated Function System (IFS) algorithm. We attempt to optimize the parameters of the analytical driver equation to optimize the data reconstruction by minimizing errors using various state-of-the-art genetic algorithms. We demonstrate our encouraging results and detail our methods and findings.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We present a novel fractal Iterated Function System (IFS based) data interpolation algorithm enabling compressive sampling of 1/f data sets. We avoid the classical inverse IFS parameter estimation problem by using a novel analytical function driven variant of the random Iterated Function System (IFS) algorithm. We attempt to optimize the parameters of the analytical driver equation to optimize the data reconstruction by minimizing errors using various state-of-the-art genetic algorithms. We demonstrate our encouraging results and detail our methods and findings.
Key concepts: Iterated function system, Computer science, Fractal, Interpolation (computer graphics), Inverse problem, Compressed sensing, Algorithm, Iterated function