Sciweavers

1082 search results - page 51 / 217
» Approximation Algorithms for Spreading Points
Sort
View
SCALESPACE
2009
Springer
14 years 2 months ago
Bregman-EM-TV Methods with Application to Optical Nanoscopy
Abstract. Measurements in nanoscopic imaging suffer from blurring effects concerning different point spread functions (PSF). Some apparatus even have PSFs that are locally depend...
Christoph Brune, Alex Sawatzky, Martin Burger
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi
ICCV
2007
IEEE
14 years 9 months ago
Noise Robust Spectral Clustering
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
Zhenguo Li, Jianzhuang Liu, Shifeng Chen, Xiaoou T...
CRV
2005
IEEE
205views Robotics» more  CRV 2005»
14 years 1 months ago
Head Pose Estimation of Partially Occluded Faces
This paper describes an algorithm which calculates the approximate head pose of partially occluded faces without training or manual initialization. The presented approach works on...
Markus T. Wenzel, Wolfram Schiffmann
SMI
2005
IEEE
181views Image Analysis» more  SMI 2005»
14 years 1 months ago
A Tracing Algorithm for Constructing Medial Axis Transform of 3D Objects Bound by Free-Form Surfaces
This paper presents an algorithm for generating the Medial Axis Transform(MAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the...
M. Ramanathan, B. Gurumoorthy