• Title/Summary/Keyword: 3D Point Data

Search Result 1,128, Processing Time 0.029 seconds

A Basic Study on Trade-off Analysis of Downsampling for Indoor Point Cloud Data (실내 포인트 클라우드 데이터 Downsampling의 Trade-off 분석을 통한 기초 연구)

  • Kang, Nam-Woo;Oh, Sang-Min;Ryu, Min-Woo;Jung, Yong-Gil;Cho, Hun-hee
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2020.06a
    • /
    • pp.40-41
    • /
    • 2020
  • As the capacity of the 3d scanner developed, the reverse engineering using the 3d scanner is emphasized in the construction industry to obtain the 3d geometric representation of buildings. However, big size of the indoor point cloud data acquired by the 3d scanner restricts the efficient process in the reverse engineering. In order to solve this inefficiency, several pre-processing methods simplifying and denoising the raw point cloud data by the rough standard are developed, but these non-standard methods can cause the inaccurate recognition and removal the key-points. This paper analyzes the correlation between the accuracy of wall recognition and the density of the data, thus proposes the proper method for the raw point cloud data. The result of this study could improve the efficiency of the data processing phase in the reverse engineering for indoor point cloud data.

  • PDF

The Merging Method of Point Data with Point Pattern Matching in 3D Measurement (3차원 형상측정에서 점 패턴매칭을 이용한 점 데이터의 결합방법)

  • 조택동;이호영;양상민
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.9
    • /
    • pp.714-719
    • /
    • 2003
  • We propose a measuring method of large object using the pattern matching. It is hard and expensive to get the complete 3D data when the object is large and exceeds the limit of measuring devices. The large object is divided into several smaller areas and is scanned several times to get the data of all the pieces. These data are aligned to get the complete 3D data using the pattern matching method such as point pattern matching method and transform matrix algorithm. The laser slit beam and CCD camera are applied for the experimental measurement. Visual C++ on Windows 98 is implemented in processing the algorithm.

MMT based V3C data packetizing method (MMT 기반 V3C 데이터 패킷화 방안)

  • Moon, Hyeongjun;Kim, Yeonwoong;Park, Seonghwan;Nam, Kwijung;Kim, Kyuhyeon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2022.06a
    • /
    • pp.836-838
    • /
    • 2022
  • 3D Point Cloud는 3D 콘텐츠를 더욱 실감 나게 표현하기 위한 데이터 포맷이다. Point Cloud 데이터는 3차원 공간상에 존재하는 데이터로 기존의 2D 영상에 비해 거대한 용량을 가지고 있다. 최근 대용량 Point Cloud의 3D 데이터를 압축하기 위해 V-PCC(Video-based Point Cloud Compression)와 같은 다양한 방법이 제시되고 있다. 따라서 Point Cloud 데이터의 원활한 전송 및 저장을 위해서는 V-PCC와 같은 압축 기술이 요구된다. V-PCC는 Point Cloud의 데이터들을 Patch로써 뜯어내고 2D에 Projection 시켜 3D의 영상을 2D 형식으로 변환하고 2D로 변환된 Point Cloud 영상을 기존의 2D 압축 코덱을 활용하여 압축하는 기술이다. 이 V-PCC로 변환된 2D 영상은 기존 2D 영상을 전송하는 방식을 활용하여 네트워크 기반 전송이 가능하다. 본 논문에서는 V-PCC 방식으로 압축한 V3C 데이터를 방송망으로 전송 및 소비하기 위해 MPEG Media Transport(MMT) Packet을 만드는 패킷화 방안을 제안한다. 또한 Server와 Client에서 주고받은 V3C(Visual Volumetric Video Coding) 데이터의 비트스트림을 비교하여 검증한다.

  • PDF

