• International Journal of Computer Science & Network Security
• /
• 제21권3호
• /
• pp.41-47
• /
• 2021

Detection of protein-protein interactions (PPIs) remains essential for the development of therapies against diseases. Experimental studies to detect PPI are longer and more expensive. Today, with the availability of PPI data, several computer models for predicting PPIs have been proposed. One of the big challenges in this task is feature extraction. The relevance of the information extracted by some extraction techniques remains limited. In this work, we first propose an extraction method based on correlation relationships between the physicochemical properties of amino acids. The proposed method uses a correlation matrix obtained from the hydrophobicity and hydrophilicity properties that it then integrates in the calculation of the bigram. Then, we use the SVM algorithm to detect the presence of an interaction between 2 given proteins. Experimental results show that the proposed method obtains better performances compared to the approaches in the literature. It obtains performances of 94.75% in accuracy, 95.12% in precision and 96% in sensitivity on human HPRD protein data.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1458-1463
• /
• 2004

Tracking is one of the most important pre-required task for many application such as human-computer interaction through gesture and face recognition, motion analysis, visual servoing, augment reality, industrial assembly and robot obstacle avoidance. Recently, 3D information of object is required in realtime for many aforementioned applications. 3D tracking is difficult problem to solve because during the image formation process of the camera, explicit 3D information about objects in the scene is lost. Recently, many vision system use stereo camera especially for 3D tracking. The 3D feature based tracking(3DFBT) which is on of the 3D tracking system using stereo vision have many advantage compare to other tracking methods. If we assumed the correspondence problem which is one of the subproblem of 3DFBT is solved, the accuracy of tracking depends on the accuracy of camera calibration. However, The existing calibration method based on accurate camera model so that modelling error and weakness to lens distortion are embedded. Therefore, this thesis proposes 3D feature based tracking method using SVM which is used to solve reconstruction problem.

• 한국컴퓨터그래픽스학회논문지
• /
• 제12권4호
• /
• pp.17-22
• /
• 2006

본 논문은 주어진 얼굴 사진에 대하여 자동으로 얼굴의 특징을 강조한 캐리커쳐 생성 기법을 제안한다. AAM(Active Appearance Model)을 사용하여 트레이닝 이미지의 특징점과 텍스쳐 정보를 유지하고 이것을 이용하여 평균 얼굴의 정보와 함께 주어진 얼굴에 대한 특징점을 찾아낸다. 캐리커쳐 아티스트들의 제안을 바탕으로 특징적인 부분을 과장하기 위한 룰을 정의하고 이를 입력 얼굴의 특징점에 적용하여 과장된 특징점을 얻는다. 마지막으로 주어진 사진에 대하여 좀 더 만화적인 효과를 내기 위해 얼굴 이미지에 카투닝을 적용한 다음 과장된 특징점으로 와핑한다. 이러한 방법으로 사용자의 조작을 최소로 하는 캐리커처 생성을 할 수 있다.

• ETRI Journal
• /
• 제32권5호
• /
• pp.784-794
• /
• 2010

Automatic facial expression recognition has many potential applications in different areas of human computer interaction. However, they are not yet fully realized due to the lack of an effective facial feature descriptor. In this paper, we present a new appearance-based feature descriptor, the local directional pattern (LDP), to represent facial geometry and analyze its performance in expression recognition. An LDP feature is obtained by computing the edge response values in 8 directions at each pixel and encoding them into an 8 bit binary number using the relative strength of these edge responses. The LDP descriptor, a distribution of LDP codes within an image or image patch, is used to describe each expression image. The effectiveness of dimensionality reduction techniques, such as principal component analysis and AdaBoost, is also analyzed in terms of computational cost saving and classification accuracy. Two well-known machine learning methods, template matching and support vector machine, are used for classification using the Cohn-Kanade and Japanese female facial expression databases. Better classification accuracy shows the superiority of LDP descriptor against other appearance-based feature descriptors.

• Journal of Advanced Marine Engineering and Technology
• /
• 제40권5호
• /
• pp.437-446
• /
• 2016

Feature selection has become an essential technique to reduce the dimensionality of data sets. Many features are frequently irrelevant or redundant for the classification tasks. The purpose of feature selection is to select relevant features and remove irrelevant and redundant features. Applications of the feature selection range from text processing, face recognition, bioinformatics, speaker verification, and medical diagnosis to financial domains. In this study, we focus on filter methods based on information entropy : IG (Information Gain), FCBF (Fast Correlation Based Filter), and mRMR (minimum Redundancy Maximum Relevance). FCBF has the advantage of reducing computational burden by eliminating the redundant features that satisfy the condition of approximate Markov blanket. However, FCBF considers only the relevance between the feature and the class in order to select the best features, thus failing to take into consideration the interaction between features. In this paper, we propose an improved FCBF to overcome this shortcoming. We also perform a comparative study to evaluate the performance of the proposed method.

• 한국소음진동공학회논문집
• /
• 제12권6호
• /
• pp.478-487
• /
• 2002

This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.

• 말소리와 음성과학
• /
• 제1권3호
• /
• pp.19-28
• /
• 2009

