Sciweavers

123 search results - page 18 / 25
» Text-independent speaker recognition using graph matching
Sort
View
ICPR
2000
IEEE
14 years 10 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
JGAA
2007
135views more  JGAA 2007»
13 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
ICB
2007
Springer
136views Biometrics» more  ICB 2007»
14 years 3 months ago
Distance Measures for Gabor Jets-Based Face Authentication: A Comparative Evaluation
Local Gabor features (jets) have been widely used in face recognition systems. Once the sets of jets have been extracted from the two faces to be compared, a proper measure of simi...
Daniel González-Jiménez, Manuele Bic...
ISCI
2007
170views more  ISCI 2007»
13 years 9 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
TSD
2004
Springer
14 years 3 months ago
Dynamic Unit Selection for Very Low Bit Rate Coding at 500 bits/sec
This paper presents a new unit selection process for Very Low Bit Rate speech encoding around 500 bits/sec. The encoding is based on speech recognition and speech synthesis technol...
Marc Padellini, François Capman, Genevi&egr...