PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 19

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  syntactic pattern recognition
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Interpreted Graphs and ETPR(k) Graph Grammar Parsing for Syntactic Pattern Recognition
Flasiński M.
Machine Graphics and Vision
|
2018
|
Vol. 27, No. 1/4
3--19
EN
Further results of research into graph grammar parsing for syntactic pattern recognition (Pattern Recognit. 21:623-629, 1988; 23:765-774, 1990; 24:1223-1224, 1991; 26:1-16, 1993; 43:249-2264, 2010; Comput. Vision Graph. Image Process. 47:1-21, 1989; Fundam. Inform. 80:379-413, 2007; Theoret. Comp. Sci. 201:189-231, 1998) are presented in the paper. The notion of interpreted graphs based on Tarski's model theory is introduced. The bottom-up parsing algorithm for ETPR(k) graph grammars is defined.
2
Content available Generative power of reduction-based parsable ETPR(k) graph grammars for syntactic pattern recognition
Flasiński M.
Journal of Automation Mobile Robotics and Intelligent Systems
|
2018
|
Vol. 12, No. 2
61--81
EN
Further results of research into parsable graph grammars used for syntactic pattern recognition (Pattern Recognition: 21, 623-629 (1988); 23, 765-774 (1990); 24, 12-23 (1991); 26, 1-16 (1993); 43, 2249-2264 (2010), Comput. Vision Graph. Image Process. 47, 1-21 (1989), Computer-Aided Design 27, 403-433 (1995), Theoret. Comp. Sci. 201, 189-231 (1998), Pattern Analysis Applications bf 17, 465-480 (2014)) are presented in the paper. The generative power of reduction-based parsable ETPR(k) graph grammars is investigated. The analogy between the triad of CF - LL(k) - LR(k) string languages and the triad of NLC - ETPL(k) - ETPR(k) graph languages is discussed.
3
Content available DPAR grammars for ECG diagnosis justification
Flasiński P.
Schedae Informaticae
|
2017
|
Vol. 26
37--47
EN
A novel model of dynamically programmed attributed regular grammars, DPAR, for the ECG diagnosis justification purposes is presented in the paper. A formal model, power properties and a case of DPAR grammar are described. The formalism of DPAR grammars allows to differentiate between certain subclasses of ECG phenomena.
4
Content available Syntactic pattern recognition of ECG for diagnostic justification
Flasiński P.
Machine Graphics and Vision
|
2014
|
Vol. 23, No. 3/4
43--55
EN
A novel hybrid structural-parametric model for ECG diagnostic justification is presented in the paper. In order to distinguish between specific subclasses of heart dysfunction phenomena both grammars and automata are enhanced with a formalism of dynamic programming. It allows one to construct a system, which is feasible for aiding a process of teaching and evaluating medical students' diagnostic reasoning in the area of electrocardiography.
5
On the use of syntactic pattern recognition methods for strategic management
Jurek J.
Systems Science
|
2009
|
Vol. 35, no 3
55-61
EN
A model of the application of syntactic pattern recognition methods in a computer system supporting strategic management in an enterprise (based on Balanced Scorecard) is presented in the paper. The goal of BCSPRS system (Balanced ScoreCard Pattern Recognition System) is the analysis and recognition of patterns representing changes of values of strategic measures in time-series. The model of BCSPRS is based on the syntactic pattern recognition approach with the use of GDPLL(k) grammars (quasi contextsensitive string grammars). The model is efficient computationally and it can be used for the recognition of even very complex patterns. Additionally, the model provides a self-learning feature: the knowledge base about the patterns to be recognized can be automatically extended by the proper grammatical inference algorithms.
6
The design and implementation of the system supporting the control of industrial-like processes
Jurek J.
Foundations of Control and Management Sciences
|
2008
|
No. 9
51-66
EN
The software design and the implementation of an intelligent system supporting the control of industrial-like processes is discussed in the paper. The main tasks of such a system are on-line monitoring, analysis and recognition of process patterns (the results of the recognition are to be used to control the process), and self-learning activity, which enable the system automatic gathering new information about the process in order to recognise new process patterns. The system is based on the syntactic pattern recognition paradigm with the use of quasi-context sensitive string grammars. The design model of the system has been prepared accordingly to the object-oriented approach. In the paper we present the overview of the model and its implementation, and we discuss its advantages.
7
Content available Stochastyczne metody generacji IE-grafów
Kotulski L., Sędziwy A.
Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
|
2008
|
T. 12, z. 3
853-861
PL
W artykule omówiono metody probabilistycznej generacji struktur grafowych, tzw. IE-grafów, stanowiących formalizm dla opisu szerokiego spektrum problemów, w szczególności w dziedzinie rozpoznawania obrazów. W pracy przedstawione zostały metody opisu (za pomocą tzw. deskryptorów) oraz własności otrzymanych IE-grafów. Prezentowane metody generacji pozwalają na tworzenie struktur o zadanych właściwościach.
EN
In the article the probabilistic methods of graph structures generation are discussed. That class of graphs known also as IE graphs allows to formalize a variety of problems including pattern recognition area. In the paper we also present the methods of description of the obtained IE graphs (by using so called descriptors) and their properties. Generation methods being presented here allow to create the graphs having the desired properties.
8
Content available remote A syntactic recognizer for Arabic characters
Cowell J., Hussain F.
Machine Graphics and Vision
|
2007
|
Vol. 16, No. 1/2
57-83
EN
Commercial OCR systems for high quality Latin characters are widely available. However, the recognition of Arabic characters, particularly those of poor quality, is still an important research area. This paper gives details of two recognition systems for isolated Arabic characters based on the extraction of critical features. The limitations of this approach and its successful extension to a syntactic recognition system are discussed. The syntactic system uses a new web grammar, in which the critical features are nodes and a set of operators describes the spatial relationships between them. The approach used is insensitive to variations in the size and orientation of the characters and even the relative lengths of strokes. The described system has been implemented and the theoretical behaviour of this approach is supported by the experimental results.
9
Content available remote Inference of Parsable Graph Grammars for Syntactic Pattern Recognition
Flasiński M.
Fundamenta Informaticae
|
2007
|
Vol. 80, nr 4
379-413
EN
A research into a syntactic pattern recognition model based on ( edNLC) graph grammars (introduced and investigated in Janssens and Rozenberg Inform. Sci. 20 (1980), 191-216, and Janssens, Rozenberg and Verraedt Comp. Vis. Graph. Image Process. 18 (1982), 279-304) has resulted in defining the efficient, O(n2), parsing schemes for the ETPL(k) subclass of these grammars and applying it for scene analysis, CAD/CAM object analysis and constructing AI systems (Flasiński Patt. Recogn. 21 (1988), 623-629, Flasiński Comp. Vis. Graph. Image Process. 47 (1989), 1-21, Flasiński Patt. Recogn. 26 (1993), 1-16, Flasiński Comp. Aided-Des. 27 (1995), 403-433, Flasiński Theor. Comp. Sci. 201 (1998), 189-231). In the paper the grammatical inference method for the parsable ETPL(k) graph grammars is defined, completing the development of this syntactic pattern recognition model.
10
Content available remote On the Analysis of Fuzzy String Patterns with the Help of Extended and Stochastic GDPLL(k) Grammars
Flasiński M., Jurek J.
Fundamenta Informaticae
|
2006
|
Vol. 71, nr 1
1-14
EN
Two methods of the analysis of distorted (fuzzy) string patterns are presented. The methods are based on the use of GDPLL(k ) grammars generating a large subclass of context sensitive languages. The first one utilizes error-correcting approach: a minimum distance measure is used for error-correcting parsing. The second one utilizes stochastic approach: the decision about the production to be applied in a derivation step is given according to the probability measure.
11
Content available remote Picture Languages in Automatic Radiological Palm Interpretation
Tadeusiewicz R., Ogiela M. R.
International Journal of Applied Mathematics and Computer Science
|
2005
|
Vol. 15, no 2
305-312
EN
The paper presents a new technique for cognitive analysis and recognition of pathological wrist bone lesions. This method uses AI techniques and mathematical linguistics allowing us to automatically evaluate the structure of the said bones, based on palm radiological images. Possibilities of computer interpretation of selected images, based on the methodology of automatic medical image understanding, as introduced by the authors, were created owing to the introduction of an original relational description of individual palm bones. This description was built with the use of graph linguistic formalisms already applied in artificial intelligence. The research described in this paper demonstrates that for the needs of palm bone diagnostics, specialist linguistic tools such as expansive graph grammars and EDT-label graphs are particularly well suited. Defining a graph image language adjusted to the specific features of the scientific problem described here permitted a semantic description of correct palm bone structures. It also enabled the interpretation of images showing some in-born lesions, such as additional bones or acquired lesions such as their incorrect junctions resulting from injuries and synostoses.
12
Content available remote The Object-oriented Architecture of the Syntactic Pattern-recognition System Based on GDPLL(k) Grammars
Jurek J.
Schedae Informaticae
|
2004
|
Vol. 13
83-102
EN
The syntactic pattern recognition model based on GDPLL (k) grammars has been proposed [6, 13] as an efficient tool for inference support in diagnostic and control expert systems. In this paper we discuss the software engineering aspect of the syntactic pattern recognition (sub)system. The architecture of the system should allow to embed the system in real-time environments, accumulate knowledge about the environment, and flexible react to the changes in the environment. The object-oriented approach has been applied to design the system, and the Unified Modeling Language has been used for the specification of the software model. In the paper we presented the model and its practical applications.
13
Content available remote Substring Languages
Atłasiewicz K.
Schedae Informaticae
|
2004
|
Vol. 13
37-63
EN
This paper investigates the concept of substring languages as an alternative to the traditional parsing scheme. Practical grounds are also presented. Then the properties of substring languages are investigated. The paper proposes the most rudimentary characteristics of substring languages and relations of this concept to classes: REG, CFL, REC and REL. Finally, the map of problem solutions in substring sense is presented.
14
Content available remote On the construction of transition functions for DPLL(k) automata for syntactic pattern recognition
Jurek J.
Machine Graphics and Vision
|
2003
|
Vol. 12, No. 4
489-513
EN
DPLL(k) automata have been introduced as a tool for inference support in pattern recognition-based real-time expert systems. The automata can be characterised by the two following features: they can recognise languages of a big descriptive power (quasi context sensitive languages), and they are efficient (i.e. they are of linear computational complexity). The two features make the automata useful in case of many practical applications, such as the on-line analysis of complex trend functions describing behaviour of industrial equipment. In this paper we present a method for construction of transition functions for the automata and a formal proof of its correctness.
15
Content available remote Representation of ECG signals using the segmentation technique
Gacek A., Jeżewski J.
Biocybernetics and Biomedical Engineering
|
2003
|
Vol. 23, no. 4
33-43
EN
In this study, we are concerned with the segmentation of ECG signals and the use of the resulting constructs (segments) in the development of a vocabulary of generic signal descriptors. The resulting space of the segmentation parameters is discussed in detail. It is shown how their representatives (prototypes) are constructed via fuzzy clustering. Numerical examples using the MIT-BIH database ECG signals are provided.
16
Content available remote Automatic understanding of medical images - new achievements in syntactic analysis of selected medical images
Tadeusiewicz R., Ogiela M. R.
Biocybernetics and Biomedical Engineering
|
2002
|
Vol. 22, no. 4
17-29
EN
In the paper we try to solve very difficult problem connected with the advances in medical imaging technology: how to replace the goal of image recognition by image understanding. The problem under consideration is crucial one for all applications of information technology in automated systems devoted both for automatic medical diagnosis and successful searching in medical databases distributed troughout the world. The key problem analysis is how to model processes of image understanding by physician. We develop new tool for intelligent perception of differences between images of normal organs and pathological cases, instead of simple image recognition. We also presented how the same method can be used for searching of multimedial medical information in the respective databases. Such indexing approach enables an intelligent selection of interested case of illness based on visual queries.
17
Content available remote Formal fundamentals of syntactic pattern recognition - survey
Flasiński M.
Geoinformatica Polonica
|
2001
|
T. 3
7-16
EN
The basic notions and ideas of syntactic pattern recognition have been introduced and discussed with the help of examples in the paper. The main problems concerning the use of formal grammars as a tool for a structural pattern generation and the use of formal automata as a tool for an analysis and recognition of such pattern have been surveyed. The paper contains also a short discussion of the application of syntactic pattern recognition methods in geosciences.
PL
W pracy wprowadzono podstawowe pojęcia i idee syntaktycznego rozpoznawania obrazów i objaśniono je na przykładach. Dokonano przeglądu głównych problemów dotyczących wykorzystania gramatyk formalnych jako narzędzia generacji obrazów strukturalnych oraz wykorzystania automatów formalnych jako narzędzia analizy i rozpoznawania takich obrazów. Artykuł zawiera również krótką dyskusję o zastosowaniu metod syntaktycznego rozpoznawania obrazów w naukach o Ziemi.
18
A description language and a parsing algorithm for recognition of distorted line objects in map-drawings
Stąpor K.
Archiwum Informatyki Teoretycznej i Stosowanej
|
1999
|
T. 11, z. 3-4
293-308
EN
This paper presents a syntactic method for interpretation of those topographic objects in map-drawings which have stable pattern, particularly so-called 1-dimensional textures. Two extensions of a string grammar have been proposed in the method. First, a facility of explicity programming the application order of productions, and second, the description language based on PDL is augmented by a special operator for describing two-dimensionality. In the presented method, a grammar describing an object is used as an extraction tool, and forms a strategy for its extraction. The method is also capable of handling situations with overlapping objects.
PL
W pracy przedstawiono metodę syntaktycznego rozpoznawania topograficznych obiektów na mapach geodezyjnych. Metoda znajduje zastosowanie dla tych obiektów, których kształt wykazuje stałe i powtarzalne cechy, w szczególności dla tzw. tekstur 1-wymiarowych, czyli liniowych obiektów topograficznych. Zaproponowano dwa rozszerzenia klasycznej gramatyki stringowej. Pierwsze rozszerzenie dotyczy wprowadzenia możliwości programowania kolejności stosowania produkcji poprzez wprowadzenie gramatyki programowej. Drugie, to rozszerzenie języka opisu obrazu PDL o operator umożliwiający opis obiektów 2-wymiarowych. Gramatyka opisująca obiekty, stosowana jest w prezentowanej metodzie jako narzędzie ekstracji tychże obiektów. Prezentowana metoda umożliwia także rozpoznawanie w warunkach częściowego nakładania się obiektów, co bardzo często ma miejsce na mapach.
19
Content available remote Parsing of random graph languages for automated inspection in statisfical-based quality assurance systems
Flasiński M., Skomorowski M.
Machine Graphics and Vision
|
1998
|
Vol. 7, No. 3
565-623
EN
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.
first rewind previous Strona / 1 next fast forward last
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ć.