• Title/Summary/Keyword: Point cloud registration

Search Result 50, Processing Time 0.027 seconds

Real-time 3D Volumetric Model Generation using Multiview RGB-D Camera (다시점 RGB-D 카메라를 이용한 실시간 3차원 체적 모델의 생성)

  • Kim, Kyung-Jin;Park, Byung-Seo;Kim, Dong-Wook;Kwon, Soon-Chul;Seo, Young-Ho
    • Journal of Broadcast Engineering
    • /
    • v.25 no.3
    • /
    • pp.439-448
    • /
    • 2020
  • In this paper, we propose a modified optimization algorithm for point cloud matching of multi-view RGB-D cameras. In general, in the computer vision field, it is very important to accurately estimate the position of the camera. The 3D model generation methods proposed in the previous research require a large number of cameras or expensive 3D cameras. Also, the methods of obtaining the external parameters of the camera through the 2D image have a large error. In this paper, we propose a matching technique for generating a 3D point cloud and mesh model that can provide omnidirectional free viewpoint using 8 low-cost RGB-D cameras. We propose a method that uses a depth map-based function optimization method with RGB images and obtains coordinate transformation parameters that can generate a high-quality 3D model without obtaining initial parameters.

An Enhanced Privacy-Aware Authentication Scheme for Distributed Mobile Cloud Computing Services

  • Xiong, Ling;Peng, Daiyuan;Peng, Tu;Liang, Hongbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.6169-6187
    • /
    • 2017
  • With the fast growth of mobile services, Mobile Cloud Computing(MCC) has gained a great deal of attention from researchers in the academic and industrial field. User authentication and privacy are significant issues in MCC environment. Recently, Tsai and Lo proposed a privacy-aware authentication scheme for distributed MCC services, which claimed to support mutual authentication and user anonymity. However, Irshad et.al. pointed out this scheme cannot achieve desired security goals and improved it. Unfortunately, this paper shall show that security features of Irshad et.al.'s scheme are achieved at the price of multiple time-consuming operations, such as three bilinear pairing operations, one map-to-point hash function operation, etc. Besides, it still suffers from two minor design flaws, including incapability of achieving three-factor security and no user revocation and re-registration. To address these issues, an enhanced and provably secure authentication scheme for distributed MCC services will be designed in this work. The proposed scheme can meet all desirable security requirements and is able to resist against various kinds of attacks. Moreover, compared with previously proposed schemes, the proposed scheme provides more security features while achieving lower computation and communication costs.

3D Reconstruction of an Indoor Scene Using Depth and Color Images (깊이 및 컬러 영상을 이용한 실내환경의 3D 복원)

  • Kim, Se-Hwan;Woo, Woon-Tack
    • Journal of the HCI Society of Korea
    • /
    • v.1 no.1
    • /
    • pp.53-61
    • /
    • 2006
  • In this paper, we propose a novel method for 3D reconstruction of an indoor scene using a multi-view camera. Until now, numerous disparity estimation algorithms have been developed with their own pros and cons. Thus, we may be given various sorts of depth images. In this paper, we deal with the generation of a 3D surface using several 3D point clouds acquired from a generic multi-view camera. Firstly, a 3D point cloud is estimated based on spatio-temporal property of several 3D point clouds. Secondly, the evaluated 3D point clouds, acquired from two viewpoints, are projected onto the same image plane to find correspondences, and registration is conducted through minimizing errors. Finally, a surface is created by fine-tuning 3D coordinates of point clouds, acquired from several viewpoints. The proposed method reduces the computational complexity by searching for corresponding points in 2D image plane, and is carried out effectively even if the precision of 3D point cloud is relatively low by exploiting the correlation with the neighborhood. Furthermore, it is possible to reconstruct an indoor environment by depth and color images on several position by using the multi-view camera. The reconstructed model can be adopted for interaction with as well as navigation in a virtual environment, and Mediated Reality (MR) applications.

  • PDF

