• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.4
• /
• pp.285-294
• /
• 2007

In this paper, we investigate a novel online estimation algorithm for dynamic Bayesian network(DBN) parameters, given as conditional probabilities. We sequentially update the parameter adjustment rule based on observation data. We apply our algorithm to two well known representations of DBNs: to a first-order Markov Chain(MC) model and to a Hidden Markov Model(HMM). A sliding window allows efficient adaptive computation in real time. We also examine the stochastic convergence and stability of the learning algorithm.

• Journal of the Korean Society of Visualization
• /
• v.4 no.1
• /
• pp.31-40
• /
• 2006

In this study a newly designed electro-osmotic micro-mixer is proposed. This study is composed of a channel and metal electrodes attached locally on the side wall surface ultimately to control the mixing effect. To obtain the flow patterns, numerical computation was performed by using a commercial code, CFD-ACE. The fluid-flow solutions are the cast into studying the characteristics of stirring in terms of the mixing index. It was shown that the local control of the electric potential can indeed contribute to the enhancement of mixing effect.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.4
• /
• pp.471-480
• /
• 2004

A estimating capability of software effort, duration and cost is based on accurate size estimate of the software to be developed. A simplified function point (FP) approach to software size estimation is described, which first skip the computation step for value adjustment factor, thus directly obtaining final adjusted FP from unadjusted FP. The research seeks suitable models based on statistical regression models in the context of case study based on 783 software projects. The approach also are built for subsets of projects using new development, enhancement and re-development types.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.47-65
• /
• 1998

We consider a multiperiod capacity planning problem for determining a mix of flexible and dedicated capacities under budget restriction. These capacities are controlled by purchasing flexible machines and/or new dedicated machines and disposing old dedicated machines. Acquisition and replacement schedules are determined and operations are assigned to the flexible or dedicated machines for the objective of minimizing the sum of discounted costs of acquisition and operation of flexible machines, new dedicated machines, and old dedicated machines. In this research, the Problem is formulated as a mixed integer linear Program and solved by a Lagrangian relaxation approach. A subgradient optimization method is employed to obtain lower bounds and a multiplier adjustment method is devised to improve the bounds. We develop a linear programming based Lagrangian heuristic algorithm to find a good feasible solution of the original problem. Results of tests on randomly generated test problems show that the algorithm gives relatively good solutions in a reasonable amount of computation time.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.103-107
• /
• 2009

This paper presents how to minimize the second-order cone programming problem occurring in the 3D reconstruction of multiple views. The $L_{\infty}$-norm minimization is done by a series of the minimization of the maximum infeasibility. Since the problem has many inequality constraints, we have to adopt methods of the interior point algorithm, in which the inequalities are sequentially approximated by log-barrier functions. An initial feasible solution is found easily by the construction of the problem. Actual computing is done by an iterative Newton-style update. When we apply the interior point method to the problem of reconstructing the structure and motion, every Newton update requires to solve a very large system of linear equations. We show that the sparse bundle-adjustment technique can be utilized in the same way during the Newton update, and therefore we obtain a very efficient computation.

• 한국연소학회:학술대회논문집
• /
• 2006.04a
• /
• pp.181-188
• /
• 2006

Operation parameters for large scale industrial facility such as iron making plant are carefully selected through elaborate tests and monitoring rather than through a mathematical modeling. One of the recent progresses for better energy utilization in iron ore sintering process is the distribution pattern of fuel inside a macro particle which is formed with fines of iron ore, coke and limestone. Results of model tests which have been used as a basis for the improved operation in the field are introduced and a theoretical modeling study is presented to supplement the experiment-based approach with fundamental arguments of physical modeling, which enables predictive computation beyond the limited region of tests and adjustment. A single fuel particle model along with one-dimensional bed combustion model of solid particles are utilized, and thermal processes of combustion and heat transfer are found to be dominant consideration in the discussions of productivity and energy utilization in the sintering process.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.277-280
• /
• 2010

LSP(Line Spectrum Pairs) Parameter is used for speech analysis in vocoders or recognizers since it has advantages of constant spectrum sensitivity, low spectrum distortion and easy linear interpolation. However the method of transforming LPC(Linear Predictive Coding) into LSP is so complex that it takes much time to compute. Among conventional methods, the real root method is considerably simpler than others, but nevertheless, it still suffers from its indeterministic computation time because the root searching is processed sequentially in frequency region. We suggest a method of reducing the LSP transformation time using voice characteristics.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.1 no.2
• /
• pp.16-22
• /
• 1983

The method of least squares is an adequate method of adjustment in various fields of engineering where redundant observations are necessary to obtain accurate values. The Consideration of weight of each Observation can improve the accuracy if the reliabilities of observations vary. The strip coordinates were weighted as inversely proportionate to the rotations $\kappa, \varphi, \omega$ which occur in the computation of model coordinates. The resulting errors in absolute coordinates were compared with the errors unweighted case to investigate the influence of orientation elements on absolute coordinates.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.5
• /
• pp.467-474
• /
• 2019

In this paper, we propose a novel method to improve FPS while maintaining the accuracy of YOLO v2 model in NVIDIA Jetson TX1. In general, in order to reduce the amount of computation, a conversion to an integer operation or reducing the depth of a network have been used. However, the accuracy of recognition can be deteriorated. So, we use methods to reduce computation and memory consumption through adjustment of the filter size and integrated computation of the network The first method is to replace the $3{\times}3$ filter with a $1{\times}1$ filter, which reduces the number of parameters to one-ninth. The second method is to reduce the amount of computation through CBR (Convolution-Add Bias-Relu) among the inference acceleration functions of TensorRT, and the last method is to reduce memory consumption by integrating repeated layers using TensorRT. For the simulation results, although the accuracy is decreased by 1% compared to the existing YOLO v2 model, the FPS has been improved from the existing 3.9 FPS to 11 FPS.

• Journal of Korean Society for Geospatial Information Science
• /
• v.7 no.2 s.14
• /
• pp.143-153
• /
• 1999

GIS have become easier to use and very popular. In recent year digital photogrammetric systems ire becoming cost-effective tools to build and update GIS databases. In close-range photogrammetry for the acquisition of geospatial data, the bundle adjustment needs both initial approximate values and control points to solve the exterior orientation parameters. This paper gives a review of applied and potential algorithms for estimating Initial approximate values before the bundle adjustment, develope new algorithms for determine the exterior orientation parameters, and gives a cost-effective methods for close-range digital photogrammetric system Modifications of existing DLT algorithm were made in this study for providing an efficient, economic, and more accurate photogrammetric data reduction technique. These modifications include robust approaches for automatic detection and elimination of all lands of gross errors in the measurement data, and incorporation of GPS to reduce the number of control points necessary for a DLT solution. Also, this paper derives a new method for space resection from a monocular image. A major advantage of proposed method is that the solution can be uniquely and analytically determined without initial approximate values of exterior orientation parameters and without iterative computation.