• Title/Summary/Keyword: POI

Search Result 220, Processing Time 0.027 seconds

A Development of GVP for Hierarchical POI Information Visualization (계층적 POI 정보 가시화를 위한 GVP 개발)

  • Park, Yong-Jin;Xin, Jin;Han, Won-Hee;Seo, Se-Kwang;Song, Eun-Ha;Han, Sung-Kook;Jeong, Young-Sik
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06b
    • /
    • pp.390-395
    • /
    • 2007
  • 현재 컴퓨터 성능의 발달과 함께 GIS 서비스는 기존의 단순 지도 서비스를 비롯한 각 개체들의 위치 정보인 POI 서비스까지 요구되고 있다. 하지만 대부분의 GIS 서비스는 그 핵심적 기반이라 할 수 있는 지도 데이터를 표현하는데 있어서 각 개발 업체 및 연구기관마다 각기 다른 지도데이터 포맷을 사용하고 있다. 이는 곧 데이터의 중복 구축뿐만 아니라 기존 GIS간의 상호 운용성이 결여되어 서로 간에 호환 불가라는 문제점을 야기 시킨다. 또한, POI 서비스에서도 POI를 이루는 개체들에 대한 위치 정보가 불충분하여 단순히 지명 서비스만을 제공하고 있어, 다양한 정보 서비스를 제공 받고자 하는 사용자의 요구를 충족시키지 못하고 있다. 이에 본 논문에서는 지도 표준인 GML을 기반으로 하여 지도 가시화의 중복 구축 및 비호환성을 극복하고, 단순한 POI 정보에 대해서는 계층적이고 사용자 중심적인 위치정보를 구축하고 이를 가시화하는 GVP를 개발한다.

  • PDF

Indoor Semantic Data Dection and Indoor Spatial Data Update through Artificial Intelligence and Augmented Reality Technology

  • Kwon, Sun
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.1170-1178
    • /
    • 2022
  • Indoor POI data, an essential component of indoor spatial data, has attribute information of a specific place in the room and is the most critical information necessary for the user. Currently, indoor POI data is manually updated by direct investigation, which is expensive and time-consuming. Recently, research on updating POI using the attribute information of indoor photographs has been advanced to overcome these problems. However, the range of use, such as using only photographs with text information, is limited. Therefore, in this study, and to improvement this, I proposed a new method to update indoor POI data using a smartphone camera. In the proposed method, the POI name is obtained by classifying the indoor scene's photograph into artificial intelligence technology CNN and matching the location criteria to indoor spatial data through AR technology. As a result of creating and experimenting with a prototype application to evaluate the proposed method, it was possible to update POI data that reflects the real world with high accuracy. Therefore, the results of this study can be used as a complement or substitute for the existing methodologies that have been advanced mainly by direct research.

  • PDF

Development of GML Map Visualization Service and POI Management Tool using Tagging (GML 지도 가시화 서비스 및 태깅을 이용한 POI 관리 도구 개발)

  • Park, Yong-Jin;Song, Eun-Ha;Jeong, Young-Sik
    • Journal of Internet Computing and Services
    • /
    • v.9 no.3
    • /
    • pp.141-158
    • /
    • 2008
  • In this paper, we developed the GML Map Server which visualized the map based on GML as international standard for exchanging the common format map and for interoperability of GIS information. And also, it should transmit effectively GML map into the mobile device by using dynamic map partition and caching. It manages a partition based on the visualization area of a mobile device in order to visualize the map to a mobile device in real time, and transmits the partition area by serializing it for the benefit of transmission. Also, the received partition area is compounded in a mobile device and is visualized by being partitioned again as four visible areas based on the display of a mobile device. Then, the area is managed by applying a caching algorithm in consideration of repetitiveness for a received map for the efficient operation of resources. Also, in order to prevent the delay in transmission time as regards the instance density area of the map, an adaptive map partition mechanism is proposed for maintaining the regularity of transmission time. GML Map Server can trace the position of mobile device with WIPI environment in this paper. The field emulator can be created mobile devices and mobile devices be moved and traced it's position instead of real-world. And we developed POIM(POI Management) for management hierarchically POI information and for the efficiency POI search by using the individual tagging technology with visual interface.

  • PDF

