• Title/Summary/Keyword: 2D LiDAR point cloud

Search Result 37, Processing Time 0.025 seconds

Analysis of Optimal Pathways for Terrestrial LiDAR Scanning for the Establishment of Digital Inventory of Forest Resources (디지털 산림자원정보 구축을 위한 최적의 지상LiDAR 스캔 경로 분석)

  • Ko, Chi-Ung;Yim, Jong-Su;Kim, Dong-Geun;Kang, Jin-Taek
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.2
    • /
    • pp.245-256
    • /
    • 2021
  • This study was conducted to identify the applicability of a LiDAR sensor to forest resources inventories by comparing data on a tree's position, height, and DBH obtained by the sensor with those by existing forest inventory methods, for the tree species of Criptomeria japonica in Jeolmul forest in Jeju, South Korea. To this end, a backpack personal LiDAR (Greenvalley International, Model D50) was employed. To facilitate the process of the data collection, patterns of collecting the data by the sensor were divided into seven ones, considering the density of sample plots and the work efficiency. Then, the accuracy of estimating the variables of each tree was assessed. The amount of time spent on acquiring and processing the data by each method was compared to evaluate the efficiency. The findings showed that the rate of detecting standing trees by the LiDAR was 100%. Also, the high statistical accuracy was observed in both Pattern 5 (DBH: RMSE 1.07 cm, Bias -0.79 cm, Height: RMSE 0.95 m, Bias -3.2 m), and Pattern 7 (DBH: RMSE 1.18 cm, Bias -0.82 cm, Height: RMSE 1.13 m, Bias -2.62 m), compared to the results drawn in the typical inventory manner. Concerning the time issue, 115 to 135 minutes per 1ha were taken to process the data by utilizing the LiDAR, while 375 to 1,115 spent in the existing way, proving the higher efficiency of the device. It can thus be concluded that using a backpack personal LiDAR helps increase efficiency in conducting a forest resources inventory in an planted coniferous forest with understory vegetation, implying a need for further research in a variety of forests.

Update of Digital Map by using The Terrestrial LiDAR Data and Modified RANSAC (수정된 RANSAC 알고리즘과 지상라이다 데이터를 이용한 수치지도 건물레이어 갱신)

  • Kim, Sang Min;Jung, Jae Hoon;Lee, Jae Bin;Heo, Joon;Hong, Sung Chul;Cho, Hyoung Sig
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.4
    • /
    • pp.3-11
    • /
    • 2014
  • Recently, rapid urbanization has necessitated continuous updates in digital map to provide the latest and accurate information for users. However, conventional aerial photogrammetry has some restrictions on periodic updates of small areas due to high cost, and as-built drawing also brings some problems with maintaining quality. Alternatively, this paper proposes a scheme for efficient and accurate update of digital map using point cloud data acquired by Terrestrial Laser Scanner (TLS). Initially, from the whole point cloud data, the building sides are extracted and projected onto a 2D image to trace out the 2D building footprints. In order to register the footprint extractions on the digital map, 2D Affine model is used. For Affine parameter estimation, the centroids of each footprint groups are randomly chosen and matched by means of a modified RANSAC algorithm. Based on proposed algorithm, the experimental results showed that it is possible to renew digital map using building footprint extracted from TLS data.

Estimation of the Reach-average Velocity of Mountain Streams Using Dye Tracing (염료추적자법을 이용한 산지하천의 구간 평균 유속 추정)

  • Tae-Hyun Kim;Jeman Lee;Chulwon Lee;Sangjun Im
    • Journal of Korean Society of Forest Science
    • /
    • v.112 no.3
    • /
    • pp.374-381
    • /
    • 2023
  • The travel time of flash floods along mountain streams is mainly governed by reach-average velocity, rather than by the point velocity of the locations of interest. Reach-average velocity is influenced by various factors such as stream geometry, streambed materials, and the hydraulic roughness of streams. In this study, the reach-average velocity in mountain streams was measured for storm periods using rhodamine dye tracing. The point cloud data obtained from a LiDAR survey was used to extract the average hydraulic roughness height, such as Ra, Rmax, and Rz. The size distribution of the streambed materials (D50, D84) was also considered in the estimation of the roughness height. The field experiments revealed that the reach-average velocities had a significant relationship with flow discharges (v = 0.5499Q0.6165 ), with an R2 value of 0.77. The root mean square error in the roughness height of the Ra-based estimation (0.45) was lower than those of the other estimations (0.47-1.04). Among the parameters for roughness height estimation, the Ra -based roughness height was the most reliable and suitable for developing the reach-average velocity equation for estimating the travel time of flood waves in mountain streams.

