• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.375-387
• /
• 2012

This paper proposes a new real-time object tracking algorithm using particle filters with color and texture features in moving CCD camera images. If the user selects an initial object, this region is declared as a target particle and an initial state is modeled. Then, N particles are generated based on random distribution and CS-LBP (Centre Symmetric Local Binary Patterns) for texture model and weighted color distribution is modeled from each particle. For observation likelihoods estimation, Bhattacharyya distance between particles and their feature models are calculated and this observation likelihoods are used for weights of individual particles. After weights estimation, a new particle which has the maximum weight is selected and new particles are re-sampled using the maximum particle. For performance comparison, we tested a few combinations of features and particle filters. The proposed algorithm showed best object tracking performance when we used color and texture model simultaneously for likelihood estimation.

• The Journal of Korean Association of Computer Education
• /
• v.20 no.1
• /
• pp.27-38
• /
• 2017

The United States (CS2013) and Japan (J07-CS) constitute a standard informatics curriculum that reflects a changing society at the level of higher education. This study analyzed the change of standard curriculum in the United States in order to provide implications for the standard composition of higher education curriculum in Korea. The subjects were composed based on the analysis of current status of university curriculum and content knowledge in Korea. As a result of the research, the Informatics curriculum in the United States has evolved into a curriculum reflecting the changing computing environment. The information curriculum of domestic colleges included only 52% of the knowledge area of CS2013. The purpose of this study is to provide an example of the composition of subjects based on the curriculum composition policy of Japan and to provide a basis for the curriculum composition without the standard informatics education course of the college in korea.

• The Journal of Korean Association of Computer Education
• /
• v.20 no.4
• /
• pp.37-46
• /
• 2017

Since 2018, the level of informatics education that is mandatory in junior high schools depends on the subject matter expertise of Informatics & Computer teachers. The purpose of this study is to analyze whether secondary teacher training institutes provide curriculum that guarantees the subjectivity of Informatics & Computer teachers. In order to achieve the goal, this study first compares curriculum courses for educating Informatics & Computer teachers of Korea secondary teacher training institutes with subjects based on the content system of J07-CS, the informatics education in Japan. Second, we compare the basic subjects offered by the Ministry of Education with the vocational subjects. Third, we analyzed the basic subjects of each university. As a result of the study, the number of informatics-related courses opened by Korean secondary teacher training institutions was insufficient compared to the number of subjects in J07-CS. Even though the standard of comparison was limited to basic subjects, the content elements were insufficient, and the ratio of the basic subjects of each university was low. In order to achieve the goal of informatics education from 2018, it is urgent to improve the curriculum of secondary education teachers.

• Journal of Distribution Research
• /
• v.15 no.1
• /
• pp.25-47
• /
• 2010

CS is one of the major concerns of managers in the world because it is well known to be a key medium construct for firms' superior outcome. One of the major agents for CS management is retailers. Firms try to manage not only employees but also retailers to promote CS behaviors. And so diverse incentives are used to promote their CS behaviors under diverse channel setting such as multi-channel. However in spite of the rising needs there has been scarce studies on the optimal incentive structure for a manufacturer to offer competing retailers at the multi-channel. In this paper, we try to find better way for a manufacturer to promote the competing retailers' CS behaviors. We investigated how to promote the retailers' CS behavior via game-theoretic modeling. Especially, we focus on the possible incentive, CS bonus type reward introduced in the studies of Hauser, Simester, and Wernerfelt(1994) and Chu and Desai(1995). We build up a multi stage complete information game and derive a subgame perfect equilibrium using backward induction. Stages of the game are as following. (Stage 1) Manufacturer sets wholesale price(w) and CS bonus($\eta$). (Stage 2) Both retailers in competition set CS effort level($e_i$) and retail price($p_i$) simultaneously. (Stage 3) Consumers make purchasing decisions based on the manufacturer's initial reputation and retailers' CS efforts.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.3
• /
• pp.209-216
• /
• 2011

Recently the design of SoCs(System-on-Chips) in which TCM is embedded for high speed operation increases rapidly. In this paper, a parallel test structure for eDRAM-based TCM embedded in SoCs is proposed. In the presented technique, the MUT (Memory Under Test) is changed to parallel structure and it increases testability of MUT with boundary scan chains. The eDRAM is designed in structure for parallel test so that it can be tested for each modules. Dynamic test can be performed based on input-output data. The proposed techniques are verified their performance by circuits simulation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.799-803
• /
• 2010

