• Journal of Korea Multimedia Society
• /
• v.21 no.3
• /
• pp.342-347
• /
• 2018

We proposed a fast detection of copy-move image forgery using four step search algorithm in the spatial domain. In the four-step search algorithm, the search area is 21 (-10 ~ +10), and the number of pixels to be scanned is 33. Our algorithm reduced computational complexity more than conventional copy move image forgery methods. The proposed method reduced 92.34 % of computational complexity compare to exhaustive search algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.537-542
• /
• 2008

The protection against transient instability and consequent out-of-step condition is a major concern for the utility industry. Unstable system may cause serious damage to system elements such as generators and transmission lines. Therefore, out-of-step detection is essential to operate a system safely. Also, a multi-agent system is one that consists of a number of agents, which interact with one another. Multi-agent systems(MAS) can offer the flexibility and the adaptability to the previous algorithm. In this paper, the detection algorithm of out-of-step is designed by multi-agent system and implemented by EMTP-MODELS. To verify performance of the proposed algorithm based on multi-agent system, simulations by EMTP have been carried out.

• Smart Structures and Systems
• /
• v.15 no.1
• /
• pp.57-80
• /
• 2015

Extended Kalman Filter (EKF) has been widely used for structural identification and damage detection. However, conventional EKF approaches require that external excitations are measured. Also, in the conventional EKF, unknown structural parameters are included as an augmented vector in forming the extended state vector. Hence the sizes of extended state vector and state equation are quite large, which suffers from not only large computational effort but also convergence problem for the identification of a large number of unknown parameters. Moreover, such approaches are not suitable for intelligent structural damage detection due to the limited computational power and storage capacities of smart sensors. In this paper, a two-stage and two-step algorithm is proposed for the identification of structural damage as well as unknown external excitations. In stage-one, structural state vector and unknown structural parameters are recursively estimated in a two-step Kalman estimator approach. Then, the unknown external excitations are estimated sequentially by least-squares estimation in stage-two. Therefore, the number of unknown variables to be estimated in each step is reduced and the identification of structural system and unknown excitation are conducted sequentially, which simplify the identification problem and reduces computational efforts significantly. Both numerical simulation examples and lab experimental tests are used to validate the proposed algorithm for the identification of structural damage as well as unknown excitations for structural health monitoring.

• Steel and Composite Structures
• /
• v.25 no.4
• /
• pp.485-496
• /
• 2017

In this paper, damage detection has been introduced as an optimization problem and a two-step method has been proposed that can detect the location and severity of damage in truss structures precisely and reduce the volume of computations considerably. In the first step, using the residual force vector concept, the suspected damaged members are detected which will result in a reduction in the number of variables and hence a decrease in the search space dimensions. In the second step, the precise location and severity of damage in the members are identified using the genetic algorithm and the results of the first step. Considering the reduced search space, the algorithm can find the optimal points (i.e. the solution for the damage detection problem) with less computation cost. In this step, the Efficient Correlation Based Index (ECBI), that considers the structure's first few frequencies in both damaged and healthy states, is used as the objective function and some examples have been provided to check the efficiency of the proposed method; results have shown that the method is innovatively capable of detecting damage in truss structures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.600-619
• /
• 2015

We propose a cost-efficient hybrid algorithm for online location updates that efficiently combines feature point detection with the online trajectory-based sampling algorithm. Our algorithm is designed to minimize the average trajectory error with the minimal number of sample points. The algorithm is composed of 3 steps. First, we choose corner points from the map as sample points because they will most likely cause fewer trajectory errors. By employing the online trajectory sampling algorithm as the second step, our algorithm detects several missing and important sample points to prevent unwanted trajectory errors. The final step improves cost efficiency by eliminating redundant sample points on straight paths. We evaluate the proposed algorithm with real GPS trajectory data for various bus routes and compare our algorithm with the existing one. Simulation results show that our algorithm decreases the average trajectory error 28% compared to the existing one. In terms of cost efficiency, simulation results show that our algorithm is 29% more cost efficient than the existing one with real GPS trajectory data.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1692-1699
• /
• 2004

