Sciweavers

174 search results - page 24 / 35
» Algorithms for center and Tverberg points
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
13 years 10 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
CVPR
2009
IEEE
15 years 1 months ago
Extraction of Tubular Structures over an Orientation Domain
This paper presents a new method to extract a network of vessels centerlines from a medical image. The network is composed of local geodesics over a four-dimensional space that in...
Gabriel Peyré, Mickaël Péchaud,...
ICPR
2008
IEEE
14 years 8 months ago
Local Regularized Least-Square Dimensionality Reduction
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
Changshui Zhang, Yangqing Jia
MICCAI
2004
Springer
14 years 7 months ago
Augmenting Intraoperative 3D Ultrasound with Preoperative Models for Navigation in Liver Surgery
Organ deformation between preoperative image data and the patient in the OR is the main obstacle for using surgical navigation systems in liver surgery. Our approach is to provide ...
Thomas Lange, Sebastian Eulenstein, Michael Hü...
COMPGEOM
1998
ACM
13 years 11 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan