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

본 논문에서는, 눈 검출에서의 픽셀 선택 방법을 이용한 편향 판별 분석(BDA) 기반의 신뢰 척도를 제안하고 이를 이용하여 hybrid 눈 검출기를 설계한다. 이를 위해 눈 조각 영상에서 먼저 판별 분석에 유용한 픽셀들을 선택하여 부분 영상을 만들고, 부분 영상에 BDA를 적용하여 신뢰 척도를 위한 특징 공간을 구성한다. Hybrid 눈 검출기를 구성하는 기본 검출기로는 상호 보완적인 특성을 가진 HFED와 MFED를 사용하였다. 주어진 영상에 대해, 기본 검출기들에 의해 생성된 눈 좌표를 가지고 생성한 눈 조각 영상의 부분 영상들을 BDA 특징공간에 투영하여 positive 샘플의 평균과의 거리를 측정함으로써 그 정확성을 측정하고, 기본 검출기의 결과들 중에서 신뢰도가 높은 결과를 최종 눈 검출 결과로 사용한다. 다양한 얼굴 데이터베이스들에 대한 실험 결과에서, 제안한 방법은 검출된 눈 좌표의 정확도 측면에서 뿐만 아니라 검출된 눈 좌표를 이용한 얼굴 인식 성능에서도 다른 방법들보다 우수한 결과를 나타내었다.

• Interdisciplinary Bio Central
• /
• 제3권4호
• /
• pp.14.1-14.9
• /
• 2011

Protein homology detection is an important issue in comparative genomics. Because of the exponential growth of sequence databases, fast and efficient homology detection tools are urgently needed. Currently, for homology detection, sequence comparison methods using local alignment such as BLAST are generally used as they give a reasonable measure for sequence similarity. However, these methods have drawbacks in offering overall sequence similarity, especially in dealing with eukaryotic genomes that often contain many insertions and duplications on sequences. Also these methods do not provide the explicit models for speciation, thus it is difficult to interpret their similarity measure into homology detection. Here, we present a novel method based on Word Conservation Score (WCS) to address the current limitations of homology detection. Instead of counting each amino acid, we adopted the concept of 'Word' to compare sequences. WCS measures overall sequence similarity by comparing word contents, which is much faster than BLAST comparisons. Furthermore, evolutionary distance between homologous sequences could be measured by WCS. Therefore, we expect that sequence comparison with WCS is useful for the multiple-species-comparisons of large genomes. In the performance comparisons on protein structural classifications, our method showed a considerable improvement over BLAST. Our method found bigger micro-syntenic blocks which consist of orthologs with conserved gene order. By testing on various datasets, we showed that WCS gives faster and better overall similarity measure compared to BLAST.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.403-406
• /
• 2003

This paper presents a robust algorithm for edge detection based on fuzzy fusion, using a novel local edge information measure based on Renyi's a-order entropy. The calculation of the proposed measure is carried out using a parametric classification scheme based on local statistics. By suitably tuning its parameters, the local edge information measure is capable of extracting different types of edges, while exhibiting high immunity to noise. The notions of fuzzy measures and the Choquet fuzzy integral are applied to combine the different sources of information obtained using the local edge information measure with different sets of parameters. The effectiveness and the robustness of the new method are demonstrated by applying our algorithm to various synthetic computer-generated and real-world images.

• 한국컴퓨터정보학회논문지
• /
• 제22권2호
• /
• pp.21-27
• /
• 2017

In this paper, we propose a pupil detection method using PCA(principal component analysis) and Hough transform. To reduce error to detect eyebrows as pupil, eyebrows are detected using projection function in eye region and eye region is set to not include the eyebrows. In the eye region, pupil candidates are detected using rank order filter. False candidates are removed by using symmetry. The pupil candidates are grouped into pairs based on geometric constraints. A similarity measure is obtained for two eye of each pair using PCA and hough transform, we select a pair with the smallest similarity measure as final two pupils. The experiments have been performed for 1000 images of the BioID face database. The results show that it achieves the higher detection rate than existing method.

• International Journal of Safety
• /
• 제1권1호
• /
• pp.28-35
• /
• 2002

Kullback Discrimination Information (KDI) is one of the pattern recognition methods. KDI defined as a measure of the mutual dissimilarity computed between two time series was studied for detection and classification of bearing flaking on outer-race and inner-races. To model the damages, the bearings in normal condition, outer-race flaking condition and inner-races flaking condition were provided. The vibration sensor was attached by the bearing housing. This produced the total 25 pieces of data each condition, and we chose the standard data and measure of distance between standard and tested data. It is difficult to detect the flaking because similar pulses come out when balls pass the defection point. The detection and classification method for inner and outer races are defected by KDI and nearest neighbor classification rule is proposed and its high performance is also shown.

• 한국정보통신학회논문지
• /
• 제26권7호
• /
• pp.1098-1101
• /
• 2022