Development of robot calibration method based on 3D laser scanning system for Off-Line Programming (오프라인 프로그래밍을 위한 3차원 레이저 스캐닝 시스템 기반의 로봇 캘리브레이션 방법 개발)

  • Kim, Hyun-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.3
    • /
    • pp.16-22
    • /
    • 2019
  • Off-line programming and robot calibration through simulation are essential when setting up a robot in a robot automation production line. In this study, we developed a new robot calibration method to match the CAD data of the production line with the measurement data on the site using 3D scanner. The proposed method calibrates the robot using 3D point cloud data through Iterative Closest Point algorithm. Registration is performed in three steps. First, vertices connected by three planes are extracted from CAD data as feature points for registration. Three planes are reconstructed from the scan point data located around the extracted feature points to generate corresponding feature points. Finally, the transformation matrix is calculated by minimizing the distance between the feature points extracted through the ICP algorithm. As a result of applying the software to the automobile welding robot installation, the proposed method can calibrate the required accuracy to within 1.5mm and effectively shorten the set-up time, which took 5 hours per robot unit, to within 40 minutes. By using the developed system, it is possible to shorten the OLP working time of the car body assembly line, shorten the precision teaching time of the robot, improve the quality of the produced product and minimize the defect rate.

Point Cloud Registration using Feature Point (특징점을 사용한 포인트 클라우드 정합)

  • Kim, Kyung Jin;Park, Byung Seo;Kim, Dong Wook;Seo, Young Ho
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2019.11a
    • /
    • pp.219-220
    • /
    • 2019
  • 본 논문에서는 특징점 기반의 포인트 클라우드 정합 알고리즘을 제안한다. 컴퓨터 비전 분야에서 각각 다른 카메라에서 획득한 데이터를 하나의 통합된 데이터로 정합하는 문제에 많은 관심을 두고 있다. 기존의 방법들은 큰 오차를 가지고 있거나 많은 카메라 대수나 고가의 RGB-D 카메라를 필요로 한다. 본 논문에서는 깊이 카메라에서 얻은 깊이 영상과 색상 영상을 이용하고 함수 최적화 알고리즘을 적용해 저가의 RGB-D 카메라 8대를 이용하여 오차가 적은 포인트 클라우드 정합 방법을 제안한다.

  • PDF

3D Multi-floor Precision Mapping and Localization for Indoor Autonomous Robots (실내 자율주행 로봇을 위한 3차원 다층 정밀 지도 구축 및 위치 추정 알고리즘)

  • Kang, Gyuree;Lee, Daegyu;Shim, Hyunchul
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.1
    • /
    • pp.25-31
    • /
    • 2022
  • Moving among multiple floors is one of the most challenging tasks for indoor autonomous robots. Most of the previous researches for indoor mapping and localization have focused on singular floor environment. In this paper, we present an algorithm that creates a multi-floor map using 3D point cloud. We implement localization within the multi-floor map using a LiDAR and an IMU. Our algorithm builds a multi-floor map by constructing a single-floor map using a LOAM-based algorithm, and stacking them through global registration that aligns the common sections in the map of each floor. The localization in the multi-floor map was performed by adding the height information to the NDT (Normal Distribution Transform)-based registration method. The mean error of the multi-floor map showed 0.29 m and 0.43 m errors in the x, and y-axis, respectively. In addition, the mean error of yaw was 1.00°, and the error rate of height was 0.063. The real-world test for localization was performed on the third floor. It showed the mean square error of 0.116 m, and the average differential time of 0.01 sec. This study will be able to help indoor autonomous robots to operate on multiple floors.

3D City Modeling Using Laser Scan Data

  • Kim, Dong-Suk;Lee, Kwae-Hi
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.505-507
    • /
    • 2003
  • This paper describes techniques for the automated creation of geometric 3D models of the urban area us ing two 2D laser scanners and aerial images. One of the laser scanners scans an environment horizontally and the other scans vertically. Horizontal scanner is used for position estimation and vertical scanner is used for building 3D model. Aerial image is used for registration with scan data. Those models can be used for virtual reality, tele-presence, digital cinematography, and urban planning applications. Results are shown with 3D point cloud in urban area.

  • PDF