System Design and Implementation for Building a Place Information based on Crowdsourcing Utilizing the Graph Data Model (그래프 데이터 모델을 활용한 크라우드 소싱 기반의 장소 정보 구축을 위한 시스템 설계 및 구현)

  • Lee, Jae-Eun;Rho, Gon-Il;Jang, Han-Me;Yu, Kiy-Un
    • Journal of Cadastre & Land InformatiX
    • /
    • v.46 no.1
    • /
    • pp.117-131
    • /
    • 2016
  • The development of LBS(location-based services) due to the widespread mobile environment highlights the importance of POI(point of interest) information. The accurate and up-to-date POI has to be ensured to reflect the information of rapidly changing places. For the efficient construction of POI, here we propose the novel construction system for t he place information. This system is based on crowd-sourcing in which a great number of users participate. In addition, we utilize the graph data model to build the new concept of the place information covering the wide areas extending from the specific point. Moreover, the implementation of the new system applying the graph data model and crowd-sourcing is realized in this paper. That is, this study suggests the whole new concept of the place information and shows the clustering and the renewal of the place information through crowd-sourcing.

Closest Pairs and e-distance Join Query Processing Algorithms using a POI-based Materialization Technique in Spatial Network Databases (공간 네트워크 데이터베이스에서 POI 기반 실체화 기법을 이용한 Closest Pairs 및 e-distance 조인 질의처리 알고리즘)

  • Kim, Yong-Ki;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.67-80
    • /
    • 2007
  • Recently, many studies on query processing algorithms has been done for spatial networks, such as roads and railways, instead of Euclidean spaces, in order to efficiently support LBS(location-based service) and Telematics applications. However, both a closest pairs query and an e-distance join query require a very high cost in query processing because they can be answered by processing a set of POIs, instead of a single POI. Nevertheless, the query processing cost for closest pairs and e-distance join queries is rapidly increased as the number of k (or the length of radius) is increased. Therefore, we propose both a closest pairs query processing algorithm and an e-distance join query processing algorithm using a POI-based materialization technique so that we can process closest pairs and e-distance join queries in an efficient way. In addition, we show the retrieval efficiency of the proposed algorithms by making a performance comparison of the conventional algorithms.

  • PDF

Voltage Control of Power System Connected to a Wind Farm by Using STATCOM and Reactive Power Compensators (STATCOM과 조상설비를 이용한 풍력단지가 연계된 전력계통의 전압제어)

  • Seo, Gyu-Seok;Park, Ji-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2737-2743
    • /
    • 2015
  • The wind power plant must be able to produce reactive power at the POI bus of a wind farm connected to power system to keep or control the voltage of POI bus. But, the reactive power capability of wind turbines may not be sufficient to control the voltage of POI bus due to the reactive power losses in connection lines between wind farm and POI bus. The solution of this problem is to install an external STATCOM. The proposed cooperative control method of STATCOM and conventional reactive power compensators such as Switched-shunt and tap changing transformer can control the voltage of POI bus more efficiently. The simulation results are shown that the voltage drop of POI Bus of Test System with the arbitrary load change rate to initial loads is improved more than 60% and the voltage of load bus is maintained more than 95% of rated voltage.

DGR-Tree : An Efficient Index Structure for POI Search in Ubiquitous Location Based Services (DGR-Tree : u-LBS에서 POI의 검색을 위한 효율적인 인덱스 구조)

  • Lee, Deuk-Woo;Kang, Hong-Koo;Lee, Ki-Young;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.3
    • /
    • pp.55-62
    • /
    • 2009
  • Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

  • PDF

