• Title/Summary/Keyword: implementation algorithm

Search Result 4,233, Processing Time 0.035 seconds

Real-Time Face Recognition System using PDA (PDA를 이용한 실시간 얼굴인식 시스템 구현)

  • Kwon Man-Jun;Yang Dong-Hwa;Go Hyoun-Joo;Kim Jin-Whan;Chun Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.5
    • /
    • pp.649-654
    • /
    • 2005
  • In this paper, we describe an implementation of real-time face recognition system under ubiquitous computing environments. First, face image is captured by PDA with CMOS camera and then this image with user n and name is transmitted via WLAN(Wireless LAN) to the server and finally PDA receives verification result from the server The proposed system consists of server and client parts. Server uses PCA and LDA algorithm which calculates eigenvector and eigenvalue matrices using the face images from the PDA at enrollment process. And then, it sends recognition result using Euclidean distance at verification process. Here, captured image is first compressed by the wave- let transform and sent as JPG format for real-time processing. Implemented system makes an improvement of the speed and performance by comparing Euclidean distance with previously calculated eigenvector and eignevalue matrices in the learning process.

WDM/TDM-Based Channel Allocation Methodology in Optical Network-on-Chip (광학 네트워크-온-칩에서 WDM/TDM 기반 채널 할당 기법)

  • Hong, Yu Min;Lee, Jae Hoon;Han, Tae Hee
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.7
    • /
    • pp.40-48
    • /
    • 2015
  • An optical network-on-chip(ONoC) architecture is emerging as a new paradigm for solving on-chip communication bottleneck. Recent studies on ONoC have been focusing on supporting the parallel transmission and avoiding path collisions using wavelength division multiplexing(WDM). However, since the maximum number of wavelengths, which a single waveguide can accommodate is limited by crosstalk and insertion loss. Therefore previous WDM studies based on incrementing the number of different wavelengths according to the number of nodes would be infeasible due to the implementation complexity. To solve such problems, we combined time division multiplexing(TDM) and wavelength-routed ONoC, along with an optimized channel allocation algorithm, which can minimize the number of extra wavelength channels and latency caused by combining TDM scheme.

Development of an Engine Simulator for Optimal Control System Implementation of a Gas Turbine Engine (가스터빈엔진 최적 제어시스템 구현을 위한 엔진 시뮬레이터 개발)

  • Cha, Young-Bum;Koo, Bon-Min;Song, Do-Ho;Choi, Jung-Keyng
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.1
    • /
    • pp.75-82
    • /
    • 2007
  • In advanced countries, a gas turbine engine is developed to use in aircraft, vessels, and target weapons. Our nation also passed the level of producing engine components and now, we are developing small-sized gas turbine engine. The most important point of the gas turbine engine, the engine control technique, is evaded by the advanced nations. This document contains the research about the development of the gas turbine engine simulator. The simulator presented in this document has a mathematical engine model based on a capacity data of the gas turbine engine to advance the engine simulator. Through this process, it eases the development of the gas turbine engine control algorithm and helps to check the engine controller function. In this simulator, the engine sensor signal conversion board is designed, so the engine model shows like a real sensor signal during the simulation. Also, this paper contrasts the actual engine test with the simulation results to verify the performance.

Design and Implementation of Search System Using Domain Ontology (도메인 온톨로지를 이용한 검색 시스템 설계 및 구현)

  • Kang, Rae-Goo;Jung, Chai-Yeoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.7
    • /
    • pp.1318-1324
    • /
    • 2007
  • TSP(Traveling Salesman Problem) is a problem finding out the shortest distance out of many courses where given cities of the number of N, one starts a certain city and turns back to a starting city, visiting every city only once. As the number of cities having visited increases, the calculation rate increases geometrically. This problem makes TSP classified in NP-Hard Problem and genetic algorithm is used representatively. To obtain a better result in TSP, various operators have been developed and studied. This paper suggests new method of population initialization and of sequential transformation, and then proves the improvement of capability by comparing them with existing methods.

Implementation of Speech Recognizer using Relevance Vector Machine (RVM을 이용한 음성인식기의 구현)

  • Kim, Chang-Keun;Koh, Si-Young;Hur, Kang-In;Lee, Kwang-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.8
    • /
    • pp.1596-1603
    • /
    • 2007
  • In this paper, we experimented by three kind of method for feature parameter, training method and recognition algorithm of most suitable for speech recognition system and considered. We decided speech recognition system of most suitable through two kind of experiment after we make speech recognizer. First, we did an experiment about three kind of feature parameter to evaluate recognition performance of it in speech recognizer using existent MFCC and MFCC new feature parameter that change characteristic space using PCA and ICA. Second, we experimented recognition performance or HMM, SVM and RVM by studying data number. By an experiment until now, feature parameter by ICA showed performance improvement of average 1.5% than MFCC by high linear discrimination from characteristic space. RVM showed performance improvement of maximum 3.25% than HMM in an experiment by decrease of studying data. As such result, effective method for speech recognition system to propose in this paper derives feature parameters using ICA and un recognition using RVM.

Design And Implementation of Zone Based Location Tracking System Using ZigBee in Indoor Environment (실내 환경에서 ZigBee를 이용한 Zone 기반 위치추적 시스템 설계 및 구현)

  • Nam, Jin-Woo;Chung, Yeong-Jee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1003-1006
    • /
    • 2009
  • Recently, Ubiquitous computing technology is increasing necessity for object recognition and a location tracking technology to meet various applications. The location tracking technology is the fundamental to the Context-Aware of users in Ubiquitous environment and its efficiency has to be improved using IEEE 802.15.4 ZigBee used in current infra such as ubiquitous sensor network. But because the IEEE 802.15.4 ZigBee protocol has limitation to apply location tracking technology such as ToA and TDoA, Zone-based Location Tracking technology using RSSI is needed. In this paper suggests RSSI-based 802.15.4 ZigBee local positioning protocol to support a positioning tracking service in Ubiqutous environment. And Zone-based location tracking system is designed for actual the indoor location tracking service.

  • PDF

