• 대한인간공학회지
• /
• 제27권4호
• /
• pp.73-83
• /
• 2008

With a rapid extension of functions in mobile phones, text input method has become very important for mobile phone users. Previous studies for text input methods were focused on Fitts' law, emphasizing expert's behaviors with one-handed text input method. However, it was observed that 97% of Korean mobile phone users input texts with two-hands. Therefore, this study was designed to develop a prediction model of two-handed Hangul text entry method including novice users as well as experts for mobile phone. For this study, Fitts' law was hypothesized to predict experts' movement time(MT) whereas Hick-Hyman law for visual search time was hypothesized to be added to MT for novices. The results showed that the prediction model was well fitted with the empirical data for both experts and novices with less than 3% error rates. In conclusion, this prediction model of two-handed Hangul text entry including novice users was proven to be a very effective model for modeling two-handed Hangul text input behavior for both experts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.2094-2112
• /
• 2019

Focusing on the issue that the conventional Kernel Correlation Filter (KCF) algorithm has poor performance in handling scale change and obscured objects, this paper proposes an anti-occlusion and scale adaptive tracking algorithm in the basis of KCF. The average Peak-to Correlation Energy and the peak value of correlation filtering response are used as the confidence indexes to determine whether the target is obscured. In the case of non-occlusion, we modify the searching scheme of the KCF. Instead of searching for a target with a fixed sample size, we search for the target area with multiple scales and then resize it into the sample size to compare with the learnt model. The scale factor with the maximum filter response is the best target scaling and is updated as the optimal scale for the following tracking. Once occlusion is detected, the model updating and scale updating are stopped. Experiments have been conducted on the OTB benchmark video sequences for compassion with other state-of-the-art tracking methods. The results demonstrate the proposed method can effectively improve the tracking success rate and the accuracy in the cases of scale change and occlusion, and meanwhile ensure a real-time performance.

• 인지과학
• /
• 제26권3호
• /
• pp.301-322
• /
• 2015

본 연구는 정서가를 가진 소리가 시각탐색만족현상에 미치는 영향에 대해 알아보고자 하였다. 시각탐색만족현상은 목표자극이 여러 개 존재하는 상황에서 하나의 목표자극을 찾고 나면 나머지 목표자극을 찾을 가능성이 낮아지는 현상이다. 이러한 현상에 대한 원인 규명에 대한 연구들 중 정서정보를 가진 자극의 효과를 알아본 연구는 부족한 실정이다. 따라서 본 연구는 소리의 정서가가 시각탐색만족현상에 어떤 영향을 주는지 알아보기 위하여 실험을 진행하였다. 또한 시선추적을 통해 시각탐색만족현상이 일어나는 원인을 찾고자 하였다. 참가자들이 알파벳 T자를 탐색하는 과제 도중 긍정적, 부정적 소리를 제시하였다. 그 결과, 부정적 소리가 제시되었을 때 사전적 정의의 시각탐색만족현상이 가장 크게 나타났다. 하지만 이는 현저성이 낮은 단일 목표자극 시행의 정확도가 월등히 좋았기 때문에 나타난 것이다. 효율성의 지표인 반응 시간은 목표자극 조건과 관계없이 부정적 소리가 주어졌을 때 가장 빨랐다. 목표자극 위에 떨어지는 응시점을 분류해본 결과, 목표자극을 응시하지 않아서 생기는 주사 오류가 가장 많이 나타났다. 본 연구의 결과는 소리의 유인과 각성수준의 상호작용에 의해 인지적 수행이 영향을 받는다는 관점에서 이해될 수 있다.

• 지능정보연구
• /
• 제19권4호
• /
• pp.55-79
• /
• 2013