Application of 3D Chain Code for Object Recognition and Analysis (객체인식과 분석을 위한 3D 체인코드의 적용)

  • Park, So-Young;Lee, Dong-Cheon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.29 no.5
    • /
    • pp.459-469
    • /
    • 2011
  • There are various factors for determining object shape, such as size, slope and its direction, curvature, length, surface, angles between lines or planes, distribution of the model key points, and so on. Most of the object description and recognition methods are for the 2D space not for the 3D object space where the objects actually exist. In this study, 3D chain code operator, which is basically extension of 2D chain code, was proposed for object description and analysis in 3D space. Results show that the sequence of the 3D chain codes could be basis of a top-down approach for object recognition and modeling. In addition, the proposed method could be applicable to segment point cloud data such as LiDAR data.

An application of MMS in precise inspection for safety and diagnosis of road tunnel (도로터널에서 MMS를 이용한 정밀안전진단 적용 사례)

  • Jinho Choo;Sejun Park;Dong-Seok Kim;Eun-Chul Noh
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.26 no.2
    • /
    • pp.113-128
    • /
    • 2024
  • Items of road tunnel PISD (Precise Inspection for Safety and Diagnosis) were reviewed and analyzed using newly enhanced MMS (Mobile Mapping System) technology. Possible items with MMS can be visual inspection, survey and non-destructive test, structural analysis, and maintenance plan. The resolution of 3D point cloud decreased when the vehicle speed of MMS is too fast while the calibration error increased when it is too slow. The speed measurement of 50 km/h is determined to be effective in this study. Although image resolution by MMS has a limit to evaluating the width of crack with high precision, it can be used as data to identify the status of facilities in the tunnel and determine whether they meet disaster prevention management code of tunnel. 3D point cloud with MMS can be applicable for matching of cross-section and also possible for the variation of longitudinal survey, which can intuitively check vehicle clearance throughout the road tunnel. Compared with the measurement of current PISD, number of test and location of survey is randomly sampled, the continuous measurement with MMS for environment condition can be effective and meaningful for precise estimation in various analysis.

Implementation of File-referring Octree for Huge 3D Point Clouds (대용량 3차원 포인트 클라우드를 위한 파일참조 옥트리의 구현)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.2
    • /
    • pp.109-115
    • /
    • 2014
  • The aim of the study is to present a method to build an octree and to query from it for huge 3D point clouds of which volumes correspond or surpass the main memory, based on the memory-efficient octree developed by Han(2013). To the end, the method directly refers to 3D point cloud stored in a file on a hard disk drive instead of referring to that duplicated in the main memory. In addition, the method can save time to rebuild octree by storing and restoring it from a file. The memory-referring method and the present file-referring one are analyzed using a dataset composed of 18 million points surveyed in a tunnel. In results, the memory-referring method enormously exceeded the speed of the file-referring one when generating octree and querying points. Meanwhile, it is remarkable that a still bigger dataset composed of over 300 million points could be queried by the file-referring method, which would not be possible by the memory-referring one, though an optimal octree destination level could not be reached. Furthermore, the octree rebuilding method proved itself to be very efficient by diminishing the restoration time to about 3% of the generation time.

Enhancing Query Efficiency for Huge 3D Point Clouds Based on Isometric Spatial Partitioning and Independent Octree Generation (등축형 공간 분할과 독립적 옥트리 생성을 통한 대용량 3차원 포인트 클라우드의 탐색 효율 향상)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.5
    • /
    • pp.481-486
    • /
    • 2014
  • This study aims at enhancing the performance of file-referring octree, suggested by Han(2014), for efficiently querying huge 3D point clouds, acquired by the 3D terrestrial laser scanning. Han's method(2014) has revealed a problem of heavy declining in query speed, when if it was applied on a very long tunnel, which is the lengthy and narrow shaped anisometric structure. Hereupon, the shape of octree has been analyzed of its influence on the query efficiency with the testing method of generating an independent octree in each isometric subdivision of 3D object boundary. This method tested query speed and main memory usage against the conventional single octree method by capturing about 300 million points in a very long tunnel. Finally, the testing method resulted in which twice faster query speed is taking similar size of memory. It is also approved that the conclusive factor influencing the query speed is the destination level, but the query speed can still increase with more proximity to isometric bounding shape of octree. While an excessive unbalance of octree shape along each axis can heavily degrade the query speed, the improvement of octree shape can be more effectively enhancing the query speed than increasement of destination level.