Design and Implementation of High Throughput Geographical Handoff Using GPS Information (GPS정보를 이용한 위치기반 핸드오프의 설계 및 구현)

  • Han, Seung-ho;Yang, Seung-chur;Kim, Jong-duok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.80-83
    • /
    • 2009
  • The most popular communication protocol is those defined by the IEEE 802.11 WLAN to support broadband internet connection. The demand for real-time multimedia service is increasing through WLAN on the road. The Hand-off function of mobile terminal is essential to support mobility. But, the hand-off function of IEEE 802.11 WLANs has the latency up to 300ms, and recent research has focusing on channel scanning and reconnection to AP and certification process of AP. It is also the lack of consideration in related works that hand-off happens frequently when the mobile node is moving. This paper proposed the hand-off algorithm that guarantees high throughput and estimates the point which may occur hand-off using GPS information and RSSI. We implement the proposed hand-off function that achieves the best performance.

  • PDF

Coupled solid and fluid mechanics simulation for estimating optimum injection pressure during reservoir CO2-EOR

  • Elyasi, Ayub;Goshtasbi, Kamran;Hashemolhosseini, Hamid;Barati, Sharif
    • Structural Engineering and Mechanics
    • /
    • v.59 no.1
    • /
    • pp.37-57
    • /
    • 2016
  • Reservoir geomechanics can play an important role in hydrocarbon recovery mechanism. In $CO_2$-EOR process, reservoir geomechanics analysis is concerned with the simultaneous study of fluid flow and the mechanical response of the reservoir under $CO_2$ injection. Accurate prediction of geomechanical effects during $CO_2$ injection will assist in modeling the Carbon dioxide recovery process and making a better design of process and production equipment. This paper deals with the implementation of a program (FORTRAN 90 interface code), which was developed to couple conventional reservoir (ECLIPSE) and geomechanical (ABAQUS) simulators, using a partial coupling algorithm. A geomechanics reservoir partially coupled approach is presented that allows to iteratively take the impact of geomechanics into account in the fluid flow calculations and therefore performs a better prediction of the process. The proposed approach is illustrated on a realistic field case. The reservoir geomechanics coupled models show that in the case of lower maximum bottom hole injection pressure, the cumulative oil production is more than other scenarios. Moreover at the high injection pressures, the production rates will not change with the injection bottom hole pressure variations. Also the FEM analysis of the reservoir showed that at $CO_2$ injection pressure of 11000 Psi the plastic strain has been occurred in the some parts of the reservoir and the related stress path show a critical behavior.

The Design and Implementation of GIS Data Processing using 3-Tiers Architecture for selecting Route (3계층 구조를 이용한 GIS 자료처리 설계 및 구현 -도로의 노선선정을 중심으로-)

  • 이형석;배상호
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.3
    • /
    • pp.23-29
    • /
    • 2002
  • The design of data processing of GIS requires efficient method with analysis procedure. This system is easy to be used and managed for presenting route according to conditions as a graphic user interface environmental window system by applying three tiers based object-oriented method. The tier of data is in charge of a class for the exchange, extraction and conservation of data between GeoMedia and application tiers. A route selection algorithm was applied to application tiers, considering all conditions which are necessary for the route selection between a beginning point and an end point, and it was added by module such as data handing, road condition, buffering, clothoid and AHP to select the alternative route followed by new condition. The user tier can express the data acquired by an application tier. Thus three tiers based architecture was presented by implementing design of GIB data processing for its efficiency.

  • PDF

CUDA Implementation for the Four-Russian Algorithm (4-러시안 알고리즘의 CUDA 구현)

  • Kim, Young Ho;Jeong, Ju-Hui;Kang, Dae Woong;Sim, Jeong Seop;Kim, Minho;Park, Soo-jun;Lim, Myungeun;Jung, Ho-Youl
    • Annual Conference of KIPS
    • /
    • 2012.04a
    • /
    • pp.261-264
    • /
    • 2012
  • 상수 크기의 알파벳 ${\Sigma}$에 대해 길이가 각각 m, n인 두 문자열 X와 Y의 편집거리는 X를 Y로 변환하기 위해 필요한 최소 편집연산의 수로 정의된다. 두 문자열의 편집거리는 잘 알려진 동적프로그래밍을 이용하여 O(mn) 시간과 공간에 계산할 수 있으며, 4-러시안 알고리즘을 이용해도 계산할 수 있다. 4-러시안 알고리즘은 블록 크기를 상수 t라 할 때, 전처리 단계에서 $O\((3{\mid}{\Sigma}{\mid})^{2t}t^2\)$ 시간과 $O\((3{\mid}{\Sigma}{\mid})^{2t}t^2\)$ 공간이 필요하며, 계산 단계에서 O(mn/t) 시간과 O(mn) 공간을 이용하여 편집거리를 계산하는 알고리즘이다. 본 논문에서는 4-러시안 알고리즘의 계산 단계를 CUDA를 이용하여 구현하고 실험을 통해 CPU 기반의 순차적인 수행시간과 GPU 기반의 병렬적인 수행시간의 비교결과를 제시한다. 본 논문의 병렬알고리즘은 m/t개의 쓰레드를 사용하여 O(m+n) 시간에 편집거리를 계산한다. GPU 기반의 알고리즘이 CPU 기반의 알고리즘 보다 t=1일 때 약 10배 빠르고, t=2일 때 약 3배 빠른 결과를 보였다.