• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.5
• /
• pp.437-442
• /
• 2015

Recently, the size of point cloud is increasing rapidly with the high advancement of 3D terrestrial laser scanners. The study aimed for improving a file-referring octree, introduced in the preceding study, which had been intended to generate an octree and to query points from a large point cloud, gathered by 3D terrestrial laser scanners. To the end, every leaf node of the octree was designed to store only one file-pointer of its first point. Also, the point cloud file was re-constructed to store points sequentially, which belongs to a same leaf node. An octree was generated from a point cloud, composed of about 300 million points, while time was measured during querying proximate points within a given distance with series of points. Consequently, the present method performed better than the preceding one from every aspect of generating, storing and restoring octree, so as querying points and memorizing usage. In fact, the query speed increased by 2 times, and the memory efficiency by 4 times. Therefore, this method has explicitly improved from the preceding one. It also can be concluded in that an octree can be generated, as points can be queried from a huge point cloud, of which larger than the main memory.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.1
• /
• pp.174-192
• /
• 2021

The LIDAR sensor, which provides higher cognitive performance than cameras and radar, is difficult to apply to ADAS or autonomous driving because of its high price. On the other hand, as the price is decreasing rapidly, expectations are rising to improve existing autonomous driving functions by taking advantage of the LIDAR sensor. In level 3 autonomous vehicles, when a dangerous situation in the cognitive module occurs due to a sensor defect or sensor limit, the driver must take control of the vehicle for manual driving. If the driver does not respond to the request, the system must automatically kick in and implement a minimum risk maneuver to maintain the risk within a tolerable level. In this study, based on this background, a LIDAR-based LKS MRM algorithm was developed for the case when the normal operation of LKS was not possible due to troubles in the cognitive system. From point cloud data collected by LIDAR, the algorithm generates the trajectory of the vehicle in front through object clustering and converts it to the target waypoints of its own. Hence, if the camera-based LKS is not operating normally, LIDAR-based path tracking control is performed as MRM. The HAZOP method was used to identify the risk sources in the LKS cognitive systems. B, and based on this, test scenarios were derived and used in the validation process by simulation. The simulation results indicated that the LIDAR-based LKS MRM algorithm of this study prevents lane departure in dangerous situations caused by various problems or difficulties in the LKS cognitive systems and could prevent possible traffic accidents.

• 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.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.2
• /
• pp.111-119
• /
• 2013

It is essential and fundamental to extract boundary information of target object via massive three-dimensional point data acquired from laser scanner. Especially extracting boundary information of manmade features such as buildings is quite important because building is one of the major components consisting complex contemporary urban area, and has artificially defined shape. In this research, extended ${\chi}$-algorithm using geometry information of point data was proposed to extract boundary information of building from three-dimensional point data consisting building. The proposed algorithm begins with composing Delaunay triangulation process for given points and removes edges satisfying specific conditions process. Additionally, to make whole boundary extraction process efficient, we used Sweep-hull algorithm for constructing Delaunay triangulation. To verify the performance of the proposed extended ${\chi}$-algorithm, we compared the proposed algorithm with Encasing Polygon Generating Algorithm and ${\alpha}$-Shape Algorithm, which had been researched in the area of feature extraction. Further, the extracted boundary information from the proposed algorithm was analysed against manually digitized building boundary in order to test accuracy of the result of extracting boundary. The experimental results showed that extended ${\chi}$-algorithm proposed in this research proved to improve the speed of extracting boundary information compared to the existing algorithm with a higher accuracy for detecting boundary information.