• Title/Summary/Keyword: 방대욱

Search Result 65, Processing Time 0.026 seconds

Design and Implementation of Contextual Information Analysis System in USN Environment (USN 환경에서의 상황정보 분석 시스템의 설계 및 구현)

  • Cheng Hao Jin;Yongmi Lee;Kwang Woo Nam;Jun Wook Lee;Keun Ho Ryu
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.422-425
    • /
    • 2008
  • 최근 IT 기술의 발전과 더불어 다양한 종류의 컴퓨터가 사람, 사물, 환경 속으로 스며들어 네트워크 망을 이루는 USN(Ubiquitous Sensor Network) 환경이 급속히 보급되고 있다. USN 환경에서 수집되는 센서 스트림 데이터는 연속적이며 동적으로 끊임없이 전달이 되기 때문에 그 양이 방대하며 또한 제한된 메모리를 사용하기 때문에 모든 데이터를 저장하여 처리할 수는 없게 된다. 스트림 데이터의 이러한 특성 때문에 본 논문에서는 입력되는 스트림 상황정보에 대해서 신속한 상황 분석 서비스를 진행하기 위하여 슬라이딩 윈도우 기법을 지원하는 상황정보 분석 시스템을 제안한다. 이 시스템은 온도, 습도, 조도 등 스트림 데이터에 대해서 WHEN-DO 상황질의모델을 적용하여 상황질의모델의 조건 만족 여부를 판단하고 특정 행동을 취한다. 따라서 본 논문에서 제안한 시스템은 실시간 건물의 상황정보를 수집하여 상태를 모니터링 하는 등 많은 USN 응용분야에 적용이 가능하다.

A Design of Greenhouse Control Algorithm with the Multiple-Phase Processing Scheme (다중 위상 처리구조를 갖는 온실 복합환경제어 알고리즘 설계)

  • Daewook Bang
    • Journal of Service Research and Studies
    • /
    • v.11 no.2
    • /
    • pp.118-130
    • /
    • 2021
  • This study designs and validates a greenhouse complex environmental control algorithm with a multi-phase processing scheme that can combine and control actuators according to the degree of change in the greenhouse environment. The composite environmental control system is a system in which the complex environmental controller analyzes the information detected by sensors and operates appropriately actuators to maintain the crop growth environment. A composite environmental controller directs control devices driving actuators through a composite environmental control algorithm, which calculates the values necessary for the operation of the control devices. Most existing algorithms carry out control procedures on a single phase by iteration cycle, which can cause abnormal changes in the greenhouse environment due to errors in output. The proposed algorithm distributes control procedures over multiple phases: environmental control, environmental control, and device operation, and every iteration cycle, detects environmental changes in the environmental control phase first, and then combines control devices that can control the environment in the environmental control phase, and finally, performs the controls to derive the actuators in the device operation phase. The proposed algorithm is designed based on the analysis of the relationship between greenhouse environmental elements and control devices deriving actuators. According to verification analysis, the multi-phase processing scheme provides room to modify or supplement the setting value and enables the control devices to reflect changes in the associated environmental components.

Real-Time Implementation of the Relative Position Estimation Algorithm Using the Aerial Image Sequence (항공영상에서 상대 위치 추정 알고리듬의 실시간 구현)

  • Park, Jae-Hong;Kim, Gwan-Seok;Kim, In-Cheol;Park, Rae-Hong;Lee, Sang-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.3
    • /
    • pp.66-77
    • /
    • 2002
  • This paper deals with an implementation of the navigation parameter extraction technique using the TMS320C80 multimedia video processor (MVP). Especially, this Paper focuses on the relative position estimation algorithm which plays an important role in real-time operation of the overall system. Based on the relative position estimation algorithm using the images obtained at two locations, we develop a fast algorithm that can reduce large amount of computation time and fit into fixed-point processors. Then, the algorithm is reconfigured for parallel processing using the 4 parallel processors in the MVP. As a result, we shall demonstrate that the navigation parameter extraction system employing the MVP can operate at full-frame rate, satisfying real-time requirement of the overall system.

