• Title/Summary/Keyword: implementation algorithm

Search Result 4,233, Processing Time 0.028 seconds

A Study on the Effect Analysis Influenced on the Advanced System of Moving Object (이동물체가 정밀 시스템에 미치는 영항분석에 관한 연구)

  • Shin, Hyeon-Jae;Kim, Soo-In;Choi, In-Ho;Shon, Young-Woo;An, Young-Hwan;Kim, Dae-Wook;Lee, Jae-Soo
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.8
    • /
    • pp.87-95
    • /
    • 2007
  • In this paper, we analyzed the mr detection and the stability of the object tracking system by an adaptive stereo object hacking using region-based MAD(Mean Absolute Difference) algorithm and the modified PID(Proportional Integral Derivative)-based pan/tilt controller. That is, in the proposed system, the location coordinates of the target object in the right and left images are extracted from the sequential stereo input image by applying a region-based MAD algorithm and the configuration parameter of the stereo camera, and then these values could effectively control to pan/tilt of the stereo camera under the noisy circumstances through the modified PID controller. Accordingly, an adaptive control effect of a moving object can be analyzed through the advanced system with the proposed 3D robot vision, in which the possibility of real-time implementation of the robot vision system is also confirmed.

Design and Implementation of DHCP Supporting Network Attack Prevention (네트워크 공격 방지를 지원하는 DHCP의 설계 및 구현에 관한 연구)

  • Yoo, Kwon-joeong;Kim, Eun-gi
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.4
    • /
    • pp.747-754
    • /
    • 2016
  • DHCP(Dynamic Host Configuration Protocol) is a protocol for efficiency and convenience of the IP address management. DHCP automatically assigns an IP address and configuration information needed to run the TCP/IP communication to individual host in the network. However, existing DHCP is vulnerable for network attack such as DHCP spoofing, release attack because there is no mutual authentication systems between server and client. To solve this problem, we have designed a new DHCP protocol supporting the following features: First, ECDH(Elliptic Curve Diffie-Hellman) is used to create session key and ECDSA(Elliptic Curve Digital Signature Algorithm) is used for mutual authentication between server and client. Also this protocol ensures integrity of message by adding a HMAC(Hash-based Message Authentication Code) on the message. And replay attacks can be prevented by using a Nonce. As a result, The receiver can prevent the network attack by discarding the received message from unauthorized host.

A Fast XML Encoding System for Fast Web Services (Fast 웹서비스를 위한 Fast XML 인코딩 시스템)

  • Kim, Jong-Moon;Yu, Lei;Hong, Xian-Yu;Choi, Bong-Kyu;Jung, Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.865-868
    • /
    • 2007
  • Web service in operating environment independent XML about under using, It dose so, Integration of the platform for it is different each other possibly it is doing. But XML in order to have the text data which is unnecessary plentifully with wireless Internet or the mobile communication modem in together relatively will connect frequently slow communication medium and there is a problem point which decreases the case prerequisite efficiency which the resources will use from the limited small-sized machinery and tools. Hereupon XML about under make binary the standard which reduces the size of the document from ITU-T and ISO/IEC it was under proposing with commonness, currently binary XML encoding where it is in the process of advancing standard there are Fast Infoset and Fast Schema. In this paper, implementation of Fast XML encoding system through introduction Fast Infoset algorithm and Fast Schema algorithm for web services increase performance.

  • PDF

8.3 Gbps pipelined LEA Crypto-Processor Supporting ECB/CTR Modes of operation (ECB/CTR 운영모드를 지원하는 8.3 Gbps 파이프라인 LEA 암호/복호 프로세서)

  • Sung, Mi-Ji;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2333-2340
    • /
    • 2016
  • A LEA (Lightweight Encryption Algorithm) crypto-processor was designed, which supports three master key lengths of 128/ 192/256-bit, ECB and CTR modes of operation. To achieve high throughput rate, the round transformation block was designed with 128 bits datapath and a pipelined structure of 16 stages. Encryption/decryption is carried out through 12/14/16 pipelined stages according to the master key length, and each pipelined stage performs round transformation twice. The key scheduler block was optimized to share hardware resources that are required for encryption, decryption, and three master key lengths. The round keys generated by key scheduler are stored in 32 round key registers, and are repeatedly used in round transformation until master key is updated. The pipelined LEA processor was verified by FPGA implementation, and the estimated performance is about 8.3 Gbps at the maximum clock frequency of 130 MHz.

Digital Image based Real-time Sea Fog Removal Technique using GPU (GPU를 이용한 영상기반 고속 해무제거 기술)

  • Choi, Woon-sik;Lee, Yoon-hyuk;Seo, Young-ho;Choi, Hyun-jun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2355-2362
    • /
    • 2016
  • Seg fog removal is an important issue concerned by both computer vision and image processing. Sea fog or haze removal is widely used in lots of fields, such as automatic control system, CCTV, and image recognition. Color image dehazing techniques have been extensively studied, and expecially the dark channel prior(DCP) technique has been widely used. This paper propose a fast and efficient image prior - dark channel prior to remove seg-fog from a single digital image based on the GPU. We implement the basic parallel program and then optimize it to obtain performance acceleration with more than 250 times. While paralleling and the optimizing the algorithm, we improve some parts of the original serial program or basic parallel program according to the characteristics of several steps. The proposed GPU programming algorithm and implementation results may be used with advantages as pre-processing in many systems, such as safe navigation for ship, topographical survey, intelligent vehicles, etc.

