• 전기학회논문지
• /
• 제65권9호
• /
• pp.1557-1563
• /
• 2016

According to recent studies, poor sitting posture of the spine has been shown to lead to a variety of spinal disorders. For this reason, it is important to measure the sitting posture. We proposed a strategy for classification of sitting posture using machine learning. We retrieved acceleration data from single tri-axial accelerometer attached on the back of the subject's neck in 5-types of sitting posture. 6 subjects without any spinal disorder were participated in this experiment. Acceleration data were transformed to the feature vectors of principle component analysis. Support vector machine (SVM) and K-means clustering were used to classify sitting posture with the transformed feature vectors. To evaluate performance, we calculated the correct rate for each classification strategy. Although the correct rate of SVM in sitting back arch was lower than that of K-means clustering by 2.0%, SVM's correct rate was higher by 1.3%, 5.2%, 16.6%, 7.1% in a normal posture, sitting front arch, sitting cross-legged, sitting leaning right, respectively. In conclusion, the overall correction rates were 94.5% and 88.84% in SVM and K-means clustering respectively, which means that SVM have more advantage than K-means method for classification of sitting posture.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2005년도 추계 종합학술대회 논문집
• /
• pp.529-532
• /
• 2005

비정상행위 탐지를 위해서는 사용자의 정상적인 행위 모델링이 중요한 이슈가 된다. 이러한 정상적인 행위를 간략한 프로파일로 생성하기 위해서 기존의 데이터 마이닝 기법들은 주로 고정된 데이터 집합을 이용하였다. 하지만 이러한 접근 방법들은 단순히 사용자 행위의 정적인 면만을 모델링 할 수 있다. 이러한 단점을 극복하기 위해서 사용자의 행위를 연속된 데이터 스트림으로 처리해야 한다. 본 논문에서는 데이터 스트림을 모델링하는 새로운 클러스터링 방법을 제안한다. 이를 위해서, 사용자의 행위의 특성을 표현하는 다양한 특징들로 분류한다. 따라서 각 특징에 대해, 제안된 클러스터링 알고리즘을 이용하여 지금까지 관찰된 특징 값들을 기반으로 클러스터 탐색하게 된다. 결과적으로 사용자의 과거 행위들을 유지할 필요 없이 사용자의 새로운 행위를 클러스터링 결과에 연속적으로 반영될 수 있다.

• 한국통신학회논문지
• /
• 제31권9C호
• /
• pp.853-858
• /
• 2006

음성인식에서 TMHMM(Tied Mixture Hidden Markov Model)은 자유 매개변수의 수를 감소시키기 위한 좋은 접근이지만, GPDF(Gaussian Probability Density Function) 군집화 오류에 의해 음성인식의 오류를 발생시켰다. 본 논문은 TMHMM에서 발생하는 군집화 오류를 최소화하기 위하여 HCNN(Homogeneous Centroid Neural Network) 군집화 알고리즘을 제안한다. 제안된 알고리즘은 CNN(Centroid Neural Network)을 TMHMM상의 음향 특징벡터에 활용하였으며, 다른 상태에 소속된 확률밀도가 서로 겹쳐진 형태의 이질군집 지역에 더 많은 코드벡터를 할당하기 위해서 본 논문에서 새로 제안이 제안되는 이질성 거리척도를 사용 하였다. 제안된 알고리즘을 한국어 고립 숫자단어의 인식문제에 적용한 결과, 기존 K-means 알고리즘이나 CNN보다 각각 14.63%, 9,39%의 오인식률의 감소를 얻을 수 있었다.

• Structural Engineering and Mechanics
• /
• 제44권2호
• /
• pp.179-196
• /
• 2012

An eigenspace projection clustering method is proposed for structural damage detection by combining projection algorithm and fuzzy clustering technique. The integrated procedure includes data selection, data normalization, projection, damage feature extraction, and clustering algorithm to structural damage assessment. The frequency response functions (FRFs) of the healthy and the damaged structure are used as initial data, median values of the projections are considered as damage features, and the fuzzy c-means (FCM) algorithm are used to categorize these features. The performance of the proposed method has been validated using a three-story frame structure built and tested by Los Alamos National Laboratory, USA. Two projection algorithms, namely principal component analysis (PCA) and kernel principal component analysis (KPCA), are compared for better extraction of damage features, further six kinds of distances adopted in FCM process are studied and discussed. The illustrated results reveal that the distance selection depends on the distribution of features. For the optimal choice of projections, it is recommended that the Cosine distance is used for the PCA while the Seuclidean distance and the Cityblock distance suitably used for the KPCA. The PCA method is recommended when a large amount of data need to be processed due to its higher correct decisions and less computational costs.

