• Journal of the military operations research society of Korea
• /
• v.26 no.2
• /
• pp.8-27
• /
• 2000

This paper evaluates the performance of clustering algorithms in the determination of combat fatigues. Among clustering algorithms, GLVQ in neural clustering methods. and ISODATA algorithm are evaluated in this paper. In order to evaluate, this study used the data sets which showed the body measurement of Korean military personnel. For the comparison of the three methods, the coverage rate and fitness for combat fatigues are evaluated and the convergence of final standard sizes are considered. As a result, the mean of the coverage rate and fitness for combat fatigues obtained with the GLVQ are higher than those obtained with -Means and ISODATA algorithms.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.41-44
• /
• 2002

Blind source separation (BSS) is a fundamental problem that is encountered in many practical applications. In most existing methods, stationary sources are considered higher-order statistics is necessary either explicitly or implicitly. But, many natural signals are nonstationary, and it is possible to perform BSS using only second-order statistics. Our method is based on only second order statistics. The algorithms are developed using the gradient descent method in orthogonality constraint and their performance is confirmed by numerical experiments.

• Journal of Korea Multimedia Society
• /
• v.17 no.3
• /
• pp.294-299
• /
• 2014

In this paper, we propose a novel algorithm to improve the performance of a voice activity detection(VAD) which is based on the generalized normal-Laplace(GNL) distribution. In our algorithm, the probability density function(PDF) of the noisy speech signal is represented by the GNL distribution and the variance of the speech and noise of GNL distribution are estimated using higher order moments. Experimental results show that the proposed algorithm yields better results compared to the conventional VAD algorithms.

• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.51-58
• /
• 2005

Interpreting a natural line drawing as a solid object requires simplifying assumptions in order to make the problem more tractable. Unfortunately, some of the assumptions made in the past have overly simplified the problem. Restricting the valency of vertices, and in particular allowing only trihedral vertices, distorts the problem, since algorithms which are satisfactory for the simplified problem are not satisfactory in the general case. This paper presents a test set of drawings of objects with higher-valency vertices. The intention in creating this test set is that it may be used to determine how effective various algorithms are in dealing with general (i.e. unrestricted) valency vertices.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.345-357
• /
• 1998

This paper focuses on production planning and scheduling problems in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problems, that is, tardiness is not allowed. Since the planning problem is a higher-level decision making than the scheduling problem, the scheduling problem is solved using a production plan obtained by solving the planning problem. We suggest heuristic procedures in which aggregated information is used when the production planning problem is solved while more detailed information is used when the scheduling problem is solved. Since a feasible schedule may not be obtained from a production plan, an iterative approach is employed in the two procedures to obtain a solution that is feasible for both the production planning and scheduling problems. Computational tests on randomly generated test problems are done to show the performance of these algorithms, and results are reported.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.9
• /
• pp.2348-2360
• /
• 2023

As science and technology evolve, object detection of moving objects has been widely used in the context of machine learning and artificial intelligence. Traditional moving object detection algorithms, however, are characterized by relatively poor real-time performance and low accuracy in detecting moving objects. To tackle this issue, this manuscript proposes a modified Kalman filter algorithm, which aims to expand the equations of the system with the Taylor series first, ignoring the higher order terms of the second order and above, when the nonlinear system is close to the linear form, then it uses standard Kalman filter algorithms to measure the situation of the system. which can not only detect moving objects accurately but also has better real-time performance and can be employed to predict the trajectory of moving objects. Meanwhile, the accuracy and real-time performance of the algorithm were experimentally verified.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.1233-1243
• /
• 2015

The contrast enhancement is great challenge in the image processing when images are suffering from poor contrast problem. Therefore, in order to overcome this problem an automatic method is proposed for contrast enhancement of natural color images. The proposed method consist of two stages: in first stage lightness component in YIQ color space is normalized by sigmoid function after the adaptive histogram equalization is applied on Y component and in second stage automatic color contrast enhancement algorithm is applied on output of the first stage. The proposed algorithm is tested on different NASA color images, hyperspectral color images and other types of natural color images. The performance of proposed algorithm is evaluated and compared with the other existing contrast enhancement algorithms in terms of colorfulness metric and color enhancement factor. The higher values of colorfulness metric and color enhancement factor imply that the visual quality of the enhanced image is good. Simulation results demonstrate that proposed algorithm provides higher values of colorfulness metric and color enhancement factor as compared to other existing contrast enhancement algorithms. The proposed algorithm also provides better visual enhancement results as compared with the other existing contrast enhancement algorithms.

• Industrial Engineering and Management Systems
• /
• v.14 no.1
• /
• pp.11-21
• /
• 2015

The purpose of this research is to develop algorithms using the Differential Evolution Algorithm (DE) to solve a multi-objective, sources and stages location-allocation problem. The development process starts from the design of a standard DE, then modifies the recombination process of the DE in order improve the efficiency of the standard DE. The modified algorithm is called modified DE. The proposed algorithms have been tested with one real case study (large size problem) and 2 randomly selected data sets (small and medium size problems). The computational results show that the modified DE gives better solutions and uses less computational time than the standard DE. The proposed heuristics can find solutions 0 to 3.56% different from the optimal solution in small test instances, while differences are 1.4-3.5% higher than that of the lower bound generated by optimization software in medium and large test instances, while using more than 99% less computational time than the optimization software.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.209-212
• /
• 1996

In this paper, we propose to re-size images using an oblique projection operator instead of the orthogonal one in order to obtain faster, simpler, and more general algorithms. The main advantage is that it becomes perfectly feasible to use higher order models(e.g., splines of degree n 3). We develop the theoretical background and present a simple and practical implementation procedure that uses B-splines. Experiments show that the proposed algorithm consistently outperforms the standard interpolation method and that it essentially provides the same performance as the optimal procedure (least squares solution) with considerably less computations.