مدل‌سازی صفحه‌ای محیط‌های داخلی با استفاده از تصاویر RGB-D

In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in finding and rescuing missions. With recent advances, mobile robots are used in hazardous missions such as radioactive areas or collapsing buildings. Having the environment’s map beforehand can boost efficiency and effectiveness of the mission. In order to digitize the environment, several 3D scans are needed. However, these scans should be merged according to a global coordination system to create a correct, consistent model. This process is called image registration. If the robot with 3D scanner is able to accurately localize itself, the registration can be done directly by robots pose. However, due to imprecise robot sensors, self-localization is error prone. Therefore, the geometric structure of overlapping 3D scans is considered. In order to registering various points sets, Iterative Closest Point (ICP) algorithm is used. ICP is the most common approach to align point clouds in two consecutive image frames. This algorithm uses a point to point approach. RGB and depth images which are captured by Kinect are used in this study. In order to reducing data points and performing faster 3D map creation, depth images are converted to point clouds and then segmentation is done according to image planes. For this purpose RGB images are segmented by region growing segmentation algorithm. In this algorithm, the image was initially over segmented. This algorithm uses stack data structure and Euclidean distance in Lab color space to segment the image. Euclidean distance in Lab color space describes the resemblance of two colors to each other. In this algorithm, the aim is to label each pixel to a segment. To this end, each unlabeled pixels Euclidean distance to its neighboring mean color is checked to be within a threshold. For over-segmentation, if the distance satisfies the smaller threshold, the more pixels will be merged to the segment. Afterwards a plane was fit to each segment. After segmentation, each segment should be represented by a plane. Eventually, the segments were merged based on the product of normal vectors and plane fitting error criteria. After segmentation, planes were fit to the new segments again. A given number of points were generated on the plane. ICP algorithm was executed on these points and transfer and rotation matrices were obtained. Generating points on the plane results in fewer points. Therefore, the points were reduced and algorithms performance was increased. The results show that the proposed method increases the speed up to 55 and 91 percent in consecutive and non-consecutive frames on average, respectively.