• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.550-552
• /
• 2010

최근 행위인식 기술은 u-헬스케어 분야를 통해서 실용화되는 단계에 이르고 있다. 실생활에 적용단계에 있는 행위인식 시스템은 기존의 서버 및 데스크톱 환경에서 벗어나 모바일 기기를 기반으로 수행되도록 변해가고 있다. 모바일 환경에 적합한 행위인식 시스템은 행위인식 센서 및 모바일 행위인식 기기의 저전력화와 모바일 기기에 적합한 행위인식 시스템이 요구된다. 본 논문은 모바일기기 기반의 스마트 환경에 알맞은 행위인식 시스템을 위해 행위인식 알고리즘 경량화 기법 연구를 수행한다. 행위별 최적의 낮은 주파수를 사용하여 센싱에 소요되는 자원을 줄인 경량화된 행위인식 방법을 제안하고 또한 주파수 변화에 따른 윈도우간 적절한 오버랩 구간 설정 방법과 윈도우에서의 특징 검출 시 오버랩 구간의 중복 연산을 제거한 경량화된 특징 검출 방법을 제안한다. 실험 결과는 행위 별 최적의 낮은 주파수를 사용하여 전력을 줄이면서도, 서로 다른 주파수의 데이터임에도 인식률은 그대로 유지됨을 보인다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.6
• /
• pp.59-72
• /
• 2012

Since a protein displays its specific functions when disorder region of protein sequence transits to order region with provoking a biological reaction, the separation of disorder region and order region from the sequence data is urgently necessary for predicting three dimensional structure and characteristics of the protein. To classify the disorder and order region efficiently, this paper proposes a classification/prediction method using sequence data while acquiring a non-biased result on a specific characteristics of protein and improving the classification speed. The emerging patterns based EPs-TFP methods utilizes only the essential emerging pattern in which the redundant emerging patterns are removed. This classification method finds the sequence patterns of disorder region, such sequence patterns are frequently shown in disorder region but relatively not frequently in the order region. We expand P-tree and T-tree conceptualized TFP method into a classification/prediction method in order to improve the performance of the proposed algorithm. We used Disprot 4.9 and CASP 7 data to evaluate EPs-TFP technique, the results of order/disorder classification show sensitivity 73.6, specificity 69.51 and accuracy 74.2.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.591-602
• /
• 2003

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.495-502
• /
• 2013

Motion estimation (ME) that limits the performance of image quality and encoding speed has been developed to reduce temporal redundancy in video sequences and plays an important role in digital video compression. But it is computational demanding part of the encoder. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. ME for Multi-view video requires high computational complexity. To reduce computational complexity and maintain the image quality, a fast motion estimation method is proposed in this paper. The proposed method uses a hierarchical search strategy. This strategy method consists of modified diamond search patten, multi gird diamond search pattern, and raster search pattern. These search patterns place search points symmetrically and evenly that can cover the overall search area not to fall into the local minimum or exploits the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over TZ search method (JMVC) can be up to 1.2 ~3 times faster while maintaining similar video quality and bit rates.

• The Korean Journal of Applied Statistics
• /
• v.21 no.1
• /
• pp.141-149
• /
• 2008

Recently we frequently analyze multivariate data with quite large number of variables. In such data sets, virtually duplicated variables may exist simultaneously even though they are conceptually distinguishable. Duplicate variables may cause problems such as the distortion of principal axes in principal component analysis and factor analysis and the distortion of the distances between observations, i.e. the input for cluster analysis. Also in supervised learning or regression analysis, duplicated explanatory variables often cause the instability of fitted models. Since real data analyses are aimed often at multiple purposes, it is necessary to reduce the number of variables to a parsimonious level. The aim of this paper is to propose a practical algorithm for selection of a subset of variables from a given set of p input variables, by the criterion of minimum trace of partial variances of unselected variables unexplained by selected variables. The usefulness of proposed method is demonstrated in visualizing the relationship between selected and unselected variables, in building a predictive model with very large number of independent variables, and in reducing the number of variables and purging/merging categories in categorical data.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.79-86
• /
• 2009

The tuple of constraint database consists of constraint logical formula and it could process the presentation and query of the constraint database simply. Query operation processing shall include the constraint formula between related tuple such as selection, union, intersection of spatial data through the constraint database. However, this could produce the increasing of duplicated or unnecessary data. Hence, it will drive up the cost as per quality. This paper identified problems regarding query processing result in the constraint database. Also this paper suggested the tuple minimization summary method for result relation and analyzed the effects for efficient query processing. We were able to identify that the effectiveness of the query processing was enhanced by eliminating unnecessary constraint formula of constraint relation using the tuple minimization method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.94-99
• /
• 2008

In the pattern classification problem, feature selection is an important technique to improve performance of the classifiers. Particularly, in the case of classifying with a large number of features or variables, the accuracy of the classifier can be improved by using the relevant feature subset to remove the irrelevant, redundant, or noisy data. In this paper we propose a feature selection method using genetic algorithm and information theory. Experimental results show that this method can achieve better performance for pattern recognition problems than conventional ones.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.634-644
• /
• 1995

In this paper, we propose a mechanism to transform more effective and semantically equivalent queries by using appropriately represented three kinds of knowledge. Also we proposed a mechanism which transforms partially omitted components or expressions into complete queries so that users can use more simple queries. The knowledges used to transform and optimize are semantic, structural and domain knowledge. Semantic knowledge includes semantic integrity constraints and domain integrity constraints. Structural knowledge represents physical relationship between relations. And domain knowledge maintains the domain information of attributes. The proposed system optimizes to more effective queries by eliminating/adding/replacing unnecessary or redundant restrictions/joins.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.55-61
• /
• 2013

The important issue in header compression would be how to compress the dynamic field increasing constantly between consecutive packets in the head of IP wireless networks. Existent header compression scheme that can eliminated repeated field in header are RFC2507, RFC3095 and E-ROHC scheme. In this paper, I propose a new method of compressing TS fields, which are the Dynamic fields of the RTP packet, into BCB (Basic Compression Bits) basic bits or NCB (Negotiation Compression Bits, BCB + additional bits) bits. In order to verify the proposed header compression method, I have simulation about proposed video packets of IP wireless networks. using Visual SLAM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.779-785
• /
• 2002

This paper presents a phase-based stereo matching algorithm in order to efficiently extract 3-dimensional objects from two 2D images. Conventional phase-based methods, especially using windowed Fourier phases, inherit good properties in the case of hierarchical approaches, because they basically use a multi-resolution phase map. On the contrary, their computational costs are very heavy. Therefore, a fast hierarchical approach, using multi-resolution phase-based strategy and reducing the redundancy of phase calculations, is proposed in this pare. In addition, a structural matching algorithm on the phase domain is adopted to improve the matching quality. In experimental results, it is shown that the computation loads are considerably reduced about 8 times and stable outputs are obtained.