• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• 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
• /
• v.16 no.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%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.3
• /
• pp.81-89
• /
• 2021

Under natural conditions, Apple detection has the problems of occlusion and small object detection difficulties. This paper proposes an improved model based on SSD. The SSD backbone network VGG16 is replaced with the ResNet50 network model, and the receptive field structure RFB structure is introduced. The RFB model amplifies the feature information of small objects and improves the detection accuracy of small objects. Combined with the attention mechanism (SE) to filter out the information that needs to be retained, the semantic information of the detection objectis enhanced. An improved SSD algorithm is trained on the VOC2007 data set. Compared with SSD, the improved algorithm has increased the accuracy of occlusion and small object detection by 3.4% and 3.9%. The algorithm has improved the false detection rate and missed detection rate. The improved algorithm proposed in this paper has higher efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.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
• /
• v.12 no.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
• /
• v.21 no.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)
• /
• v.7 no.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.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.2
• /
• pp.83-90
• /
• 2015

Almost of current Automatic Incident Detection(AID) algorithms involve the vulnerability that detects the traffic accident in open road or in tunnel as the traffic jam not as the traffic accident. This paper proposes the improved accident detection algorithm to enhance the detection probability based on accident detection algorithms applied in open roads. The improved accident detection algorithm provides the preliminary judgment of potential accident by detecting the stopped object by Gaussian Mixture Model. Afterwards, it measures the detection area is divided into blocks so that the occupancy rate can be determined for each block. All experimental results of applying the new algorithm on a real incident was detected image without error.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.3
• /
• pp.378-383
• /
• 2020

Viola & Jones' object detection algorithm is a very good algorithm for the face component(FC) detection, but there are still problems such as duplicate detection, false detection and non-detection due to parameter setting. This paper proposes an improved FC detection algorithm that applies the variable parameter to reduce non-detection and the verification to reduce duplicate detection and false detection to the Viola & Jones' algorithm. The proposed algorithm reduces the non-detection by changing the parameter value of the Viola & Jones' algorithm until the potential valid FCs are detected, and eliminates the duplicate detection and the false detection by using the verification that evaluates size, position, and uniqueness of the detected FCs. Simulation results show that the proposed algorithm includes valid FCs in the detected objects and then detects only the valid FCs by removing invalid FCs from them.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.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.