• Korean Journal of Computational Design and Engineering
• /
• v.12 no.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.

• Journal of Advanced Marine Engineering and Technology
• /
• v.2 no.1
• /
• pp.3-14
• /
• 1978

The authors have developed a calculating method of propeller shaft alignment by the finite element method. The propeller shaft is divided into finite elements which can be treated as uniform section bars. For each element, the nodal point equation is derived from the stiffness matrix, the external force vector and the section force vector. Then the overall nodal point equation is derived from the element nodal point equation. The deflection, offset, bending moment and shearing force of each nodal point are calculated from the overall nodal point equation by the digital computer. Reactions and deflections of supporting points of straight shaft are calculated and also the reaction influence number is derived. With the reaction influence number the optimum alignment condition that satisfies all conditions is calculated by the simplex method of linear programming. All results of calculation are compared with those of Det norske Veritas, which has developed a computor program based on the three-moment theorem of the strength of materials. The authors finite element method has shown good results and will be used effectively to design the propeller shaft alignment.

• Journal of the military operations research society of Korea
• /
• v.24 no.1
• /
• pp.146-156
• /
• 1998

Cholesky factorization is known to be inefficient to problems with dense column and network problems in interior point methods. We use the conjugate gradient method and preconditioners to improve the convergence rate of the conjugate gradient method. Several preconditioners were applied to LPABO 5.1 and the results were compared with those of CPLEX 3.0. The conjugate gradient method shows to be more efficient than Cholesky factorization to problems with dense columns and network problems. The incomplete Cholesky factorization preconditioner shows to be the most efficient among the preconditioners.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2585-2598
• /
• 2015

Hand posture recognition has played a very important role in Human Computer Interaction (HCI) and Computer Vision (CV) for many years. The challenge arises mainly due to self-occlusions caused by the limited view of the camera. In this paper, a robust hand posture recognition approach based on 3D point cloud from two RGB-D sensors (Kinect) is proposed to make maximum use of 3D information from depth map. Through noise reduction and registering two point sets obtained satisfactory from two views as we designed, a multi-viewed hand posture point cloud with most 3D information can be acquired. Moreover, we utilize the accurate reconstruction and classify each point cloud by directly matching the normalized point set with the templates of different classes from dataset, which can reduce the training time and calculation. Experimental results based on posture dataset captured by Kinect sensors (from digit 1 to 10) demonstrate the effectiveness of the proposed method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.4 s.235
• /
• pp.570-577
• /
• 2005

In this study a complete 3D surface reconstruction method is proposed based on the concept that the vertices of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.457-478
• /
• 2015

In this paper we propose an iteration hybrid method for approximating a point in the intersection of the solution-sets of pseudomonotone equilibrium and variational inequality problems and the fixed points of a semigroup-nonexpensive mappings in Hilbert spaces. The method is a combination of projection, extragradient-Armijo algorithms and Manns method. We obtain a strong convergence for the sequences generated by the proposed method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.06a
• /
• pp.3-4
• /
• 2007

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.422-424
• /
• 2021

In this paper, it leads the approach of fusing multiple RGB cameras for visual objects recognition based on deep learning with convolution neural network and 3D Light Detection and Ranging (LiDAR) to observe the environment and match into a 3D world in estimating the distance and position in a form of point cloud map. The goal of perception in multiple cameras are to extract the crucial static and dynamic objects around the autonomous vehicle, especially the blind spot which assists the AV to navigate according to the goal. Numerous cameras with object detection might tend slow-going the computer process in real-time. The computer vision convolution neural network algorithm to use for eradicating this problem use must suitable also to the capacity of the hardware. The localization of classified detected objects comes from the bases of a 3D point cloud environment. But first, the LiDAR point cloud data undergo parsing, and the used algorithm is based on the 3D Euclidean clustering method which gives an accurate on localizing the objects. We evaluated the method using our dataset that comes from VLP-16 and multiple cameras and the results show the completion of the method and multi-sensor fusion strategy.

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

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.13 no.3
• /
• pp.472-478
• /
• 1989

Using the SMC(sheet moulding compound) composite material consisting of E-glass chopped strand mat and unsaturated polyester resin, three-point bending tests are carried out to evaluate the elasto-plastic fracture toughness by means of R curve. The crack extension is experimentally observed with the ink staining method. The point of stable crack growth is discussed in consideration of the load-load point displacement curve, the damage behavior of the notch vicinity, and the R-curves. The damage zone of the notch vicinity was composed of the initiation and growth of subcracks as well as those of the main crack. The point of stable crack growth can be defined as the inflection point in the R curves and its point also concurrs with the proportional limit on the load-load point displacement curve.