Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Machine Graphics and Vision

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: structural pattern recognition

Sortuj według:

Ogranicz wyniki do:

Picture languages in machine understanding of medical vizualization

Ogiela M. R., Tadeusiewicz R.

Machine Graphics and Vision

2005

Vol. 14, No. 1

71-82

This paper presents theoretical fundamentals and application of context-free and graph languages for cognitive analysis of selected medical visualization. It shows new opportunities for applying these methods automatic understanding of semantic contents of images in intelligent medical information system. A successful extraction of the crucial semantic content of medical image may contribute considerably to the creation of new intelligent cognitive systems, or medical computer vision systems. Thanks to the new idea of cognitive resonance between a stream of the data extracted from the image using linguistic methods, and expectations following from the language representation of the medical knowledge, it is possible to understand the subject-oriented content of the visual data. This article shows that structural techniques of soft-computing may be applied in automatic classification and machine perception based on semantic pattern content in order to determine the semantic meaning of the patterns.

A graph-edit algorithm for hand-drawn graphical document recognition and thier automatic introduction into CAD systems

Lladós J., Martí E.

Machine Graphics and Vision

1999

Vol. 8, No. 2

195-211

In this work, a graph-based algorithm for symbol recognition in hand-drawn architectural plans has been described. The algorithm belongs to a prototype of man-machine interface consisting in the introduction of hand-drawndesigns to a CADsystem. Documentsand symbol prototypes are represented in terms of a Region Adjecency Graph (RAG) structure. Hence, the localization of symbol instaces in documents is performed by an error-tolerant subgraph isomorphism algorithm that looks for the minimum cost edit sequence that transforms a model graph to an input one. In this paper we describe this algorithm and the set of graph edit operations designed to transform RAGs. The main idea of the algorithm is to formulate the distance between two RAGs in terms of the string edit distance between the boundary strings of the corresponding regions. The main advantage of the algorithm is its ability to cope with distorted structuredand its invariance to rotation, translation and scaling.