IEEE International Conference on Image Processing 2005 2005
DOI: 10.1109/icip.2005.1530505
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting discriminant information in elastic graph matching

Abstract: In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the nodes in order to find the most discriminant features. The similarity measure for discriminant feature vectors and the node deformation are combined in a discriminant manner in order to form a local similarity measure between nodes. Moreover, the local similarity values at the nodes of the elastic graph, are weighted by coefficients tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…A new edges cost term forces that the difference in angle of the corresponding edges in the model and test graphs is below a threshold. Zafeiriou et al [11] used eigen-analysis to find the most discriminant features from the jets and proposed a new similarity measure for these. This work was subsequently extended in [12], by proposing a similarity measure that fuses the feature distance to nodes deformation.…”
Section: Related Workmentioning
confidence: 99%
“…A new edges cost term forces that the difference in angle of the corresponding edges in the model and test graphs is below a threshold. Zafeiriou et al [11] used eigen-analysis to find the most discriminant features from the jets and proposed a new similarity measure for these. This work was subsequently extended in [12], by proposing a similarity measure that fuses the feature distance to nodes deformation.…”
Section: Related Workmentioning
confidence: 99%
“…The performance of face verification systems is measured in terms of the False Rejection Rate (FRR) achieved at a fixed False Acceptance Rate (FAR) [26,25]. There is a trade-off between FAR and FRR.…”
Section: Verification Experimentsmentioning
confidence: 99%
“…This trade-off between the FAR and FRR can create a curve where FRR is plotted as a function of FAR (while altering the threshold value). This curve is called receiver operating characteristic (ROC) curve [28,30,29]. The performance of a verification system is often quoted by a particular operating point of the ROC curve where FAR = FRR.…”
Section: Experimental Validationmentioning
confidence: 99%