AUTOMATED COARSE REGISTRATION OF POINT CLOUDS IN 3D URBAN SCENES USING VOXEL BASED PLANE CONSTRAINT

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Plane-based Coarse Registration of 3d Point Clouds with 4d Models

The accurate registration of 3D point clouds with project 3D/4D models is becoming more and more important with the development of BIM and 3D laser scanning, for which the registration in a common coordinate system is critical to project control. While robust solutions for scan-model fine registration already exist, they rely on a fairly accurate prior coarse registration. This paper first show...

متن کامل

Automatic Registration of Approximately Leveled Point Clouds of Urban Scenes

Registration of point clouds is a necessary step to obtain a complete overview of scanned objects of interest. The majority of the current registration approaches target the general case where a full range of the registration parameters search space is assumed and searched. It is very common in urban objects scanning to have leveled point clouds with small roll and pitch angles and with also a ...

متن کامل

Segmentation Based Classification of 3D Urban Point Clouds: A Super-Voxel Based Approach with Evaluation

Segmentation and classification of urban range data into different object classes have several challenges due to certain properties of the data, such as density variation, inconsistencies due to missing data and the large data size that require heavy computation and large memory. A method to classify urban scenes based on a super-voxel segmentation of sparse 3D data obtained from LiDAR sensors ...

متن کامل

Automated registration of multi-view point clouds using sphere targets

This paper addresses the problem of automated registration of multi-view point clouds generated by a 3D scanner using sphere targets. First, sphere targets are detected from each point cloud. The centroids of the detected targets in each point cloud are then used for rough registration. Congruent triangles are computed from the centroids for the correspondence among them, with which a rigid bod...

متن کامل

Automatic registration of overlapping 3D point clouds using closest points

While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent the state of the art technique for the automatic registration of overlapping free form shapes. They both have a time complexity of O(n). While the former has a space complexity also of O(n), the latter has a space compl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences

سال: 2017

ISSN: 2194-9050

DOI: 10.5194/isprs-annals-iv-2-w4-185-2017