• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1998년도 학술발표대회 논문집 제17권 1호
• /
• pp.213-216
• /
• 1998

This paper proposes improved algorithm for multi-user detection in DS-CDMA. Each of algorithm is based on CMA algorithm. Improved LMS-CMS and LMAD-CMA are combined to macthed filter. Simulations results shown that Improved LMAD-CMA algorithm has a higher capacity than MOE in steady-state convergence properties.

• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1008-1014
• /
• 2020

Aiming at the defect detection quality of denim fabric, this paper designs an improved algorithm based on the optimized Gabor filter. Firstly, we propose an improved defect detection algorithm of jean fabric based on the maximum two-dimensional image entropy and the loss evaluation function. Secondly, 24 Gabor filter banks with 4 scales and 6 directions are created and the optimal filter is selected from the filter banks by the one-dimensional image entropy algorithm and the two-dimensional image entropy algorithm respectively. Thirdly, these two optimized Gabor filters are compared to realize the common defect detection of denim fabric, such as normal texture, miss of weft, hole and oil stain. The results show that the improved algorithm has better detection effect on common defects of denim fabrics and the average detection rate is more than 91.25%.

• 한국인터넷방송통신학회논문지
• /
• 제21권3호
• /
• pp.81-89
• /
• 2021

자연 조건에서 Apple 감지에는 가림 문제와 작은 대상 감지 어려움이 있다. 본 논문은 SSD 기반의 개선 된 모델을 제안한다. SSD 백본 네트워크 VGG16은 ResNet50 네트워크 모델로 대체되고 수용 필드 구조 RFB 구조가 도입되었다. RFB 모델은 작은 표적의 특징 정보를 증폭하고 작은 표적의 탐지 정확도를 향상시킨다. 유지해야 하는 정보를 필터링하기 위해 주의 메커니즘 (SE)과 결합하면 감지 대상의 의미 정보가 향상된다. 향상된 SSD 알고리즘은 VOC2007 데이터 세트에 대해 학습된다. SSD에 비해 개선 된 알고리즘은 폐색 및 작은 표적 탐지의 정확도를 3.4 % 및 3.9 % 향상 시켰다. 이 알고리즘은 오 탐지율과 누락된 감지율을 향상 시켰다. 본 논문에서 제안한 개선 된 알고리즘은 더 높은 효율성을 갖는다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5574-5591
• /
• 2017

Inspired by the idea of Artificial Immune System, many researches of wireless sensor network (WSN) intrusion detection is based on the artificial intelligent system (AIS). However, a large number of generated detectors, black hole, overlap problem of NSA have impeded further used in WSN. In order to improve the anomaly detection performance for WSN, detector generation mechanism need to be improved. Therefore, in this paper, a Differential Evolution Constraint Multi-objective Optimization Problem based Negative Selection Algorithm (DE-CMOP based NSA) is proposed to optimize the distribution and effectiveness of the detector. By combining the constraint handling and multi-objective optimization technique, the algorithm is able to generate the detector set with maximized coverage of non-self space and minimized overlap among detectors. By employing differential evolution, the algorithm can reduce the black hole effectively. The experiment results show that our proposed scheme provides improved NSA algorithm in-terms, the detectors generated by the DE-CMOP based NSA more uniform with less overlap and minimum black hole, thus effectively improves the intrusion detection performance. At the same time, the new algorithm reduces the number of detectors which reduces the complexity of detection phase. Thus, this makes it suitable for intrusion detection in WSN.

• Journal of Information Processing Systems
• /
• 제12권3호
• /
• pp.502-510
• /
• 2016

Considering video copy transform diversity, a multi-feature video copy detection algorithm based on a Speeded-Up Robust Features (SURF) local descriptor is proposed in this paper. Video copy coarse detection is done by an ordinal measure (OM) algorithm after the video is preprocessed. If the matching result is greater than the specified threshold, the video copy fine detection is done based on a SURF descriptor and a box filter is used to extract integral video. In order to improve video copy detection speed, the Hessian matrix trace of the SURF descriptor is used to pre-match, and dimension reduction is done to the traditional SURF feature vector for video matching. Our experimental results indicate that video copy detection precision and recall are greatly improved compared with traditional algorithms, and that our proposed multiple features algorithm has good robustness and discrimination accuracy, as it demonstrated that video detection speed was also improved.

• Smart Structures and Systems
• /
• 제21권2호
• /
• pp.235-248
• /
• 2018

