Entropy of Markovian processes: Application to image entropy in computer vision

DOI10.1016/S0016-0032(97)00075-6MaRDI QIDQ5959128zbMATH OpenFDO

Publication date 28 September 2002

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0016-0032(97)00075-6

computer vision entropy image entropy Markov processes measures of information monkey model

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Measures of information, entropy (94A17)

Review text

For image processing, the author introduces about twelve new measures of information, for example the density of conditional entropy of \(f\) as \(\frac{1}{2} \int_0^{2\pi} \ln (f'_x\cos\alpha +f'_y\sin\alpha)^2 d\alpha.\) Two propositions and five lemmata are offered (the lemmata do not lead to the propositions). The style is conversational, with (triple) exclamation marks; the statement of Lemma 2 is ``As a direct consequence of the definition of discrete Markov processes, by using entropy with respect to a measure, one can obtain the entropy of the trajectory \(x(t)\) on the finite interval \([0,T],\) in the form \(H(x(\;);0,T)=H(x_0)+\int_0^T\int_{\mathbb{R}^n} p(x,t)\ln[(2\pi e)^n|GQG^T|]^{1/2} dx dt\), where \(p(x,t)\) is the probability density defined by the Fokker-Planck-Kolmogorov equation \(\frac{\partial p}{\partial t}= -\sum_{i=1}^n\frac{\partial(pf_i)}{\partial x_i}+\frac{1}{2}\sum_{i,j=1}^n \frac{\partial^2[p(GQG^T)_{ij}]}{\partial x_i\partial x_j}\).

Recommendations

Cites work

Cited in

(1)

Information and self‐organization ‐ a new approach via self‐divergence of Markovian processes

This page was built for publication: Entropy of Markovian processes: Application to image entropy in computer vision

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