Direct Finite Element Model Generation using 3 Dimensional Scan Data (3D SCAN DATA 를 이용한 직접유한요소모델 생성)

  • Lee Su-Young;Kim Sung-Jin;Jeong Jae-Young;Park Jong-Sik;Lee Seong-Beom
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.5 s.182
    • /
    • pp.143-148
    • /
    • 2006
  • It is still very difficult to generate a geometry model and finite element model, which has complex and many free surface, even though 3D CAD solutions are applied. Furthermore, in the medical field, which is a big growth area of recent years, there is no drawing. For these reasons, making a geometry model, which is used in finite element analysis, is very difficult. To resolve these problems and satisfy the requests of the need to create a 3D digital file for an object where none had existed before, new technologies are appeared recently. Among the recent technologies, there is a growing interest in the availability of fast, affordable optical range laser scanning. The development of 3D laser scan technology to obtain 3D point cloud data, made it possible to generate 3D model of complex object. To generate CAD and finite element model using point cloud data from 3D scanning, surface reconstruction applications have widely used. In the early stage, these applications have many difficulties, such as data handling, model creation time and so on. Recently developed point-based surface generation applications partly resolve these difficulties. However there are still many problems. In case of large and complex object scanning, generation of CAD and finite element model has a significant amount of working time and effort. Hence, we concerned developing a good direct finite element model generation method using point cloud's location coordinate value to save working time and obtain accurate finite element model.

Organizing Lidar Data Based on Octree Structure

  • Wang, Miao;Tseng, Yi-Hsing
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.150-152
    • /
    • 2003
  • Laser scanned lidar data record 3D surface information in detail. Exploring valuable spatial information from lidar data is a prerequisite task for its applications, such as DEM generation and 3D building model reconstruction. However, the inherent spatial information is implicit in the abundant, densely and randomly distributed point cloud. This paper proposes a novel method to organize point cloud data, so that further analysis or feature extraction can proceed based on a well organized data model. The principle of the proposed algorithm is to segment point cloud into 3D planes. A split and merge segmentation based on the octree structure is developed for the implementation. Some practical airborne and ground lidar data are tested for demonstration and discussion. We expect this data organization could provide a stepping stone for extracting spatial information from lidar data.

  • PDF

Point Cloud Video Codec using 3D DCT based Motion Estimation and Motion Compensation (3D DCT를 활용한 포인트 클라우드의 움직임 예측 및 보상 기법)

  • Lee, Minseok;Kim, Boyeun;Yoon, Sangeun;Hwang, Yonghae;Kim, Junsik;Kim, Kyuheon
    • Journal of Broadcast Engineering
    • /
    • v.26 no.6
    • /
    • pp.680-691
    • /
    • 2021
  • Due to the recent developments of attaining 3D contents by using devices such as 3D scanners, the diversity of the contents being used in AR(Augmented Reality)/VR(Virutal Reality) fields is significantly increasing. There are several ways to represent 3D data, and using point clouds is one of them. A point cloud is a cluster of points, having the advantage of being able to attain actual 3D data with high precision. However, in order to express 3D contents, much more data is required compared to that of 2D images. The size of data needed to represent dynamic 3D point cloud objects that consists of multiple frames is especially big, and that is why an efficient compression technology for this kind of data must be developed. In this paper, a motion estimation and compensation method for dynamic point cloud objects using 3D DCT is proposed. This will lead to switching the 3D video frames into I frames and P frames, which ensures higher compression ratio. Then, we confirm the compression efficiency of the proposed technology by comparing it with the anchor technology, an Intra-frame based compression method, and 2D-DCT based V-PCC.

