• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.353-360
• /
• 2004

The study on scene change detection in the compressed MPEG videos has been done by various approaches. However, most of these approacher accomplished scene change detection by carrying out decoding processes and then by comparing pixels with pixels. This approach it not suitable for real time applications owing to much computing time of decoding processes. Recently, the study on scene change detection algorithms using only information of compressed domain is becoming Increasingly important. In this paper, we propose a sequential access method as an efficient scene change detection algorithm in the compressed domain. According to the type of pictures in the compressed MPEG video streams (divided in I-blocks and each I-block into P-blocks), the proposed algorithm provides effective scene change detection by applying sequential access and block by block mechanism. The proposed sequential access method provides fast and accurate detection operation by reducing checking procedures of unnecessary pictures due to molt of operations in compressed domain and checking by block units. Also, this approach uses optimal algorithm to provide fast and accurate detection operation.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1044-1049
• /
• 2000

In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has faster searching speed than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect searching time and searching precision. In this study, the whole moving pictures were primarily retrieved by the temporal sampling method. When there exist a scene change within the sampling interval, we suggested a fast searching algorithm using binary searching and derived an equation formula to determine optimal primary retrieval which can minimize computation, and showed the result of the experiment on MPEG moving pictures. The result of the experiment shows that the searching speed of the suggested algorithm is maximum 13 times faster than the one of he sequential searching method.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.1053-1066
• /
• 2005

In this paper we consider the problem of identifying and testing outliers in linear regression. First we consider the use of the so-called scale ratio tests for testing the null hypothesis of no outliers. This test is based on the ratio of two residual scale estimates. We show the asymptotic distribution of the test statistics and investigate its properties. Next we consider the problem of identifying the outliers. A forward sequential procedure using the suggested test is proposed. The new method is compared with classical procedure in the real data example. Unlike other forward procedures, the present one is unaffected by masking and swamping effects because the test statistic is based on robust scale estimate.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.419-424
• /
• 1999

In this paper, the comparison of the first order approximation schemes such as SLP (sequential linear programming), CONLIN(convex linearization), MMA(method of moving asymptotes) and the second order approximation scheme, SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore, when it is considered with the expense of computation, MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem, it was applied to the helicopter tail boom considering column buckling and local wall buckling constraints. It is concluded that MMA can be a very efficient approximation scheme from simple problems to complex problems.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.3
• /
• pp.272-281
• /
• 2009

In this paper, three-dimensional optimal evasive maneuver patterns for air-to-surface attack missiles against proportionally navigated anti-air defense missiles were investigated. An interception error of the defense missile is produced by an evasive maneuver of the attack missile. It is assumed that the defense missiles are continuously launched during the flight of attack missile. The performance index to be minimized is then defined as the negative square integral of the interception errors. The direct parameter optimization technique based on SQP and a co-evolution method based on the augmented Lagrangian formulation are adopted to get the attack missile's optimal evasive maneuver patterns. The overall shape of the resultant optimal evasive maneuver is represented as a deformed barrel-roll.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1219-1224
• /
• 2004

In this study the optimization of plate-fin type heat sink with vortex generator for thermal stability is conducted numerically. To acquire the optimal design variables, the CFD and mathematical optimization are integrated. The flow and thermal fields are predicted using the finite volume method. The optimization is carried out by means of the sequential quadratic programming (SQP) method. The results show that when the temperature rise is less than 40 K, the optimal design variables are as follows; $B_1=2.584mm$, $B_2=1.741mm$, and t = 7.914 mm. Comparing with the initial design, the temperature rise is reduced by 4.2 K, while the pressure drop is increased by 9.43 Pa. The Pareto optimal solutions are also presented between the pressure drop and the temperature rise.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.719-722
• /
• 1998

Fault simulation for large and complex sequential circuits is highly cpu-intensive task in the intergrated circuit design process. In this paper, we propose CM-SIM, a concurrent fault simulator which employs an optimal memory management strategy and simple list operations. CM-SIM removes inefficiencies and uses new dynamic memory management strategies, using contiguous array memory. Consequently, we got improved performance and reduced memory usage in concurrent fault simulation.

• Journal of Ocean Engineering and Technology
• /
• v.18 no.3
• /
• pp.32-39
• /
• 2004

A design procedure for a ship with minimum total resistance has been developed using a numerical optimization method called SQP(sequential quadratic programming) to search for different optimal hull forms. The frictional resistance has been estimated using the ITTC 1957 model-ship correlation line formula, and the wave resistance has been evaluated using a potential-flow panel method that is based on Rankine sources with nonlinear free surface boundary conditions. The geometry of a hull surface has been modified using B-spline surface patches, during the whole optimization process. The numerical analyses have been carried out for the modified Wilgey hull at three different speeds (Fn=0.25, 0.316, 0.408), and the calculation results were compared.

• Journal of the Korean Society for Precision Engineering
• /
• v.30 no.10
• /
• pp.1079-1086
• /
• 2013

Optimal mount position of a front pillar trim considering heat resistant characteristics can be determined by two methods. One is conventional approximate optimization method which uses the statistical design of experiments (DOE) and response surface method (RSM). Generally, approximated optimum results are obtained through the iterative process by a trial and error. The quality of results depends seriously on the factors and levels assigned by a designer. The other is a methodology derived from previous work by the authors, which is called sequential design of experiments (SDOE), to reduce a trial and error procedure and to find an appropriate condition for using artificial neural network (ANN) systematically. An appropriate condition is determined from the iterative process based on the analysis of means. With this new technique and ANN, it is possible to find an optimum design accurately and efficiently.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.2
• /
• pp.210-217
• /
• 1990

For the failure detection of dynamic systems, processing the residuals from the observer of the estimator is the most general method. A failure detection method which use an adaptive predictor to separate the effect of sensor failure from the additive noise in the residuals of a Kalman filter that is employed as an estimator of a dynamic system is addressed here. In the method, the property of the residuals of an optimal Kalman estimator is exploited. The simulation results of this method shows that the proposed method is superior to the sequential probability ratio test for a small failure magnitude.