Further results of research into parsing of random graphs for recognition of distored scenes ([9, 11]) are presented. An efficient top-down parallel parsing algorithm for analysis of distored scenes is proposed. The proposed approach involves parsing of graph grammars. To take into acount all variations of a distored scene under study, a probabilistic description of the scene is needed. The random graph approach ([9, 11]) is proposed here for such a description.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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.
The main purpose of the system described in this paper is optimization of traffic in the city by collecting and analyzing data related to traffic flow. Devices used in the process of collecting traffic information are installed in vehicles and send the information about current vehicle’s position and momentary speed. Based on that it is possible to find the best routes for any two points in the city.
4
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Basic requirements for an automated visual inspection in intelligent SPC-oriented quality assurance systems are discussed. Extensions of feature IE-graphs representing solids in CAD ([62]) to a stochastic model of manufacturing processes are proposed. An efficient random graph language analysis based on parsable ETPL(k) graph grammars([55)] is presented as a tool for intelligent reasoning in high layer modules of automated inspection systems. The first applications of the model are shown.
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ć.