• International Journal of Control, Automation, and Systems
• /
• v.3 no.4
• /
• pp.509-523
• /
• 2005

We are developing a novel framework, PRIDE (PRediction In Dynamic Environments), to perform moving object prediction (MOP) for autonomous ground vehicles. The underlying concept is based upon a multi-resolutional, hierarchical approach which incorporates multiple prediction algorithms into a single, unifying framework. The lower levels of the framework utilize estimation-theoretic short-term predictions while the upper levels utilize a probabilistic prediction approach based on situation recognition with an underlying cost model. The estimation-theoretic short-term prediction is via an extended Kalman filter-based algorithm using sensor data to predict the future location of moving objects with an associated confidence measure. The proposed estimation-theoretic approach does not incorporate a priori knowledge such as road networks and traffic signage and assumes uninfluenced constant trajectory and is thus suited for short-term prediction in both on-road and off-road driving. In this article, we analyze the complementary role played by vehicle kinematic models in such short-term prediction of moving objects. In particular, the importance of vehicle process models and their effect on predicting the positions and orientations of moving objects for autonomous ground vehicle navigation are examined. We present results using field data obtained from different autonomous ground vehicles operating in outdoor environments.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2289-2298
• /
• 1997

This paper proposes a new method to recognize map. In order to minimize the ripple effect of one recognition result affecting another, the structural information is represented with a hierarchical model. and the model is used in both the recognition and verification process. Furthermore, lines related to an entity are searched in a used in both the recognition and verification process. Furthermore, lines related to an entity are searched in a reduced search space by defining some relations between lines. When there is a mis-recognition after verificaiton, recognition process will be retired. In the process, the accurate result can obtained through the change of the parameter values used in the algorithm. As a result, the search space is reduced effectively, and even objects that embodies the broken lines and the crossed lines are recognized.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2197-2207
• /
• 1997

In this paper, we propose a video data segmentation method using edge and color distribution of video frames and also develop a video browser by using the proposed algorithm. To segment a video, we use a 644-bin HSV color histogram and the edge information which generated with automatic threshold method. We consider scene's characteristics by using positions and colo distributions of object in each frame. We develop a hierarchical and a shot-based browser for video browsing. We also show that our proposed method is less sensitive to light effects and more robust to motion effects than previous ones like a histogram-based method by testing with various video data.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.710-715
• /
• 2004

The design problem of manufacturing system is addressed, adopting the closed queueing network model with multiple loops and re-entrant flows. The entire design problem is divided into two hierarchical sub-problems of (1) determining the station configuration and (2) optimizing the lot constitution; then they are tackled by neighbor search algorithm (NSA) and greedy mean value analysis (GMVA), respectively. Unlike the conventional MVA concerning multi-class closed queueing networks, the GMVA doesn't stick to a fixed lot proportion; rather it tries to find the optimal balance. The NSA, on the other hand, improves the object function value by altering the station configuration successively with its superior neighbor. The moderate time complexity, presented in big-${o}$ notation, enables us to apply the method even to the large-size practical cases, and the CPU time of an enlarged problem can be approximated by the same equation. The validity of our analytic approach is backed up by simulation studies with a widespread simulation package.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.102-110
• /
• 1992

In this paper, a new method of character recognition is proposed. It uses density information, in addition to positional and directional information generally used, to recognize a character. Four directional feature primitives are extracted from the thinning templates on the observation that the output of the templates have directional property in general. A simple and fast feature extraction scheme is possible. Features are organized from recursive nonary tree(N-tree) that corresponds to normalized character area. Each node of the N-tree has four directional features that are sum of the features of it's nine sub-nodes. Every feature primitive from the templates are added to the corresponding leaf and then summed to the upper nodes successively. Recognition can be accomplished by using appropriate feature level of N-tree. Also, effectiveness of each node's feature vector was tested by experiment. A method to implement the proposed feature vector organization algorithm into hardware is proposed as well. The third generation node, which is 4$\times$4, is used as a unit processing element to extract features, and it was implemented in hardware. As a result, we could observe that it is possible to extract feature vector for real-time processing.

• Journal of Korean Library and Information Science Society
• /
• v.35 no.4
• /
• pp.451-467
• /
• 2004

This paper is intended to present the theoretical analyses on automatic indexing, which is vital in the process of constructing a thesaurus browser, and clustering algorithms to construct hierarchical relations among terms as well as the methods for the automatic construction of a thesaurus browser. The methods to select the index term automatically in the web documents are studied by surveying the methods for analyzing and processing metadata which conforms to bibliographical roles of traditional paper documents in web documents. Also, the result of the study suggests to adding or involving the metadata in web documents, using the metadata automatic editor because metadata is not listed in most of the web documents.