A Knowledge-Based Intelligent Information Agent for Animal Domain (동물 영역 지식 기반의 지능형 정보 에이전트)

  • 이용현;오정욱;변영태
    • Korean Journal of Cognitive Science
    • /
    • v.10 no.1
    • /
    • pp.67-78
    • /
    • 1999
  • Information providers on WWW have been rapidly increasing, and they provide a vast amount of information in various fields, Because of this reason, it becomes hard for users to get the information they want. Although there are several search engines that help users with the keyword matching methods, it is not easy to find suitable keywords. In order to solve these problems with a specific domain, we propose an intelligent information agent(HHA-la : HongIk Information Agent) that converts user's q queries to forms including related domain words in order to represent user's intention as much as it can and provides the necessary information of the domain to users. HHA-la h has an ontological knowledge base of animal domain, supplies necessary information for queries from users and other agents, and provides relevant web page information. One of system components is a WebDB which indexes web pages relevant to the animal domain. The system also supplies new operators by which users can represent their thought more clearly, and has a learning mechanism using accumulated results and user feedback to behave more intelligently, We implement the system and show the effectiveness of the information agent by presenting experiment results in this paper.

  • PDF

On-line Recognition of Cursive Korean Characters Based on Hidden Markov Model and Level Building (은닉 마르코프 모델과 레벨 빌딩 알고리즘을 이용한 흘림체 한글의 온라인 인식)

  • Kim, Sang-Gyun;Kim, Gyeong-Hyeon;Lee, Jong-Guk;Lee, Jae-Uk;Kim, Hang-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1281-1293
    • /
    • 1996
  • In this paper, we propose a novel recognition model of on-line cursive Korean characters using HMM(Hidden Markov Model) and level building algorithm. The model is constructed as a form of recognition network with HMM for graphemes and Korean combination rules. Though the network is so flexible as to accomodate variability of input patterns, it has a problem of recognition speed caused by 11, 172 search paths. To settle the problem, we modify the level building algorithm to be adapted directly to the Korean combination rules and apply it to the model. The modified algorithm is efficient network search procedure time complexity of which depends on the number of HMMs for each grapheme, not the number of paths in the extensive recognition network. A test with 15, 000 hand written characters shows recognition rat 90% and speed of 0.72 second per character.

  • PDF

Unsupervised Motion Learning for Abnormal Behavior Detection in Visual Surveillance (영상감시시스템에서 움직임의 비교사학습을 통한 비정상행동탐지)

  • Jeong, Ha-Wook;Chang, Hyung-Jin;Choi, Jin-Young
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.48 no.5
    • /
    • pp.45-51
    • /
    • 2011
  • In this paper, we propose an unsupervised learning method for modeling motion trajectory patterns effectively. In our approach, observations of an object on a trajectory are treated as words in a document for latent dirichlet allocation algorithm which is used for clustering words on the topic in natural language process. This allows clustering topics (e.g. go straight, turn left, turn right) effectively in complex scenes, such as crossroads. After this procedure, we learn patterns of word sequences in each cluster using Baum-Welch algorithm used to find the unknown parameters in a hidden markov model. Evaluation of abnormality can be done using forward algorithm by comparing learned sequence and input sequence. Results of experiments show that modeling of semantic region is robust against noise in various scene.

Graph Representation by Medial Axis Transform Image for 3D Retrieval (3차원 영상 검색을 위한 중심축 변환에 의한 그래프 표현 기법)

  • Kim, Deok-Hun;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.1
    • /
    • pp.33-42
    • /
    • 2001
  • Recently, the interests in the 3D image, generated from the range data and CAD, have exceedingly increased, accordingly a various 3D image database is being constructed. The efficient and fast scheme to access the desired image data is the important issue in the application area of the Internet and digital library. However, it is difficult to manage the 3D image database because of its huge size. Therefore, a proper descriptor is necessary to manage the data efficiently, including the content-based search. In this paper, the proposed shape descriptor is based on the voxelization of the 3D image. The medial axis transform, stemming from the mathematical morphology, is performed on the voxelized 3D image and the graph, which is composed of node and edge, is generated from skeletons. The generated graph is adequate to the novel shape descriptor due to no loss of geometric information and the similarity of the insight of the human. Therefore the proposed shape descriptor would be useful for the recognition of 3D object, compression, and content-based search.

  • PDF

