A Clustering Procedure for Syntactic Patterns

A Novel String Grammar Unsupervised Possibilistic C-Medians Algorithm for Sign Language Translation Systems

“…Since this is a string calculation, the numeric distance metrics cannot be used in this case. Hence, the distance metric used in the paper is the Levenshtein distance [50][51][52][53] between string s j and string prototypes sc i (Lev(sc i , s j )) (a smallest number of transformations needed to derive one string from the other) between input string j and cluster prototype i. Since the keyframes for each symbol in the signature library may have different numbers of keypoints, to identify the correct symbol for that image frame, the average number of matched keypoints per keyframe (Avg_Match) [43] of each symbol is computed as:…”

“…Since this is a string calculation, the numeric distance metrics cannot be used in this case. Hence, the distance metric used in the paper is the Levenshtein distance [50][51][52][53] between string sj and string prototypes sci (Lev(sci, sj)) (a smallest number of transformations needed to derive one string from the other) between input string j and cluster prototype i. Figure 3.…”

Syntactic Algorithms for Image Segmentation and a Special Computer Architecture for Image Processing

“…For the purpose of increasing the flexibility of the syntactic method, Fu and Lu [17] proposed a clustering procedure for syntactic pat- When structures of patterns or textures of the image are complex, the characteristics thresholding method by structural approach is useful.…”

An Application of Array Token Petri Nets to Clustering Analysis for Syntactic Patterns

“…Distance between arrays in terms of the error transformations required to derive one array from another has already been defined in literature. Application of array grammars to clustering analysis exists in literature [3,4]. A clustering procedure for English characters has been proposed by defining a distance between an array and a group of arrays characterized by an array grammar.…”