Sciweavers

7351 search results - page 163 / 1471
» Segmenting Point Sets
Sort
View
MICCAI
2001
Springer
15 years 9 months ago
Multisubject Non-rigid Registration of Brain MRI Using Intensity and Geometric Features
In this article we merge point feature and intensity-based registration in a single algorithm to tackle the problem of multiple brain registration. Because of the high variability ...
Pascal Cachier, Jean-Francois Mangin, Xavier Penne...
NIPS
2004
15 years 5 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
COMGEO
2011
ACM
14 years 11 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 8 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
URBAN
2008
99views more  URBAN 2008»
15 years 4 months ago
A comparison of address point, parcel and street geocoding techniques
The widespread availability of powerful geocoding tools in commercial GIS software and the interest in spatial analysis at the individual level have made address geocoding a widel...
Paul A. Zandbergen