A fundamental open problem in computer vision-determining pose and correspondence between two sets of points in space-is solved with a novel, fast, robust and easily implementable algorithm. The technique works on noisy 2D or 3D point sets that may be of unequal sizes and may differ by non-rigid tra
Correspondence of 2-D projections by bipartite matching
โ Scribed by Paul M. Griffin
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 345 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper extends an application of the method of simulated annealing for molecular matching so that the best common subsets of atom positions can be identified. Null correspondences are introduced into the difference distance matrix to enable poorly matched positions to be ignored in minimizing th
A novel algorithm based on a two-dimensional feature match is presented which compares the local features of the region containing a data point with the characteristics of the symmetry-related area. The proposed method results in a very effective suppression of artifacts and t , noise ridges, equal
Logical features are abstract representations of images at various levels of detail. Some logical features such as spa- The image retrieval based on spatial content is an attracting task in many image database applications. The 2D strings protial-location and spatial-relation [18] may be synthesize