• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.145-156
• /
• 2007

Recently, the needs for effective real time change detection algorithms for XML/HTML documents and increased in such fields as the detection of defacement attacks to web documents, the version management, and so on. Especially, those applications of real time change detection for large number of XML/HTML documents require fast heuristic algorithms to be used in real time environment, instead of algorithms which compute minimal cost-edit scripts. Existing heuristic algorithms are fast in execution time, but do not provide satisfactory edit script. In this paper, we present existing algorithms XyDiff and X-tree Diff, analyze their problems and propose algorithm X-tree Diff which improve problems in existing ones. X-tree Diff+ has similar performance in execution time with existing algorithms, but it improves matching ratio between nodes from two documents by refining matching process based on the notion of efficiency of matching.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1504-1526
• /
• 2018

For uplink multi-user massive MIMO systems, conventional minimum mean square error (MMSE) linear detection method achieves near-optimal performance when the number of antennas at base station is much larger than that of the single-antenna users. However, MMSE detection involves complicated matrix inversion, thus making it cumbersome to be implemented cost-effectively and rapidly. In this paper, we first summarize in detail the state-of-the-art simplified MMSE detection algorithms that circumvent the complicated matrix inversion and hence reduce the computation complexity from ${\mathcal{O}}(K^3)$ to ${\mathcal{O}}(K^2)$ or ${\mathcal{O}}(NK)$ with some certain performance sacrifice. Meanwhile, we divide the simplified algorithms into two categories, namely the matrix inversion approximation and the classical iterative linear equation solving methods, and make comparisons between them in terms of detection performance and computation complexity. In order to further optimize the detection performance of the existing detection algorithms, we propose more proper solutions to set the initial values and relaxation parameters, and present a new way of reconstructing the exact effective noise variance to accelerate the convergence speed. Analysis and simulation results verify that with the help of proper initial values and parameters, the simplified matrix inversion based detection algorithms can achieve detection performance quite close to that of the ideal matrix inversion based MMSE algorithm with only a small number of series expansions or iterations.

• International Journal of Computer Science & Network Security
• /
• v.22 no.2
• /
• pp.272-282
• /
• 2022

Between 2014 and 2019, the US lost more than 2.1 billion USD to phishing attacks, according to the FBI's Internet Crime Complaint Center, and COVID-19 scam complaints totaled more than 1,200. Phishing attacks reflect these awful effects. Phishing websites (PWs) detection appear in the literature. Previous methods included maintaining a centralized blacklist that is manually updated, but newly created pseudonyms cannot be detected. Several recent studies utilized supervised machine learning (SML) algorithms and schemes to manipulate the PWs detection problem. URL extraction-based algorithms and schemes. These studies demonstrate that some classification algorithms are more effective on different data sets. However, for the phishing site detection problem, no widely known classifier has been developed. This study is aimed at identifying the features and schemes of SML that work best in the face of PWs across all publicly available phishing data sets. The Scikit Learn library has eight widely used classification algorithms configured for assessment on the public phishing datasets. Eight was tested. Later, classification algorithms were used to measure accuracy on three different datasets for statistically significant differences, along with the Welch t-test. Assemblies and neural networks outclass classical algorithms in this study. On three publicly accessible phishing datasets, eight traditional SML algorithms were evaluated, and the results were calculated in terms of classification accuracy and classifier ranking as shown in tables 4 and 8. Eventually, on severely unbalanced datasets, classifiers that obtained higher than 99.0 percent classification accuracy. Finally, the results show that this could also be adapted and outperforms conventional techniques with good precision.

• Journal of Multimedia Information System
• /
• v.8 no.2
• /
• pp.79-84
• /
• 2021

Detecting brain tumors of different sizes is a challenging task. This study aimed to identify brain tumors using detection algorithms. Most studies in this area use segmentation; however, we utilized detection owing to its advantages. Data were obtained from 64 patients and 11,200 MR images. The deep learning model used was RetinaNet, which is based on ResNet152. The model learned three different types of pre-processing images: normal, general histogram equalization, and contrast-limited adaptive histogram equalization (CLAHE). The three types of images were compared to determine the pre-processing technique that exhibits the best performance in the deep learning algorithms. During pre-processing, we converted the MR images from DICOM to JPG format. Additionally, we regulated the window level and width. The model compared the pre-processed images to determine which images showed adequate performance; CLAHE showed the best performance, with a sensitivity of 81.79%. The RetinaNet model for detecting brain tumors through deep learning algorithms demonstrated satisfactory performance in finding lesions. In future, we plan to develop a new model for improving the detection performance using well-processed data. This study lays the groundwork for future detection technologies that can help doctors find lesions more easily in clinical tasks.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.12
• /
• pp.1678-1684
• /
• 2018

