Results 1 to 10 of about 2,431,309 (120)
Unsupervised Learning of Probabilistic Grammar-Markov Models for Object Categories [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008 We introduce a Probabilistic Grammar-Markov Model (PGMM) which couples probabilistic context free grammars and Markov Random Fields. These PGMMs are generative models defined over attributed features and are used to detect and classify objects in natural images.
Long Zhu, Yuanhao Chen, Alan Yuille
semanticscholar +8 more sources
Unsupervised Learning of a Probabilistic Grammar for Object Detection and Parsing [PDF]
Neural Information Processing Systems, 2007 We describe an unsupervised method for learning a probabilistic grammar of an object from a set of training examples. Our approach is invariant to the scale and rotation of the objects. We illustrate our approach using thirteen objects from the Caltech 101 database.
Long Zhu, Yuanhao Chen, Alan Yuille
semanticscholar +5 more sources
Stochastic Object-Based Graph Grammars
Electronic Notes in Theoretical Computer Science, 2007 AbstractObject-Based Graph Grammar (OBGG) is a formal visual language suited to the specification of asynchronous distributed systems based on message passing. Model-checking of OBGG models is currently supported and a series of case studies have been developed.
Odorico Machado Mendizabal +2 more
openalex +3 more sources
Syntagma as an object of communicative grammar
Bulletin of the Karaganda University. Philology series, 2020 The article reviews syntagmatic research and defines syntagma as psycholinguistic, semantic-syntactic, semantic-intonational, functional unit. It is indicated that lexical mixing and syntactic dismemberment are the result of syntagmatic studies. At the same time, this article gives a definition of the role that syntagma plays in communicative grammar ...
N. Ilyassova
openalex +2 more sources
From object grammars to ECO systems
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enrica Duchi +2 more
+7 more sources
Verifying Object-Based Graph Grammars
Electronic Notes in Theoretical Computer Science, 2004 AbstractObject-Based Graph Grammars (OBGG) is a formal language suitable for the specification of distributed systems. On previous work, a translation from OBGG models to PROMELA (the input language of the SPIN model checker) was defined, enabling the verification of OBGG models using SPIN.
Osmar Marchi dos Santos +2 more
openalex +3 more sources
Object-oriented parallel parsing for context-free grammars [PDF]
Proceedings of the 12th conference on Computational linguistics -, 1988 This paper describes a new parallel parsing scheme for context-free grammars and our experience of implementing this scheme, and it also reports the result of our simulation for running the parsing program on a massive parallel processor.In our basic parsing scheme, a set of context free grammar rules is represented by a network of processor-like ...
Akinori Yonezawa, Ichiro Ohsawa
openalex +4 more sources
Object grammars and random generation [PDF]
Discrete Mathematics & Theoretical Computer Science, 1998 This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects ...
Isabelle Dutour, Jean-Marc Fédou
openalex +6 more sources
The design and implementation of Object Grammars
Science of Computer Programming, 2014 An Object Grammar is a variation on traditional BNF grammars, where the notation is extended to support declarative bidirectional mappings between text and object graphs. The two directions for interpreting Object Grammars are parsing and formatting.
Tijs van der Storm +2 more
openalex +3 more sources
Process grammar and process history for 2D objects
DAIMI Report Series, 2008 This project is the written report for the course in Picture Processing at the Department of Computer Science, Aarhus University. The starting point is a paper by Michael Leyton in Artificial Intelligence 34, 1988: "A process grammar for shape". The paper describes how it is possible to derive the process history for an object from its state at two ...
Thomas W. Larsen, Brian H. Mayoh
openalex +5 more sources