Registration-free 3D Point Cloud Data Acquisition Technique for as-is BIM Generation Using Rotating Flat Mirrors

  • Li, Fangxin;Kim, Min-Koo;Li, Heng
    • International conference on construction engineering and project management
    • /
    • 2020.12a
    • /
    • pp.3-12
    • /
    • 2020
  • Nowadays, as-is BIM generation has been popularly adopted in the architecture, engineering, construction and facility management (AEC/FM) industries. In order to generate a 3D as-is BIM of a structural component, current methods require a registration process that merges different sets of point cloud data obtained from multiple locations, which is time-consuming and registration error-prone. To tackle this limitation, this study proposes a registration-free 3D point cloud data acquisition technique for as-is BIM generation. In this study, small-size mirrors that rotate in both horizontal and vertical direction are used to enable the registration-free data acquisition technique. First, a geometric model that defines the relationship among the mirrors, the laser scanner and the target component is developed. Second, determinations of optimal laser scanner location and mirror location are performed based on the developed geometrical model. To validate the proposed registration-free as-is BIM generation technique, simulation tests are conducted on key construction components including a PC slab and a structural wall. The result demonstrates that the registration-free point cloud data acquisition technique can be applicable in various construction elements including PC elements and structural components for as-is BIM generation.

  • PDF

Massive 3D Point Cloud Visualization by Generating Artificial Center Points from Multi-Resolution Cube Grid Structure (다단계 정육면체 격자 기반의 가상점 생성을 통한 대용량 3D point cloud 가시화)

  • Yang, Seung-Chan;Han, Soo Hee;Heo, Joon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.4
    • /
    • pp.335-342
    • /
    • 2012
  • 3D point cloud is widely used in Architecture, Civil Engineering, Medical, Computer Graphics, and many other fields. Due to the improvement of 3D laser scanner, a massive 3D point cloud whose gigantic file size is bigger than computer's memory requires efficient preprocessing and visualization. We suggest a data structure to solve the problem; a 3D point cloud is gradually subdivided by arbitrary-sized cube grids structure and corresponding point cloud subsets generated by the center of each grid cell are achieved while preprocessing. A massive 3D point cloud file is tested through two algorithms: QSplat and ours. Our algorithm, grid-based, showed slower speed in preprocessing but performed faster rendering speed comparing to QSplat. Also our algorithm is further designed to editing or segmentation using the original coordinates of 3D point cloud.

Segmentation and Classification of Lidar data

  • Tseng, Yi-Hsing;Wang, Miao
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.153-155
    • /
    • 2003
  • Laser scanning has become a viable technique for the collection of a large amount of accurate 3D point data densely distributed on the scanned object surface. The inherent 3D nature of the sub-randomly distributed point cloud provides abundant spatial information. To explore valuable spatial information from laser scanned data becomes an active research topic, for instance extracting digital elevation model, building models, and vegetation volumes. The sub-randomly distributed point cloud should be segmented and classified before the extraction of spatial information. This paper investigates some exist segmentation methods, and then proposes an octree-based split-and-merge segmentation method to divide lidar data into clusters belonging to 3D planes. Therefore, the classification of lidar data can be performed based on the derived attributes of extracted 3D planes. The test results of both ground and airborne lidar data show the potential of applying this method to extract spatial features from lidar data.

  • PDF

Pointwise CNN for 3D Object Classification on Point Cloud

  • Song, Wei;Liu, Zishu;Tian, Yifei;Fong, Simon
    • Journal of Information Processing Systems
    • /
    • v.17 no.4
    • /
    • pp.787-800
    • /
    • 2021
  • Three-dimensional (3D) object classification tasks using point clouds are widely used in 3D modeling, face recognition, and robotic missions. However, processing raw point clouds directly is problematic for a traditional convolutional network due to the irregular data format of point clouds. This paper proposes a pointwise convolution neural network (CNN) structure that can process point cloud data directly without preprocessing. First, a 2D convolutional layer is introduced to percept coordinate information of each point. Then, multiple 2D convolutional layers and a global max pooling layer are applied to extract global features. Finally, based on the extracted features, fully connected layers predict the class labels of objects. We evaluated the proposed pointwise CNN structure on the ModelNet10 dataset. The proposed structure obtained higher accuracy compared to the existing methods. Experiments using the ModelNet10 dataset also prove that the difference in the point number of point clouds does not significantly influence on the proposed pointwise CNN structure.