Dynamic Class Mapping Mechanism for Guaranteed Service with Minimum Cost over Differentiated Services Networks (다중 DiffServ 도메인 상에서 QoS 보장을 위한 동적 클래스 재협상 알고리즘)

  • 이대붕;송황준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.697-710
    • /
    • 2004
  • Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

Implementation for Texture Imaging Algorithm based on GLCM/GLDV and Use Case Experiments with High Resolution Imagery

  • Jeon So Hee;Lee Kiwon;Kwon Byung-Doo
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.626-629
    • /
    • 2004
  • Texture imaging, which means texture image creation by co-occurrence relation, has been known as one of useful image analysis methodologies. For this purpose, most commercial remote sensing software provides texture analysis function named GLCM (Grey Level Co-occurrence Matrix). In this study, texture-imaging program for GLCM algorithm is newly implemented in the MS Visual IDE environment. While, additional texture imaging modules based on GLDV (Grey Level Difference Vector) are contained in this program. As for GLCM/GLDV texture variables, it composed of six types of second order texture function in the several quantization levels of 2(binary image), 8, and 16: Homogeneity, Dissimilarity, Energy, Entropy, Angular Second Moment, and Contrast. As for co-occurrence directionality, four directions are provided as $E-W(0^{\circ}),\;N-E(45^{\circ}),\;S-W(135^{\circ}),\;and\;N-S(90^{\circ}),$ and W-E direction is also considered in the negative direction of E- W direction. While, two direction modes are provided in this program: Omni-mode and Circular mode. Omni-mode is to compute all direction to avoid directionality problem, and circular direction is to compute texture variables by circular direction surrounding target pixel. At the second phase of this study, some examples with artificial image and actual satellite imagery are carried out to demonstrate effectiveness of texture imaging or to help texture image interpretation. As the reference, most previous studies related to texture image analysis have been used for the classification purpose, but this study aims at the creation and general uses of texture image for urban remote sensing.

  • PDF

Simulation Analysis for Verifying an Implementation Method of Higher-performed Packet Routing

  • Park, Jaewoo;Lim, Seong-Yong;Lee, Kyou-Ho
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.10a
    • /
    • pp.440-443
    • /
    • 2001
  • As inter-network traffics grows rapidly, the router systems as a network component becomes to be capable of not only wire-speed packet processing but also plentiful programmability for quality services. A network processor technology is widely used to achieve such capabilities in the high-end router. Although providing two such capabilities, the network processor can't support a deep packet processing at nominal wire-speed. Considering QoS may result in performance degradation of processing packet. In order to achieve foster processing, one chipset of network processor is occasionally not enough. Using more than one urges to consider a problem that is, for instance, an out-of-order delivery of packets. This problem can be serious in some applications such as voice over IP and video services, which assume that packets arrive in order. It is required to develop an effective packet processing mechanism leer using more than one network processors in parallel in one linecard unit of the router system. Simulation analysis is also needed for verifying the mechanism. We propose the packet processing mechanism consisting of more than two NPs in parallel. In this mechanism, we use a load-balancing algorithm that distributes the packet traffic load evenly and keeps the sequence, and then verify the algorithm with simulation analysis. As a simulation tool, we use DEVSim++, which is a DEVS formalism-based hierarchical discrete-event simulation environment developed by KAIST. In this paper, we are going to show not only applicability of the DEVS formalism to hardware modeling and simulation but also predictability of performance of the load balancer when implemented with FPGA.

  • PDF

The Design and Implementation of Location Information System using Wireless Fidelity in Indoors (실내에서 Wi-Fi를 이용한 위치 정보 시스템의 설계 및 구현)

  • Kwon, O-Byung;Kim, Kyeong-Su
    • Journal of Digital Convergence
    • /
    • v.11 no.4
    • /
    • pp.243-249
    • /
    • 2013
  • In this paper, GPS(Global Positioning System) that can be used outdoors and GPS(Global Positioning System) is not available for indoor Wi-Fi(Wireless Fidelity) using the Android-based location information system has been designed and implemented. Pedestrians in a room in order to estimate the location of the pedestrian's position, regardless of need to obtain the absolute position and relative position, depending on the movement of pedestrians in a row it is necessary to estimate. In order to estimate the initial position of the pedestrian Wi-Fi Fingerprinting was used. Most existing Wi-Fi Fingerprinting position error small WKNN(Weighted K Nearest Neighbor) algorithm shortcoming EWKNN (Enhanced Weighted K Nearest Neighbor) using the algorithm raised the accuracy of the position. And in order to estimate the relative position of the pedestrian, the smart phone is mounted on the IMUInertial Measurement Unit) because the use did not require additional equipment.

Development of High Performance Massively Parallel Processing Simulator for Semiconductor Etching Process (건식 식각 공정을 위한 초고속 병렬 연산 시뮬레이터 개발)

  • Lee, Jae-Hee;Kwon, Oh-Seob;Ban, Yong-Chan;Won, Tae-Young
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.36D no.10
    • /
    • pp.37-44
    • /
    • 1999
  • This paper report the implementation results of Monte Carlo numerical calculation for ion distributions in plasma dry etching chamber and of the surface evolution simulator using cell removal method for topographical evolution of the surface exposed to etching ion. The energy and angular distributions of ion across the plasma sheath were calculated by MC(Monte Carlo) algorithm. High performance MPP(Massively Parallel Processing) algorithm developed in this paper enables efficient parallel and distributed simulation with an efficiency of more than 95% and speedup of 16 with 16 processors. Parallelization of surface evolution simulator based on cell removal method reduces simulation time dramatically to 15 minutes and increases capability of simulation required enormous memory size of 600Mb.

  • PDF