The KDB-tree is a traditional indexing scheme for retrieving multidimensional data. Much research for KDB-tree family frequently addresses the low storage utilization and insufficient retrieval performance as their two bottlenecks. The bottlenecks occur due to a number of unnecessary splits caused by data insertion orders and data skewness. In this paper, we propose a novel index structure, called as $KDB_{CS}^+$-tree, to process skewed data efficiently and improve the retrieval performance. The $KDB_{CS}^+$-tree increases the number of fan-outs by exploiting bit-vectors for representing splitting information and pointer elimination. It also improves the storage utilization by representing entries as a hierarchical structure in each internal node.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2017.05a
• /
• pp.207-212
• /
• 2017

Korean civil airworthiness requirements of powerplant system are regulated on KAS Part 23 and Part 33. These are equivalent to FAR Part 23, Part 33 of FAA and CS-23, CS-E of EASA. FAA and EASA rewrites entire airworthiness requirements for the small airplane. It changed current 'prescriptive regulation' into 'performance-based regulation' which makes the object of safety performance. Powerplant requirements are also changed extensively by these concept revolution. In accordance with reorganization, we studied new powerplant system requirements of FAR Part 23 and proposed ideal direction to rewrite of Korean Airworthiness Standard rewrite.

• Annual Conference on Human and Language Technology
• /
• 2002.10e
• /
• pp.92-97
• /
• 2002

의미기반 정보 검색, 자연어 질의 응답, 지식 자동 습득, 담화 처리 등 높은 수준의 자연언어처리 시스템에서 의미처리를 위한 대용량의 지식 베이스가 필요하다. 이러한 지식 베이스 중에서 가장 기본적인 것이 워드넷이다. 이러한 워드넷을 이용함으로써 여러 의미 사이의 의미 유사도를 구할 수 있고, 속성을 물려받을 수 있기 때문에 비슷한 속성을 가진 의미들을 한꺼번에 다루는 데 유용하다. 본 논문에서는 기본 어휘를 바탕으로 기존의 명사 워드넷과 단일어 사전을 이용하여 한국어 동사 워드넷을 구축하는 방법을 제시한다. 본 논문에서 1차 작업을 통하여 구축한 동사 워드넷에는 동사 1,757개에 대한 4,717개의 의미(중복을 포함하면 모두 5,235개의 의미)를 포함하고 있으며 특별히 의미가 많이 편중된 14개의 개념에 속한 571개의 의미를 53개의 세부 개념으로 재분류하여 최종적으로 모두 767개의 계층적 개념으로 구성된 동사 워드넷이 만들어 졌다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.134-136
• /
• 2000

본 논문에서는 고차원의 특징 벡터 공간에서의 객체에 대한 효율적인 검색을 지원하는 셀기반 시그니쳐 트리 색인 구조(CS-트리, CI-트리)를 제안한다. 특징 벡터 공간을 셀로써 분할하고 특징 벡터는 셀의 시그니쳐로 표현되며 트리에 저장된다. 특징 벡터 대신 시그니쳐를 사용하여 트리의 깊이가 낮아짐으로서 검색을 효율적으로 수행할 수 있다. 또한 셀에 적합한 새로운 가지치기 거리를 이용한 유사성 검색 알고리즘으로 수행할 수 있다. 또한 셀에 적합한 새로운 가지치기 거리를 유사성 검색 알고리즘을 제시한다. 마지막으로 우수한 고차원 색인 기법으로 알려져 있는 X-트리와 성능 비교를 수행하여, 성능비교 결과 본 논문에서 제안하는 CS-트리와 CI-트리가 검색 시간 측면에서 최대 30%의 검색 성능이 개선됨을 보인다.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.104-110
• /
• 2014

This paper considers two reconstruction schemes of structured-sparse signals, turbo inference and Markov chain Monte Carlo (MCMC) inference, in compressed sensing(CS) technique that is recently getting an important issue for an efficient video wireless transmission system using multi-copter as an unmanned aerial vehicle. Proposed reconstruction algorithms are setting importance on reduction of image data sizes, fast reconstruction speed and errorless reconstruction. As a result of experimentation with twenty kinds of images, we can find turbo reconstruction algorithm based on loopy belief propagation(BP) has more excellent performances than MCMC algorithm based on Gibbs sampling as aspects of average reconstruction computation time, normalized mean squared error(NMSE) values.