• Communications for Statistical Applications and Methods
• /
• 제19권5호
• /
• pp.655-662
• /
• 2012

Classification is an important research field in pattern recognition with high-dimensional predictors. The support vector machine(SVM) is a penalized feature selector and classifier. It is based on the hinge loss function, the non-convex penalty function, and the smoothly clipped absolute deviation(SCAD) suggested by Fan and Li (2001). We developed the algorithm for the multiclass SVM with the SCAD penalty function using the local quadratic approximation. For multiclass problems we compared the performance of the SVM with the $L_1$, $L_2$ penalty functions and the developed method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.417-420
• /
• 2002

In this paper, we propose a VLSI architecture for computation of the SVM(Support Vector Machine) that has become established as a powerful technique for solving a variety of classification, regression, and so on. When we compare the proposed systolic arrays with the conventional method, our architecture exhibits a lot of advantages in terms of latency and throughput rate.

• Journal of the Korean Data and Information Science Society
• /
• 제15권2호
• /
• pp.507-513
• /
• 2004

Least-squares support vector machine (LS-SVM) has been very successful in pattern recognition and function estimation problems for crisp data. In this paper, we propose LS-SVM approach to evaluating fuzzy regression model with multiple crisp inputs and a Gaussian fuzzy output. The proposed algorithm here is model-free method in the sense that we do not need assume the underlying model function. Experimental result is then presented which indicate the performance of this algorithm.

• 정보보호학회논문지
• /
• 제14권2호
• /
• pp.23-33
• /
• 2004

인터넷 환경의 급속한 발전으로 인하여 이메일을 통한 메시지 교환은 급속히 증가하고 있다. 그러나 이메일의 편리성에도 불구하고 개인이나 기업에서는 스팸메일로 인한 시간과 비용의 낭비가 크게 증가하고 있다. 이러한 스팸메일에 대한 문제들을 해결하기 위하여 많은 방법들이 연구되고 있으며, 대표적인 방법으로 키워드를 이용한 패턴매칭이나 나이의 베이지안 방식과 같은 확률을 이용한 방법들이 있다. 본 논문에서는 기존의 연구에 대한 문제점을 보완하기 위하여 패턴 분류문제에 있어서 우수한 성능을 보이는 Support Vector Machine을 사용하여 정상적인 메일과 스팸메일을 분류하는 방안을 제시하였으며, 특히 n-Gram을 사용하여 생성된 색인어와 단어사전을 학습데이터 생성에 사용함으로서 효율적인 학습을 수행하도록 하였다. 결론에서는 제안된 방법에 대한 성능을 검증하기 위하여 기존의 연구 결과와 비교함으로서 제안된 방법의 성능을 검증하였다.

• 한국정보통신학회논문지
• /
• 제9권2호
• /
• pp.330-337
• /
• 2005

본 논문에서는 SVM(Support Vector Machine)을 이용하여 얼굴 검출 성능을 향상시키는 방법을 제안한다. 본 논문에서는 먼저 영상내의 거대한 특징 집합으로부터 중요한 작은 특징 집합을 선택하는 AdaBoost 기반 객체 검출 방법을 사용하여 얼굴 후보 영역을 검출한다. 그 다음에는 특징 벡터에 대해 SVM 기반 이진분류를 수행하여 후보 영역의 영상이 얼굴인지 아닌지를 판별한다 실험 결과 본문에서 제안한 방법은 기존의 방법에 비하여 얼굴 검출의 정확도를 향상시켰다.

• Management Science and Financial Engineering
• /
• 제17권1호
• /
• pp.19-43
• /
• 2011

Tuning the architecture of SVM (support vector machine) is to build an SVM model of better performance. Two different tuning methods of the grid search and the GA (genetic algorithm) have been addressed in the literature, each of which has its own methodological pros and cons. This paper suggests a combined method for tuning the architecture of SVM models, which employs the GAM (generalized additive models), the grid search, and the GA in sequence. The GAM is used for selecting input variables, and the grid search and the GA are employed for finding optimal parameter values of the SVM models. Applying the method to a bankruptcy prediction problem, we show that SVM model tuned by the proposed method outperforms other SVM models.

• 한국군사과학기술학회지
• /
• 제19권2호
• /
• pp.236-243
• /
• 2016

This paper presents a threat list acquisition method in an engagement area using the support vector machines (SVM). The proposed method consists of track creation, track estimation, track feature extraction, and threat list classification. To classify the threat track robustly, dynamic track estimation and pattern recognition algorithms are used. Dynamic tracks are estimated accurately by approximating a track movement using position, velocity and time. After track estimation, track features are extracted from the track information, and used to classify threat list. Experimental results showed that the threat list acquisition method in the engagement area achieved about 95 % accuracy rate for whole test tracks when using the SVM classifier. In case of improving the real-time process through further studies, it can be expected to apply the fire control systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.250-255
• /
• 2003

The position of a 3-dimensional(3D) point can be measured by using calibrated stereo camera. To obtain more accurate measurement ,more accurate camera calibration is required. There are many existing methods to calibrate camera. The simple linear methods are usually not accurate due to nonlinear lens distortion. The nonlinear methods are accurate more than linear method, but it increase computational cost and good initial guess is needed. The multi step methods need to know some camera parameters of used camera. Recent years, these explicit model based camera calibration work with the development of more precise camera models involving correction of lens distortion. But these explicit model based camera calibration have disadvantages. So implicit camera calibration methods have been derived. One of the popular implicit camera calibration method is to use neural network. In this paper, we propose implicit stereo camera calibration method for 3D reconstruction using support vector machine. SVM can learn the relationship between 3D coordinate and image coordinate, and it shows the robust property with the presence of noise and lens distortion, results of simulation are shown in section 4.

• 제어로봇시스템학회논문지
• /
• 제16권12호
• /
• pp.1226-1232
• /
• 2010

A door can serve as a feature for place classification and localization for navigation of a mobile robot in indoor environments. This paper proposes a door detection method based on the recognition of various door handles using the general Hough transform (GHT) and support vector machine (SVM). The contour and color histogram of a door handle extracted from the database are used in GHT and SVM, respectively. The door recognition scheme consists of four steps. The first step determines the region of interest (ROI) images defined by the color information and the environment around the door handle for stable recognition. In the second step, the door handle is recognized using the GHT method from the ROI image and the image patches are extracted from the position of the recognized door handle. In the third step, the extracted patch is classified whether it is the image patch of a door handle or not using the SVM classifier. The door position is probabilistically determined by the recognized door handle. Experimental results show that the proposed method can recognize various door handles and detect doors in a robust manner.

• ETRI Journal
• /
• 제33권4호
• /
• pp.652-655
• /
• 2011

In this letter, we propose a new compression method for a high dimensional support vector machine (SVM). We used singular value decomposition (SVD) to compress the norm part of a radial basis function SVM. By deleting the least significant vectors that are extracted from the decomposition, we can compress each vector with minimized energy loss. We select the compressed vector dimension according to the predefined threshold which can limit the energy loss to design criteria. We verified the proposed vector compressed SVM (VCSVM) for conventional datasets. Experimental results show that VCSVM can reduce computational complexity and memory by more than 40% without reduction in accuracy when classifying a 20,958 dimension dataset.