K.S. Fu. Syntactic pattern recognition. In Young T.Z and Fu K.S, editors, Handbook of Pattern Recognition and Image Processing, pages 85--114. Academic Press, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....structure in the description. From the description lanFigure 4 Description language graph guage point of view, the modeling can be interpreted as a syntactic pattern recognition approach in which the primitives are transformed into the vocabulary and the relations are transformed into a grammar [FU86]. This approach makes use of the idea of shape decomposition, it divides complex shapes into simple elementary units, i.e. primitives. This can be seen as an application of semantic networks [DAR88] since semantic networks are labeled, directed graphs where nodes represent objects, sub objects, ....

Fu K.S., "Syntactic Pattern Recognition", in: Young T.Y.,Fu K.S., (Eds.), "Handbook of Pattern Recognition and Image Processing", Academic Press, San Diego, London, pp.84-117, 1986.

....structure in the description. From the description language point of view, the Figure 4 Description language graph modeling can be interpreted as a syntactic pattern recognition approach in which the primitives are transformed into the vocabulary and the relations are transformed into a grammar [4]. This approach makes use of the idea of shape decomposition, it divides complex shapes into simple elementary units, i.e. primitives. This can be seen as an application of semantic networks [2] since semantic networks are labeled, directed graphs where nodes represent objects, sub objects, or ....

Fu K.S., "Syntactic Pattern Recognition", in: Young T.Y.,Fu K.S., (Eds.), "Handbook of Pattern Recognition and Image Processing", Academic Press, San Diego, London, pp.84-117, 1986.

....problems are used for many years. They allow to classify complex patterns of interrelated primitives and yield a structural description simultaneously. Furthermore, the possibility to define recursive production rules generally leads to particular compact representations of classes of patterns [5]. Grammatical methods have also been introduced to computer aided manufacturing applications like workpiece or machine tool design [1] However, to the best of our knowledge grammar based approaches have not yet been used to qualify the internal structure of mechanical assemblies. Our efforts ....

K.S. Fu, editor. Syntactic Pattern Recognition, Applications. Springer-Verlag, Berlin, 1977.

.... P; S) with the production rules: P = fS A=C;D (a b) c; A a D b;C ( d) c d) Dg, generates the language L(G 1 ) fa (a b) c b; d) c d) a b) cg, where is the usual concatenation operator, is for parallel concatenation, and : is the operator for extremes inversion [4, 1]. This language describes the two forms from Figure 5, built with the primitives fa; b; c; dg = f ; g. We will present now the image desciption model that uses grammars whose terminal symbols are graphical primitives (horizontal, vertical and diagonal lines, as shown in Figure 4) and ....

K.S. Fu, Syntactic Pattern Recognition, Application, Springer-Verlag, New York, 1977.

