• Journal of Korean Medical classics
• /
• v.33 no.2
• /
• pp.51-59
• /
• 2020

Objectives : We would like to study what is the most appropriate "feature" to effectively perform authorship attribution of the text of Traditional East Asian Medicine Methods : The authorship attribution performance of the Support Vector Machine (SVM) was compared by cross validation, depending on whether the function words or content words, single word or collocations, and IDF weights were applied or not, using 'Variorum of the Nanjing' as an experimental Corpus. Results : When using the combination of 'function words/uni-bigram/TF', the performance was best with accuracy of 0.732, and the combination of 'content words/unigram/TFIDF' showed the lowest accuracy of 0.351. Conclusions : This shows the following facts from the authorship attribution of the text of East Asian traditional medicine. First, function words play an important role in comparison to content words. Second, collocations was relatively important in content words, but single words have more important meanings in function words. Third, unlike general text analysis, IDF weighting resulted in worse performance.

• Journal of Korea Multimedia Society
• /
• v.19 no.4
• /
• pp.736-746
• /
• 2016

In this paper, we propose an automatic prostate cancer detection method using position, signal intensity and texture feature based on SVM in multi-parametric MR images. First, to align the prostate on DWI and ADC map to T2wMR, the transformation parameters of DWI are estimated by normalized mutual information-based rigid registration. Then, to normalize the signal intensity range among inter-patient images, histogram stretching is performed. Second, to detect prostate cancer areas in T2wMR, SVM classification with position, signal intensity and texture features was performed on T2wMR, DWI and ADC map. Our feature classification using multi-parametric MR imaging can improve the prostate cancer detection rate on T2wMR.

• Journal of Information Technology Services
• /
• v.6 no.3
• /
• pp.241-249
• /
• 2007

This paper describes a real-time face tracking system using effective detector and Kalman filter. In the proposed system, an image is separated into a background and an object using a real-time updated face color for effective face detection. The face features are extracted using the five types of simple Haar-like features. The extracted features are reinterpreted using Principal Component Analysis (PCA), and interpreted principal components are used for Support Vector Machine (SVM) that classifies the faces and non-faces. The moving face is traced with Kalman filter, which uses the static information of the detected faces and the dynamic information of changes between previous and current frames. The proposed system sets up an initial skin color and updates a region of a skin color through a moving skin color in a real time. It is possible to remove a background which has a similar color with a skin through updating a skin color in a real time. Also, as reducing a potential-face region using a skin color, the performance is increased up to 50% when comparing to the case of extracting features from a whole region.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.483-486
• /
• 2015

Security systems that use face recognition are vulnerable to spoofing attacks where unauthorized individuals use a photo or video of authorized users. In this work, we propose a method to detect a face spoofing attack with a video of an authorized person. The proposed method uses three sequential frames in the video to extract features by using Fourier Transform and Dense-SIFT filter. Then, classification is completed with a Support Vector Machine (SVM). Experimental results with a database of 200 valid and 200 spoof video clips showed 99% detection accuracy. The proposed method uses simplified features that require fewer memory and computational overhead while showing a high spoofing detection accuracy.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.349-364
• /
• 2013

The big challenge in current content-based image retrieval systems is to reduce the semantic gap between the low level-features and high-level concepts. In this paper, we have proposed a novel framework for efficient image retrieval to improve the retrieval results significantly as a means to addressing this problem. In our proposed method, we first extracted a strong set of image features by using the dual-tree rotated complex wavelet filters (DT-RCWF) and dual tree-complex wavelet transform (DT-CWT) jointly, which obtains features in 12 different directions. Second, we presented a relevance feedback (RF) framework for efficient image retrieval by employing a support vector machine (SVM), which learns the semantic relationship among images using the knowledge, based on the user interaction. Extensive experiments show that there is a significant improvement in retrieval performance with the proposed method using SVMRF compared with the retrieval performance without RF. The proposed method improves retrieval performance from 78.5% to 92.29% on the texture database in terms of retrieval accuracy and from 57.20% to 94.2% on the Corel image database, in terms of precision in a much lower number of iterations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.325-330
• /
• 2008

