Estimates of amount of information in the probability model of image coding (Q4380894)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1129948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimates of amount of information in the probability model of image coding |
scientific article; zbMATH DE number 1129948 |
Statements
Estimates of amount of information in the probability model of image coding (English)
0 references
17 March 1998
0 references
probabilistic model
0 references
information-based complexity
0 references
quantity of information
0 references
image encoding
0 references
0.7565768957138062
0 references
0.755379855632782
0 references
0.7194435000419617
0 references
0.709604799747467
0 references
Let \(x(k,l),\;1\leq k,l\leq m,\;0\leq x(k,l)\leq1,\) be an image and let \[ dx=\left\{\sum_{k,l=1}^{m}(x(k,l)-Mx)^2\right\}^{1/2}, \] where \(Mx= m^{-2} \sum_{k,l=1}^{m}x(k,l)\). In a probabilistic model of the theory of information based complexity the author obtains the estimate \(H(d)=m^2(1+o(1))\log_{2} \left({d/\varepsilon m}+o(1)\right)\) for the quantity of information \(H(d)\) which is necessary for encoding of the image \(x(k,l),\;dx\leq d\) with accuracy \(\varepsilon\).
0 references
