Sciweavers

133 search results - page 8 / 27
» On the distinct distances determined by a planar point set
Sort
View
ISBI
2006
IEEE
14 years 8 months ago
Landmark matching on the sphere using distance functions
Nonlinear registration of 3D surfaces is important in many medical imaging applications, including the mapping of longitudinal changes in anatomy, or of multi-subject functional M...
Natasha Lepore, Alex D. Leow, Paul M. Thompson
IDA
2009
Springer
13 years 5 months ago
Context-Based Distance Learning for Categorical Data Clustering
Abstract. Clustering data described by categorical attributes is a challenging task in data mining applications. Unlike numerical attributes, it is difficult to define a distance b...
Dino Ienco, Ruggero G. Pensa, Rosa Meo
CCCG
2009
13 years 9 months ago
Generalized jewels and the point placement problem
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sark...
COMGEO
2006
ACM
13 years 8 months ago
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
Christopher Dyken, Michael S. Floater
ICCV
2007
IEEE
14 years 9 months ago
Localizing Unordered Panoramic Images Using the Levenshtein Distance
This paper proposes a feature-based method for recovering the relative positions of the viewpoints of a set of panoramic images for which no a priori order information is availabl...
Damien Michel, Antonis A. Argyros, Manolis I. A. L...