• International Journal of Aeronautical and Space Sciences
• /
• 제14권4호
• /
• pp.369-378
• /
• 2013

This paper presents a vision/LiDAR integrated navigation system that provides accurate relative navigation performance on a general ground surface, in GNSS-denied environments. The considered ground surface during flight is approximated as a piecewise continuous model, with flat and slope surface profiles. In its implementation, the presented system consists of a strapdown IMU, and an aided sensor block, consisting of a vision sensor and a LiDAR on a stabilized gimbal platform. Thus, two-dimensional optical flow vectors from the vision sensor, and range information from LiDAR to ground are used to overcome the performance limit of the tactical grade inertial navigation solution without GNSS signal. In filter realization, the INS error model is employed, with measurement vectors containing two-dimensional velocity errors, and one differenced altitude in the navigation frame. In computing the altitude difference, the ground slope angle is estimated in a novel way, through two bisectional LiDAR signals, with a practical assumption representing a general ground profile. Finally, the overall integrated system is implemented, based on the extended Kalman filter framework, and the performance is demonstrated through a simulation study, with an aircraft flight trajectory scenario.

• 한국콘텐츠학회논문지
• /
• 제4권3호
• /
• pp.81-90
• /
• 2004

최근 컴퓨팅 환경의 급속한 발전으로 다양한 응용에서 다차원 데이터에 대한 활용이 증가되고 있다. 본 논문에서는 내용 기반 다차원 데이터 검색을 위한 벡터 관사 트리를 제안한다 제안하는 색인 구조는 공간 분할 방식과 벡터 근사화 기법을 이용하여 영역 정보를 표현하기 때문에 하나의 노드 안에 많은 영역 정보를 저장하여 트리의 높이를 감소시킨다 또한 다차원의 데이터 공간에 동적인 비트로 할당하여 다차원색인 구조의 문제점인 '차원의 저주 현상'을 해결한다. 또한 군집화된 데이터에 대해서 효과적인 표현 기법을 제공한다. 자식 노드의 영역 정보는 부모 노드를 기준으로 상대적으로 표현함으로서 좀더 정확한 영역을 표현할 수 있다. 제안하는 색인 구조의 우수성을 보이기 위해 실험을 통해 기존에 제안된 색인구조와의 비교 분석을 수행한다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권4호
• /
• pp.202-208
• /
• 2015

In this study, we propose a new inference algorithm for a multiclass Gaussian process classification model using a variational EM framework and the Laplace approximation (LA) technique. This is performed in two steps, called expectation and maximization. First, in the expectation step (E-step), using Bayes' theorem and the LA technique, we derive the approximate posterior distribution of the latent function, indicating the possibility that each observation belongs to a certain class in the Gaussian process classification model. In the maximization step, we compute the maximum likelihood estimators for hyper-parameters of a covariance matrix necessary to define the prior distribution of the latent function by using the posterior distribution derived in the E-step. These steps iteratively repeat until a convergence condition is satisfied. Moreover, we conducted the experiments by using synthetic data and Iris data in order to verify the performance of the proposed algorithm. Experimental results reveal that the proposed algorithm shows good performance on these datasets.

• 한국전산구조공학회논문집
• /
• 제23권6호
• /
• pp.659-665
• /
• 2010

The finite element method(FEM) is proven to be an effective approximate method of structural analysis if proper element types and meshes are chosen, and recently, the method is often applied to solve complex dynamic and nonlinear problems. A properly chosen element type and mesh yields reliable results for dynamic finite element structural analysis. However, dynamic behavior of a structure may include unpredictably large strains in some parts of the structure, and using the initial mesh throughout the duration of a dynamic analysis may include some elements to go through strains beyond the elements' reliable limits. Thus, the finite element mesh for a dynamic analysis must be dynamically adaptive, and considering the rapid process of analysis in real time, the dynamically adaptive finite element mesh generating schemes must be computationally efficient. In this paper, a computationally efficient dynamically adaptive finite element mesh generation scheme for dynamic analyses of structures is described. The concept of representative strain value is used for error estimates and the refinements of meshes use combinations of the h-method(node movement) and the r-method(element division). The shape coefficient for element mesh is used to correct overly distorted elements. The validity of the scheme is shown through a cantilever beam example under a concentrated load with varying values. The example shows reasonable accuracy and efficient computing time. Furthermore, the study shows the potential for the scheme's effective use in complex structural dynamic problems such as those under seismic or erratic wind loads.

• 대한화학회지
• /
• 제10권4호
• /
• pp.175-180
• /
• 1966

