Sciweavers

847 search results - page 65 / 170
» Approximation algorithms for projective clustering
Sort
View
87
Voted
ICANN
2003
Springer
15 years 5 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
105
Voted
ICIP
2004
IEEE
16 years 2 months ago
Shape estimation of 3-D DNA molecules from stereo cryo-electron micro-graphs
We introduce a 3-D parametric active contour algorithm for the shape estimation of DNA molecules from stereo cryo-electron micrographs. We consider a 3-D filament (consisting of a...
Mathews Jacob, Thierry Blu, Michael Unser
98
Voted
CVPR
2006
IEEE
16 years 2 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
David Tolliver, Gary L. Miller
FTML
2010
159views more  FTML 2010»
14 years 11 months ago
Dimension Reduction: A Guided Tour
We give a tutorial overview of several geometric methods for dimension reduction. We divide the methods into projective methods and methods that model the manifold on which the da...
Christopher J. C. Burges
CGF
2008
128views more  CGF 2008»
15 years 23 days ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...