Стационарные процессы на графах и анализ изображений

Authors

  • Natalya Ampilova

Keywords:

Markov chain, stationary process on graph, approximation of an invariant measure, dynamical systems, maximization of weighted entropy

Abstract

The method of a classification of images concerning to a substance propagation process is proposed. The image is considered as a lattice formed by pixels of given intensity. Then an oriented graph corresponding to the image is constructed in the following way: every vertex (pixel) is connected with N neighbours. For a given vertex all outcoming edges have a value (pixel intensity/N), for boundary vertex – pixel intensity/(N – 1). The constructed flow is normed. For obtained markov chain by the Sheleihovsky-Bregman method a stationary distribution is constructed, which maximizes weighted entropy. It is weighted entropy that is used as a classifying sign when images with different doses of a substance are analyzed. The results of numerical experiments are given.

Downloads

Published

2013-04-30

Issue

Section

Computer science

How to Cite

[1]
“Стационарные процессы на графах и анализ изображений”, Comput. Tools Educ., no. 2, Apr. 2013, Accessed: Oct. 24, 2026. Available: http://cte.eltech.ru/ojs/index.php/kio/article/view/1341

Most read articles by the same author(s)