Sciweavers

1375 search results - page 86 / 275
» Matching Points with Things
Sort
View
161
Voted
FOCM
2008
156views more  FOCM 2008»
15 years 3 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
ECCV
2004
Springer
16 years 5 months ago
Detecting Keypoints with Stable Position, Orientation, and Scale under Illumination Changes
Local feature approaches to vision geometry and object recognition are based on selecting and matching sparse sets of visually salient image points, known as `keypoints' or `p...
Bill Triggs
123
Voted
CAIP
1999
Springer
138views Image Analysis» more  CAIP 1999»
15 years 7 months ago
Procrustes Alignment with the EM Algorithm
This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the...
Bin Luo, Edwin R. Hancock
122
Voted
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 4 months ago
Image registration using genetic algorithms
This paper addresses the image registration problem applying genetic algorithms. The image registration’s objective is the definition of a mapping that best match two set of poi...
Flávio Luiz Seixas, Luiz Satoru Ochi, Aura ...
115
Voted
CVPR
1999
IEEE
16 years 5 months ago
Harmonic Maps and Their Applications in Surface Matching
* The surface-matching problem is investigated in this paper using a mathematical tool called harmonic maps. The theory of harmonic maps studies the mapping between different metri...
Dongmei Zhang, Martial Hebert