Many researchers have developed various techniques for detection of human faces in ordinary still images. Face detection is the first imperative step of human face recognition systems. The two main problems of human face detection are how to cutoff the running time and how to reduce the number of false positives. In this paper, we present frontal and near-frontal face detection algorithm in still gray images using a thick edge image and neural network. We have devised a new filter that gets the thick edge image. Our overall scheme for face detection consists of two main phases. In the first phase we describe how to create the thick edge image using the filter and search for face candidates using a whole face detector. It is very helpful in removing plenty of windows with non-faces. The second phase verifies for detecting human faces using component-based eye detectors and the whole face detector. The experimental results show that our algorithm can reduce the running time and the number of false positives.

• Journal of Korea Multimedia Society
• /
• v.19 no.6
• /
• pp.979-989
• /
• 2016

Traversable region detection is an essential step for advanced driver assistance systems and self-driving car systems, and it has been conducted by detecting lanes from input images. The performance can be unreliable, however, when the light condition is poor or there exist no lanes on the roads. To solve this problem, this paper proposes an algorithm which utilizes the information about the number of lanes and texture analysis. The proposed algorithm first specifies road region candidates by utilizing the number of lanes information. Among road region candidates, the road region is determined as the region in which texture is homogeneous and texture discontinuities occur around its boundaries. Traversable region is finally detected by dividing the estimated road region with the number of lanes information. This paper combines the proposed algorithm with a lane detection-based method to construct a system, and simulation results show that the system detects traversable region even on the road with poor light conditions or no lanes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.2
• /
• pp.227-232
• /
• 2018

In a Hough transform that is a representative algorithm for the straight line detection, a great number of edge pixels generated from noisy or complex images cause enormous amount of computation and pseudo straight lines. This paper proposes a two step straight line detection algorithm to improve the conventional Hough transform. In the first step, the proposed algorithm divides an image into non-overlapping blocks and detects the information related to the straight line of the edge pixels in the block using a principal component analysis (PCA). In the second step, it detects the straight lines by performing the Hough transform limited slope area to the pixels associated with the straight line. Simulation results show that the proposed algorithm reduces average of ${\rho}$ computation by 94.6% and prevents the pseudo straight lines although some additional computation is needed.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.151-159
• /
• 2010

Currently, by using the Internet, We can do varius things such as Web surfing, email, on-line shopping, stock trading on your home or office. However, as being out of the concept of security from the beginning, it is the big social issues that malicious user intrudes into the system through the network, on purpose to steal personal information or to paralyze system. In addition, network intrusion by ordinary people using network attack tools is bringing about big worries, so that the need for effective and powerful intrusion detection system becomes very important issue in our Internet environment. However, it is very difficult to prevent this attack perfectly. In this paper we proposed the algorithm for the detection of DoS attacks, and developed attack detection tools. Through learning in a normal state on Step 1, we calculate thresholds, the number of packets that are coming to each port, the median and the average utilization of each port on Step 2. And we propose values to determine how to attack detection on Step 3. By programing proposed attack detection algorithm and by testing the results, we can see that the difference between the median of packet mounts for unit interval and the average utilization of each port number is effective in detecting attacks. Also, without the need to look into the network data, we can easily be implemented by only using the number of packets to detect attacks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1316-1332
• /
• 2012

Formation flying is an important technology that enables high cost-effective organization of outer space aircrafts. The ad-hoc wireless network based on direct-sequence ultra-wideband (DS-UWB) techniques is seen as an effective means of establishing wireless communication links between aircrafts. In this paper, based on the theory of matched filter and error bits correction, a hybrid detection algorithm is proposed for realizing multiuser detection (MUD) when the DS-UWB technique is used in the ad-hoc wireless network. The matched filter is used to generate a candidate code set which may contain several error bits. The error bits are then recognized and corrected by an novel error-bit corrector, which consists of two steps: code mapping and clustering. In the former step, based on the modified optimum MUD decision function, a novel mapping function is presented that maps the output candidate codes into a feature space for differentiating the right and wrong codes. In the latter step, the codes are clustered into the right and wrong sets by using the K-means clustering approach. Additionally, in order to prevent some right codes being wrongly classified, a sign judgment method is proposed that reduces the bit error rate (BER) of the system. Compared with the traditional detection approaches, e.g., matched filter, minimum mean square error (MMSE) and decorrelation receiver (DEC), the proposed algorithm can considerably improve the BER performance of the system because of its high probability of recognizing wrong codes. Simulation results show that the proposed algorithm can almost achieve the BER performance of the optimum MUD (OMD). Furthermore, compared with OMD, the proposed algorithm has lower computational complexity, and its BER performance is less sensitive to the number of users.