1999
DOI: 10.1016/s0031-3203(98)00090-9
|View full text |Cite
|
Sign up to set email alerts
|

An evolutionary algorithm for the registration of 3-d surface representations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0
1

Year Published

1999
1999
2013
2013

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 0 publications
0
7
0
1
Order By: Relevance
“…Fischer et al studied the 3D image registration problem as part of object recognition. An evolutionary algorithm-based 3D surface registration method was presented in Fischer et al's work [10].…”
Section: Image Registration Using Evolutionary Computationmentioning
confidence: 99%
See 1 more Smart Citation
“…Fischer et al studied the 3D image registration problem as part of object recognition. An evolutionary algorithm-based 3D surface registration method was presented in Fischer et al's work [10].…”
Section: Image Registration Using Evolutionary Computationmentioning
confidence: 99%
“…The average number of generations needed to achieve convergence was in the hundreds, but in extreme cases [10], it could be thousands.…”
Section: Image Registration Using Evolutionary Computationmentioning
confidence: 99%
“…Typical approaches are hill climbing, 28 gradient descent, 10 simulated annealing, 21 and evolutionary algorithms. 12 Such algorithms often require that a good initial registration be provided. They then determine globally optimal parameters to register the images.…”
Section: Search Techniquesmentioning
confidence: 99%
“…A minimum is obtained when sum of absolute di erences or geometric distance is used as the similarity measure, while a maximum is obtained when cross-correlation coe cient or mutual information is used. A tri-quadric function is de ned by S(x y z) = Ax + Dxy+ E y z+ F x z + Gx + H y + I z+ J: (12) Parameters A{J are determined by the least squares method using the 3 3 3 array of similarities and their coordinates. Once A{J are determined, the maximum (minimum) of S(x y z) is determined by computing its derivatives with respect to x, y, a n d z setting them to zero and solving the obtained system of linear equations for x, y, a n d z.…”
mentioning
confidence: 99%
“…Various improvements and variants of the original ICP has been proposed, including the iterative closest compatible point algorithm (ICCP) [2] , which verifies the closest point pairs by additional attributes like color or surface normal. Furthermore, more sophisticated optimization schemes are proposed such as the simulated annealing [3] and the evolutionary algorithm [4] . Rusinkiewicz and Levoy [5] and Rodrigues et.…”
Section: Introductionmentioning
confidence: 99%