Sciweavers

199 search results - page 11 / 40
» Approximating Center Points with Iterated Radon Points
Sort
View
ADCM
2007
84views more  ADCM 2007»
13 years 7 months ago
A non-linear circle-preserving subdivision scheme
We describe a new method for constructing a sequence of refined polygons, which starts with a sequence of points and associated normals. The newly generated points are sampled fr...
Pavel Chalmovianský, Bert Jüttler
ICIP
1998
IEEE
14 years 9 months ago
An Explicit Closed-Form Solution to the Limited-Angle Discrete Tomography Problem for Finite-Support Objects
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
Andrew E. Yagle
COMPGEOM
2007
ACM
13 years 11 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
3DIM
2003
IEEE
13 years 11 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
TIT
2002
75views more  TIT 2002»
13 years 7 months ago
Iterative multiuser joint decoding: Unified framework and asymptotic analysis
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
Joseph Boutros, Giuseppe Caire