• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.993-1001
• /
• 2000

This research features a method that quantitatively evaluates the performance of edge detection algorithms. Contrary to conventional methods that evaluate the performance of edge detection as a function of the amount of noise added to he input image, the proposed method is capable of assessing the performance of edge detection algorithms based on chosen parameters that influence the performance of edge detection. We have proposed a quantitative measure, called average performance index, that compares the average performance of different edge detection algorithms. We have applied the method to the commonly used edge detectors, Sobel, LOG(Laplacian of Gaussian), and Canny edge detectors for noisy images that contain straight line edges and curved line edges. Two kinds of noises i.e, Gaussian and impulse noises, are used. Experimental results show that our method of quantitatively evaluating the performance of edge detection algorithms can facilitate the selection of the optimal dge detection algorithm for a given task.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.42-47
• /
• 1994

A pitch detector is an essential component in a variety of speech processing systems. Besides providing valuable insights into the nature of the exciation source for speech production, the pitch contour of an utterance is useful for recognizing speakers, aids-to-the handicapped, and is required in almost all speech analysis-synthesis system. Because of the importance of the pitch detection, a wide variety algorithms for pitch detection have been proposed in speech procesing literature. Thus, in this paper we discuss th evarious type of pitch detection algorithms which have been proposed until now. Then we provide th eperformance measurements for seven pitch detection algorithms.

• Korean Journal of Remote Sensing
• /
• v.28 no.4
• /
• pp.369-392
• /
• 2012

Recently, many target detection algorithms were developed for hyperspectral image. However, almost of these studies focused only accuracy from 1 or 2 data sets to validate and compare the algorithms although they give limited information to users. This study aimed to compare usability of target detection algorithms with various parameters. Five parameters were proposed to compare sensitivity in aspect of detection accuracy which are related with radiometric and spectral characteristics of target, background and image. Six target detection algorithms were compared in aspect of accuracy and efficiency (processing time) by variation of the parameters and image size, respectively. The results shown different usability of each algorithm by each parameter in aspect of accuracy. Second order statistics based algorithms needed relatively long processing time. Integrated usabilities of accuracy and efficiency were various by characteristics of target, background and image. Consequently, users would consider appropriate target detection algorithms by characteristics of data and purpose of detection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.5079-5099
• /
• 2018

Regarding to the huge number of connections and the large flow of data on the Internet, Intrusion Detection System (IDS) has a difficulty to detect attacks. Moreover, irrelevant and redundant features influence on the quality of IDS precisely on the detection rate and processing cost. Feature Selection (FS) is the important technique, which gives the issue for enhancing the performance of detection. There are different works have been proposed, but a map for understanding and constructing a state of the FS in IDS is still need more investigation. In this paper, we introduce a survey of feature selection algorithms for intrusion detection system. We describe the well-known approaches that have been proposed in FS for IDS. Furthermore, we provide a classification with a comparative study between different contribution according to their techniques and results. We identify a new taxonomy for future trends and existing challenges.

• Journal of Korea Game Society
• /
• v.1 no.1
• /
• pp.42-48
• /
• 2001

Collision is a brief dynamic event consisting of the close approach of two or more objects or particles resulting in an abrupt change of momentum or exchange of energy because of interaction. Collisions play very important role in computer graphics, computer games and animations fields. Collisions can supply active interaction between cyberspace and real world and give much interests for making nice games so reasonable collision detection algorithms are needed. Collision detection algorithms should satisfy being fast and accuracy. In this paper, we survey the 2D collision detection algorithms between geometric models. We present several methods and system available for collision detection.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.4
• /
• pp.284-290
• /
• 2013

Feature detection is very important to image processing area. In this paper we compare and analyze some characteristics of image processing algorithms for corner and blob feature detection. We also analyze the simulation results through image matching process. We show that how these algorithms work and how fast they execute. The simulation results are shown for helping us to select an algorithm or several algorithms extracting corner and blob feature.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.47 no.1
• /
• pp.9-19
• /
• 2024

Deep learning-based computer vision anomaly detection algorithms are widely utilized in various fields. Especially in the manufacturing industry, the difficulty in collecting abnormal data compared to normal data, and the challenge of defining all potential abnormalities in advance, have led to an increasing demand for unsupervised learning methods that rely on normal data. In this study, we conducted a comparative analysis of deep learning-based unsupervised learning algorithms that define and detect abnormalities that can occur when transparent contact lenses are immersed in liquid solution. We validated and applied the unsupervised learning algorithms used in this study to the existing anomaly detection benchmark dataset, MvTecAD. The existing anomaly detection benchmark dataset primarily consists of solid objects, whereas in our study, we compared unsupervised learning-based algorithms in experiments judging the shape and presence of lenses submerged in liquid. Among the algorithms analyzed, EfficientAD showed an AUROC and F1-score of 0.97 in image-level tests. However, the F1-score decreased to 0.18 in pixel-level tests, making it challenging to determine the locations where abnormalities occurred. Despite this, EfficientAD demonstrated excellent performance in image-level tests classifying normal and abnormal instances, suggesting that with the collection and training of large-scale data in real industrial settings, it is expected to exhibit even better performance.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.19 no.4
• /
• pp.83-90
• /
• 2011

The evaluation of Conflict detection and Resolution Algorithms require the use of analytical that describe encounter flight safety and the costs and benefits of optimization maneuver. A number of such algorithms have been applied in the past to the free flight. Each algorithm has benefits and limitations, and flight safety may be facilitated by combining the best features of various techniques. This paper studied a summary of conflict detection and resolution algorithm approaches. Algorithm techniques are categorized and the fundamental assumptions, capabilities, and limitations of each approach are described. The Algorithms are evaluated and compared based on their applicability to free flight airspace conflict situations.

• ETRI Journal
• /
• v.44 no.4
• /
• pp.654-671
• /
• 2022

Accidental falls frequently occur during activities of daily living. Although many studies have proposed various accident detection methods, no high-performance accident detection system is available. In this study, we propose a method for integrating data and accident detection algorithms presented in existing studies, collect new data (from two stunt performers and 15 people over age 60) using a developed wearable device, demonstrate new features and related accident detection algorithms, and analyze the performance of the proposed method against existing methods. Comparative analysis results show that the newly defined features extracted reflect more important risk factors than those used in existing studies. Further, although the traditional algorithms applied to integrated data achieved an accuracy (AC) of 79.5% and a false positive rate (FPR) of 19.4%, the proposed accident detection algorithms achieved 97.8% AC and 2.9% FPR. The high AC and low FPR for accidental falls indicate that the proposed method exhibits a considerable advancement toward developing a commercial accident detection system.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.71-80
• /
• 2011

This paper provides a novel approach for developers to use face detection techniques for their applications easily without special knowledge by selecting optimal face detection algorithms based on fuzzy inference. The purpose of this paper is to come up with a high-level system for face detection based on fuzzy inference with which users can develop systems easily and even without specific knowledge on face detection theories and algorithms. Important conditions are firstly considered to categorize the large problem space of face detection. The conditions identified here are then represented as expressions so that developers can use them to express various problems. The expressed conditions and available face detection algorithms constitute the fuzzy inference rules and the Fuzzy Interpreter is constructed based on the rules. Once the conditions are expressed by developers, the Fuzzy Interpreter proposed take the role to inference the conditions and find and organize the optimal algorithms to solve the represented problem with corresponding conditions. A proof-of-concept is implemented and tested compared to conventional algorithms to show the performance of the proposed approach.