• 한국정밀공학회지
• /
• 제23권11호
• /
• pp.93-102
• /
• 2006

In this study an advanced domain decomposition method is suggested in order to construct surface models from very large amount of points. In this method the spatial domain of interest that is occupied by the input set of points is divided in repetitive manner. First, the space is divided into smaller domains where the problem can be solved independently. Then each subdomain is again divided into much smaller domains where the problem can be solved locally. These local solutions of subdivided domains are blended together to obtain a solution of each subdomain using partition of unity function. Then the solutions of subdomains are merged together in order to construct whole surface model. The suggested methods are conceptually very simple and easy to implement. Since RDDM(Repetitive Domain Decomposition Method) is effective in the computation time and memory consumption, the present study is capable of providing a fast and accurate reconstructions of complex shapes from large amount of point data containing millions of points. The effectiveness and validity of the suggested methods are demonstrated by performing numerical experiments for the various types of point data.

• 한국정보통신학회논문지
• /
• 제23권11호
• /
• pp.1482-1484
• /
• 2019

We present a method for transmitting 3D object information in real time in a telepresence system. Three-dimensional object information consists of a large amount of point cloud data, which requires high performance computing power and ultra-wideband network transmission environment to process and transmit such a large amount of data in real time. In this paper, multiple users can transmit object motion and facial expression information in real time even in small network bands by using GANs (Generative Adversarial Networks), a non-supervised learning machine learning algorithm, for real-time transmission of 3D point cloud data. In particular, we propose the creation of an object similar to the original using only the feature information of 3D objects using conditional GANs.

• 한국CDE학회논문집
• /
• 제19권3호
• /
• pp.294-304
• /
• 2014

This paper presents a real-time rendering algorithm of large-scale geometric data using GLSL (OpenGL shading language). It details the VAO (vertex array object) and VBO(vertex buffer object) to be used for up-loading the large-scale point clouds and polygon meshes to a graphic video memory, and describes the shader program composed by a vertex shader and a fragment shader, which manipulates those large-scale data to be rendered by GPU. In addition, we explain the global rendering procedure that creates and runs the shader program with the VAO and VBO. Finally, a rendering performance will be measured with application examples, from which it will be demonstrated that the proposed algorithm enables a real-time rendering of large amount of geometric data, almost impossible to carry out by previous techniques.

• 한국CDE학회논문집
• /
• 제12권4호
• /
• pp.274-282
• /
• 2007

In this paper, a method of constructing a rectangular net from unorganized point cloud data is presented. In the method an implicit surface that fits the given point data is generated by using principal component analysis(PCA) and adaptive domain decomposition method(ADDM). Then a complete and quality rectangular net can be obtained by extracting voxel data from the implicit surface and projecting exterior faces of extracted voxels onto the implicit surface. The main advantage of the proposed method is that a quality rectangular net can be extracted from randomly scattered 3D points only without any further information. Furthermore the results of this works can be used to obtain many useful information including a slicing data, a solid STL model and a NURBS surface model in many areas involved in treatment of large amount of point data by proper processing of implicit surface and rectangular net generated previously.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• 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.

• Journal of Computational Design and Engineering
• /
• 제1권1호
• /
• pp.13-26
• /
• 2014

Recently, renovations of plant equipment have been more frequent because of the shortened lifespans of the products, and as-built models from large-scale laser-scanned data is expected to streamline rebuilding processes. However, the laser-scanned data of an existing plant has an enormous amount of points, captures intricate objects, and includes a high noise level, so the manual reconstruction of a 3D model is very time-consuming and costly. Among plant equipment, piping systems account for the greatest proportion. Therefore, the purpose of this research was to propose an algorithm which could automatically recognize a piping system from the terrestrial laser-scanned data of plant equipment. The straight portion of pipes, connecting parts, and connection relationship of the piping system can be recognized in this algorithm. Normal-based region growing and cylinder surface fitting can extract all possible locations of pipes, including straight pipes, elbows, and junctions. Tracing the axes of a piping system enables the recognition of the positions of these elements and their connection relationship. Using only point clouds, the recognition algorithm can be performed in a fully automatic way. The algorithm was applied to large-scale scanned data of an oil rig and a chemical plant. Recognition rates of about 86%, 88%, and 71% were achieved straight pipes, elbows, and junctions, respectively.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 추계학술발표대회
• /
• pp.355-356
• /
• 2011

LiDAR data is very large, which contains an amount of redundant information. The information not only takes up a lot of storage space but also brings much inconvenience to the LIDAR data transmission and application. Therefore, a simplified method was proposed for LiDAR data based on quad-tree structure in this paper. The boundary contour lines of the buildings are displayed as building extraction. Experimental results show that the method is efficient for point's simplification according to the rule of mapping.

• 동력기계공학회지
• /
• 제5권1호
• /
• pp.64-72
• /
• 2001

According to the regulation of IMO, oil discharge from ships is allowed under 15ppm only and an oil filtering equipment is essential. However, for large ships using heavy fuel oil of over S.G 0.98 and viscosity 380cSt and system oil, it has been in difficulty to process with existing filtering type of oily water separator. A parallel plate type oily water separator which is one of gravity type separators can be used as an assistant equipment for the oil filtering system to meet the present IMO standard of 15 ppm, because it is an efficient method in dealing with a large amount of rich oil with high specific gravity. This work is focused on the fundamental investigation of the performance of the plate type oily water separator by visualization method and PIV(Particle Image Velocimetry) measurement to acquire multi-point velocity data simultaneously. The experimental results showed that the space of the plates acts a significant role in separating process and it was found that an important point to minimize a vortex flow is to flow a large amount of fluid in space of the plates in order to promote the efficiency of separation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1089-1092
• /
• 1998

Conventional floating-point adders have one data-path that is used for all operations. This paper describes a floatingpoint adder eeveloped for low power consumption, which has three data-paths one of which is selected according to the exponent difference. The first is applied to the case that the absolute exponent difference (AED) of two operands is less than 1, and the second is for 1

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권3호
• /
• pp.459-470
• /
• 2013

The discovery of nearest neighbors, without training in advance, has many applications, such as the formation of mosaic images, image matching, image retrieval and image stitching. When the quantity of data is huge and the number of dimensions is high, the efficient identification of a nearest neighbor (NN) is very important. This study proposes a variation of the KD-tree - the arbitrary KD-tree (KDA) - which is constructed without the need to evaluate variances. Multiple KDAs can be constructed efficiently and possess independent tree structures, when the amount of data is large. Upon testing, using extended synthetic databases and real-world SIFT data, this study concludes that the KDA method increases computational efficiency and produces satisfactory accuracy, when solving NN problems.