2009
DOI: 10.1007/978-3-642-04391-8_30
|View full text |Cite
|
Sign up to set email alerts
|

Multi-modal Authentication Using Continuous Dynamic Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…Quad tree further depth decomposition will lead to more performance as it selects more minute details of variation. Continuous dynamic programming method of classification will provide piecewise comparison (Radhika et al, 2009a). Zernike moments are rotation invariant (Radhika et al, 2009b).…”
Section: Resultsmentioning
confidence: 99%
“…Quad tree further depth decomposition will lead to more performance as it selects more minute details of variation. Continuous dynamic programming method of classification will provide piecewise comparison (Radhika et al, 2009a). Zernike moments are rotation invariant (Radhika et al, 2009b).…”
Section: Resultsmentioning
confidence: 99%
“…The input parameter for transfer function isb s2 ðtÞ. Pole-zero mapping is achieved by (27). The real part of zeros (28) are considered, for improved comparison.…”
Section: Methodologiesmentioning
confidence: 99%
“…Algorithms for speeding-up the k-nn search fall into two categories: template condensation and template reorganization. Template condensation removes redundant patterns in a template set and template reorganization, restructures templates for efficient search of k nearest neighbors [19]. In this work, template condensation is achieved by genuine training samples selected.…”
Section: K-nn Methodsmentioning
confidence: 99%