• 한국멀티미디어학회논문지
• /
• 제21권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.

• 전기학회논문지
• /
• 제57권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
• /
• 제15권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
• /
• 제25권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)
• /
• 제9권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.

• 한국멀티미디어학회논문지
• /
• 제7권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.

• 한국멀티미디어학회논문지
• /
• 제19권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.

• 한국정보통신학회논문지
• /
• 제22권2호
• /
• pp.227-232
• /
• 2018

직선 검출을 위한 대표적인 알고리즘인 허프 변환에서 잡음이 있거나 복잡한 영상에서 생성되는 방대한 에지 화소들은 상당한 계산량과 의사직선을 야기한다. 본 논문은 기존 허프변환을 개선하기 위해 2 단계 직선 검출 알고리즘을 제안한다. 첫 번째 단계에서 제안된 알고리즘은 영상을 겹치지 않는 블록들로 나누고, 주성분 분석(PCA)을 이용해 블록 내 에지 화소들의 직선과 관련된 정보를 검출한다. 두 번째 단계에서 직선과 관련된 화소들에 기울기 제한된 허프변환을 수행하여 직선들을 검출한다. 모의실험 결과들은 제안된 알고리즘이 부가적인 계산이 다소 필요하지만 불필요한 에지 화소들을 줄이고 기울기 영역을 제한하여 ${\rho}$ 계산의 평균 94.6% 줄여주고 의사직선 검출을 방지하는 것을 보여주고 있다.

• 한국시뮬레이션학회논문지
• /
• 제19권4호
• /
• pp.151-159
• /
• 2010

인터넷은 이제 일상생활에서 떼어놓을 수 없는 생활의 일부가 되었다. 그러나 인터넷은 애초에 보안의 개념 없이 만들어졌기 때문에 악의적인 사용자가 네트워크를 통해 시스템에 침투하여 시스템을 마비시키거나 개인정보를 탈취하는 문제들이 커다란 사회적 이슈가 되고 있다. 또한 최근 평범한 일반 사람들도 네트워크 공격 툴 사용으로 인한 DoS 공격이 가능해짐에 따라 인터넷 환경에서 큰 위협을 주고 있다. 그러므로 효율적이고 강력한 공격 탐지 시스템이 인터넷 환경에서 매우 중요하게 되었다. 그러나 이러한 공격을 완벽하게 막아내는 것은 매우 어려운 일이다. 본 논문에서는 DoS 공격의 탐지를 위한 알고리즘을 제안하고, 이를 이용한 공격탐지도구를 제시한다. 먼저 정상상태에서의 학습단계를 거쳐서, 학습된 임계치 허용량, 각 포트로 유입되는 패킷의 개수, 중간값 그리고 각 포트별 평균사용률을 계산하고, 이 값을 바탕으로 공격탐지가 이루어지는 3단계 판별 방법을 제안하였다. 제안한 방법에 맞는 공격 탐지 도구를 제작하여 실험을 하였으며, 그 결과 각 포트별 평균사용률과 단위 시간당 패킷량 중간값의 차이와 학습된 임계치 허용량의 비교는 공격 탐지에 효율적임을 알 수 있다. 또한 네트워크 데이터를 들여다 볼 필요 없이, 패킷의 개수만을 이용하여 공격을 탐지함으로써 간단히 구현할 수 있음을 알 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권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.