• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.7B
• /
• pp.968-974
• /
• 2001

최근 정보통신기술의 발전과 함께 영상매체의 급속한 증가로 영상의 효율적인 관리와 검색의 필요성이 요구되면서 내용기반 영상검색이 핵심기술로 대두되고 있다. 내용기반 영상검색에서 영상의 특징을 표현하기 위해 색상 히스토그램을 많이 사용하고 있으나, 색상만을 고려하는 것은 많은 단점을 지니고 있으므로 본 논문에서는 먼저 순차영역분할(sequential clustering)기법을 도입하여 영역을 분할하며, 분할된 영역의 색상평균값과 영역의 중심점으로부터의 거리 히스토그램을 영상의 특징으로 구하여 이를 비교함으로써 색상과 공간정보를 함께 고려하는 방법을 제안한다. 제안된 방법의 특성의 수가 18개로 타 방법보다 매우 작은 저장공간을 가지면서도 동시에 검색효율이 8.5% 이상 개선되었다. Precision 대 Recall에서도 각 질의영상에서 대부분의 Recall 값에서 제안한 방법의 우수함이 확인되었으며, 시각적으로도 양호한 검색결과를 얻을 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.766-768
• /
• 2004

자연영상에서 획득된 문자를 인식하는 연구는 대부분 디지털 카메라나 캠코더를 이용하여 획득된 고해상도 영상을 입력영상으로 사용하고 있다. 본 논문에서는 휴대폰 카메라로 획득된 저해상도 영상을 입력영상으로 사용하였다. 저해상도의 영상은 적은 수의 픽셀로 정보를 표현하고 있기 때문에 기존에 제시되었던 다양한 이진화 방법으로는 문자와 배경을 깨끗하게 분리해 낼 수 없다. 본 논문은 입력영상의 이진화를 위친 K-Means 알고리즘을 이용하여 칼라 클러스터링을 하였으며, 이진화 성능을 향상시키기 위해 지능형 주파수 필터를 사용하였다. 이진화된 영상을 파이프라인 구조의 인식 시스템에 인식시킴으로써 기존의 제안 방법들에 비하여 인식 성능을 향상시킬 수 있었다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1826-1835
• /
• 2007

In this paper, we present a new approach for automatic detection and tracking for multiple targets. We combine a highest probability data association(HPDA) algorithm for target detection with a particle filter for multiple target tracking. The proposed approach evaluates the probabilities of one-to-one assignments of measurement-to-track and the measurement with the highest probability is selected to be target- originated, and the measurement is used for probabilistic weight update of particle filtering. The performance of the proposed algorithm for target tracking in clutter is compared with the existing clustering algorithm and the sequential monte carlo method for probability hypothesis density(SMC PHD) algorithm for multi-target detection and tracking. Computer simulation studies demonstrate that the HPDA algorithm is robust in performing automatic detection and tracking for multiple targets even though the environment is hostile in terms of high clutter density and low target detection probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.3B
• /
• pp.315-322
• /
• 2001

최근 정보통신기술의 발전과 함께 영상매체의 급속한 증자로 영상의 효율적인 관리와 검색을 수행하기 위한 내용기반 영상검색은 핵심기술로 대두되고 있다. 내용기반 영상검색에서 영상의 특징을 표현하기 위해 색상 히스토그램을 많이 사용하고 있으나, 색상만을 고려하는 것은 많은 단점을 지니고 있으므로 본 논문에서는 영상의 특징으로 색상과 공간 정보를 함께 고려하기 위한 순차영역분할(sequential clustering) 기법을 도입하며, 분할된 영역의 색상평균값, 분산값과 영역의 크기를 특성벡터로 제안한다. 제안된 방법의 특성의수가 18개로 타 방법보다 매우 작은 저장공간을 가지면서도 검색효율이 8.8%이상 개선되었다. Precision 대 Recall에서도 각 질의 영상에서 대부분의 Recall 값에서 제안한 방법이 우수함이 확인되었으며, 시각적으로도 양호한 검색결과를 얻을 수 있었다.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.587-590
• /
• 2005

Reactive plans for a box-pushing task of a mobile robot are automatically built up, where sequential action plans are found in a configuration space by A* algorithm for various initial configurations. Then, conjunction of conditions to associate with a same behavior are found by a back tracking algorithm. And corresponding reactive plans are generated. Finally, a clustering technique is applied to identify which reactive plan should be applied for a given perceptual condition. Several simulation results are shown to justify our proposed approach.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.114-122
• /
• 2000

This paper proposes a classification method using an amorphous Prototype to minimize classification error caused by such fixed-Prototype-based methods as Fuzzy C-Means, Nearest Neighborring Classification, FMMCNN, and Fuzzy-ART. For this method, a new fuzzy neural network is introduced, in which a convex polytope is generated or adaptively reshaped to classify the given datum into a proper group. Thus, this method contains a function to classify sequential data set. To show the validity of this method, various numerical experiments including comparison results with FMMCNN are presented

• IE interfaces
• /
• v.11 no.1
• /
• pp.183-190
• /
• 1998

This paper is concerned with the bicriteria vehicle routing problems with time window constraints(BVRPTW). The BVRPTW is to determine the most favorable vehicle routes that minimize the total vehicle travel time and the total customer wait time which are, more often than not, conflicting. We construct a linear goal programming (GP) model for the BVRPTW and propose a heuristic algorithm to relieve a computational burden inherent to the application of the GP model. The heuristic algorithm consists of a parallel insertion method for clustering and a sequential linear goal programming procedure for routing. The results of computational experiments showed that the proposed algorithm finds successfully more favorable solutions than the Potvin an Rousseau's method that is known as a very good heuristic for the VRPs with time window constraints, through the change of target values and the decision maker's goal priority structure.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.339-341
• /
• 2012

This paper presents a method for generating an autonomous activity-based diary in the environment including a personal computer (PC). In order to record a user's various tasks in front of a PC, we consider the contextual information such as current time, opened programs, and user interactions. As one modality for the user interaction, a motion sensor was applied to recognize a user's hand gestures in case that the activity is conducted without interaction between the user and the PC. Moreover, we propose a temporal clustering method to recapitulate the sequential and meaningful activity in the stream of extracted PC usage logs. By combining those two processes, we summarize the user activities in the PC environment.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.65-70
• /
• 2011

Advertizing postal system combined with GIS and temporal/spatial mining techniques has been developed to activate advertizing service and conduct marketing campaign efficiently. In order to select customers accurately, this system provide purchase propensity information using sequential, cyclicpatterns and lifesytle information through RFM analysis and clustering technique. It is possible for corporate mailer to do customer oriented marketing campaign with the advertizing postal system as well as 'one-stop' service including target customer selection, mail production, and delivery request.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.610-617
• /
• 2003

Similarity matching in video database is of growing importance in many new applications such as video clustering and digital video libraries. In order to provide efficient access to relevant data in large databases, there have been many research efforts in video indexing with diverse spatial and temporal features. however, most of the previous works relied on sequential matching methods or memory-based inverted file techniques, thus making them unsuitable for a large volume of video databases. In order to resolve this problem, this paper proposes an effective and scalable indexing technique using a trie, originally proposed for string matching, as an index structure. For building an index, we convert each frame into a symbol sequence using a window order heuristic and build a disk-resident trie from a set of symbol sequences. For query processing, we perform a depth-first search on the trie and execute a temporal segmentation. To verify the superiority of our approach, we perform several experiments with real and synthetic data sets. The results reveal that our approach consistently outperforms the sequential scan method, and the performance gain is maintained even with a large volume of video databases.