• Title/Summary/Keyword: 환경 매핑

Search Result 333, Processing Time 0.026 seconds

Feature-based Matching Algorithms for Registration between LiDAR Point Cloud Intensity Data Acquired from MMS and Image Data from UAV (MMS로부터 취득된 LiDAR 점군데이터의 반사강도 영상과 UAV 영상의 정합을 위한 특징점 기반 매칭 기법 연구)

  • Choi, Yoonjo;Farkoushi, Mohammad Gholami;Hong, Seunghwan;Sohn, Hong-Gyoo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.6
    • /
    • pp.453-464
    • /
    • 2019
  • Recently, as the demand for 3D geospatial information increases, the importance of rapid and accurate data construction has increased. Although many studies have been conducted to register UAV (Unmanned Aerial Vehicle) imagery based on LiDAR (Light Detection and Ranging) data, which is capable of precise 3D data construction, studies using LiDAR data embedded in MMS (Mobile Mapping System) are insufficient. Therefore, this study compared and analyzed 9 matching algorithms based on feature points for registering reflectance image converted from LiDAR point cloud intensity data acquired from MMS with image data from UAV. Our results indicated that when the SIFT (Scale Invariant Feature Transform) algorithm was applied, it was able to stable secure a high matching accuracy, and it was confirmed that sufficient conjugate points were extracted even in various road environments. For the registration accuracy analysis, the SIFT algorithm was able to secure the accuracy at about 10 pixels except the case when the overlapping area is low and the same pattern is repeated. This is a reasonable result considering that the distortion of the UAV altitude is included at the time of UAV image capturing. Therefore, the results of this study are expected to be used as a basic research for 3D registration of LiDAR point cloud intensity data and UAV imagery.

Process Performance Measurement Model Based on Event for an efficient Decision-Making (효율적인 의사결정을 위한 이벤트 기반의 프로세스 성과측정을 위한 모델)

  • Park, Jae-Won;Choi, Jae-Hyun;Cho, Poong-Youn;Lee, Nam-Yong
    • The KIPS Transactions:PartD
    • /
    • v.17D no.4
    • /
    • pp.259-270
    • /
    • 2010
  • Information systems nowadays are heterogeneous and distributed which integrate the enterprise information by processes. They are also very complex, because they are linked together by processes. It aims to integrate the systems so that these systems work as one system. A process is a framework which contains all of the business activities in an enterprise, and has a lot of information which is needed for measuring performance. A process consists of activities, and an activity contains events which can be considered information sources. In most cases, it is very valuable to determine if a process is meaningful, but it is difficult because of the complexity in measuring performance, and also because finding relationships between business factors and events is not a simple problem. So it would reduce operation cost and allow efficient process execution if I could evaluate the process before it ends. In this paper we propose an event based process measurement model. First, we propose the concept of process performance measurement, and a model for selecting process and activity indexes from the events which are collected from information systems. Second, we propose at methodologies and data schema that can store and manage the selected process indexes, the mapping methods between indexes and events. Finally, we propose a process Performance measurement model using the collected events which gives users a valuable managerial information.

BER Performance of an Offset Stacked Spreading CDMA System Based on Orthogonal Complementary Codes (직교 상보코드 기반의 옵셋누적 확산 CDMA 시스템의 비트오율 성능)

  • Kim, Myoung-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.3
    • /
    • pp.1-8
    • /
    • 2009
  • DS-CDMA system has very low bandwidth efficiency, hence it is difficult to maintain high spreading gain for high speed data transmission. Offset stacked spreading CDMA(OSS-CDMA) is a transmission scheme where spreading codes with chip offsets are overlapped, then transmitted. This kind of system requires a code set that guarantees orthogonality between codes in the set of any cjip offset. An orthogonal complementary code set has a property that the crosscorrelation function between codes in the group is zero for all shifts, hence it can be used for an OSS-CDMA system. In an OCC-OSS CDMA system each user is assigned an orthogonal complementary code group. User data bit is spread by the given codes and overlapped, and the code sequences are transmitted with multicarrier. However, the offset stacked spread sequences are multilevel, and the number of symbol levels is increases as the spreading efficiency is increased. When the OSS sequence is transmitted with MPSK mapping, the signal constellation becomes dense, and the system is easily affected by channel impairments. In this paper, we propose a level clipping scheme on OSS sequence before MPSK modulated. Simulations have been carried out to investigate the BER performance of the OCC-OSS CDMA system in AWGN environment. The results show that proposed scheme outperform the scheme without level clipping.