This paper reports experimental findings about the duration feature of the acoustic components of English stops in Korean speakers' voicing perception. In our experiment, 35 participants discriminated between recorded stimuli and digitally transformed stimuli with different duration features from the original stimuli. 72 sets of paired stimuli are generated to test the effects of the duration feature in various phonetic contexts. The result of our experiment is a complicated cross-tabulation with 540 cells defined by five categorical independent variables plus one response variable. To find a meaningful generalization out of this complex frequency table, we ran logit log-linear regression analyses. Surprisingly, we have found that there is no single effect of the duration feature in all phonetic contexts on Korean speakers' perception of the voicing contrasts of English stops. Instead, the logit log-linear analyses reveal that there are interaction effects among phonetic contexts (=C), the places of articulation of stops (=P), and the voicing contrast (=V), and among duration (=T), phonetic contexts, and the places of articulation. To put it in mathematical terms, the distribution of the data can be explained by a simple log-linear equation, logF=${\mu}+{\lambda}CPV+{\lambda}TCP$.

• 대한원격탐사학회지
• /
• 제24권5호
• /
• pp.389-396
• /
• 2008

In these days, various kinds of web applications based on web 2.0 paradigm have been developed. In web 2.0 paradigm pursuing participation, sharing, and openness on the web-as-platform, web mapping or web GIS application are regarded as top most applications, so that web applications, handling geo-spatial contents, with user-interaction interface and search engine of high performance have been provided for both public users and expert users in the special domains. Public and industrial needs for web mapping mashup application by open API, linked with the practical web computing technologies, are gradually increasing. In this study, a user interface in mashup for geo-spatial feature generation was implemented by using mainly Google maps API. Spatial database resources in this implementation are those of Google mapping server. As the results, public users on web client can create their own geo-spatial data sets in web vector formats, without the help of any GIS tools or access to proprietary databases. It is concluded that web-based mashup application in client-side using open API can be used as an alternative for geo-browsing system or portable feature generation system.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제12권7호
• /
• pp.315-324
• /
• 2023

꾸준히 증가하는 노인성 질환 환자 대상으로 몰입형 디지털 콘텐츠를 이용한 쉽고 정확한 전신 재활 상호작용 기술이 필요하며, 본 연구에서는 이를 위해 홀로렌즈와 키넥트를 사용한 전신 상호작용 기술을 소개한다. 이를 위해 메쉬 특징점 기반 변환, AR 마커 기반 변환, 신체 인식 기반 변환 방법의 3가지 좌표 변환 방식을 제안한다. 메쉬 특징점 기반 변환은 공간 메쉬에 3개의 특징점을 지정하고 변환 행렬을 이용하여 좌표계를 일치시킨다. 이 방법은 수작업이 필요하여 사용성이 떨어지지만 정확도가 8.5mm로 상대적으로 높다. AR 마커 기반 방식은 홀로렌즈s와 키넥트가 동시에 인식하는 AR, QR마커를 사용하여 평균오차 11.2mm로 준수한 정확도를 달성했다. 신체 인식 기반 변환 방법은 두 기기가 동시에 인식하는 머리 혹은 HMD위치와 양 손 혹은 컨트롤러 위치를 이용하여 좌표계를 일치시킨다. 이 방법은 정확도가 떨어지지만 부가적인 도구나 수작업이 필요 없으므로 사용성이 좋다. 또한 후처리 기술로 RANSAC을 적용함으로써 오차를 10% 이상 줄였다. 이러한 3가지 방식은 콘텐츠가 필요한 사용 편의성과 정확도에 따라서 선택적으로 적용할 수 있다. 본 연구에서는 이 기술을 이용해서 '썬더펀치'와 재활 치료 콘텐츠에 적용하여 검증하였다.

• 한국지능시스템학회논문지
• /
• 제18권1호
• /
• pp.20-26
• /
• 2008

지능형 로봇이나 컴퓨터가 일상생활 속에서 차지하는 비중이 점점 높아짐에 따라 인간과의 상호교류도 점점 중요시되고 있다. 이렇게 지능형 로봇(컴퓨터) - 인간의 상호 교류하는데 있어서 감정 인식 및 표현은 필수라 할 수 있겠다. 본 논문에서는 음성 신호와 얼굴 영상에서 감정적인 특징들을 추출한 후 이것을 Bayesian Learning과 Principal Component Analysis에 적용하여 5가지 감정(평활, 기쁨, 슬픔, 화남, 놀람)으로 패턴을 분류하였다. 그리고 각각 매개체의 단점을 보완하고 인식률을 높이기 위해서 결정 융합 방법과 특징 융합 방법을 적용하여 감정 인식 실험을 하였다. 결정 융합 방법은 각각 인식 시스템을 통해 얻어진 인식 결과 값을 퍼지 소속 함수에 적용하여 감정 인식 실험을 하였으며, 특징 융합 방법은 SFS(Sequential Forward Selection) 특징 선택 방법을 통해 우수한 특징들을 선택한 후 MLP(Multi Layer Perceptron) 기반 신경망(Neural Networks)에 적용하여 감정 인식 실험을 실행하였다. 그리고 인식된 결과 값을 2D 얼굴 형태에 적용하여 감정을 표현하였다.