# Entropy encoding, Hilbert space, and Karhunen-Loève transforms

@article{Jorgensen2007EntropyEH,
title={Entropy encoding, Hilbert space, and Karhunen-Lo{\e}ve transforms},
author={Palle E. T. Jorgensen and Myung-Sin Song},
journal={Journal of Mathematical Physics},
year={2007},
volume={48},
pages={103503-103503}
}`
• Published 23 January 2007
• Computer Science
• Journal of Mathematical Physics
By introducing Hilbert space and operators, we show how probabilities, approximations, and entropy encoding from signal and image processing allow precise formulas and quantitative estimates. Our main results yield orthogonal bases which optimize distinct measures of data encoding.
43 Citations

## Figures from this paper

Entropy Encoding in Wavelet Image Compression
This chapter explores various schemes of entropy encoding and how they work mathematically where applicable, and investigates their applications in lossless compression.
Equivalence Between Representations for Samplable Stochastic Processes and its Relationship With Riesz Bases
• Mathematics
IEEE Transactions on Information Theory
• 2013
It is shown that random signals which can be linearly determined by their samples are related to the question of the representation of random variables by means of a countable Riesz basis.
Analysis of Fractals, Image Compression, Entropy Encoding, Karhunen-Loève Transforms
• Computer Science
• 2009
The purpose of this paper is to show that algorithms in a diverse set of applications may be cast in the context of relations on a finite set of operators in Hilbert space, and to introduce a diagionalization procedure in Karhunen-Loève analysis.
Reproducing Kernel Hilbert Space vs. Frame Estimates
• Mathematics
• 2015
We consider conditions on a given system F of vectors in Hilbert space H, forming a frame, which turn H into a reproducing kernel Hilbert space. It is assumed that the vectors inF are functions on
Data Dimension Reduction and Kernel Principal Component Analysis
• Computer Science, Mathematics
• 2019
The object is algorithms for optimization, selection of eﬃcient bases, oronents, which serve to minimize entropy and error; and hence to improve digital representation of images, and hence of optimal storage, and transmis- sion.
Dimension Reduction and Kernel Principal Component Analysis
• Computer Science, Mathematics
• 2019
The object is algorithms for optimization, selection of efficient bases, or components, which serve to minimize entropy and error; and hence to improve digital representation of images, and hence of optimal storage, and transmission.
Positive Definite Kernels, Algorithms, Frames, and Approximations
• Computer Science, Mathematics
ArXiv
• 2021
A new approach to design of algorithms of Kaczmarz type in the framework of operators in Hilbert space is proposed, designed with view to maximum likelihood solutions, minimization of “cost” problems, identification of principal components, and data-dimension reduction.
FRAMES, FRACTALS AND RADIAL OPERATORS IN HILBERT SPACE
In this paper, we construct graphs having a fractal property, and groupoids induced by the graphs. The fundamental properties of them and their corresponding graph von Neumann algebras, and their
Optimal sampling points in reproducing kernel Hilbert spaces
• Mathematics, Computer Science
J. Complex.
• 2016
The Karhunen-Loève Theorem
The univariate Karhunen-Loève Expansion is the decomposition of a continuous-parameter second-order stochastic process into uncorrelated random coe cients. In the present dissertation, the expansion

## References

SHOWING 1-10 OF 45 REFERENCES
Suboptimality of the Karhunen-Loeve transform for transform coding
• Computer Science
IEEE Transactions on Information Theory
• 2004
This paper shows that in both the fixed-rate and the variable-rate coding frameworks there exist sources for which the performance penalty for using a "worst" KLT can be made arbitrarily large, and demonstrates in both frameworks that even a best KLT gives suboptimal performance.
Suboptimality of the Karhunen-Loève Transform for Transform Coding
• Computer Science
IEEE Trans. Inf. Theory
• 2004
This paper shows that in both the fixed-rate and the variable-rate coding frameworks there exist sources for which the performance penalty for using a "worst" KLT can be made arbitrarily large, and demonstrates in both frameworks that even a best KLT gives suboptimal performance.
Tree Approximation and Optimal Encoding
• Computer Science
• 2001
It is shown that the restrictions of tree approximation cost little in terms of rates of approximation, and encoders for compression are designed that provide upper estimates for the Kolmogorov entropy of Besov balls.
von Neumann measurement is optimal for detecting linearly independent mixed quantum states
We consider the problem of designing a measurement to minimize the probability of a detection error when distinguishing between a collection of possibly nonorthogonal mixed quantum states. We show
Ten Lectures on Wavelets
• Geology
• 1992
This paper presents a meta-analyses of the wavelet transforms of Coxeter’s inequality and its applications to multiresolutional analysis and orthonormal bases.
Disintegration of projective measures
• Mathematics
• 2004
In this paper, we study a class of quasi-invariant measures on paths generated by discrete dynamical systems. Our main result characterizes the subfamily of these measures which admit a certain
Data Compression and Harmonic Analysis
• Computer Science
IEEE Trans. Inf. Theory
• 1998
Why harmonic analysis has interacted with data compression is explained, and some interesting recent ideas in the field that may affect data compression in the future are described.
The eigenvalues of a self-adjoint nxn matrix A can be put into a decreasing sequence $\lambda=(\lambda_1,...,\lambda_n)$, with repetitions according to multiplicity, and the diagonal of A is a point