A Study on Development of Network Management Systems base on Component (컴포넌트 기반의 망관리 시스템 개발에 관한 연구)

  • Kim, Haeng-Kon;Kim, Ji-Young
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.937-950
    • /
    • 2004
  • With growing population of internet and web applications, distributed environment is considered to be the standard architecture of application. A network management systems(NMS) is necessary to control and monitor the complex network resources for providing and sharing the heft quality service. We recognize the NMS as a standard infrastructure for supporting efficient networking and a separate commercial applications. We believe every resource including software, hardware and environment for the network management should be separated from special protocols, vendors and applications. Therefore, We need a standard network management system that is efficient and consistent because of the heterogeous network features. In regards to software development, software reuse through assembling and extending the reusable elements such as patterns and components assures to realize the best productivity and quality The component based development(CBD) methodology that can assemble black box though well defined interfaces makes it possible to develop easer and quicker applications and is proved as the best software development solution involved in construction, selection and assembly of components. In this thesis, we describe the architecture for the network management and identify, define and design the components through analysis and design in the network management domain and Identified components mapped to the component architecture. We also specify the component development and design and implement the component for developing the network management. Implemented components apply to the component repository system that register, retrieve and understand the components. We analyze, design and implement the entire network management system based on configuration, connection, performance and fault management through the pre-developed components.

A Flow Control Scheme for the QoS Improvement of Multi-Service using IPv6 Hop-by-Hop Option Header (IPv6 홉-바이-홉 옵션 헤더 이용으로 멀티서비스의 QoS 개선을 위한 플로우 제어 방안)

  • 이인화;김성조
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.250-262
    • /
    • 2004
  • In IPv6 environment, the Internet Telephony, VoD(Video on Demand) and high capacity file exchange service will be more increased than IPv4. Therefore, the strict guarantee of QoS based on End-to-End and differentiated quality control schemes are simultaneously required. This paper proposes the flow control schemes on IPv6 network that the traffic is identified by flow and the QoS of multi-service is improved by QoS information in IPv6 hop-by-hop option header. The object of flow control includes not only non-default QoS traffic, which uses the flow label, but also best-effort or encrypted traffic. Therefore, the guarantee of real-time service is strengthened and the flow, which abuses unnecessarily the network resources, is effectively controlled. Also, this paper proposes the mapping scheme between the flow and MPLS by reflecting the minimum change of the existed network resource and the status of backbone network of ISP(Internet Service Provider). In the simulation result, It is shown that the proposed scheme is effective in the side of QoS on real-time services and utilization of backbone resources.

An Architecture of UPnP Bridge for Non-lP Devices with Heterogeneous Interfaces (다양한 Non-lP 장치를 위한 UPnP 브리지 구조)

  • Kang, Jeong-Seok;Choi, Yong-Soon;Park, Hong-Seong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12B
    • /
    • pp.779-789
    • /
    • 2007
  • This paper presents an architecture of UPnP Bridge for interconnecting Non-lP devices with heterogeneous network interfaces to UPnP devices on UPnP networks. The proposed UPnP Bridge provides a Virtual UPnP device that performs generic UPnP Device's functionalities on behalf of Non-lP device. This paper defines 3 types of descriptions, Device Description, Message Field Description, and Extended UPnP Service Description in order to reduce the amount of effort required to connect a non-lP device with a new interface or message format to UPnP network. By these three types of descriptions and Message conversion module, developers for Non-lP devices can easily connect the devices to UPnP network without additional programming. So UPnP control point controls Non-lP devices as generic UPnP device. Some experiments validate the proposed architecture, which are performed on a test bed consisting of UPnP network the proposed bridge, and non-lP devices with CAN and RS232 interfaces.

