Sciweavers

1607 search results - page 6 / 322
» A practical approach for computing the diameter of a point s...
Sort
View
ICIP
2008
IEEE
14 years 9 months ago
Classification of unlabeled point sets using ANSIG
We address two-dimensional shape-based classification, considering shapes described by arbitrary sets of unlabeled points, or landmarks. This is relevant in practice because, in m...
José J. Rodrigues, João M. F. Xavier...
ICALP
2004
Springer
14 years 24 days ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
EMMCVPR
2009
Springer
13 years 5 months ago
Intrinsic Second-Order Geometric Optimization for Robust Point Set Registration without Correspondence
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
Dirk Breitenreicher, Christoph Schnörr
COMPGEOM
1996
ACM
13 years 11 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
ICPR
2008
IEEE
14 years 1 months ago
Correspondences of point sets using Particle Filters
The paper shows how Particle Filters can be used to establish visually consistent partial correspondences between similar features in unrestricted 2D point sets representing shape...
Rolf Lakämper, Shusha Li, Marc Sobel