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

• Journal of Advanced Marine Engineering and Technology
• /
• 제2권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.

• 한국국방경영분석학회지
• /
• 제24권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)
• /
• 제9권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.

• 대한기계학회논문집A
• /
• 제29권4호
• /
• 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
• /
• 제23권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• 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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2007년도 춘계학술대회 논문집
• /
• pp.3-4
• /
• 2007

• 방송공학회논문지
• /
• 제26권5호
• /
• pp.553-565
• /
• 2021

포인트 클라우드는 3D 오브젝트를 표현하기 위한 점들의 집합으로 3D 좌표 정보인 기하 정보와 색상, 반사율 등을 나타내는 속성 정보로 이루어져 있으며, 이러한 표현 방식으로 인해 2D 영상에 비해 방대한 양의 데이터를 가진다. 따라서, 포인트 클라우드 데이터를 전송하거나 다양한 분야에서 활용하기 위해서 포인트 클라우드 데이터를 압축하는 과정이 필수적으로 요구된다. 포인트 클라우드는 2D 영상과 같이 해당 영상을 구성하는 2D 기하 정보에 대응하는 색상 정보가 모두 존재하는 것과 달리, 3D 공간 중 일부만이 색상과 같은 속성 정보를 포함하여 포인트 클라우드를 표현하고 있기에, 기하 정보에 대한 별도의 처리도 요구된다. 이와 같은 포인트 클라우드의 특징을 기반으로 고밀도 포인트 클라우드 데이터의 압축 방안으로 국제 표준화 기구 ISO/IEC 산하 MPEG에서는 포인트 클라우드 영상을 사영한 뒤 2D DCT 기반의 2D 영상 압축 코덱으로 압축하는 V-PCC 를 표준화 중에 있다. 해당 표준은 3D 포인트 클라우드를 2D로 변환하여 압축을 진행하기에 3D 공간 정보를 정확하게 표현하기에는 한계가 존재한다. 이에, 본 논문에서는 포인트 클라우드 정지영상을 3D 상에서 3D DCT로 변환하여 포인트 클라우드 데이터를 압축하는 방안인 3D Discrete Cosine Transform based Point Cloud Compression을 제시하고, 2D DCT 기반의 V-PCC와 비교하여 3D DCT의 효율성을 확인하고자 한다.

• 대한기계학회논문집
• /
• 제13권3호
• /
• pp.472-478
• /
• 1989

본 연구에서는 FRP의 파괴인성평가를 위한 기초적인 자료를 얻기 위하여 FRP 중에서도 널리 사용되고 있는 SMC재를 준비하고 3점 굽힘시험을 실시하여 노치선단에서의 손상거동 및 균열진전저항유선으로부터 안정파괴개시점을 검토하였다.