본 연구에서는 집중형 센터를 가진 역물류네트워크(Reverse logistics network with centralized centers : RLNCC)를 효율적을 해결하기 위한 혼합형 유전알고리즘(Hybrid genetic algorithm : HGA) 접근법을 제안한다. 제안된 HGA에서는 유전알고리즘(Genetic algorithm : GA)이 주요한 알고리즘으로 사용되며, GA 실행을 위해 0 혹은 1의 값을 가질 수 있는 새로운 비트스트링 표현구조(Bit-string representation scheme), Gen and Chang(1997)이 제안한 확장샘플링공간에서의 우수해 선택전략(Elitist strategy in enlarged sampling space) 2점 교차변이 연산자(Two-point crossover operator), 랜덤 돌연변이 연산자(Random mutation operator)가 사용된다. 또한 HGA에서는 혼합형 개념 적용을 위해 Michalewicz(1994)가 제안한 반복적언덕오르기법(Iterative hill climbing method : IHCM)이 사용된다. IHCM은 지역적 탐색기법(Local search technique) 중의 하나로서 GA탐색과정에 의해 수렴된 탐색공간에 대해 정밀하게 탐색을 실시한다. RLNCC는 역물류 네트워크에서 수집센터(Collection center), 재제조센터(Remanufacturing center), 재분배센터(Redistribution center), 2차 시장(Secondary market)으로 구성되며, 이들 각 센터 및 2차 시장들 중에서 하나의 센터 및 2차 시장만 개설되는 형태를 가지고 있다. 이러한 형태의 RLNCC는 혼합정수계획법(Mixed integer programming : MIP)모델로 표현되며, MIP 모델은 수송비용, 고정비용, 제품처리비용의 총합을 최소화하는 목적함수를 가지고 있다. 수송비용은 각 센터와 2차 시장 간에 제품수송에서 발생하는 비용을 의미하며, 고정비용은 각 센터 및 2차 시장의 개설여부에 따라 결정된다. 예를 들어 만일 세 개의 수집센터(수집센터 1, 2, 3의 개설비용이 각각 10.5, 12.1, 8.9)가 고려되고, 이 중에서 수집센터 1이 개설되고, 나머지 수집센터 2, 3은 개설되지 않을 경우, 전체고정비용은 10.5가 된다. 제품처리비용은 고객으로부터 회수된 제품을 각 센터 및 2차 시장에서 처리할 경우에 발생되는 비용을 의미한다. 수치실험에서는 본 연구에서 제안된 HGA접근법과 Yun(2013)의 연구에서 제안한 GA접근법이 다양한 수행도 평가 척도에 의해 서로 비교, 분석된다. Yun(2013)이 제안한 GA는 HGA에서 사용되는 IHCM과 같은 지역적탐색기법을 가지지 않는 접근법이다. 이들 두 접근법에서 동일한 조건의 실험을 위해 총세대수 : 10,000, 집단의 크기 : 20, 교차변이 확률 : 0.5, 돌연변이 확률 : 0.1, IHCM을 위한 탐색범위 : 2.0이 사용되며, 탐색의 랜덤성을 제거하기 위해 총 20번의 반복실행이 이루어 졌다. 사례로 제시된 두 가지 형태의 RLNCC에 대해 GA와 HGA가 각각 실행되었으며, 그 실험결과는 본 연구에서 제안된 HGA가 기존의 접근법인 GA보다 더 우수하다는 것이 증명되었다. 다만 본 연구에서는 비교적 규모가 작은 RLNCC만을 고려하였기에 추후 연구에서는 보다 규모가 큰 RLNCC에 대해 비교분석이 이루어 져야 할 것이다.

• 생명과학회지
• /
• 제18권8호
• /
• pp.1132-1139
• /
• 2008

