scientific article; zbMATH DE number 3978974
[For the entire collection see Zbl 0564.00027.] Distortion-free compressibility of individual pictures, i.e., two- dimensional arrays of data, by finite-state encoders is investigated. For every individual infinite picture I, a quantity \(\rho\) (I) is defined, called the compressibility of I, which is shown to be the asymptotically attainable lower bound on the compression-ratio that can be achieved for I by any finite-state, information-lossless encoder. This is demonstrated by means of a constructive coding theorem and its converse that, apart from their asymptotic significance, might also provide useful criteria for finite and practical data-compression tasks. The proposed picture- compressibility is also shown to possess the properties that one would expect and require of a suitably defined concept of two-dimensional entropy for arbitrary probabilistic ensembles of infinite pictures. While the definiton of \(\rho\) (I) allows the use of different machines for different pictures, the constructive coding theorem leads to a universal compression-scheme that is asymptotically optimal for every picture. The results of this paper are readily extendable to data arrays of any finite dimension. The proofs of the theorems will appear in a forthcoming paper.
- scientific article; zbMATH DE number 988299
- scientific article; zbMATH DE number 782087
- Compression of sequences of graphical images
- Image Compression by Redundancy Reduction
- scientific article; zbMATH DE number 67275
- Digital image compression
- scientific article; zbMATH DE number 1933270
- On compression and modelling of images
- scientific article; zbMATH DE number 890207
- Binary Compressed Imaging
- Parallel construction and query of index data structures for pattern matching on square matrices
- On encoding and decoding with two-way head machines
- Polynomial approximation of images
- Compression of sequences of graphical images
- Extreme compression of grayscale images
- Tiling and adaptive image compression
- Two-dimensional encoding by finite-state encoders
- Image‐Based Surface Compression
- Context-dependent multilevel pattern matching for lossless image compression
- Composing Functions to Minimize Image Size
- scientific article; zbMATH DE number 21739 (Why is no real title available?)
- An extended run-length encoder and decoder for compression of black/white images
- The rate-distortion dimension of sets and measures
- Estimates of amount of information in the probability model of image coding
- Weighted universal image compression
- scientific article; zbMATH DE number 782087 (Why is no real title available?)
- scientific article; zbMATH DE number 890207 (Why is no real title available?)
- Universally typical sets for ergodic sources of multidimensional data
- A Compression-Boosting Transform for Two-Dimensional Data
- Dynamic computational geometry on meshes and hypercubes
- \(LZ\)-based image compression
- Compressibility measures for two-dimensional data
- A new algorithm for compression of two-level facsimile picture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3744087)