Estimates of amount of information in the probability model of image coding

From MaRDI portal





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\).











This page was built for publication: Estimates of amount of information in the probability model of image coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4380894)