R-Tree Construction for The Content Based Publish/Subscribe Service in Peer-to-peer Networks (피어투피어 네트워크에서의 컨텐츠 기반 publish/subscribe 서비스를 위한 R-tree구성)

  • Kim, Yong-Hyuck;Kim, Young-Han;Kang, Nam-Hi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.11
    • /
    • pp.1-11
    • /
    • 2009
  • A content based pub/sub (Publish/subscribe) services at the peer-to-peer network has the requirements about how to distribute contents information of subscriber and to delivery the events efficiently. For satisfying the requirements, a DHT(Distributed Hash Table) based pub/sub overlay networking and tree type topology based network construction using filter technique have been proposed. The DHT based technique is suitable for topic based pub/sub service but it's not good contents based service that has the variable requirements. And also filter based tree topology networking is not efficient at the environment where the user requirements are distributed. In this paper we propose the R-Tree algorithm based pub/sub overlay network construction method. The proposed scheme provides cost effective event delivery method by mapping user requirement to multi-dimension and hierarchical grouping of the requirements. It is verified by simulation at the variable environment of user requirements and events.

Timestamps based sequential Localization for Linear Wireless Sensor Networks (선형 무선 센서 네트워크를 위한 시각소인 기반의 순차적 거리측정 기법)

  • Park, Sangjun;Kang, Jungho;Kim, Yongchul;Kim, Young-Joo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.10
    • /
    • pp.1840-1848
    • /
    • 2017
  • Linear wireless sensor networks typically construct a network topology with a high reliability through sequential 1:1 mapping among sensor nodes, so that they are used in various surveillance applications of major national infrastructures. Most existing techniques for identifying sensor nodes in those networks are using GPS, AOA, and RSSI mechanisms. However, GPS or AOA based node identification techniques affect the size or production cost of the nodes so that it is not easy to construct practical sensor networks. RSSI based techniques may have a high deviation regrading location identification according to propagation environments and equipment quality so that complexity of error correction algorithm may increase. We propose a timestamps based sequential localization algorithm that uses transmit and receive timestamps in a message between sensor nodes without using GPS, AOA, and RSSI techniques. The algorithms for distance measurement between each node are expected to measure distance within up to 1 meter in case of an crystal oscillator of 300MHz or more.

Study Service Ontology Design Scheme Using UML and OCL (UML 및 OCL을 이용한 서비스 온톨로지 설계 방안에 관한 연구)

  • Lee Yun-Su;Chung In-Jeoung
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.627-636
    • /
    • 2005
  • The Intelligent Web Service is proposed for the purpose of automatic discovery, invocation, composition, inter-operation, execution monitoring and recovery web service through the Semantic Web and the Agent technology. To accomplish this Intelligent Web Service, the Ontology is a necessity for reasoning and processing the knowledge by the computer. However, creating service ontology, for the intelligent web service, has two problems not only consuming a lot of time and cost depended on heuristic of service developer, but also being hard to be mapping completely between service and service ontology. Moreover, the markup language to describe the service ontology is currently hard to be learned by the service developer In a short time. This paper proposes the efficient way of designing and creating the service ontology using MDA methodology. This proposed solution reuses the creating model in terms of desiEninE and constructing Web Service Model using UML based on MDA. After converting the Platform-Independent Web Service Model to the dependent model of OWL-S which is a Service Ontology description language, it converts to OWL-S Service Ontology using XMI. This proposed solution has profits, oneis able to be easily constructed the Service Ontology by Service Developers, the other is enable to be created the both service and Service Ontology from one model. Moreover, it can be effective to reduce the time and cost as creating Service Ontology automatically from a model, and calmly dealt with a change of outer environment like as the platform change. This paper cites an instance for the validity of designing Web Service model and creating the Service Ontology, and validates whether the created Service Ontology is valid or not.