전자우편(email)은 인터넷의 급격한 보급으로 인하여 사용자들이 많이 사용하게 된 통신 메커니즘이다. 그러나 이러한 전자우편의 대중성을 상업적인 목적으로 이용한 스팸메일의 출현으로, 사용자들은 정신적 피해, 업무 방해, 메일서버의 트래픽 과부화로 인한 유지보수 비용 증가와 같은 문제점들을 접하게 되었다. 특히, 최근에는 광고성 이미지들을 첨부하는 등의 새로운 기법이 적용된 스팸메일의 발생으로 기존의 텍스트 기반의 스팸메일 필터링 기법들이 무의미하게 되었으며, 따라서 그로 인한 피해가 증가하는 추세이다. 이러한 이미지 기반의 스팸메일들의 필터링을 위하여 Support Vector Machine과 같은 기계학습 기법을 이용한 기법들이 제안되고 있으나, 여전히 그 성능은 만족스럽지 못하다. 본 논문은 전자우편으로부터 텍스트 및 시각적 의미를 분석하여 전자우편 온톨로지에 기술하고 스팸메일 판단을 위한 의미추론규칙을 적용함으로써 광고성 이미지가 첨부되어 있는 스팸메일을 효과적으로 필터링 하기 위한 시스템을 제안한다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.3
• /
• pp.178-185
• /
• 2013

As computer technology continues to develop, computer networks are now widely used. As a result, there are many new intrusion types appearing and information security is becoming increasingly important. Although there are many kinds of intrusion detection systems deployed to protect our modern networks, we are constantly hearing reports of hackers causing major disruptions. Since existing technologies all have some disadvantages, we utilize algorithms, such as the fuzzy C-means (FCM) and the support vector machine (SVM) algorithms to improve these technologies. Using these two algorithms alone has some disadvantages leading to a low classification accuracy rate. In the case of FCM, self-adaptability is weak, and the algorithm is sensitive to the initial value, vulnerable to the impact of noise and isolated points, and can easily converge to local extrema among other defects. These weaknesses may yield an unsatisfactory detection result with a low detection rate. We use a genetic algorithm (GA) to help resolve these problems. Our experimental results show that the combined GA and FCM algorithm's accuracy rate is approximately 30% higher than that of the standard FCM thereby demonstrating that our approach is substantially more effective.

• Transactions of Materials Processing
• /
• v.29 no.5
• /
• pp.282-289
• /
• 2020

Flexible roll forming is an advanced sheet-metal-forming process that allows the production of parts with various cross-sections. During the flexible process, material is subjected to three-dimensional deformation such as transverse bending, inhomogeneous elongations, or contraction. Because of the effects of process variables on the quality of the roll-formed products, the approaches used to investigate the roll-forming process have been largely dependent on experience and trial- and-error methods. Web-warping is one of the major shape defects encountered in flexible roll forming. In this study, an SVR model was developed to predict the web-warping during the flexible roll forming process. In the development of the SVR model, three process parameters, namely the forming-roll speed condition, leveling-roll height, and bend angle were considered as the model inputs, and the web-warping height was used as the response variable for three blank shapes; rectangular, concave, and convex shape. MATLAB software was used to train the SVR model and optimize three hyperparameters (λ, ε, and γ). To evaluate the SVR model performance, the statistical analysis was carried out based on the three indicators: the root-mean-square error, mean absolute error, and relative root-mean-square error.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.2981-2996
• /
• 2020

With the increasing amount of splicing images, many detection schemes of splicing images are proposed. In this paper, a splicing detection scheme for color image based on the quaternion discrete cosine transform (QDCT) is proposed. Firstly, the proposed quaternion Markov features are extracted in QDCT domain. Secondly, the proposed quaternion Markov features consist of global and local quaternion Markov, which utilize both magnitude and three phases to extract Markov features by using two different ways. In total, 2916-D features are extracted. Finally, the support vector machine (SVM) is used to detect the splicing images. In our experiments, the accuracy of the proposed scheme reaches 99.16% and 97.52% in CASIA TIDE v1.0 and CASIA TIDE v2.0, respectively, which exceeds that of the existing schemes.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1083-1094
• /
• 2020

Recognizing plant species based on leaf images is challenging because of the large inter-class variation and inter-class similarities among different plant species. The effective extraction of leaf descriptors constitutes the most important problem in plant leaf recognition. In this paper, a multi-scale angular description method is proposed for fast and accurate leaf recognition and retrieval tasks. The proposed method uses a novel scale-generation rule to develop an angular description of leaf contours. It is parameter-free and can capture leaf features from coarse to fine at multiple scales. A fast Fourier transform is used to make the descriptor compact and is effective in matching samples. Both support vector machine and k-nearest neighbors are used to classify leaves. Leaf recognition and retrieval experiments were conducted on three challenging datasets, namely Swedish leaf, Flavia leaf, and ImageCLEF2012 leaf. The results are evaluated with the widely used standard metrics and compared with several state-of-the-art methods. The results and comparisons show that the proposed method not only requires a low computational time, but also achieves good recognition and retrieval accuracies on challenging datasets.