1995
DOI: 10.1007/3-540-60268-2_394
|View full text |Cite
|
Sign up to set email alerts
|

Constraining probabilistic relaxation with symbolic attributes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1996
1996
1998
1998

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Four types of classifiers are first applied to perform the classification individually. We used structural [38], Gaussian, Neural Network, and Hidden Markov Model classifiers [40].…”
Section: Experimental Comparison Of Classifier Combination Rules: Hanmentioning
confidence: 99%
See 1 more Smart Citation
“…Four types of classifiers are first applied to perform the classification individually. We used structural [38], Gaussian, Neural Network, and Hidden Markov Model classifiers [40].…”
Section: Experimental Comparison Of Classifier Combination Rules: Hanmentioning
confidence: 99%
“…Otherwise, the sample will be checked against all prototypes in the code-Group to find the closest candidate(s) to the sample. First, the probabilistic relaxation algorithm [38] is used to find the correspondence between the primitives in the sample and those in the prototype. Then, a distance measure is used to quantify the similarity between the sample and each candidate.…”
Section: The Classification Schemementioning
confidence: 99%