Results 251 to 260 of about 41,084 (293)
Some of the next articles are maybe not open access.
Some results on picture languages
Pattern Recognition, 1999Two different types of models called puzzle languages and recognizable picture languages describing digitized pictures in a two-dimensional plane have been introduced in the 1990s. We review here these models, reporting the main results already proved. We also give a few new results.
D G Thomas, V R Dare, K G Subramanian
exaly +2 more sources
LEARNING OF PATTERN AND PICTURE LANGUAGES
Series in Machine Perception and Artificial Intelligence, 1992A method of learning pattern languages in time polynomial in the length of the pattern is introduced. The learning of certain picture languages can then be done by considering them as an interpretation of pattern languages. The learning of Tabled Regular k-Matrix languages describing arrays of symbols is also examined.
Kg Subramanian, Rani Siromoney
exaly +2 more sources
International Journal of Reasoning-based Intelligent Systems, 2018
Ramya Govindaraj, Anand Mahendran
exaly +2 more sources
Ramya Govindaraj, Anand Mahendran
exaly +2 more sources
Timed picture naming in seven languages [PDF]
Psychonomic Bulletin and Review, 2003 Timed picture naming was compared in seven languages that vary along dimensions known to affect lexical access.Analysesover items focused on factorsthat determine cross-languageuniversalsand cross-languagedisparities.
Thomas Jacobsen +2 more
exaly +6 more sources
Recognizing Picture Languages by Reductions to String Languages
J. Autom. Lang. Comb., 2022By using a stateless deterministic transducer with a window of size 3-by-3 that employs a simple scanning strategy, we reduce a given picture language to a string language. Then we utilize two types of deterministic automata to accept this string language, finite-state acceptors and finite-state acceptors with translucent letters.
Frantisek Mráz, Friedrich Otto
openaire +2 more sources
Two undecidability results for chain code picture languages [PDF]
Theoretical Computer Science, 2002 It is undecidable whether or not two 1-retreat-bounded regular languages describe exactly the same set of pictures or they describe a picture in ...
Changwook Kim
exaly +2 more sources
2006 Japan-China Joint Workshop on Frontier of Computer Science and Technology, 2006
Picture languages are on attractive basis for communication. However, it is difficult to represent and understand accurate meaning in such languages. So, we are developing an approach where pictures with captions are allocated on positions of a 2D structure and special translators generate corresponding sentences in natural languages.
Hiroshi Migiyama +2 more
openaire +1 more source
Picture languages are on attractive basis for communication. However, it is difficult to represent and understand accurate meaning in such languages. So, we are developing an approach where pictures with captions are allocated on positions of a 2D structure and special translators generate corresponding sentences in natural languages.
Hiroshi Migiyama +2 more
openaire +1 more source
A CHARACTERIZATION OF RECOGNIZABLE PICTURE LANGUAGES
International Journal of Pattern Recognition and Artificial Intelligence, 1992This paper first shows that REC, the family of recognizable picture languages in Giammarresi and Restivo,3 is equal to the family of picture languages accepted by two-dimensional on-line tessellation acceptors in Inoue and Nakamura.5 By using this result, we then solve open problems in Giammarresi and Restivo,3 and show that (i) REC is not closed ...
Katsushi Inoue, Itsuo Takanami
openaire +1 more source
LEARNING OF RECOGNIZABLE PICTURE LANGUAGES
International Journal of Pattern Recognition and Artificial Intelligence, 1992Learning of certain classes of two-dimensional picture languages is considered in this paper. Linear time algorithms that learn in the limit, from positive data the classes of local picture languages and locally testable picture languages are presented.
Rani Siromoney +3 more
openaire +1 more source
Superposition in picture languages
2005A word on alphabet π={u, r, d, l} can be thought of as a description of a connected picture drawn on a square grid: each letter is associated with a unit move of a pen, u coding a move up, r, d and l coding moves to the right, down and to the left. We define the notion of superposition of two pictures f and g as the set of pictures obtained when one ...
Bodonirina Ratoandromanana +1 more
openaire +1 more source