Sciweavers

305 search results - page 7 / 61
» A Robust Interest Points Matching Algorithm
Sort
View
ECCV
2006
Springer
14 years 9 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
CVPR
2000
IEEE
14 years 10 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
ICVGIP
2004
13 years 9 months ago
Fast and Robust Projective Matching for Fingerprints Using Geometric Hashing
Fingerprint matching is the most important module in automatic person recognition using fingerprints. We model the nonlinear distortions and noise obtained during the fingerprint ...
Rintu Boro, Sumantra Dutta Roy
ICRA
2006
IEEE
174views Robotics» more  ICRA 2006»
14 years 1 months ago
Multi-scale point and line range data algorithms for mapping and localization
— This paper presents a multi-scale point and line based representation of two-dimensional range scan data. The techniques are based on a multi-scale Hough transform and a tree r...
Samuel T. Pfister, Joel W. Burdick
ICIP
2005
IEEE
14 years 9 months ago
Optimizing of searching co-motion point-pairs for statistical camera calibration
In the paper we introduce an algorithm for matching partially overlapping image-pairs where the object of interest is in motion, even if the motion is discontinuous and in an unstr...
Csaba Benedek, Laszlo Havasi, Tamás Szir&aa...