Parsing of random graphs for scene analysis

• Autorzy: Skomorowski M.
• Konferencja: Conference on Computer Graphics and Image Processing, GKPO' 98 (5 ; 18-22.05.1998 ; Borki, Poland)
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

scene analysis; graph grammars; graph parsing; random graphs

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 1998
• Tom: Vol. 7, No. 1/2
• Strony: 313--323
• Opis fizyczny: Bibliogr. 11 poz.

Twórcy

autor

Skomorowski M.

• Department of Computer Science, Jagiellonian University, Kraków, Poland