Resampling Method to Improve Performance of Point Cloud Registration (포인트 클라우드 정합 성능 향상을 위한 리샘플링 방법)

  • Kim, Jongwook;Park, Jong-Il
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.11a
    • /
    • pp.187-189
    • /
    • 2020
  • 본 논문에서는 포인트 클라우드 정합 성능 향상을 위해 기하적 복잡도가 낮은 정점들의 영향을 최소화하는 포인트 클라우드 리샘플링 방법을 제안한다. 3 차원 특징 기술자(3D feature descriptor)를 기반으로 하는 포인트 클라우드 정합은 정점 법선 벡터의 변화량을 특징으로 사용한다. 따라서 강건한 특징은 대부분 정점 법선 벡터의 변화량이 큰 영역에서 추출된다. 반면에 정점 법선 벡터의 변화량이 거의 없는 평면 영역은 정합 수행 시에 이상점(outlier)으로 작용할 수 있으므로 해당 정점들이 정합 과정에 미치는 영향을 최소화해야 한다. 제안하는 방법은 모델 포인트 클라우드의 기하적 복잡도를 고려한 리샘플링을 통해 전체 정점의 수 대비 복잡도가 낮은 정점들의 비율을 낮추어 이상점이 정합 과정에 미치는 영향을 최소화하고 정합 성능을 향상시켰다.

  • PDF

Non-rigid Point-Cloud Contents Registration Method used Local Similarity Measurement (부분 유사도 측정을 사용한 비 강체 포인트 클라우드 콘텐츠 정합 방법)

  • Lee, Heejea;Yun, Junyoung;Park, Jong-Il
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2022.06a
    • /
    • pp.829-831
    • /
    • 2022
  • 포인트 클라우드 콘텐츠는 움직임이 있는 콘텐츠를 연속된 프레임에 3 차원 위치정보와 대응하는 색상으로 기록한 데이터이다. 강체 포인트 클라우드 데이터를 정합하기 위해서는 고전적인 방법이지만 강력한 ICP 정합 알고리즘을 사용한다. 그러나 국소적인 모션 벡터가 있는 비 강체 포인트 클라우드 콘텐츠는 기존의 ICP 정합 알고리즘을 통해서는 프레임 간 정합이 불가능하다. 본 논문에서는 비 강체 포인트 클라우드 콘텐츠를 지역적 확률 모델을 사용하여 프레임 간 포인트의 쌍을 맺고 개별 포인트 간의 모션벡터를 구해 정합 하는 방법을 제안한다. 정합 대상의 데이터를 2 차원 투영을 하여 구조화시키고 정합 할 데이터를 투영하여 후보군 포인트를 선별한다. 선별된 포인트에서 깊이 값 비교와 좌표 및 색상 유사도를 측정하여 적절한 쌍을 찾아준다. 쌍을 찾은 후 쌍으로 모션 벡터를 더하여 정합을 수행하면 비 강체 포인트 클라우드 콘텐츠 데이터에 대해서도 정합이 가능해진다.

  • PDF

Registration of Three-Dimensional Point Clouds Based on Quaternions Using Linear Features (선형을 이용한 쿼터니언 기반의 3차원 점군 데이터 등록)

  • Kim, Eui Myoung;Seo, Hong Deok
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.38 no.3
    • /
    • pp.175-185
    • /
    • 2020
  • Three-dimensional registration is a process of matching data with or without a coordinate system to a reference coordinate system, which is used in various fields such as the absolute orientation of photogrammetry and data combining for producing precise road maps. Three-dimensional registration is divided into a method using points and a method using linear features. In the case of using points, it is difficult to find the same conjugate point when having different spatial resolutions. On the other hand, the use of linear feature has the advantage that the three-dimensional registration is possible by using not only the case where the spatial resolution is different but also the conjugate linear feature that is not the same starting point and ending point in point cloud type data. In this study, we proposed a method to determine the scale and the three-dimensional translation after determining the three-dimensional rotation angle between two data using quaternion to perform three-dimensional registration using linear features. For the verification of the proposed method, three-dimensional registration was performed using the linear features constructed an indoor and the linear features acquired through the terrestrial mobile mapping system in an outdoor environment. The experimental results showed that the mean square root error was 0.001054m and 0.000936m, respectively, when the scale was fixed and if not fixed, using indoor data. The results of the three-dimensional transformation in the 500m section using outdoor data showed that the mean square root error was 0.09412m when the six linear features were used, and the accuracy for producing precision maps was satisfied. In addition, in the experiment where the number of linear features was changed, it was found that nine linear features were sufficient for high-precision 3D transformation through almost no change in the root mean square error even when nine linear features or more linear features were used.