An Approximate k-NN Query Processing Algorithm Supporting both Location Cloaking and POI Protection (사용자 위치 정보 및 POI 정보 보호를 고려한 Approximate k-최근접점 질의처리 알고리즘)

  • Jang, Mi-Young;Hossain, Amina;Um, Jung-Ho;Chang, Jae-Woo
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2010.06a
    • /
    • pp.53-60
    • /
    • 2010
  • 위치 기반 서비스(Location-Based Services: LBS)에서 질의 요청자가 자신의 위치 정보와 원하는 질의를 전송하면, 위치 기반 서버는 이를 기반으로 질의를 처리하고 결과를 전송한다. 이 때 질의 요청자는 자신의 정확한 위치 좌표를 서버에 전송하기 때문에 개인 정보가 악용될 수 있는 위험에 노출된다. 이러한 문제를 해결하기 위하여 제안된 연구는 크게 Location Clocking 기법과 Private Information Retrieval(PIR) 기법으로 분류된다. Location Cloaking 기법은 사용자의 위치 좌표를 k-1개의 다른 사용자와 함께 묶어 하나의 Cloaking 영역을 생성하고 이를 바탕으로 질의를 처리한다. 그러나 영역에 대한 질의 후보 집합을 결과로 전송하므로 사용자에게 노출되는 POI 수가 증가하는 문제점을 지닌다. PIR은 암호화 기법으로 위치 기반 서버나 공격자에게 사용자의 위치와 질의 타입을 드러내지 않고 질의를 수행한다. 그러나 암호화 된 질의 결과로 사용자에게 데이터 전체를 전송하기 때문에 막대한 통신비용을 초래한다. 따라서 본 논문에서는 Location Cloakng과 PIR 기법의 장점을 결합하여 사용자의 개인 정보와 위치 기반 서버의 POI 정보 보호를 고려한 Approximate k-최근접점 질의 처리 알고리즘을 제안한다. 질의 전송시, 질의 요청자는 Cloaking 영역을 생성하여 위치 좌표를 감추고, 질의 결과 전송 시 Cloaking 영역에 제한된 PIR 프로토콜을 적용한다. 또한 k-최근접점 질의 수행시, 반환되는 POI의 수를 최소화하고, 정확도 높은 질의 결과를 만족하기 위해 Overlapping parameter를 적용한 색인 기법을 제안한다.

  • PDF

An Efficient Range Search Technique in Road Networks (도로 네트워크에서 효율적인 범위 검색 기법)

  • Park, Chun Geol;Kim, Jeong Joon;Park, Ji Woong;Han, Ki Joon
    • Spatial Information Research
    • /
    • v.21 no.4
    • /
    • pp.7-14
    • /
    • 2013
  • Recently, R&D(Research and Development) is processing actively on range search in the road network environments. However, the existing representative range search techniques have shortcomings in that the greater the number of POI's, the more increased storage space or the more increased search time due to inefficient search process. Accordingly, In this paper, we proposed a range search technique using QRMP(QR-tree using Middle Point) to solve the problems of conventional range search techniques. In addition, we made a formula to obtain the total size of the storage space for QRMP and proved the excellence of the range search technique proposed in this paper through the experiment using actual road networks and POI data.

Multiple Pronunciation Dictionary Generation For Korean Point-of-Interest Data Using Prosodic Words (운율어를 이용한 한국어 위치 정보 데이터의 다중 발음 사전 생성)

  • Kim, Sun-Hee;Jeon, Je-Hun;Na, Min-Soo;Chung, Min-Hwa
    • Annual Conference on Human and Language Technology
    • /
    • 2006.10e
    • /
    • pp.183-188
    • /
    • 2006
  • 본 논문에서 위치 정보 데이터란 텔레메틱스 분야의 응용을 위하여 웹상에서 수집한 Point-of-Interest (POI) 데이터로서 행정구역 및 지명 인명, 상호명과 같은 위치 검색에 사용되는 어휘로 구성된다. 본 논문은 음성 인식 시스템을 구성하는 발음 사전의 개발에 관한 것으로 250k 위치 정보데이터로부터 운율어를 이용하여 불규칙 발음과 발음 변이를 포함하는 가능한 모든 발음을 생성하는 방법을 제안하는 것을 목적으로 한다. 원래 모든 POI 는 한 번씩만 데이터에 포함되어 있으므로, 그 가운데 불규칙 발음을 포함하는 POI를 검출하거나 발음을 생성하기 위해서는 각각의 POI 하나하나를 일일이 검토하는 방법밖에 없는데, 대부분의 POI 가 복합명사구로 이루어졌다는 점에 착안하여 운율어를 이용한 결과, 불규칙 발음 검출과 다중 발음 생성을 효율적으로 수행할 수 있었다. 이러한 연구는 음성처리 영역에서는 위치정보데이터의 음성인식 성능을 향상하는 데 직접적인 기여를 할 수 있고, 무엇보다도 음성학과 음운론 이론을 음성 인식 분야에 접목한 학제적 연구로서 그 의미가 있다고 할 수 있다.

  • PDF