Sciweavers

141 search results - page 12 / 29
» The Parallel Iterative Closest Point Algorithm
Sort
View
3DIM
2003
IEEE
14 years 9 days 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
JPDC
2007
138views more  JPDC 2007»
13 years 8 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 8 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé
CVPR
2006
IEEE
14 years 10 months ago
Tracking of the Articulated Upper Body on Multi-View Stereo Image Sequences
We propose a novel method for tracking an articulated model in a 3D-point cloud. The tracking problem is formulated as the registration of two point sets, one of them parameterise...
Julius Ziegler, Kai Nickel, Rainer Stiefelhagen
IICS
2005
Springer
14 years 2 months ago
Compositional Constraints Generation for Concurrent Real-Time Loops with Interdependent Iterations
Abstract. In this paper we describe an assume/guarantee based execution constraints synthesis algorithm for concurrent threads executing on parallel platforms. Threads are loops wh...
Ismail Assayad, Sergio Yovine