....set of strings is a string that minimizes the sum of distances to the strings of the set. In some applications of Pattern Recognition, the median string can be used to model a (large) set of garbled strings or patterns. This is the case for the optimal prototype of a cluster of syntactic patterns [4]. In general, the problem of searching for the median string of a set is an NP Hard problem [2] and, therefore, no ecient algorithm can be designed to compute the median string. In some Pattern Recognition problems, heuristics are currently used to obtain approximations to the median strings [9, ....

....In some Pattern Recognition problems, heuristics are currently used to obtain approximations to the median strings [9, 5] One of these approximations corresponds to the search of the set median. In this case, the search is constrained to the given input set, which makes it a polynomial problem [4, 5]. In some cases, the set median is by no means a good approximation to a median string (for example, in the extreme case of a set of two strings) A heuristic approach was proposed in [9] for computing the median string of a given set. This approach is not time consuming if the median is close to ....

K. S. Fu. Syntactic Pattern Recognition. Prentice-Hall, 1982.

....In some applications of Pattern Recognition, a string or small set of strings is used to model a (large) set of garbled strings or patterns. A number of techniques have been developed for searching such a string or set of strings. One of these techniques is Clustering for Syntactic Patterns [5], that are based on a distance measurement between two strings. The Levenshtein distance is one of the most typical. The Levenshtein distance (or edit distance) corresponds to the smallest number of deletions, insertions and substitutions needed to transform one string (or sequence) into another. ....

....Recognition problems such as Speech Recognition, heuristics are currently used to obtain approximations to the median strings [7, 6] One of these approximations corresponds to the search of a set median. In this case, the search is constrained to the given input set and is a polynomial problem [5, 6]. In some cases, the set median cannot be a good approximation to a median string (for example, as in the extreme case of a set of two strings) There was a proposal in [9] but this proposal was based on numerical discrete sequences. We want to apply this technique to discrete sequences of ....

K. S. Fu. Syntactic Pattern Recognition. Prentice-Hall, 1982.

.... tol erante a et e etudi ee dans le cas d une grammaire donn ee et d une phrase qu on essaie de faire accepter par cette grammaire : on ecrit l arbre de d erivation et d es que l on arrive a l endroit o u la phrase n est pas accept ee, on la modifie de facon a ce qu elle soit accept ee [2]. On pourrait inf erer une expression r eguli ere a partir d un echantillon par une des m ethodes d ej a existantes et transformer ensuite l expression obtenue [5] mais on obtient alors un ensemble d expressions r eguli eres dont la taille croit exponentiellement avec l ordre du bruit que l on ....

....expressions r eguli eres. Le choix d une expression particuli ere repr esentative n ecessite l introduction de nouvelles heuristiques, comme la simplicit e de l expression finale ou la meilleure proximit e par rapport a l echantillon de d epart, ce qui ram ene a des m ethodes de regroupement [2]. Pour pallier a cette explosion combinatoire, on peut traiter directement l expression inf er ee a partir de l echantillon bruit e. Ceci nous conduit a rechercher des descriptions structurelles ayant une syntaxe du type X i Y j R i;j , avec les R i;j de la forme Y k R k r k ....

K. S. Fu. Syntactic Pattern Recognition. Academic Press, Chap.5 (1974).

....Controls has been proposed by researches to address such issues when it comes to the design, modeling, analysis, synthesis and control of such complex systems. The word intelligent controls was coined by K. S. Fu in 1971, when trying to define areas beyond adaptive and learning control [73, 74]. Due to the inherent complexity of this area, various researchers have developed structured frameworks for the design and development of intelligent systems. Antsaklis and Passino in [10] provide a collection of articles contributed by leading researchers in the area of intelligent control and ....

....and Electronic Systems, July 1980. 72] Freedman, P. Time, Petri Nets, and Robotics , IEEE Transactions on Robotics and Automation, Vol. 7, No. 4, Aug. 1991, pp. 417 433. 73] Fu, K. S. Learning Control Systems Review and Outlook , IEEE Transactions on Automatic Control , April 1970. [74] Fu, K. S. Syntactic pattern Recognition , Academic Press, New York, 1974. 75] Genrich, H. J. Predicate Transition Nets , In Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, W. Brauer, W. Reisig, and G. Rozenberg, Eds. vol. 254 of Lecture Notes in Computer ....

Fu, K. S., "Syntactic pattern Recognition", Academic Press, New York, 1974.

....3. Nonterminal symbols represent properties of higher layers,e.g. transport, session, or application protocols. Therefore, the influence of particular performance parameters, such as the window size, can be studied for each single layer. 4. Grammatical inference techniques, which are discussed in [Fu82] enable the construction of proper attributed grammars by analyzing measured event traces of distributed applications. 5. Attributed grammars allow the compact and generalized representation of measured event traces and to construct a syntax driven workload generator which supplies simulation ....

....it is natural to assume that the resulting grammar belongs to the class of regular grammars because most protocols are designed by means of cooperating finite state automata. We therefore decided to develop an inference module based on the k tail technique for regular languages described in [Fu82] Starting from the formal derivative D a S n of a sample event trace S n with respect to the event a 2 S n , defined as D a S n : ffi j afi 2 S n g which can easily be extended to a string ff = a 1 : a k according to D ff S n : D a k (D a k01 ( D a 2 (D a 1 S n ) it is ....

King Sun Fu. Syntactic Pattern recognition. John Wiley and Sons, 1982.

....only when it is possible to anticipate the common errors that we may encounter. Since the domain of mathematical expressions in our research is well defined and limited, it is feasible to design an error correcting parser for handling all the correct and incorrect expressions. According to [10], there are three types of syntactic errors for string grammars, namely, substitution errors, deletion errors, and insertion errors. As a result, three types of transformation are suggested to correct the errors, as follows: Let Sigma be a finite alphabet and Sigma be the closure of Sigma. ....

K.-S. Fu. Syntactic pattern recognition. In T. Y. Young and K.-S. Fu, editors, Handbook of Pattern Recognition and Image Processing, volume 1, chapter 4, pages 85--117. Academic Press, San Diego, 1986.

....class of structures present in images. Many models of this type have been introduced. There are stochastic models for image textures [GGGD] ZMW] for contours in images [Mu] GCK] for the decomposition of an image into regions [G G] M S] for disparity maps, for grammatical parsing of shapes [Fu], for template matching, for specific tasks such as face recognition [HGYGM] The common framework for all these studies is to describe some class of images I(x; y) by means of a set of auxiliary variables fx ff g representing the salient structures in the images, e.g. edges, texture statistics, ....

K.S.Fu, Syntactic Pattern Recognition, Prentice-Hall, 1982.

....through structure and the processing is both numerical and symbolic, without discarding the component of structure which relates different portions of numerical data and the imprecise and incomplete nature of the data. For example, let us consider problems of syntactic pattern recognition [4, 5]. Certain pattern classes contain objects, such as geometric figures, with an identifiable hierarchical structure that can be described by a formal grammar. A basic set of pattern primitives is selected and forms the set of grammar terminals. Grammar productions are a list of allowable relations ....