• Annual Conference of KIPS
• /
• 2006.05a
• /
• pp.709-712
• /
• 2006

다양한 종류의 컴퓨터가 사람, 사물, 환경 속에 내재되어 있고, 이들이 서로 연결되어, 필요한 곳에서 활용할 수 있는 유비쿼터스 환경에서는 홈 네트워크를 통해 이 기종 기기간 다양한 데이터 교환을 요구한다. 더욱이 원활한 영상 데이터의 처리, 전송, 모니터링 기술은 핵심적 요소가 아닐 수 없다. 공간 및 시간적인 해상도, 컬러의 표현 그리고 화질의 측정방법 등 고전적 영상 처리 연구 분야뿐만 아니라 국한된 대역폭을 갖는 홈네트워크의 전송체계에서 전송률 문제에 대한 심도 있는 연구가 필요하다. 본 논문에서는 홈네트워크 상황에서 콘텐츠의 중심이 되는 영상 데이터의 전송과 처리 그리고 제어를 위하여 새로운 움직임 추정 알고리즘을 제안한다. 각도, 거리등 다양한 환경에서 전송되어지는 스테레오 카메라의 영상데이터들은 축소, 확대, 이동, 보정 등 전처리 후 제안된 변형계층 모션벡터 추정 알고리즘을 이용하여 압축 처리, 전송된다. 기존 모션벡터 추정 알고리즘의 장점을 계승하고 단점을 보완한 변형계층 알고리즘은 비정형, 소형 매크로 블록을 이용하여 휘도의 편차가 큰 영상의 효율적 움직임 추정에 이용된다. 본 논문에서 제안한 변형계층 알고리즘과 이를 이용해 구현된 영상시스템은 유비쿼터스 환경에서 다양하게 활용될 수 있다.

• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.91-97
• /
• 2003

The Propose of this paper is hierarchical detection method for the optic disc in fundus image. We detected the optic disc boundary by using the Prior information. It is based on the anatomical knowledge of fundus which are the vessel information. the image complexity. and etc. The whole method can be divided into three stages . First, we selected the region of interest(ROI) which included optic disc region. This is used to calculate location and size of the optic disc which are prior knowledge to simplify image preprocessing. And then. we divided the fundus image into numberous regions with watershed algorithm and detected intial boundary of the optic disc by reducing the number of the separated regions in ROI. Finally, we have searching the defective parts of boundary as a result of serious vessel interference in order to detect the accurate boundary of optic disc and we have removing and interpolating them.

• Journal of The Korean Association For Science Education
• /
• v.33 no.3
• /
• pp.679-693
• /
• 2013

The purpose of this study is to develop an inventory to classify task commitment types of science learning and to classify highschool students' task commitment types. Firstly, inventory questions were designed following the literature analysis on the task commitment components which involve self confidence, high goal setting, and focused attention. Prototype inventory underwent the content validity test, pilot test, and reliability test. Through these steps, final inventory was input to 462 high school students and underwent the factor analysis and cluster analysis. Factor analysis confirmed three components of task commitment as the three factors of inventory questions. In order to find how many clusters exist, factors of developed inventory became new variables. Each factor's factor mean was calculated and served as the new variable of the cluster analysis. Cluster analysis extracted five clusters as task commitment types. The 5 clusters were suggested by the agglomarative schedule and dendrogram gained from a hierarchical cluster analysis with the setting of the Ward algorithm and Squared Euclidean distance. Based on the factor mean score, traits of each cluster could be drawn out. Inventory developed by this study is expected to be used to identify student commitment types and assess the effectiveness of task commitment enhancement programs.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.78.1-78.1
• /
• 2013

The hierarchical model of galaxy formation predicts that galaxy halos contain merger relics in the form of long stellar stream. Thus, tidal substructure of stars around globular clusters, such as tidal tails, could be an essential evidence of the merging scenario in the formation of the Galaxy. From April 2010 to December 2012, we obtained $45^{\prime}{\times}45^{\prime}$ wide-field JHKs near-infrared photometric imaging data for about 20 globular clusters in the Milky Way, and examined the stellar density distribution around globular clusters. Here, we introduce the preliminary results of stellar spatial distributions and radial surface density profiles of four globular clusters. In order to minimize the field star contamination and identify the cluster's member candidates stars, we used a statistical filtering algorithm and gave weights on the CMDs of globular clusters. In two-dimensional stellar density maps, we could found tidal stripping structures for some globular clusters. The orientation of tidal substructure seems to associate with the effects of dynamical interactions with the Galaxy and cluster's orbit. Indeed, the radial surface density profile accurately describes this stripping structures as a break in the slope of profile. The observational results could give us further observational evidence of merging scenario of the formation of the Galaxy.