• 정보처리학회논문지D
• /
• 제14D권2호
• /
• pp.145-156
• /
• 2007

최근 웹 문서의 변조의 탐지, 버전 관리 등을 위한 XML/HTML 문서들에 대한 효과적인 실시간 변화탐지 알고리즘의 필요성이 증대하고 있다. 특히 대용량의 XML/HTML 문서들에 대한 실시간 변화탐지 응용들은 최소비용의 편집스크립트를 계산하는 알고리즘 보다는 실시간 처리가 가능한 빠른 휴리스틱 알고리즘들을 필요로 한다. 기존의 휴리스틱 알고리즘들은 실행속도는 빠르나 생성되는 편집스크립트의 질이 만족스럽지 못하다. 본 논문에서는 기존의 알고리즘 XyDiff와 X-tree Diff를 소개하고 이들 알고리즘들의 문제점들을 분석하고 문제점들을 개선한 알고리즘 X-tree Diff+를 제안한다. X-tree Diff+는 실행시간 측면에서 기존 알고리즘들과 유사하나 대응효율성에 기반한 대응과정의 개선을 통해 두 문서 간의 노트들의 대응률을 향상시킨 알고리즘이다.

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

• 전기학회논문지
• /
• 제67권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
• /
• 제22권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.

• 대한원격탐사학회지
• /
• 제39권6_3호
• /
• pp.1791-1799
• /
• 2023

한국항공우주연구원은 위성정보활용협의체 소속기관을 대상으로 아리랑위성 시리즈 영상자료 보급 및 활용지원을 담당하고 있다. 협의체 소속기관 사용자들은 대부분 광학 영상 중심으로 위성영상을 활용하고 있으며, 상대적으로 Synthetic Aperture Radar (SAR) 영상에 대한 활용 방안은 미흡한 실정이다. 본 논문에서는 SAR 영상자료 활용을 지원하기 위한 일환으로 향후 개발할 SAR 강도 기반 변화탐지 기술의 결정을 위해 현재까지 연구되어진 SAR 강도 기반 변화탐지 기술과 그 활용사례들을 조사했다. 조사 결과 많은 연구자로부터 강도 차분, 상관계수, 히스토그램(Histogram) 또는 편파 정보를 활용하여 변화 픽셀을 탐지하고 분석하기 위한 다양한 알고리즘들과 도시, 홍수, 산불, 식생과 같은 다양한 분야에서 변화탐지 알고리즘의 활용방안이 연구되었음을 확인할 수 있었다. 본 연구는 위성정보활용협의체에 활용할 SAR 변화탐지 기술 개발에 활용할 예정이다.

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

• 한국정보전자통신기술학회논문지
• /
• 제11권5호
• /
• pp.615-622
• /
• 2018

최근 가시광원을 사용하는 카메라 통신 기술의 발전과 더불어 디스플레이를 통해 가시광 데이터를 표출하고 이를 인식하는 기술에 대한 수요가 증가하고 있다. 기존의 디스플레이 기반 CamCom 기법은 사용자가 설정한 RoI 영역 기반의 2차원 컬러코드를 인식하는 방식을 사용하였으나, 이는 보행 상황 등 수신위치가 변동되는 상황에 적합하지 않은 단점이 존재한다. 이에 본 논문에서는 카메라 통신에서 자동 RoI 설정을 위해 적용될 수 있는 Lambertian 색상 분할과 Canny 엣지 검출이 결합된 알고리즘 기반의 자동 디스플레이 검출 기법에 대하여 제안하였다. 기존 디스플레이 검출 기법은 디스플레이에서 표출되고 있는 콘텐츠의 변화가 발생하면 검출율이 현저히 감소하는 문제점이 존재하며, 본 논문에서는 이를 해결하기 위하여 lambertian 색상 분할 및 canny 엣지 검출을 결합한 알고리즘 적용을 통헤 자동으로 디스플레이를 검출 할 수 있는 기법을 제안하였다. 본 연구에서는 디스플레이 엣지 인식을 위해 사용되는 다양한 알고리즘을 분석하고 변화하는 컬러코드 콘텐츠 인식시 성능을 측정하였으며, 제안한 저속 카메라 통신용 자동 디스플레이 검출을 위한 lambertian 색상 분할 및 Canny Edge Detection 알고리즘을 적용한 실험 결과 약 96%의 검출율을 달성함을 확인하였다.

• ETRI Journal
• /
• 제35권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.