Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
11,778
The Trimmed Iterative Closest Point Algorithm
- In International Conference on Pattern Recognition
, 2002
"... The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called the Trimmed ICP (TrICP). The new algorithm ..."
Abstract
-
Cited by 69 (4 self)
- Add to MetaCart
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called the Trimmed ICP (TrICP). The new
Morphological Iterative Closest Point Algorithm
- IEEE Trans. On Image Processing
, 1999
"... . This paper describes a method for accurate and computationally efficient registration of 3\GammaD shapes including curves and surfaces. The method is based on the iterative closest point (ICP) algorithm. The real strength of our algorithm is the use of Morphological Voronoi tessellation method to ..."
Abstract
- Add to MetaCart
. This paper describes a method for accurate and computationally efficient registration of 3\GammaD shapes including curves and surfaces. The method is based on the iterative closest point (ICP) algorithm. The real strength of our algorithm is the use of Morphological Voronoi tessellation method
The parallel iterative closest point algorithm
- In Proceedings of Fourth International Conference on 3-D Digital Imaging and Modeling
, 2001
"... This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspon-dence calculations are distributed among the processor re-sources. At the end of each iteration, the results of the cor-respondence ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspon-dence calculations are distributed among the processor re-sources. At the end of each iteration, the results of the cor
An approximate EM Homographical Iterative Closest Point algorithm.
"... This paper describes an approximately expectationmaximization (EM) formulation of a homographical iterative closest point registration approach (henceforth HICP). We show that such an EM approach allows the algorithm to converge faster, and more robustly in the presence of noise. Although this algor ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper describes an approximately expectationmaximization (EM) formulation of a homographical iterative closest point registration approach (henceforth HICP). We show that such an EM approach allows the algorithm to converge faster, and more robustly in the presence of noise. Although
Iterative Closest Point Algorithm in the Presence of Anisotropic Noise
"... Abstract. The Iterative closest point (ICP) algorithm is a widely used method for 3D point set registration. It iteratively establishes point correspondences between two input data sets and computes a rigid transformation accordingly. From a statistical point of view, the algorithm implicitly assume ..."
Abstract
- Add to MetaCart
Abstract. The Iterative closest point (ICP) algorithm is a widely used method for 3D point set registration. It iteratively establishes point correspondences between two input data sets and computes a rigid transformation accordingly. From a statistical point of view, the algorithm implicitly
Soft shape context for iterative closest point registration
- In: Proc. IEEE Int. Conf. Image Proc
, 2004
"... This paper introduces a shape descriptor, the soft shape context, motivated by the shape context method. Unlike the original shape context method, where each image point was hard assigned into a single histogram bin, we instead allow each image point to contribute to multiple bins, hence more robust ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
robust to distortions. The soft shape context can easily be integrated into the iterative closest point (ICP) method as an auxiliary feature vector, enriching the representation of an image point from spatial information only, to spatial and shape information. This yields a registration method more
BASED ITERATIVE CLOSEST POINT WITH STOCHASTIC CLUSTERING MATCHING
"... Ear recognition is a new technology and future trend for personal identification. However, the false detection rate and matching recognition are very challenging due to the ear complex geometry. The Scope of the study is to introduced a combination of Iterative Closest Point (ICP) and Stochastic Clu ..."
Abstract
- Add to MetaCart
Ear recognition is a new technology and future trend for personal identification. However, the false detection rate and matching recognition are very challenging due to the ear complex geometry. The Scope of the study is to introduced a combination of Iterative Closest Point (ICP) and Stochastic
VICP: Velocity Updating Iterative Closest Point Algorithm
"... Abstract — We propose a novel method to enhance a family of ICP(iterative closest point) algorithms by updating velocity. Even though ICP algorithms play a dominant role in a model based tracking, it is difficult to avoid an accumulated tracking error during a continuous motion. It is because that t ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract — We propose a novel method to enhance a family of ICP(iterative closest point) algorithms by updating velocity. Even though ICP algorithms play a dominant role in a model based tracking, it is difficult to avoid an accumulated tracking error during a continuous motion. It is because
� ICP stand for: Iterative Closest Point
, 2010
"... � First proposed by Besl et. al. on “A method for registration of 3D shapes” � A general purpose, representation independent algorithm for matching point sets, line segments…etc � Suitable from simple 2D shape to large 3D surface reconstruction � Usually used in Real-Time manner 3 Our Task � Impleme ..."
Abstract
- Add to MetaCart
� First proposed by Besl et. al. on “A method for registration of 3D shapes” � A general purpose, representation independent algorithm for matching point sets, line segments…etc � Suitable from simple 2D shape to large 3D surface reconstruction � Usually used in Real-Time manner 3 Our Task
Results 1 - 10
of
11,778
