• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.705-711
• /
• 2000

This paper presents a fast 3D mesh generation method using a surface based method with a stitching algorithm. This method uses the surface based method since the volume based method that uses 3D Delaunay triangulation can hardly deal with a large scale of scanned points. To reduce the processing time, this method also uses a stitching algorithm: after dividing the whole point data into several sections and performing mesh generation on individual sections, the meshes from several sections are stitched into one mesh. Stitching method prevents the surface based method from increasing the processing time exponentially as the number of the points increases. This method works well with different types of scanned points: a scattered type points from a conventional 3D scanner and a cross-sectional type from CT or MRI.

• Journal of Broadcast Engineering
• /
• v.26 no.5
• /
• pp.553-565
• /
• 2021

Point cloud is a set of points for representing a 3D object, and consists of geometric information, which is 3D coordinate information, and attribute information, which is information representing color, reflectance, and the like. In this way of expressing, it has a vast amount of data compared to 2D images. Therefore, a process of compressing the point cloud data in order to transmit the point cloud data or use it in various fields is required. Unlike color information corresponding to all 2D geometric information constituting a 2D image, a point cloud represents a point cloud including attribute information such as color in only a part of the 3D space. Therefore, separate processing of geometric information is also required. Based on these characteristics of point clouds, MPEG under ISO/IEC standardizes V-PCC, which imitates point cloud images and compresses them into 2D DCT-based 2D image compression codecs, as a compression method for high-density point cloud data. This has limitations in accurately representing 3D spatial information to proceed with compression by converting 3D point clouds to 2D, and difficulty in processing non-existent points when utilizing 3D DCT. Therefore, in this paper, we present 3D Discrete Cosine Transform-based Point Cloud Compression (3DCT PCC), a method to compress point cloud data, which is a 3D image by utilizing 3D DCT, and confirm the efficiency of 3D DCT compared to V-PCC based on 2D DCT.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1025-1034
• /
• 2022

In this paper, we propose a post-processing method through interpolation of hole regions that occur when extracting point clouds. When image matching is performed on stereo image data, holes occur due to occlusion and building façade area. This area may become an obstacle to the creation of additional products based on the point cloud in the future, so an effective processing technique is required. First, an initial point cloud is extracted based on the disparity map generated by applying stereo image matching. We transform the point cloud into a grid. Then a hole area is extracted due to occlusion and building façade area. By repeating the process of creating Triangulated Irregular Network (TIN) triangle in the hall area and processing the inner value of the triangle as the minimum height value of the area, it is possible to perform interpolation without awkwardness between the building and the ground surface around the building. A new point cloud is created by adding the location information corresponding to the interpolated area from the grid data as a point. To minimize the addition of unnecessary points during the interpolation process, the interpolated data to an area outside the initial point cloud area was not processed. The RGB brightness value applied to the interpolated point cloud was processed by setting the image with the closest pixel distance to the shooting center among the stereo images used for matching. It was confirmed that the shielded area generated after generating the point cloud of the target area was effectively processed through the proposed technique.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.6_2
• /
• pp.643-651
• /
• 2012

Object recognition belongs to high-level processing that is one of the difficult and challenging tasks in computer vision. Digital photogrammetry based on the computer vision paradigm has begun to emerge in the middle of 1980s. However, the ultimate goal of digital photogrammetry - intelligent and autonomous processing of surface reconstruction - is not achieved yet. Object recognition requires a robust shape description about objects. However, most of the shape descriptors aim to apply 2D space for image data. Therefore, such descriptors have to be extended to deal with 3D data such as LiDAR(Light Detection and Ranging) data obtained from ALS(Airborne Laser Scanner) system. This paper introduces extension of chain code to 3D object space with hierarchical approach for segmenting point cloud data. The experiment demonstrates effectiveness and robustness of the proposed method for shape description and point cloud data segmentation. Geometric characteristics of various roof types are well described that will be eventually base for the object modeling. Segmentation accuracy of the simulated data was evaluated by measuring coordinates of the corners on the segmented patch boundaries. The overall RMSE(Root Mean Square Error) is equivalent to the average distance between points, i.e., GSD(Ground Sampling Distance).

