• Title/Summary/Keyword: technology map

Search Result 2,863, Processing Time 0.035 seconds

Interoperability of Spatial Data through Open Web Map Server

  • Cho, D.S.;Jang, I.S.;Min, K.W.;Park, J.H.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.488-490
    • /
    • 2003
  • Over the past few years, a number of studies have been made on web map services, which enable the GIS user to access spatial data through the web. They, however, have focused on only implementation techniques separately, such as map client implementation, map server implementation, communication between client and server, and the map data representation. Therefore, it is hard to share and practical use the spatial data, because they does not ensure interoperability in heterogeneous map servers. In this paper, we have designed and implemented the web map server with open architecture, which complies with the standard interfaces proposed by OpenGIS Consortium (OGC). In particular, we have extended the OGC’s interfaces for a map server to support one or more data sources. This paper has contributed to construction and practical use of web map services by newly proposing the method of implementation of a map server, which could be reused regardless of the types of data sources.

  • PDF

Map Detection using Deep Learning

  • Oh, Byoung-Woo
    • Journal of Advanced Information Technology and Convergence
    • /
    • v.10 no.2
    • /
    • pp.61-72
    • /
    • 2020
  • Recently, researches that are using deep learning technology in various fields are being conducted. The fields include geographic map processing. In this paper, I propose a method to infer where the map area included in the image is. The proposed method generates and learns images including a map, detects map areas from input images, extracts character strings belonging to those map areas, and converts the extracted character strings into coordinates through geocoding to infer the coordinates of the input image. Faster R-CNN was used for learning and map detection. In the experiment, the difference between the center coordinate of the map on the test image and the center coordinate of the detected map is calculated. The median value of the results of the experiment is 0.00158 for longitude and 0.00090 for latitude. In terms of distance, the difference is 141m in the east-west direction and 100m in the north-south direction.

A System Framework for Map Air Update Navigation Service

  • Min, Kyoung-Wook;An, Kyoung-Hwan;Jang, In-Sung;Jin, Sung-Il
    • ETRI Journal
    • /
    • v.33 no.4
    • /
    • pp.476-486
    • /
    • 2011
  • The quality of navigation service is determined by the accuracy of the available data. For existing navigation services, a full map update is provided in order to keep the map data of mobile devices current. As content and services of mobile devices have recently been diversifying, the size of map data managed in mobile devices has increased, reaching several gigabytes in size. It generally takes tens of minutes to write several gigabytes of data into mobile device storage. For traditional navigation systems, a complicated storage structure called a physical storage format (PSF) is used to assure maximum processing performance of map data in mobile devices within limited resources. Consequently, even though modified navigation map data actually affects only a portion of a map, the full map data is updated because partial updates are not possible. In this paper, a navigation system is studied to solve this difficult partial map update problem. The map air update navigation system, which is the result of this study, provides real-time partial map updating using wireless communications.

Precision shape modeling by z-map model

  • Park, Jung-Whan;Chung, Yun-Chan;Choi, Byoung-Kyn
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.3 no.1
    • /
    • pp.49-56
    • /
    • 2002
  • The Z-map is a special farm of discrete non-parametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z[ij]. While the z-map is the simplest farm of representing sculptured surfaces and is the most versatile scheme for modeling non-parametric objects, its practical application in industry (eg, tool-path generation) has aroused much controversy over its weaknesses, namely its inaccuracy, singularity (eg, vertical wall), and some excessive storage needs. Much research or the application of the z-map can be found in various articles, however, research on the systematic analysis of sculptured surface shape representation via the z-map model is rather rare. Presented in this paper are the following: shape modeling power of the simple z-map model, exact (within tolerance) z-map representation of sculptured surfaces which have some feature-shapes such as vertical-walls and real sharp-edges by adopting some complementary z-map models, and some application examples.

Cost Effective Mobility Anchor Point Selection Scheme for HMIPv6 Networks (HMIPv6 환경에서의 최소비용 MAP 선택 기법)

  • Roh, Myoung-Hwa;Jeong, Choong-Kyo
    • Journal of Industrial Technology
    • /
    • v.26 no.B
    • /
    • pp.207-213
    • /
    • 2006
  • Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

  • PDF

A Design of Turbo Decoder for 3GPP using Log-MAP Algorithm (Log-MAP을 사용한 3GPP용 터보 복호기의 설계)

  • Kang, Heyng-Goo;Jeon, Heung-Woo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.533-536
    • /
    • 2005
  • MAP algorithm is known for optimal decoding algorithm of Turbo codes, but it has very large computational complexity and delay. Generally log-MAP algorithm is used in order to overcome the defect. In this paper we propose modified scheme of the state metric calculation block which can improve the computation speed in log-MAP decoder and simple linear offset unit without using LUT. The simulation results show that the operation speed of the proposed scheme is improved as compared with that of the past scheme.

  • PDF

Development of Map Building Algorithm for Mobile Robot by Using RFID (모바일 로봇에서 RFID를 이용한 지도작성 알고리즘 개발)

  • Kim, Si-Seup;Seon, Jeong-An;Kee, Chang-Doo
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.20 no.2
    • /
    • pp.133-138
    • /
    • 2011
  • RFID system can be used to improve object recognition, map building and localization for robot area. A novel method of indoor navigation system for a mobile robot is proposed using RFID technology. The mobile robot With a RFID reader and antenna is able to find what obstacles are located where in circumstance and can build the map similar to indoor circumstance by combining RFID information and distance data obtained from sensors. Using the map obtained, the mobile robot can avoid obstacles and finally reach the desired goal by $A^*$ algorithm. 3D map which has the advantage of robot navigation and manipulation is able to be built using z dimension of products. The proposed robot navigation system is proved to apply for SLAM and path planning in unknown circumstance through numerous experiments.

High-Speed Self-Organzing Map for Document Clustering

  • Rojanavasu, Ponthap;Pinngern, Ouen
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1056-1059
    • /
    • 2003
  • Self-Oranizing Map(SOM) is an unsupervised neural network providing cluster analysis of high dimensional input data. The output from the SOM is represented in map that help us to explore data. The weak point of conventional SOM is when the map is large, it take a long time to train the data. The computing time is known to be O(MN) for trainning to find the winning node (M,N are the number of nodes in width and height of the map). This paper presents a new method to reduce the computing time by creating new map. Each node in a new map is the centroid of nodes' group that are in the original map. After create a new map, we find the winning node of this map, then find the winning node in original map only in nodes that are represented by the winning node from the new map. This new method is called "High Speed Self-Oranizing Map"(HS-SOM). Our experiment use HS-SOM to cluster documents and compare with SOM. The results from the experiment shows that HS-SOM can reduce computing time by 30%-50% over conventional SOM.

  • PDF

DESIGNING AND DEVELOPING E-MAP COMPONENT USING UML

  • Jo Myung-Hee;Jo Yun-Won;Kim Dong-Young
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.466-469
    • /
    • 2005
  • In this study e-map component was designed and developed to possibly overlay with all kinds of thematic maps in various scales and provide the all detailed information by using high-resolution satellite image and GIS. Also, this system has powerful map composition tool to display map such as legend, scale bar, index map and so on. For this, this e-map component was designed by using UML and developed based on Windows 2000 and implemented by using Visual Basic 6.0 as development programming language, Map Objects 2.1 of ESRI as GIS component. Through this system, the forest officials could generate more detailed topography and desired thematic map. In addition, the data consistency in DBMS could be maintained by using SDE (Spatial Database Engine) for their job and share the standard forest database with others in real time.

  • PDF