Challenging data sets for point cloud registration algorithms
نویسندگان
چکیده
منابع مشابه
Challenging data sets for point cloud registration algorithms
The number of registration solutions in the literature has bloomed recently. The iterative closest point, for example, could be considered as the backbone of many laser-based localization and mapping systems. Although they are widely used, it is a common challenge to compare registration solutions on a fair base. The main limitation is to overcome the lack of accurate ground truth in current da...
متن کاملCloud To Cloud Registration For 3d Point Data
Grant, Darion Shawn. Ph.D., Purdue University, December 2013. Cloud To Cloud Registration For 3D Point Data. Major Professors: James Bethel and Melba Crawford. The vast potential of digital representation of objects by large collections of 3D points is being recognized on a global scale and has given rise to the popularity of point cloud data (PCD). 3D imaging sensors provide a means for quickl...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملA Review of Point Cloud Registration Algorithms for Mobile Robotics
The topic of this review is geometric registration in robotics. Registration algorithms associate sets of data into a common coordinate system. They have been used extensively in object reconstruction, inspection, medical application, and localization of mobile robotics. We focus on mobile robotics applications in which point clouds are to be registered. While the underlying principle of those ...
متن کاملRegistration of multiple point sets
Registering 3D point sets subject to rigid body motion is a common problem in computer vision. The optimal transformation is usually specified to be the minimum of a weighted least squares cost. The case of 2 point sets has been solved by several authors using analytic methods such as SVD. In this paper we present a numerical method for solving the problem when there are more than 2 point sets....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Robotics Research
سال: 2012
ISSN: 0278-3649,1741-3176
DOI: 10.1177/0278364912458814