With the development of computer music notation programs, when drawing sheet music, it is often drawn using a computer. However, there are still many use of hand-written notations for educational purposes or to quickly draw sheet music such as listening and dictating. In previous studies, OMR focused on recognizing the printed music sheet made by music notation program. the result of handwritten OMR with camera is poor because different people have different writing methods, and lens distortion. In this study, as a pre-processing process for recognizing handwritten music sheet, we propose a method for recognizing a staff using linear regression and a method for recognizing a bar using CNN. F₁ scores of staff recognition and barline detection are 99.09% and 95.48%, respectively. This methodologies are expected to contribute to improving the accuracy of handwriting.

• Journal of Korean Neurosurgical Society
• /
• 제56권6호
• /
• pp.455-462
• /
• 2014

Objective : To propose a new measure for effective monitoring of intraoperative somatosensory evoked potentials (SEP) and to validate the feasibility of this measure for evoked potentials (EP) and single trials with a retrospective data analysis study. Methods : The proposed new measure (hereafter, a slope-measure) was defined as the relative slope of the amplitude and latency at each EP peak compared to the baseline value, which is sensitive to the change in the amplitude and latency simultaneously. We used the slope-measure for EP and single trials and compared the significant change detection time with that of the conventional peak-to-peak method. When applied to single trials, each single trial signal was processed with optimal filters before using the slope-measure. In this retrospective data analysis, 7 patients who underwent cerebral aneurysm clipping surgery for unruptured aneurysm middle cerebral artery (MCA) bifurcation were included. Results : We found that this simple slope-measure has a detection time that is as early or earlier than that of the conventional method; furthermore, using the slope-measure in optimally filtered single trials provides warning signs earlier than that of the conventional method during MCA clipping surgery. Conclusion : Our results have confirmed the feasibility of the slope-measure for intraoperative SEP monitoring. This is a novel study that provides a useful measure for either EP or single trials in intraoperative SEP monitoring.

• 대한임베디드공학회논문지
• /
• 제12권4호
• /
• pp.231-238
• /
• 2017

Detecting small infrared targets from the low-SCR images at a long distance is very hard. The previous Local Contrast Method (LCM) algorithm based on the human visual system shows a superior performance of detecting small targets by a background suppression technique through local contrast measure. However, its slow processing speed due to the heavy multi-scale processing overhead is not suitable to a variety of real-time applications. This paper presents a lightweight real-time small target detection algorithm, called by the Improved Selective Local Contrast Method (ISLCM), to reduce the scale-invariant computational overhead. The proposed ISLCM applies the improved local contrast measure to the predicted selective region so that it may have a comparable detection performance as the previous LCM while guaranteeing low scale-invariant computational load by exploiting both adaptive scale estimation and small target feature feasibility. Experimental results show that the proposed algorithm can reduce its computational overhead considerably while maintaining its detection performance compared with the previous LCM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권10호
• /
• pp.4176-4197
• /
• 2020

Botnet is a type of dangerous malware. Botnet attack with a collection of bots attacking a similar target and activity pattern is called bot group activities. The detection of bot group activities using intrusion detection models can only detect single bot activities but cannot detect bots' behavioral relation on bot group attack. Detection of bot group activities could help network administrators isolate an activity or access a bot group attacks and determine the relations between bots that can measure the correlation. This paper proposed a new model to measure the similarity between bot activities using the intersections-probability concept to define bot group activities called as B-Corr Model. The B-Corr model consisted of several stages, such as extraction feature from bot activity flows, measurement of intersections between bots, and similarity value production. B-Corr model categorizes similar bots with a similar target to specify bot group activities. To achieve a more comprehensive view, the B-Corr model visualizes the similarity values between bots in the form of a similar bot graph. Furthermore, extensive experiments have been conducted using real botnet datasets with high detection accuracy in various scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권8호
• /
• pp.2587-2605
• /
• 2022

In order to efficiently detect community structure in complex networks, community detection algorithms can be designed from the perspective of node similarity. However, the appropriate parameters should be chosen to achieve community division, furthermore, these existing algorithms based on the similarity of common neighbors have low discrimination between node pairs. To solve the above problems, a noval community detection algorithm using closeness similarity based on common neighbor node clustering entropy is proposed, shorted as CSCDA. Firstly, to improve detection accuracy, common neighbors and clustering coefficient are combined in the form of entropy, then a new closeness similarity measure is proposed. Through the designed similarity measure, the closeness similar node set of each node can be further accurately identified. Secondly, to reduce the randomness of the community detection result, based on the closeness similar node set, the node leadership is used to determine the most closeness similar first-order neighbor node for merging to create the initial communities. Thirdly, for the difficult problem of parameter selection in existing algorithms, the merging of two levels is used to iteratively detect the final communities with the idea of modularity optimization. Finally, experiments show that the normalized mutual information values are increased by an average of 8.06% and 5.94% on two scales of synthetic networks and real-world networks with real communities, and modularity is increased by an average of 0.80% on the real-world networks without real communities.