Incremental Batch Update of Spatial Data Cube with Multi-dimensional Concept Hierarchies (다차원 개념 계층을 지원하는 공간 데이터 큐브의 점진적 일괄 갱신 기법)

  • Ok, Geun-Hyoung;Lee, Dong-Wook;You, Byeong-Seob;Lee, Jae-Dong;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1395-1409
    • /
    • 2006
  • A spatial data warehouse has spatial data cube composed of multi-dimensional data for efficient OLAP(On-Line Analytical Processing) operations. A spatial data cube supporting concept hierarchies holds huge amount of data so that many researches have studied a incremental update method for minimum modification of a spatial data cube. The Cube, however, compressed by eliminating prefix and suffix redundancy has coalescing paths that cause update inconsistencies for some updates can affect the aggregate value of coalesced cell that has no relationship with the update. In this paper, we propose incremental batch update method of a spatial data cube. The proposed method uses duplicated nodes and extended node structure to avoid update inconsistencies. If any collision is detected during update procedure, the shared node is duplicated and the duplicate is updated. As a result, compressed spatial data cube that includes concept hierarchies can be updated incrementally with no inconsistency. In performance evaluation, we show the proposed method is more efficient than other naive update methods.

  • PDF

Spatiotemporal Moving Pattern Discovery using Location Generalization of Moving Objects (이동객체 위치 일반화를 이용한 시공간 이동 패턴 탐사)

  • Lee, Jun-Wook;Nam, Kwang-Woo
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1103-1114
    • /
    • 2003
  • Currently, one of the most critical issues in developing the service support system for various spatio-temporal applications is the discoverying of meaningful knowledge from the large volume of moving object data. This sort of knowledge refers to the spatiotemporal moving pattern. To discovery such knowledge, various relationships between moving objects such as temporal, spatial and spatiotemporal topological relationships needs to be considered in knowledge discovery. In this paper, we proposed an efficient method, MPMine, for discoverying spatiotemporal moving patterns. The method not only has considered both temporal constraint and spatial constrain but also performs the spatial generalization using a spatial topological operation, contain(). Different from the previous temporal pattern methods, the proposed method is able to save the search space by using the location summarization and generalization of the moving object data. Therefore, Efficient discoverying of the useful moving patterns is possible.

Study on the Convenient Interface to the University Web-based Library System (Web을 기반으로 한 대학교 도서관 시스템에 있어서 용이한 인터페이스에 관한 연구)

  • 이현정;정재욱
    • Archives of design research
    • /
    • v.15 no.1
    • /
    • pp.93-100
    • /
    • 2002
  • The University's web library is a form of library that enables to deal with information about searching loaning, returning of books or data housed in it through web. With the advent of the network and multimedia following the entrance to an information-oriented society, we are experiencing a big change in how to communicate and acquire information. Massive multimedia information transmitted by image and moving picture through the network, made it possible to overstep the limit of the physical gap between information suppliers and users. Despite this important role, it is accompanied by problems such as copyright, scarcity of recognition, paralysis of infra, technical matters and reliability which demand development. In this thesis, according to the State University Evaluation Standards, search node and user interface by system used in 20 different universities possessing web-based library sites were compared are analysed. On the basis of this, an experimental user interface for web-based University libraries was produced, and various questionnaires and data leer this produced interface were collected, classified and analyzed. With the application of the results for the work above to the general search system interface of the web-based library, we proposed a new user interface that contains the following functions, such as location and loan condition of books, search frequency and steps for purchasing books inside the web library.

  • PDF