• 제어로봇시스템학회논문지
• /
• 제12권7호
• /
• pp.666-670
• /
• 2006

This paper presents the novel feature selection method for Emotion Recognition, which may include a lot of original features. Specially, the emotion recognition in this paper treated speech signal with emotion. The feature selection has some benefits on the pattern recognition performance and 'the curse of dimension'. Thus, We implemented a simulator called 'IFS' and those result was applied to a emotion recognition system(ERS), which was also implemented for this research. Our novel feature selection method was basically affected by Reinforcement Learning and since it needs responses from human user, it is called 'Interactive feature Selection'. From performing the IFS, we could get 3 best features and applied to ERS. Comparing those results with randomly selected feature set, The 3 best features were better than the randomly selected feature set.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.4137-4152
• /
• 2014

This paper investigates the description ability of chaotic feature vector to dynamic textures. First a chaotic feature and other features are calculated from each pixel intensity series. Then these features are combined to a chaotic feature vector. Therefore a video is modeled as a feature vector matrix. Next by the aid of bag of words framework, we explore the representation ability of the proposed chaotic feature vector. Finally we investigate recognition rate between different combinations of chaotic features. Experimental results show the merit of chaotic feature vector for pixel intensity series representation.

• 대한원격탐사학회지
• /
• 제36권4호
• /
• pp.545-555
• /
• 2020

This paper focuses on automatic image registration between EO (Electro-Optical) and IR (InfraRed) satellite images with different spectral properties using block-based approach and simple preprocessing technique to enhance the performance of feature matching. If unpreprocessed EO and IR images from Kompsat-3A satellite were applied to local feature matching algorithms(Scale Invariant Feature Transform, Speed-Up Robust Feature, etc.), image registration algorithm generally failed because of few detected feature points or mismatched pairs despite of many detected feature points. In this paper, we proposed a new image registration method which improved the performance of feature matching with block-based registration process on 9-divided image and pre-processing technique based on adaptive histogram equalization. The proposed method showed better performance than without our proposed technique on visual inspection and I-RMSE. This study can be used for automatic image registration between various images acquired from different sensors.

• 한국CDE학회논문집
• /
• 제12권5호
• /
• pp.395-404
• /
• 2007

Feature-based modeling and history-based modeling are the two main paradigms that are used in most of current CAD systems. Although these modeling paradigms make it easier for designers to create solid model, it may pose dependency constraints on features that are interacting one with another. When editing such features, these constraints often cause unpredictable and unacceptable results. For example, when a parent feature is deleted, the child features of the parent feature are also deleted. This entails re-generations of the deleted features, which requires additional modeling time. In order to complement this situation, we propose a method to delete only the features of interest by disconnecting the dependency constraints. This method can provide designers with more efficient way of model modification.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2002년도 봄 학술발표논문집 Vol.29 No.1 (B)
• /
• pp.373-375
• /
• 2002

빠르게 변화하는 시장의 요구에 대응하고자 특정 도메인에 속하는 애플리케이션 간의 재사용을 높이려는 Product-Line에 대한 연구가 진행되고 있다. Product-Line에서는 도메인 내의 여러 애플리케이션 간의 차이점과 공통정을 분류하는데 Feature Modeling이라는 개념을 주로 사용하고 있다. 이러한 Feature를 추상화하여 메타 모델로 나타내고 정령과 기법을 통하여 명세화 한다면, 기존의 Feature 모델에서 발견해내지 못하는 feature들과 관련 요소들을 추출하고, 명세화를 통한 통일된 해석이 가능하며 , Feature Model에 대한 reasoning, 충돌에 대한 예측 및 면상 등의 지원이 가능할 것이다. 따라서 본 논문에서는 Multi-paradigm 명세 언어를 제공하여주는 KAOS 방법을 적용하여, 추상화 수준에서의 메타 모델을 제안하고, Feature를 명세와 하고 습득하는 방안을 제시하고자 만다.

• ETRI Journal
• /
• 제32권3호
• /
• pp.482-485
• /
• 2010

Feature selection is very important for feature-based relation classification tasks. While most of the existing works on feature selection rely on linguistic information acquired using parsers, this letter proposes new features, including probabilistic and semantic relatedness features, to manifest the relatedness between patterns and certain relation types in an explicit way. The impact of each feature set is evaluated using both a chi-square estimator and a performance evaluation. The experiments show that the impact of relatedness features is superior to existing well-known linguistic features, and the contribution of relatedness features cannot be substituted using other normally used linguistic feature sets.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권2호
• /
• pp.110-114
• /
• 2015

This paper reports a novel object-detection technique in video sequences. The proposed algorithm consists of detection of objects in illuminated and occluded videos by using object features and a neural network technique. It consists of two functional modules: region-based object feature extraction and continuous detection of objects in video sequences with region features. This scheme is proposed as an enhancement of the Lowe's scale-invariant feature transform (SIFT) object detection method. This technique solved the high computation time problem of feature generation in the SIFT method. The improvement is achieved by region-based feature classification in the objects to be detected; optimal neural network-based feature reduction is presented in order to reduce the object region feature dataset with winner pixel estimation between the video frames of the video sequence. Simulation results show that the proposed scheme achieves better overall performance than other object detection techniques, and region-based feature detection is faster in comparison to other recent techniques.

• 전기전자학회논문지
• /
• 제19권4호
• /
• pp.526-534
• /
• 2015

In this paper, we studied the use of the foreground and background features and SVM classifier to improve the accuracy of offline handwritten numeral recognition. The foreground features are two directional features: directional gradient feature by Kirsch operators and directional stroke feature by local shrinking and expanding operations, and the background feature is concavity feature which is extracted from the convex hull of the numeral, where the concavity feature functions as complement to the directional features. During classification of the numeral, these three features are combined to obtain good discrimination power. The efficiency of our scheme is tested by recognition experiments on the handwritten numeral database CENPARMI, where SVM classifier with RBF kernel is used. The experimental results show the usefulness of our scheme and recognition rate of 99.10% is achieved.

• 반도체디스플레이기술학회지
• /
• 제12권3호
• /
• pp.59-64
• /
• 2013

Accurate and robust image registration is important task in many applications such as image retrieval and computer vision. To perform the image registration, essential required steps are needed in the process: feature detection, extraction, matching, and reconstruction of image. In the process of these function, feature extraction not only plays a key role, but also have a big effect on its performance. There are two representative algorithms for extracting image features, which are scale invariant feature transform (SIFT) and speeded up robust feature (SURF). In this paper, we present and evaluate two methods, focusing on comparative analysis of the performance. Experiments for accurate and robust feature detection are shown on various environments such like scale changes, rotation and affine transformation. Experimental trials revealed that SURF algorithm exhibited a significant result in both extracting feature points and matching time, compared to SIFT method.

• 정보처리학회논문지B
• /
• 제10B권1호
• /
• pp.73-80
• /
• 2003

본 논문에서는 기준영상과 탐색영상 사이의 대응되는 특징 점을 정합 하는 알고리즘을 제안한다. 두 영상에서 특징 점을 찾기 위하여 Harris의 코너 점 검출기를 사용하였다. 기준영상의 각 특징 점에 대해, 정규상관계수가 임계치 이상인 탐색영상의 특징 점들로 후보 정합 점을 구한다. 최종적으로 동적 프로그래밍을 사용하여 후보 정합 점들 중에서 대응되는 특징 점을 구한다. 실험으로 인위적인 영상과 실제 영상에서 특징 점을 정합 하는 결과를 보였다.