• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.439-446
• /
• 2015

Recently, semantic trajectories which combine GPS positions and POIs(Point of Interests) become more popular in order to expand location based services. To construct semantic trajectories, the existing algorithms exploit the extent information of POIs described as polygons and find overlapping regions between GPS positions and the extents. However, the algorithms are not applicable in the condition where the extent information is not provided such as in Google Map, Naver Map, OpenStreetMap and most of the open geographic information systems. In this paper, we provide a novel algorithm to construct semantic trajectories only with GPS positions and POI points but without POI extents.

• Journal of Information Technology Services
• /
• v.10 no.4
• /
• pp.269-280
• /
• 2011

Mobile Augmented Reality (mobile AR), as one of the most prospective mobile applications, intends to provide richer experiences by annotating tags or virtual objects over the scene observed through camera embedded in a handheld device like smartphone or pad. In this paper, we analyzed the current status of the art of mobile AR and proposed a novel Points of Interest (POIs) data model based on ontology to provide context-aware information retrievals on lots of POIs data. Proposed ontology was expanded from the standard POIs data model of W3C POIs Working Group and established using OWL (Web Ontology Language) and Protege. We also proposed a context-aware mobile AR platform which can resolve three distinguished issues in current platforms : interoperability problem of POI tags, POIs data retrieval issue, and context-aware service issue.

• Spatial Information Research
• /
• v.23 no.4
• /
• pp.33-46
• /
• 2015

The fact that the limits of information recency, diversity, and usability are mainly caused by the supply oriented geospatial data and service development is commonly recognized. It is recently tried to overcome the limits by facilitating user experience and VGI(Volunteered Geographic Information) in several geospatial web services. This study suggests conceptual architecture and service scenario for geospatial collaborative platform prototype through review and examination of previous researches. The prototype, composed of 4 unit modules: 3D POI Creation Module, 3D POI Application Module, 3D POI/Event Management Module, 3D POI/Event Monitoring Module, provides the capability of collaboratively dealing with geospatial work. The suggested service scenario is demonstrated by developing prototype for the service modules.

• 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.

• Proceedings of the Korea Contents Association Conference
• /
• 2017.05a
• /
• pp.17-18
• /
• 2017

손쉽게 현 위치 정보를 공유하고 사용자 간 커뮤니케이션이 가능한 위치 기반 소셜 네트워크가 대중화되면서 장소 추천에 대한 연구가 활발히 진행되어 있다. 본 논문은 시간대별 사용자 선호도와 주요 활동 영역을 고려한 POI 추천 기법을 제안한다. 장소 카테고리별 사용자의 체크인(che-ck-in)정보를 시간대로 분할하여 시간에 따른 장소의 선호도를 판별하고 사용자의 과거 이력을 이용하여 사용자별 활동 영역을 선별한다. 장소의 선호도와 선별된 활동 영역에 기반하여 협업 필터링을 수행하여 POI를 추천한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1199-1201
• /
• 2015

위치 기반 서비스는 여러 분야에서 활용되어지고 있다. 사용자들에게 정확한 정보를 제공하기 위해서는 대량의 위치 데이터를 분석하여 POI를 추출하고 분석해야 된다. 본 논문에서는 POI를 추출하는 방법으로 DBSCAN 클러스터링을 이용하고 이를 MapReduce 환경에서 구현한다. 또한 알고리즘의 수행속도를 향상시키기위해 데이터를 분할하는 방법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.172-175
• /
• 2015

많은 사람들이 위치 기반 서비스를 사용하면서 위치 기반 서비스에서 사용되는 GPS 데이터는 기하급수적으로 증가하고 있다. 사용자들에게 필요한 정보를 제공하기위해서는 이러한 대량의 GPS 데이터를 처리하여 POI를 추출하고 분석하는 과정이 필요하다. 본 논문에서는 POI를 추출하고 관리 분석하기 위해 MapReduce 환경을 구축하고 DBSCAN 클러스터링 방법을 이용한다. 또한 분산 환경에서 DBSCAN 알고리즘을 수행하기 위해 K-Means를 이용한 데이터 분할 방법을 제안한다.

• The Journal of the Korea Contents Association
• /
• v.19 no.2
• /
• pp.284-295
• /
• 2019

In the recent times, a personalized travel path recommendation based on both travelogues and community contributed photos and the heterogeneous meta-data (tags, geographical locations, and date taken) which are associated with photos have been studied. The travellers using social media leave their location history, in the form of paths. These paths can be bridged for acquiring information, required, for future recommendation, for the future travellers, who are new to that location, providing all sort of information. In this paper, we propose a personalized travel path recommendation scheme, based on social life log. By taking advantage, of two kinds of social media, such as travelogue and community contributed photos, the proposed scheme, can not only be personalized to user's travel interest, but also be able to recommend, a travel path rather than individual Points of Interest (POIs). The proposed personalized travel route recommendation method consists of two steps, which are: pruning POI pruning step and creating travel path step. In the POI pruning step, candidate paths are created by the POI derived. In the creating travel path step, the proposed scheme creates the paths considering the user's interest, cost, time, season of the topic for more meaningful recommendation.

• 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.

• Annual Conference on Human and Language Technology
• /
• 2006.10e
• /
• pp.183-188
• /
• 2006

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