Sciweavers

180 search results - page 20 / 36
» Fingerprint matching based on distance metric learning
Sort
View
CIARP
2009
Springer
15 years 4 months ago
A Brief Index for Proximity Searching
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
Eric Sadit Tellez, Edgar Chávez, Antonio Ca...
APVIS
2009
15 years 2 months ago
Visualizing time-varying features with TAC-based distance fields
To analyze time-varying data sets, tracking features over time is often necessary to better understand the dynamic nature of the underlying physical process. Tracking 3D time-vary...
Teng-Yok Lee, Han-Wei Shen
COMPGEOM
2008
ACM
15 years 3 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 5 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
15 years 5 months ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...