• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.707-720
• /
• 2014

This paper proposes a face tracking scheme that is a combination of a face detection algorithm and a face tracking algorithm. The proposed face detection algorithm basically uses the Adaboost algorithm, but the amount of search area is dramatically reduced, by using skin color and motion information in the depth map. Also, we propose a face tracking algorithm that uses a template matching method with depth information only. It also includes an early termination scheme, by a spiral search for template matching, which reduces the operation time with small loss in accuracy. It also incorporates an additional simple refinement process to make the loss in accuracy smaller. When the face tracking scheme fails to track the face, it automatically goes back to the face detection scheme, to find a new face to track. The two schemes are experimented with some home-made test sequences, and some in public. The experimental results are compared to show that they outperform the existing methods in accuracy and speed. Also we show some trade-offs between the tracking accuracy and the execution time for broader application.

• Journal of Korean Society for Quality Management
• /
• v.45 no.1
• /
• pp.25-38
• /
• 2017

Purpose: Hot strip rolling mill consists of a lot of mechanical and electrical units. In condition monitoring and diagnosis phase, various units could be failed with unknown reasons. In this study, we propose an effective method to detect early the units with abnormal status to minimize system downtime. Methods: The early warning problem with various units is defined. K-means and PAM algorithm with Euclidean and Manhattan distances were performed to detect the abnormal status. In addition, an performance of the proposed algorithm is investigated by field data analysis. Results: PAM with Manhattan distance(PAM_ManD) showed better results than K-means algorithm with Euclidean distance(K-means_ED). In addition, we could know from multivariate field data analysis that the system reliability of hot strip rolling mill can be increased by detecting early abnormal status. Conclusion: In this paper, clustering-based monitoring and fault detection algorithm using Manhattan distance is proposed. Experiments are performed to study the benefit of the PAM with Manhattan distance against the K-means with Euclidean distance.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.4
• /
• pp.1171-1181
• /
• 2014

Different power quality (PQ) disturbance sources can have major impacts on the power supply grid. This study proposes, for the first time, an early warning approach to identifying PQ problems and providing early warning prompts based on the monitored data of PQ disturbance sources. To establish a steady-state power quality early warning index system, the characteristics of PQ disturbance sources are analyzed and summed up. The higher order statistics anomaly detection (HOSAD) algorithm, based on skewness and kurtosis, and hierarchical power quality early warning flow, were then used to mine limit-exceeding and abnormal data and analyze their severity. Cases studies show that the proposed approach is effective and feasible, and that it is possible to provide timely power quality early warnings for limit-exceeding and abnormal data.

• Smart Structures and Systems
• /
• v.23 no.2
• /
• pp.107-122
• /
• 2019

As one of the most important parameters in structural health monitoring, structural frequency has many advantages, such as convenient to be measured, high precision, and insensitive to noise. In addition, frequency-change-ratio based method had been validated to have the ability to identify the damage occurrence and location. However, building a precise enough finite elemental model (FEM) for the test structure is still a huge challenge for this frequency-change-ratio based damage detection technique. In order to overcome this disadvantage and extend the application for frequencies in structural health monitoring area, a novel method was developed in this paper by combining the cross-model cross-mode (CMCM) model updating algorithm with the frequency-change-ratio based method. At first, assuming the physical parameters, including the element mass and stiffness, of the test structure had been known with a certain value, then an initial to-be-updated model with these assumed parameters was constructed according to the typical mass and stiffness distribution characteristic of shear buildings. After that, this to-be-updated model was updated using CMCM algorithm by combining with the measured frequencies of the actual structure when no damage was introduced. Thus, this updated model was regarded as a representation of the FEM model of actual structure, because their modal information were almost the same. Finally, based on this updated model, the frequency-change-ratio based method can be further proceed to realize the damage detection and localization. In order to verify the effectiveness of the developed method, a four-level shear building was numerically simulated and two actual shear structures, including a three-level shear model and an eight-story frame, were experimentally test in laboratory, and all the test results demonstrate that the developed method can identify the structural damage occurrence and location effectively, even only very limited modal frequencies of the test structure were provided.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.305-306
• /
• 2006

To avoid the large scale of damage when fire occurs in the tunnel, it is necessary to have a system to minimize the damage, and early discovery of the problem. In this paper, we have proposed algorithm using the image processing, which is the high-speed detection for the occurrence of fire or smoke in the tunnel. The fire detection is different to the forest fire detection as there are elements such as car and tunnel lightings and other variety of elements different from the forest environment. Therefore, an indigenous algorithm should be developed.The two algorithms proposed in this paper, are able to complement with each other and also they can detect the exact position, at the earlier stay of detection. In addition, by comparing properties of each algorithm throughout this experiment, we have proved the propriety of algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.177-183
• /
• 2007

Active queue management (AQM) refers to a family of packet dropping mechanisms for router queues that has been proposed to support end-to-end congestion control mechanisms in the Internet. The proposed AQM algorithm by the IETF is Random Early Detection (RED). The RED algorithm allows network operators simultaneously to achieve high throughput and low average delay. However. the resulting average queue length is quite sensitive to the level of congestion. In this paper, we propose the Refined Adaptive RED(RARED), as a solution for reducing the sensitivity to parameters that affect RED performance. Based on simulations, we observe that the RARED scheme improves overall performance of the network. In particular, the RARED scheme reduces packet drop rate and improves goodput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1085-1100
• /
• 2011

The Random Early Detection algorithm is widely used in the queue management mechanism of the router. We find that the parameters of the RED algorithm have a significant influence on the defense performance of the random early detection algorithm and discuss the robust of the algorithm in mitigating Low-rate Denial-of-Service attack in details. Simulation results show that the defense performance can be effectively improved by adjusting the parameters of $Q_{min}$ and $Q_{max}$. Some suggestions are given for mitigating the LDoS attack at the end of this paper.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.4
• /
• pp.59-70
• /
• 2008

In this paper, we proposed image processing technique for automatic real-time fire and smoke detection in tunnel environment. To avoid the large scale of damage of fire occurred in variety environments, it is purposeful to propose many studies to minimize and to discover the incident as fast as possible. But we need new specific algorithm because tunnel environment is quite different and it is difficult to apply previous fire detection algorithm to tunnel environment. Therefore, in this paper, we proposed specific algorithm which can be applied in tunnel environment. To minimize false detection in tunnel we used color and motion information. And it is possible to detect exact position in early stage with detection, test, verification procedures. In addition, by comparing properties of each algorithm throughout experiment, we have proved the validity and efficiency of proposed algorithm.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.695-700
• /
• 2005

To provide the fair rate and achieve the fair bandwidth allocation, many per-flow scheduling algorithms have been proposed such as fair queueing algorithm for congestion control. But these algorithms need to maintain the state, manage buffer and schedule packets on a per-flow basis; the complexity of these functions may prevent them from being cost-effectively implemented. In this paper, therefore, to acquire cost-effectively for implementation, we propose a CS-FNE(Core Stateless FNE) algorithm that is based on FM(Flow Number Estimation), and evaluated CS-FNE scheme together with CSFQ(Core Stateless Fair Queueing), FRED(Fair Random Early Detection), RED(Random Early Detection), and DRR(Dynamic Round Robin) in several different configurations and traffic sources. Through the simulation results, we showed that CS-FNE algorithm can allocate fair bandwidth approximately than other algorithms, and CS-FNE is simpler than many per-flow basis queueing mechanisms and it can be easily implemented.