Design and Implementation of a Translator for Translating Java Bytecode into MSIL (자바 Bytecode 에서 MSIL 로의 변환을 위한 번역기의 설계 및 구현)

  • Min, Jung-Hyun;Oh, Se-Man
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.04b
    • /
    • pp.743-746
    • /
    • 2001
  • 자바는 객체지향 언어이고, 한번 작성된 프로그램은 자바 가상 기계가 있는 모든 곳에서 수정없이 실행될 수 있기 때문에 소프트웨어의 개발과 유지 보수에 많은 장점을 가진 언어이다. 이러한 특징으로 인하여 개발되는 제품들이 자바로 구현되는 경우가 많다. 그러나 아직 대다수 소프트웨어 개발자들은 주로 C 언어나 C++ 언어를 사용하고 있으며, 최근에는 C#이라는 언어를 사용하고 있다. 자바가 플랫폼에 독립적인 장점은 가지고 있지만, 다수의 개발자 및 사용자가 마이크로소프트 윈도우 운영체제를 사용하고 있다는 것을 감안한다면 그리 탁월한 장점만은 될 수 없다. 또한, 최근의 개발동향이 COM(Component Object Model)을 지향하고 있고, 이는 더 이상 개발자들에게 프로그래밍 언어에 구애를 받지 않고 오직 개발 제품에 대한 집중력을 가질 수 있는 환경을 제공할 수 있다면, 그 개발 효율에 있어서 상당한 이점을 가질 수 있다는 의미이다. 따라서, COL(Component Object Language)을 기반으로 하고 있는 C# (C sharp)언어를 사용하여 개발을 함에 있어서 자바의 언어를 C# 언어로 변환할 수 있다면, 신생 언어인 C#에 있어서 기존 자바로 되어 있는 유용한 개발 제품들을 보다 효율적으로 이용할 수 있을 것이다. 본 논문에서는 두 언어(자바, C#)를 하나로 잇는 교량(bridge)역할을 할 수 있도록 자바의 중간 언어인 Bytecode를 C#의 중간 언어인 MSIL(Microsoft Intermediate Language)로 바꿀 수 있는 중간 언어 번역기를 설계하고 구현하였다. 이를 위한 방법으로는 먼저, 자바 Bytecode 와 MSIL 의 어셈블리 형태에서의 명령어 매칭과정을 매핑 테이블을 이용하여 처리하였고, MSIL 에서 자바 Bytecode 의 함수와 같은 기능을 하는 메소드의 변환을 위하여 마크로 변환기법을 이용하여 해결하였다.I/O ratio 2.5). BTEX의 상대적 함량도 실내가 실외보다 높아 실내에도 발생원이 있음을 암시하고 있다. 자료 분석결과 유치원 실내의 벤젠은 실외로부터 유입되고 있었고, 톨루엔, 에틸벤젠, 크실렌은 실외뿐 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화가 선조체 영역에서 국한되어 나타나며 그 유의성이 움직임 보정 전에 비하여 낮음을 알 수 있었다. 결론: 뇌활성화 과제 수행시에 동반되는 피험자의 머리 움직임에 의하여 도파민 유리가 과대평가되었으며 이는 이 연구에서 제안한 영상정합을 이용한 움직임 보정기법에 의해서 개선되었다. 답이 없는 문제, 문제 만들기, 일반화가 가능한 문제 등으로 보고, 수학적 창의성 중 특히 확산적 사고에 초점을 맞추어 개방형 문제가 확산적 사고의 요소인 유창성, 독창성, 유연성 등에 각각 어떤 영향을 미치는지 20주의 프로그램을 개발, 진행하여 그 효과를

  • PDF