• Journal of Auto-vehicle Safety Association
• /
• v.14 no.2
• /
• pp.51-56
• /
• 2022

This paper presents an Ground Segmentation algorithm to eliminate unnecessary Lidar Point Cloud Data (PCD) in an autonomous driving system. We consider Random Sample Consensus (Ransac) Algorithm to process lidar ground data. Ransac designates inlier and outlier to erase ground point cloud and classified PCD into two parts. Test results show removal of PCD from ground area by distinguishing inlier and outlier. The paper validates ground rejection algorithm in real time calculating the number of objects recognized by ground data compared to lidar raw data and ground segmented data based on the z-axis. Ground Segmentation is simulated by Robot Operating System (ROS) and an analysis of autonomous driving data is constructed by Matlab. The proposed algorithm can enhance performance of autonomous driving as misrecognizing circumstances are reduced.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.252-265
• /
• 2000

In this thesis, the analysis of data processing method and the amount of computation in the whole geometry processing is conducted step by step. Floating-point ALU design is based on the characteristics of geometry processing operation. The performance of the devised ALU fitting with the geometry processing operation is analyzed by simulation after the description of the proposed ALU and geometry processor. The ALU designed in the paper can perform three types of floating-point operation simultaneously-addition/subtraction, multiplication, division. As a result, the 23.5% of improvement is achieved by that floating-point ALU for the whole geometry processing and in the floating-point division and square root operation, there is another 23% of performance gain with adding area-performance efficient SRT divisor.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.223-224
• /
• 2021

Recently, k-farthest neighbor (kFN) queries have not as much attention as k-nearest neighbor (kNN) queries. Therefore, this study considers moving k-farthest neighbor (MkFN) queries for spatial network databases. Given a positive integer k, a moving query point q, and a set of data points P, MkFN queries can constantly retrieve k data points that are farthest from the query point q. The challenge with processing MkFN queries in spatial networks is to avoid unnecessary or superfluous distance calculations between the query and associated data points. This study proposes a batch processing algorithm, called MOFA, to enable efficient processing of MkFN queries in spatial networks. MOFA aims to avoid dispensable distance computations based on the clustering of both query and data points. Moreover, a time complexity analysis is presented to clarify the effect of the clustering method on the query processing time. Extensive experiments using real-world roadmaps demonstrated the efficiency and scalability of the MOFA when compared with a conventional solution.

• Smart Structures and Systems
• /
• v.3 no.3
• /
• pp.373-384
• /
• 2007

For structural health monitoring (SHM) of civil infrastructures, displacement is a good descriptor of the structural behavior under all the potential disturbances. However, it is not easy to measure displacement of civil infrastructures, since the conventional sensors need a reference point, and inaccessibility to the reference point is sometimes caused by the geographic conditions, such as a highway or river under a bridge, which makes installation of measuring devices time-consuming and costly, if not impossible. To resolve this issue, a visionbased real-time displacement measurement system using digital image processing techniques is developed. The effectiveness of the proposed system was verified by comparing the load carrying capacities of a steel-plate girder bridge obtained from the conventional sensor and the present system. Further, to simultaneously measure multiple points, a synchronized vision-based system is developed using master/slave system with wireless data communication. For the purpose of verification, the measured displacement by a synchronized vision-based system was compared with the data measured by conventional contact-type sensors, linear variable differential transformers (LVDT) from a laboratory test.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2605-2608
• /
• 2003

This paper presents design and implementation methods of the real-time three dimensional tracking system of the gazing point. The proposed method is based on three dimensional data processing of eye images in the 3D world coordinates. The system hardware consists of two conventional CCD cameras for acquisition of stereoscopic image and computer for processing. And in this paper, the advantages of the proposed algorithm and test results ate described.

• Proceedings of the KIEE Conference
• /
• 2004.10a
• /
• pp.43-45
• /
• 2004

This paper represents the improvement of floating point operation for AC servo motor controller based on fixed point operation DSP. TMS320F2812 has fixed point operation processing structure. The controller parameters are modified to the digitized data by scaling the original parameters. TMS320F 2812 is a 32-bit processor, and it could have enough accuracy to get the digitized data this procedure is implemented and the experiments controling a AC servo system.