Dental caries is one of the most popular oral disease. The aim of automatic dental cavity detection system is helping dentist to make accurate diagnosis. It is very important to separate cavity from the teeth in the detection system. In this paper, We compared two active contour algorithms, Snake and DRLSE(Distance Regularized Level Set Evolution). To improve performance, image is selected ROI(region of interest), then applied bilateral filter, Canny edge. In order to evaluate the algorithms, we applied to 7 tooth phantoms from incisor to molar. Each teeth contains two cavities of different shape. As a result, Snake is faster than DRLSE, but Snake has limitation to compute topology of objects. DRLSE is slower but those of performance is better.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.3E
• /
• pp.113-123
• /
• 2003

One of the most important problems in speech recognition is to detect the presence of speech in adverse environments. In other words, the accurate detection of speech boundary is critical to the performance of speech recognition. Furthermore the speech detection problem becomes severer when recognition systems are used over the telephone network, especially wireless network and noisy environment. Therefore this paper describes various speech detection algorithms for continuous digit recognition system used over wire/wireless telephone networks and we propose a algorithm in order to improve the robustness of speech detection using useful band selection under noisy telephone networks. In this paper, we compare some speech detection algorithms with the proposed one, and present experimental results done with various SNRs. The results show that the new algorithm outperforms the other speech detection methods.

• Korean Journal of Remote Sensing
• /
• v.39 no.6_3
• /
• pp.1791-1799
• /
• 2023

The Korea Aerospace Research Institute is responsible for supplying and supporting the utilization of imagery data from the Arirang satellite series for organizations affiliated with the Government Satellite Information Application Consultation. Most of them primarily utilize optical imagery, and there is a relative lack of utilization of Synthetic Aperture Radar (SAR) imagery. In this paper, as part of supporting the use of SAR images, we investigated SAR intensity-based change detection algorithms and their use cases that have been researched to determine SAR intensity-based change detection algorithms to be developed in the future. As a result of the research, we found that various algorithms utilizing intensity difference, correlation coefficients, histograms, or polarimetric information have been researched by numerous researchers to detect and analyze change pixels and the applications of change detection algorithms have been studied in various fields such as a city, flood, forest fire, and vegetation. This study will serve as a reference for the development of SAR change detection algorithms, intended for utilization in the Government Satellite Information Application Consultation.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.180-188
• /
• 2016

In this paper, we propose a fire detection algorithm based on motion information and color information analysis. Conventional fire detection algorithms have as main problem the difficulty to detect fire due to external light, intensity, background image complexity, and little fire diffusion. So we propose a fire detection algorithm that accurate and fast. First, it analyzes the motion information in video data and then set the first candidate. Second, it determines this domain after analyzing the color and the domain. This algorithm assures a fast fire detection and a high accuracy compared with conventional fire detection algorithms. Our algorithm will be useful to real-time fire detection in real world.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.615-622
• /
• 2018

Recent advancements in camera communication (CamCom) technology using visible light exploited to use display as an luminance source to modulate the data for visible light data communication. The existing display-CamCom techniques uses the selected region of interest based camera capturing approach to detect and decode the 2D color coded data on display screen. This is not effective way to do communicate when the user on mobility. This paper propose the automatic display detection using Lambertian color segmentation combined with canny edge detection algorithms for CamCom in order to avoid manual region of interest selection to establish communication link between display and camera. The automatic display detection methods fails using conventional edge detection algorithms when content changes dynamically in displays. In order to solve this problem lambertian color segmentation combined with canny edge detection algorithms are proposed to detect display automatically. This research analysed different algorithms on display edge recognition and measured the performance on rendering dynamically changing content with color code on display. The display detection rate is achieved around 96% using this proposed solutions.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.80-88
• /
• 2013

A passive infrared or pyroelectric infrared (PIR) sensor is mainly used to sense the existence of moving objects in an indoor environment. However, in an outdoor environment, there are often outbreaks of false alarms from environmental changes and other sources. Therefore, it is difficult to provide reliable detection outdoors. In this paper, two algorithms are proposed to reduce false alarms and provide trustworthy quality to surveillance systems. We gather PIR signals outdoors, analyze the collected data, and extract the target features defined as window energy and alarm duration. Using these features, we model target and false alarms, from which we propose two target decision algorithms: window energy detection and alarm duration detection. Simulation results using real PIR signals show the performance of the proposed algorithms.