• Smart Structures and Systems
• /
• 제8권1호
• /
• pp.69-92
• /
• 2011

This paper presents an emergent pattern recognition approach based on the immune network theory and hierarchical clustering algorithms. The immune network allows its components to change and learn patterns by changing the strength of connections between individual components. The presented immune-network-based approach achieves emergent pattern recognition by dynamically generating an internal image for the input data patterns. The members (feature vectors for each data pattern) of the internal image are produced by an immune network model to form a network of antibody memory cells. To classify antibody memory cells to different data patterns, hierarchical clustering algorithms are used to create an antibody memory cell clustering. In addition, evaluation graphs and L method are used to determine the best number of clusters for the antibody memory cell clustering. The presented immune-network-based emergent pattern recognition (INEPR) algorithm can automatically generate an internal image mapping to the input data patterns without the need of specifying the number of patterns in advance. The INEPR algorithm has been tested using a benchmark civil structure. The test results show that the INEPR algorithm is able to recognize new structural damage patterns.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.18-23
• /
• 1993

In this paper, we attempt to estimate the state of a finite state system. In such system, we can observe time series data which has some significant behaviors corresponding to its system states. The behavior is characterized by feature parameters extracted from time series. Our thought is that the system output time series data is expressed as a sequence of behavior patterns which are represented by clusters in feature parameters space. An algorithm jointing fuzzy clustering to fuzzy finite state transition model is suggested.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.229-232
• /
• 2004

In this paper, we propose a robust music retrieval system based on the content analysis of music. New feature extraction method called Multi-Feature Clustering (MFC) is proposed for the robust and optimum performance of the music retrieval system. It is demonstrated that the use of MFC significantly improves the system stability of music retrieval with better classification accuracy.

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

This paper describes a new feature based tracking system that can track moving objects with a pan-tilt camera. We extract corner features of the scene and tracks the features using filtering, The global motion energy caused by camera movement is eliminated by finding the maximal matching position between consecutive frames using Pyramidal template matching. The region of moving object is segmented by clustering the motion trajectories and command the pan-tilt controller to follow the object such that the object will always lie at the center of the camera. The proposed system has demonstrated good performance for several video sequences.

• 대한전자공학회논문지
• /
• 제24권5호
• /
• pp.856-862
• /
• 1987

An local adaptive image segmentatin algorithm for local feature detection and effective clustering of unimodal histogram shape are proposed. Local adaptive difference image and its histogram are obtained from the input image. The parameters are derived from the histogram and used for the segmentation based on relaxatin process. The results showed effective region segmentation and good noise cleaning for the ocular fundus fluorescein angiogram which has low contrast and unimodal histogram.

• 한국컴퓨터정보학회논문지
• /
• 제13권4호
• /
• pp.11-18
• /
• 2008

문서군집은 정보검색의 많은 응용분야에 사용되는 중요한 문서 분석 방법이다. 본 논문은 비음수 행렬 분해(NMF, non-negative matrix factorization)를 기반한 용어 가중치 재산정 방법을 이용하여서 사용자의 요구에 적합한 군집결과를 얻도록 하는 새로운 군집모델을 제안한다. 제안된 모델은 군집형태에 대한 사용자 요구와 기계에 의한 군집 형태의 차이를 최소화하기 위하여 사용자 피드백에 의한 가중치가 재계산된 용어를 이용한다. 또한 제안방법은 용어의 가중치 재계산과 문서군집에 문서집합의 내부구조를 나타내는 의미특징행렬과 의미변수행렬 이용하여 문서군집의 성능을 높일 수 있다. 실험결과 제안방법을 적용한 문서군집방법이 적용하지 않은 문서군 방법에 비하여 좋은 성능을 보인다.