Proceedings of 13th International Conference on Pattern Recognition 1996
DOI: 10.1109/icpr.1996.547653
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms for free-form surface matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
54
0
1

Year Published

1997
1997
2021
2021

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 80 publications
(55 citation statements)
references
References 7 publications
0
54
0
1
Order By: Relevance
“…Matching methods are based on the process of matching points from both surfaces, as Ransac or Genetic Algorithm. In some situations both techniques can be combined to find correspondences, as Brunnström [13], who used the normal vectors at every point to define the fitness function of the genetic algorithm. On the other hand, techniques of both groups can be used independently as Ransac which do not use features in the matching process or Point Signature that when points are characterized only a comparison between features from both surfaces is required to detect correspondences.…”
Section: Coarse Registration Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Matching methods are based on the process of matching points from both surfaces, as Ransac or Genetic Algorithm. In some situations both techniques can be combined to find correspondences, as Brunnström [13], who used the normal vectors at every point to define the fitness function of the genetic algorithm. On the other hand, techniques of both groups can be used independently as Ransac which do not use features in the matching process or Point Signature that when points are characterized only a comparison between features from both surfaces is required to detect correspondences.…”
Section: Coarse Registration Methodsmentioning
confidence: 99%
“…Brunnströ m and Stoddart [13] used a genetic algorithm to solve the problem of searching for correspondences between two range images. The interest in this method is centered on defining the vector that contains the n index of correspondences between both range images, where the size of the vector is set to n, i.e.…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…These later methods -like ICP [14] -are typically slow and show bad convergence properties, requiring an initial step for object detection. Methods for coarse registration include PCA, local feature based approaches like harmonic shape contexts [15], spin images [16], RANSAC-based approaches like DARCES [17] and genetic algorithms [18]. A drawback with many of the popular algorithms (like spin images) is that they require the presence of local features, i.e.…”
Section: Introductionmentioning
confidence: 99%
“…ordinary Least Squares adjustment, Genetic Algorithms (Brunnström & Stoddart, 1996), Principal Component Analysis ''PCA'' (Chung & Lee, 1998) or RANdom Sample And Consensus ''RANSAC'' (Fischler & Bolles, 1981)). Kang et al (2009) proposed an iterative algorithm, using Lease Squares adjustment, for optimal transformation parameters estimation.…”
Section: Introductionmentioning
confidence: 99%