A new approach to scene labelling is proposed. The proposed approach involves parsing for graph grammars. To take into account all variations of an ambiguous (distorted) scene under study, a probabilistic description of the scene is needed. Random graphs are proposed here for such a description. An efficient, O(n2), parsing algorithm for random graphs is proposed here as a tool for scene labelling. An example is provided.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this paper random recursive dags ( directed acyclic graphs) are considered. For such combinatorial structures the expected number of vertices of small outdegrees as well as the degree of a given vertex are studied.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.