K.S. Fu, ed. Syntactic Pattern Recognition. Applications, New York: Springer Verlag, 1976.

....distortions are included in the factors according to which the system will be judged. Thus, before tests at each of the previous levels come to an end, these alterations will be applied to the images. The pattern primitives are also playing an important role in these experiments. As K.S. Fu said in [35], the interplay between the complexities of primitives and of pattern grammars is certainly very important in the design of a syntactic pattern analysis system. In our case, we do not exactly have a grammar as in traditional syntactic analysis systems, but we do have a numerous set of rules ....

Fu K.S. Syntactic pattern recognition. In Young T.Z and Fu K.S, editors, Handbook of Pattern Recognition and Image Processing, pages 85--114. Academic Press, 186.

....as sequences of postures. In this technique, trajectories of the degrees of freedom are not modelled, hence spatial scaling would be impossible, and temporal scaling although possible, would be somewhat inflexible. 2.2. 3 Syntactic Classification In an approach similar to that taken by Fu [12] for several applications, Jones and Doyle [19] suggest an alternative to sequentially calculating the similarity measures for each template, given a set of observed values. The method is based on constructing and traversing a feature tree, like the one partially shown in figure 2.1. Key features ....

K.S. Fu. Syntactic Pattern Recognition. Prentice-Hall, Inc., 1981.

....syntactic, and artificial neural network (ANN) approaches. In the structural approach [14, 15, 16] one extracts features based on minutiae and represents the features using a graph data structure. Structural matching is done by exploiting the topology of the features. In the syntactic approach [17], one typically approximates ridge patterns [18] as strings of primitives and models the plausible strings from a class such as Tented Arch using production rules as in grammar. Depending on the type of grammar used one can see a significant drop in the number of production rules required. For ....

K.S. Fu. Syntactic Pattern Recognition. Prentice-Hall, Englewood Cliffs, NJ, 1982.

....operations with respect to the procedure for Non Reducible Descriptors construction and allows incremental learning of the set structure. 1 Introduction In the string matching, the sentence describing an input pattern is matched against sentences representing each prototype or reference pattern[2]. Based on a selected The present paper is partly supported by the Bulgarian Ministry of Education and Science under a contract I 24 1991 and also by a grant TIC91 0430 from the Spanish Ministry of Education and Science matching or similarity criterion, the input pattern is classified in the ....

....must include the similarity of both their structures and primitives. The development of distance and similarity measures between syntactic patterns and error correcting parsing procedures made possible the appearance of string clustering techniques for the structural pattern recognition problems[2]. In the determination of structure of a set based on QNRD concept, the descriptors used to perform the clustering, carry structural information about the cluster. The suggested approach is based on type of partitional procedure. The defining of a structure of a given set by QNRD uses the fact ....

K.-S. Fu, "Syntactic Pattern Recognition", in Handbook of Pattern Recognition and Image Processing, ed. T. Y. Young and K.-S. Fu, Chapter 4, (Academic Press, Inc. Orlando, 1986).

....example is at the heart of this paper: we seek a technique for object recognition based on such entry level, generic descriptions. 1. 1 Classical Aspects of Shape Recognition Rosch s experimental observation that basic level descriptions precede particulars was made about the same time that Fu [15] and others were introducing syntactic pattern recognition. Fu s goal was to define a grammar for patterns, and then to specify automata that could recognize this grammar. However, this program lost favor because there was no clear indication of those pattern features on which the grammar should ....

K. Fu, editor. Syntactic Pattern Recognition, Applications. Springer-Verlag, New York, 1977.

No context found.

K.S. Fu. Syntactic pattern recognition. In Young T.Z and Fu K.S, editors, Handbook of Pattern Recognition and Image Processing, pages 85--114. Academic Press, 1986.

No context found.

K.S. Fu, Syntactic Pattern Recognition. Prentice-Hall, 1982.

No context found.

K.S. Fu. Syntactic Pattern Recognition. Springer-Verlag, New York, 1977.

No context found.

K.S. Fu, "Syntactic Pattern Recognition", in: T.Y. Young, K.S. Fu (Eds.), "Handbook of Pattern Recognition and Image Processing", Academic Press, San Diego, London, pp.84117, 1986.

No context found.

K.S. Fu. Syntactic pattern recognition. In K.S. Fu, editor, Applications of Pattern Recognition, chapter 3, pages 37--63. CRC Press, Inc., 1982.

No context found.

K.S. Fu. Syntactic pattern recognition. In K.S. Fu, editor, Applications of Pattern Recognition, chapter 3, pages 37--63. CRC Press, Inc., 1982.

No context found.

Fu K.S., 1986, "Syntactic pattern recognition", in Young T.Z and Fu K.S, editors, "Handbook of Pattern Recognition and Image Processing", 85--114, Academic Press

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC