13651 search results - page 67 / 2731 » Spectral analysis of data |
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Registration of 3D surfaces is a critical step for shape analysis. Recent studies show that spectral representations based on intrinsic pairwise geodesic distances between points ...
IJCNN
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
SIGGRAPH
2000
ACM
14 years 6 days ago
2000
ACM
We show how spectral methods may be applied to 3D mesh data to obtain compact representations. This is achieved by projecting the mesh geometry onto an orthonormal basis derived f...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
JMLR
2011
13 years 2 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...