• The Journal of the Acoustical Society of Korea
• /
• v.22 no.3E
• /
• pp.124-132
• /
• 2003

We propose a new method for speech/non-speech classifiers based on concepts of the adaptive boosting (AdaBoost) algorithm in order to detect speech for robust speech recognition. The method uses a combination of simple base classifiers through the AdaBoost algorithm and a set of optimized speech features combined with spectral subtraction. The key benefits of this method are the simple implementation, low computational complexity and the avoidance of the over-fitting problem. We checked the validity of the method by comparing its performance with the speech/non-speech classifier used in a standard voice activity detector. For speech recognition purpose, additional performance improvements were achieved by the adoption of new features including speech band energies and MFCC-based spectral distortion. For the same false alarm rate, the method reduced 20-50% of miss errors.

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

In this paper, a new efficient algorithm for global motion estimation is proposed. This algorithm uses a previous 4-parameter model based global motion estimation algorithm and M-estimator for improving the accuracy and robustness of the estimate. The first algorithm uses the block based motion vector fields and which generates a coarse global motion parameters. And second algorithm is M-estimator technique for getting precise global motion parameters. This technique does not increase the computational complexity significantly, while providing good results in terms of estimation accuracy. In this work, an initial estimation for the global motion parameters is obtained using simple 4-parameter global motion estimation approach. The parameters are then refined using M-estimator technique. This combined algorithm shows significant reduction in mean compensation error and shows performance improvement over simple 4-parameter global motion estimation approach.

• Laser Solutions
• /
• v.13 no.2
• /
• pp.17-23
• /
• 2010

It is very important to track a complicate weld seam for the welding automation. Very recently, laser vision sensor becomes a useful sensing tool to find the seams. Until now, however studies of welding automation using a laser vision sensor, focused on either image processing or feature recognition from CCD camera. Even though it is possible to use a simple algorithm for tracking a simple seam, it is extremely difficult to develop a seam-tracking algorithm when the seam is more complex. To overcome these difficulties, this study introduces a simulation system to develop the seam tracking algorithm. This method was verified experimentally to reduce the time and effort to develop the seam tracking algorithm, and to implement the sensing device.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.263-268
• /
• 2001

In this paper, we present a new heuristic algorithm fur buffer allocation in FMS (Flexible Manufacturing System). It is conducted by using a genetic algorithm and simulation. First, we model the system by using a simulation software, \"Arena\". Then, we apply a genetic algorithm to achieve an optimal solution. VBA blocks, which are kinds of add-in functions in Arena, are used to connect Arena with the genetic algorithm. The system being modeled has seven workstations, one loading/unloading station, and three AGVs (Automated Guided Vehicle). Also it contains three products, which each have their own machining order and processing times. We experimented with two kinds of buffer allocation problems with a proposed heuristic algorithm, and we will suggest a simple heuristic approach based on processing times and workloads to validate our proposed algorithm. The first experiment is to find a buffer profile to achieve the maximum throughput using a finite number of buffers. The second experiment is to find the minimum number of buffers to achieve the desired throughput. End of this paper, we compare the result of a proposed algorithm with the result of a simple buffer allocation heuristic based on processing times and workloads. We show that the proposed algorithm increase the throughput by 7.2%.t by 7.2%.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.6
• /
• pp.675-682
• /
• 2010

The flood impact pressure acting on a vertical wall resulting from a dam-breaking problem is simulated using a navier-Stokes(N-S) solver. The N-S solver uses Eulerian Finite Volume Method(FVM) along with Volume Of Fluid(VOF) method for 2-D incompressible free surface flows. A Split Lagrangian Advection(SLA) scheme for VOF method is implemented in this paper. The SLA scheme is developed based on an algorithm of Piecewise Linear Interface Calculation(PLIC). The coupling between the continuity and momentum equations is affected by using a well-known Semi-Implicit Method for Pressure-Linked Equations (SIMPLE) algorithm. Several two-dimensional numerical simulations of the dam-breaking problem are presented to validate the accuracy and demonstrate the capability of the present algorithm. The significance of the time step and grid resolution are also discussed. The computational results are compared with experimental data and with computations by other numerical methods. The results showed a favorable agreement of water impact pressure as well as the global fluid motion.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1324-1342
• /
• 2020

Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.691-700
• /
• 1994

Voronoi diagram of a set of geometric entities on a plane such as points, line segments, or arcs is a collection of Voronoi polygons associated with each entity, where Voronoi polygon of an entity is a locus of point which is closer to the associated entity than any other entity. Voronoi diagram is one of the most fundamental geometrical construct and well-known for its theoretical elegance and the wealth of applications. Various geometric problems can be solved with the aid of Voronoi diagram. For example, the maximum tool diameter of a milling cutter for rough cutting in a pocket can be easily found, and the pocketing tool path can be efficiently generated from Voronoi diagram. In PCB design, the design rule checking can be easily done via Voronoi diagram, too. This paper discusses an algorithm to construct Voronoi diagram of a simple polygon which consists of simple curves such as line segments as well as arcs in a plane with O(nlogn) time complexity by employing the divide and conquer scheme.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1047-1065
• /
• 2022

For two dimensional lattices, a Gaussian basis achieves all two successive minima. For dimension larger than two, constructing a pairwise Gaussian basis is useful to compute short vectors of the lattice. For three dimensional lattices, Semaev showed that one can convert a pairwise Gaussian basis to a basis achieving all three successive minima by one simple reduction. A pairwise Gaussian basis can be obtained from a given basis by executing Gauss algorithm for each pair of basis vectors repeatedly until it returns a pairwise Gaussian basis. In this article, we prove a necessary and sufficient condition for a pairwise Gaussian basis to achieve the first k successive minima for three dimensional lattices for each k ∈ {1, 2, 3} by modifying Semaev's condition. Our condition directly checks whether a pairwise Gaussian basis contains the first k shortest independent vectors for three dimensional lattices. LLL is the most basic lattice basis reduction algorithm and we study how to use LLL to compute a pairwise Gaussian basis. For δ ≥ 0.9, we prove that LLL(δ) with an additional simple reduction turns any basis for a three dimensional lattice into a pairwise SV-reduced basis. By using this, we convert an LLL reduced basis to a pairwise Gaussian basis in a few simple reductions. Our result suggests that the LLL algorithm is quite effective to compute a basis with all three successive minima for three dimensional lattices.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.426-439
• /
• 1996

In this paper, we propose a simple algorithm to calculate the numbers of the passing cars by using an image processing sensor for the digital black and white images with 256 tone level. Shadow is one of the most troublesome factor in image processing. By differencing the tone level, we cannot discriminate between the body of the car and its shadow. In our proposed algorithm, the area of the shadow is excluded by recognizing the position of each traffic lane. For real-time operation and simple calculation, two lines of the tone level are extracted and the existences of cars are recognized. In the experimental application on a high-way, the recognition rate of the real-time operation is more than 94%.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.5
• /
• pp.1-8
• /
• 2018

This paper proposes a simple encryption technology for space-time block coding algorithm. Space-time block coding algorithm uses two antennas in transmitting data which consists of original data and transformed data for the purpose of combining in the receiver. This kind of two transmission antenna data could be exchanged and transmitted on each other's antenna individually, which can be used as a simple encryption algorithm. Encryption timing control informations should be shared between transmitter and receiver beforehand. It is shown that the proposed architecture can give performance enhancement compared with no encryption cases.