CpG island는 유전자의 발현 기작과 많은 관련이 있다. 포유동물 유전자의 약 $30{\sim}60$% 정도의 프로모터와 엑손부위에 CpG island가 존재 한다. 최근의 연구 결과에 따르면 CpG island의 과메틸화는 주요 암 억제유전자들을 불활성화 시켜 암을 일으키는 주요 요인이 되는 것으로 밝혀졌다. CpG island의 과메틸화는 거의 모든 암 종류에서 발견되고 있다. 따라서 CpG island를 검색하는 프로그램은 매우 중요한 의미를 갖는다. 그래서 D. Takai 와 P. A. Jones 등이 2002년 검증한 CpG island 정의 기준을 이용하여 윈도우 기반의 소프트웨어 프로그램인 CpGi를 개발하였다. CpGi는 Visual C++ 6.0로 구현하였으며, 입력서열 양식은 FASTA 포맷을 허용하도록 구성하였다. CpGi의 검색 성능을 평가하기 위해 2개의 인간 Contig, 즉, AP00524 (22번 염색체)와 NT_029490.3 (21번 염색체) 등을 대상으로 기존의 다른 CpG island 검색 프로그램인 Emboss-CpGPlot 및 CpG Island Searcher 등과 검색결과를 비교 분석하였다. CpGi에 의한 검색 결과는 다른 두 프로그램에 비해 같거나 오히려 보다 정확한 검색 결과를 보여주었다. CpGi는 사용자 친화적인 윈도우 인터페이스로 구현되어 있어 사용자가 프로그램을 구동하고 이용하기 매우 쉽고, 분석결과에 대한 이해도 용이하다. 본 프로그램은 사용자가 지정한 파라미터 값들(%GC, Obs (CpG)/Exp (CpG), 분석 윈도우 크기, 스텝크기, Gap 허용치, #CG)에 의해 CpG island의 위치를 결정하고, G+C%와 CpG island의 위치를 시각적으로 보여준다. 결과적으로, CpGi는 CpG island 관련 실험 연구자들뿐만 아니라 대용량 서열 분석 및 주석 작업을 위해 매우 유용한 도구로 활용될 수 있을 것이다.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권11호
• /
• pp.596-603
• /
• 2004

This paper proposes an expert system based on the pattern recognition method which can enhance the accuracy and effectiveness of real-time bus reconfiguration strategy for the transfer of faulted load when a main transformer fault occurs in the automated substation. The minimum distance classification method is adopted as the pattern recognition method of expert system. The training pattern set is designed MTr by MTr to minimize the searching time for target load pattern which is similar to the real-time load pattern. But the control pattern set, which is required to determine the corresponding bus reconfiguration strategy to these trained load pattern set is designed as one table by considering the efficiency of knowledge base design because its size is small. The training load pattern generator based on load level and the training load pattern generator based on load profile are designed, which are can reduce the size of each training pattern set from max L/sup (m+f)/ to the size of effective level. Here, L is the number of load level, m and f are the number of main transformers and the number of feeders. The one reduces the number of trained load pattern by setting the sawmiller patterns to a same pattern, the other reduces by considering only load pattern while the given period. And control pattern generator based on exhaustive search method with breadth-limit is designed, which generates the corresponding bus reconfiguration strategy to these trained load pattern set. The inference engine of the expert system and the substation database and knowledge base is implemented in MFC function of Visual C++ Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and pattern recognition solution based on diversity event simulations for typical distribution substation.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권12호
• /
• pp.637-644
• /
• 2004

This paper proposes an expert system with the knowledge learning capability which can enhance the safety and effectiveness of substation operation in the automated substation as well as existing substation by inferring multiple events such as main transformer fault, busbar fault and main transformer work schedule under multiple inference mode and multiple objective mode and by considering totally the switch status and the main transformer operating constraints. Especially inference mode includes the local minimum tree search method and pattern recognition method to enhance the performance of real-time bus reconfiguration strategy. The inference engine of the expert system consists of intuitive inferencing part and logical inferencing part. The intuitive inferencing part offers the control strategy corresponding to the event which is most similar to the real event by searching based on a minimum distance classification method of pattern recognition methods. On the other hand, logical inferencing part makes real-time control strategy using real-time mode(best-first search method) when the intuitive inferencing is failed. Also, it builds up a knowledge base or appends a new knowledge to the knowledge base using pattern learning function. The expert system has main transformer fault, main transformer maintenance work and bus fault processing function. It is implemented as computer language, Visual C++ which has a dynamic programming function for implementing of inference engine and a MFC function for implementing of MMI. Finally, it's accuracy and effectiveness is proved by several event simulation works for a typical substation.

• 한국측량학회지
• /
• 제31권6_2호
• /
• pp.585-592
• /
• 2013

CBIR is an effective tool to search and extract image contents in a large remote sensing image database queried by an operator or end user. However, as imaging principles are different by sensors, their visual representation thus varies among image modality type. Considering images of various modalities archived in the database, image modality difference has to be tackled for the successful CBIR implementation. However, this topic has been seldom dealt with and thus still poses a practical challenge. This study suggests a cross modality CBIR (termed as the CM-CBIR) method that transforms given query feature vector by a supervised procedure in order to link between modalities. This procedure leverages the skill of analyst in training steps after which the transformed query vector is created for the use of searching in target images with different modalities. Current initial results show the potential of the proposed CM-CBIR method by delivering the image content of interest from different modality images. Despite its retrieval capability is outperformed by that of same modality CBIR (abbreviated as the SM-CBIR), the lack of retrieval performance can be compensated by employing the user's relevancy feedback, a conventional technique for retrieval enhancement.

• 대한인간공학회지
• /
• 제26권2호
• /
• pp.103-112
• /
• 2007

This study was designed to validate Spreading Activation Theory (SAT) for an evaluation methodology for menu structure through Eye-Tracking approach. When a visual search is on the way, more eye fixations and time are necessary to visually process complex and vague area. From the aspect of recognition, well-designed menu structures were hypothesized to have fewer numbers of fixations and shorter duration because well-designed menu structures reflecting the users' mental model would be well matched with the product's menu structure, resulting in reducing the number of fixations and duration time. The results show that the shorter reaction times for SAT had significantly fewer numbers of fixation and shorter duration time as the hypothesis for this study stated. In conclusion, SAT was proved to be an effective evaluation methodology for menu structure with the eye tracking equipment. In addition, using SAT instead of the real performance experiment would be useful for designing user-centered systems and convenient information structures because SAT was proven to be the theoretical background for design and evaluation of menu structures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권6호
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.