An efficient method utilizing the multi-stage improved differential evolution algorithm (MSIDEA) as an optimization solver is presented here to detect the multiple-damage of structural systems. Natural frequency changes of a structure are considered as a criterion for damage occurrence. The structural damage detection problem is first transmuted into a standard optimization problem dealing with continuous variables, and then the MSIDEA is utilized to solve the optimization problem for finding the site and severity of structural damage. In order to assess the performance of the proposed method for damage identification, an experimental study and two numerical examples with considering measurement noise are considered. All the results demonstrate the effectiveness of the proposed method for accurately determining the site and severity of multiple-damage. Also, the performance of the MSIDEA for damage detection compared to the standard differential evolution algorithm (DEA) is confirmed by test examples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2720-2736
• /
• 2013

Multi-view face detection has become an active area for research in the last few years. In this paper, a novel multi-view human face detection algorithm based on improved real Adaboost is presented. Real Adaboost algorithm is improved by weighted combination of weak classifiers and the approximately best combination coefficients are obtained. After that, we proved that the function of sample weight adjusting method and weak classifier training method is to guarantee the independence of weak classifiers. A coarse-to-fine hierarchical face detector combining the high efficiency of Haar feature with pose estimation phase based on our real Adaboost algorithm is proposed. This algorithm reduces training time cost greatly compared with classical real Adaboost algorithm. In addition, it speeds up strong classifier converging and reduces the number of weak classifiers. For frontal face detection, the experiments on MIT+CMU frontal face test set result a 96.4% correct rate with 528 false alarms; for multi-view face in real time test set result a 94.7 % correct rate. The experimental results verified the effectiveness of the proposed approach.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제4권2호
• /
• pp.83-90
• /
• 2015

현존하는 자동 사고감지 알고리즘의 대부분은 개방도로 혹은 터널 내에서 사고 발생 시 이것을 사고로 감지하지 못하고 혼잡으로 감지하는 경우가 많다는 문제점을 가지고 있다. 본 논문에서는 개방도로에서의 사고감지 알고리즘을 기반으로 터널 내에서의 사고감지 알고리즘을 개선하여 감지율을 높일 수 있는 알고리즘을 제안하였다. 개선된 알고리즘은 가우시안 혼합모델을 이용하여 픽셀의 변화량을 판단하여 터널 내 사고로 인한 정지차량을 우선 감지한 후 도로를 블록화하여 블록 간 점유율의 편차를 분석하여 최종 판단을 한다. 실제 사고영상에 알고리즘을 적용한 실험에서 모두 오류 없이 검지하였음을 확인하였다.

• 한국정보통신학회논문지
• /
• 제24권3호
• /
• pp.378-383
• /
• 2020

Viola & Jones의 객체 검출 알고리즘은 얼굴 요소 검출을 위한 매우 우수한 알고리즘이지만 변수 설정에 따른 중복 검출, 오 검출, 미 검출 같은 문제들이 여전히 존재한다. 본 논문은 Viola & Jones의 객체 검출 알고리즘에 미 검출을 줄이기 위한 가변 변수와 중복 검출과 오 검출을 줄이기 위한 검증을 적용한 개선된 얼굴 요소 검출 알고리즘을 제안한다. 제안된 알고리즘은 잠재적 유효 얼굴 요소들을 검출할 때까지 Viola & Jones의 객체 검출의 변수 값을 변화시켜 미 검출을 줄이고, 검출된 얼굴 요소의 크기, 위치, 유일성을 평가하는 검증을 이용해 중복 검출과 오 검출들을 제거시켜 준다. 시뮬레이션 결과들은 제안된 알고리즘이 검출된 객체들에 유효 얼굴 요소들을 포함시키고 나서 무효 얼굴 요소들을 제거하여 유효 얼굴 요소들만을 검출하는 것을 보여준다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권1호
• /
• pp.37-55
• /
• 2023

In this paper we propose a new algorithm for detecting and counting flowers in a complex background based on digital images. The algorithm mainly includes the following parts: edge contour extraction of flowers, edge contour determination of overlapped flowers and flower counting. We use a contour detection technique in Computer Vision (CV) to extract the edge contours of flowers and propose an improved algorithm with a concave point detection technique to find accurate segmentation for overlapped flowers. In this process, we first use the polygon approximation to smooth edge contours and then adopt the second-order central moments to fit ellipse contours to determine whether edge contours overlap. To obtain accurate segmentation points, we calculate the curvature of each pixel point on the edge contours with an improved Curvature Scale Space (CSS) corner detector. Finally, we successively give three adaptive judgment criteria to detect and count flowers accurately and automatically. Both experimental results and the proposed evaluation indicators reveal that the proposed algorithm is more efficient for flower counting.