Sciweavers

1245 search results - page 65 / 249
» Triangulation for Points on Lines
Sort
View
ISAAC
2009
Springer
116views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
Francisco Claude, Reza Dorrigiv, Stephane Durocher...
ICRA
1993
IEEE
102views Robotics» more  ICRA 1993»
15 years 1 months ago
Automatic Reteach of Manipulators for Manufacturing Multiple Product Lines
Ordinarily, a robot workspace has insufficientroom to allow the setup of multiple applications simultaneously. As a result, it is common practice to use modular fixtures which hol...
Louis J. Everett, James C. Colson
ICPR
2006
IEEE
15 years 11 months ago
Extracting Lines in Noisy Image Using Directional Information
Detection of lines in noisy image is not easy. When using Hough transform, multiple false peaks may be generated from collinear noisy edge points, which in turn may create false l...
Arturo Sanchez-Azofeifa, Jun Zhou, Walter F. Bisch...
MICCAI
2004
Springer
15 years 10 months ago
Accurate Quantification of Small-Diameter Tubular Structures in Isotropic CT Volume Data Based on Multiscale Line Filter Respons
Abstract. A method fully utilizing multiscale line filter responses is presented to estimate the point spread function (PSF) of a CT scanner and diameters of small tubular structur...
Yoshinobu Sato, Shuji Yamamoto, Shinichi Tamura
ICA
2004
Springer
15 years 3 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter