1994/01/01 by Tsutomu Kawabata, Amir Dembo · 2 citations
Mathematics · Computer Science · #Mathematical Dynamics and Fractals #Computability, Logic, AI Algorithms #Chaos-based Image/Signal Encryption #Minkowski–Bouligand dimension #Mathematics #Packing dimension #Hausdorff dimension #Dimension (graph theory) #Distortion (music) #Fractal dimension #Effective dimension #Dimension function #Upper and lower bounds #Combinatorics #Inductive dimension #Metric (unit) #Sufficient dimension reduction #Distribution (mathematics) #Fractal #Discrete mathematics #Mathematical analysis #Computer science
paper · doi:10.1109/18.333868
openalex publication_date 1994/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Data compression of independent samples drawn from a fractal set is considered. The asymptotic ratio of rate to magnitude log distortion characterizes the effective dimension occupied by the underlying distribution. This quantity is shown to be identical to Renyi's (1959) information dimension. For self-similar fractal sets this dimension is distribution dependent-in sharp contrast with the behavior of absolutely continuous measures. The rate-distortion dimension of a set is defined as the maximal rate-distortion dimension for distributions supported on this set. Kolmogorov's metric dimension is an upper bound on the rate-distortion dimension, while the Hausdorff dimension is a lower bound. Examples of sets for which the rate-distortion dimension differs from these bounds are provided.>