Polarography에 의한 反應速度測定法 은 여러가지가 있고 또 많이 硏究되어 왔다. 그러나 그의 應用은 그렇게 많지 않으며, 본 실本 實驗에서는 Delabay의 圖解法과 Koutecky式을 利用하여 몇 가지 ion의 陰極反應速度를 求하고 이들 Data를 써서 簡易速度式을 檢討하였다.

• 대한조선학회논문집
• /
• 제35권1호
• /
• pp.1-14
• /
• 1998

2차원 천수방정식에 기초한 조류계산 수치모델을 개발하였다. 복잡한 해안선의 입력을 단순화할 수 있는 직각격자를 사용하였으며, 방정식은 효율이 뛰어난 것으로 알려져 있는 인수분해음해법(Implicit Factorization Method)에 의하여 수치적으로 풀었다. 대류항은 상류차분법으로 처리하여 수치소산이 자동적으로 들어가도록 하였으며, 따라서 수치불안정에 의한 발산을 억제할 수 있었다. 모델의 검증을 위하여 선형화된 천수방정식을 풀고 계산결과를 해석해와 비교하였으며 잘 일치하고 있음을 확인하였다. 수치모델의 응용 예로서 인천항부근의 경인운하 개발예정인 수로에서의 조류 계산결과를 보였다.

• 대한기계학회논문집A
• /
• 제30권9호
• /
• pp.1062-1069
• /
• 2006

Reduction schemes approximate the lower eigenvalues that represent the global behavior of the structures. But, they are not efficient to be applied to large-scaled problems because these schemes require considerable amount of computing time in constructing reduced one from the original large-scaled systems. In addition, the selection of the primary degrees of freedom might be localized to cause the excessive emphasis of the lower mode or lost of the important modes. In the present study, a new reduction method combined with the subdomain method is proposed. For the construction of the final reduced system the system of each domain subdivided into primary, slave and interface degrees of freedom. It is remarkably efficient and accurate comparable to full-scale system. Numerical examples demonstrate that the proposed method saves computational cost effectively and provides a reduced system which predicts accurate eigen-pairs of global system.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(I)
• /
• pp.311-315
• /
• 1987

In this paper an efficient algorithm to estimate the volume and surface area and the reconstruction algorithm for 3-dimensional graphics are presented. The graph theory is used to estimate the optimal quantitative factors. To improve the computing efficiency, the algorithm to get proper contour points is performed by applying several tolerances. The search and the given arc cost is limited according to the change of curvature of the cross-sectional contour. For mathematical model, these algorithms for volume estimation based on polyhedral approximation are applied to the selected optimal surface. The results show that the values of the volume and surface area for tolerances 1.0005, 1.001 and 1.002 approximate to values for tolerances 1.000 resulting in small errors. The reconstructed three-dimensional images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increasing.

• Journal of Information Processing Systems
• /
• 제10권1호
• /
• pp.23-35
• /
• 2014

Recently, novel application areas in digital geometry processing, such as simulation, dynamics, and medical surgery simulations, have necessitated the representation of not only the surface data but also the interior volume data of a given 3D object. In this paper, we present an efficient framework for the shape approximations of spherical solid objects based on trivariate B-splines. To do this, we first constructed a smooth correspondence between a given object and a unit solid cube by computing their harmonic mapping. We set the unit solid cube as a rectilinear parametric domain for trivariate B-splines and utilized the mapping to approximate the given object with B-splines in a coarse-to-fine manner. Specifically, our framework provides user-controllability of shape approximations, based on the control of the boundary condition of the harmonic parameterization and the level of B-spline fitting. Experimental results showed that our method is efficient enough to compute trivariate B-splines for several models, each of whose topology is identical to a solid sphere.

• Journal of Computing Science and Engineering
• /
• 제1권2호
• /
• pp.211-232
• /
• 2007

In this paper we investigate some issues and solutions related to the design of a Data Warehouse (DW), storing several aggregate measures about trajectories of moving objects. First we discuss the loading phase of our DW which has to deal with overwhelming streams of trajectory observations, possibly produced at different rates, and arriving in an unpredictable and unbounded way. Then, we focus on the measure presence, the most complex measure stored in our DW. Such a measure returns the number of distinct trajectories that lie in a spatial region during a given temporal interval. We devise a novel way to compute an approximate, but very accurate, presence aggregate function, which algebraically combines a bounded amount of measures stored in the base cells of the data cube. We conducted many experiments to show the effectiveness of our method to compute such an aggregate function. In addition, the feasibility of our innovative trajectory DW was validated with an implementation based on Oracle. We investigated the most challenging issues in realizing our trajectory DW using standard DW technologies: namely, the preprocessing and loading phase, and the aggregation functions to support OLAP operations.