• Title/Summary/Keyword: moving GIS

Search Result 151, Processing Time 0.026 seconds

A Study on Utilization of GNSS and Spatial Image for River Site Decision Supporting (하천 현장업무 의사지원을 위한 GNSS와 공간영상 활용방안에 관한 연구)

  • Park, Hyeon-Cheol;Choung, Yun-Jae;Jo, Myung-Hee
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.14 no.1
    • /
    • pp.118-129
    • /
    • 2011
  • This Study has developed the information system of the rivers based on 3D image GIS by converging the latest information technology of GIS(Geographic Information System), RS(Remote Sensing), GNSS(Global Navigation Satellite System), aerial laser survey(LiDAR) with real time network technology in order to understand the current situation of all the four major rivers and support the administrative management system. The said information system acquires the high resolution aerial photographs of 25cm, aerial laser survey and water depth surveying data to express precise space information on the whole Youngsan River which is the leading project site out of the four river sites. Monitoring the site is made available on the transporting means such as a helicopter, boat or a bus in connection with locational coordinate tracking skill for the moving objects in real time using GNSS. It makes monitoring all the information on the four river job sites available at a glance, which can obtain the reliability of the people to such vast areas along with enhancing the recognition of the people by publicity of four Rivers Revitalizing Project and reports thereof.

Design and implementation of a time-based R-tree for indexing moving objects (이동체의 색인을 위한 시간 기반 R-트리의 설계 및 구현)

  • 전봉기;홍봉희
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.320-335
    • /
    • 2003
  • Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

A Moving Object Query Process System for Mobile Recommendation Service (모바일 추천 서비스를 위한 이동 객체 질의 처리 시스템)

  • Park, Jeong-Seok;Shin, Moon-Sun;Ryu, Keun-Ho;Jung, Young-Jin
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.707-718
    • /
    • 2007
  • Recently, much studies for providing mobile users with suitable and useful content services, LBS(Location Based Service) corresponding to the change of users' location, are actively going on. First and foremost, this is basically owing to the progress of location management technologies such as GPS, mobile communication technology and the spread of personal devices like PDA and the cellular phones. Besides, the research scope of LBS has been changed from vehicle tracking and navigation services to intelligent and personalized services considering the changing information of conditions or environment where the users' are located. For example, it inputs the information such as heavy traffic, pollution, and accidents. The query languages which effectively search the stored vehicle and environment information have been studied depending on the increase of the information utilization. However, most of existing moving object query languages are not enough to provide a recommendation service for a user, because they can not be tested and evaluated in real world and did not consider changed environment information. In order to retrieve not only a vehicle location and environment condition but also use them, we suggest a moving object query language for recommendation service and implement a moving object query process system for supporting a query language. It can process a nearest neighbor query for recommendation service which considers various attributes such as a vehicle's location and direction, environment information. It can be applied to location based service application which utilizes the recommended factors based on environmental conditions.

Design and Implementation of a SQL based Moving Object Query Process System for Controling Transportation Vehicle (물류 차량 관제를 위한 SQL 기반 이동 객체 질의 처리 시스템의 설계 및 구현)

  • Jung, Young-Jin;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.12D no.5 s.101
    • /
    • pp.699-708
    • /
    • 2005
  • It becomes easy and generalized to track the cellular phone users and vehicles according to the Progress of wireless telecommunication, the spread of network, and the miniaturization of terminal devices. It has been constantly studied to provide location based services to furnish suitable services depending on the positions of customers. Various vehicle tracking and management systems are developed to utilize and manage the vehicle locations to relieve the congestion of traffic and to smooth transportation. However the designed previous work can not evaluated in real world, because most of previous work is only designed not implemented and it is developed for simple model to handle a point, a line, a polygon object. Therefore, we design a moving object query language and implement a vehicle management system to search the positions and trajectories of vehicles and to analyze the cost of transportation effectively. The designed query language based on a SQL can be utilized to get the trajectories between two specific places, the departure time, the arrival time of vehicles, and the predicted uncertainty positions, etc. In addition, the proposed moving object query language for managing transportation vehicles is useful to analyze the cost of trajectories in a variety of moving object management system containing transportation.

A Study on Development of A GPS navigation system based on RFID which contains location information (위치정보가 기록된 RFID를 이용한 택배차량용 내비게이션 시스템 개발에 관한 연구)

  • Shim, Jin-Bum;Han, Yeong-Geun
    • Journal of the Korea Safety Management & Science
    • /
    • v.12 no.1
    • /
    • pp.113-118
    • /
    • 2010
  • "Domestic delivery service" is defined the service to deliver goods or packages from point of senders to point of receiver. With the characteristics of door to door, it is must a service provider should know the exact location of destination assuring best utilization of moving path. Generally, location information consist of postal code and address only, which result in difficulties to identify the precise location of destination. It is relatively less correlated between the information that address refers and practical location in Korea address system. For example, the next door to house number 100 is not always house number 101. Therefore, a delivery man additionally uses a paper map or a GPS navigation which carry extra job to input every code of location to the device in order to know precise location. It is also very inconvenient that every delivery man identify the location that address information refers and make a personal decision of the optimum moving path dropping each destination without calculating provisioning process of whole delivery path. As explained above, it is inefficient to find information delivery service required and to generate the optimum path. In results, these difficulties bring in delay of service and increase of cost. In this point, the contents of the thesis suggest a GPS navigation system easy to obtain accuracy of delivery information which enables to automate optimum moving path based on RFID which contains location information.

The Optimized Detection Range of RFID-based Positioning System using k-Nearest Neighbor Algorithm

  • Kim, Jung-Hwan;Heo, Joon;Han, Soo-Hee;Kim, Sang-Min
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.10a
    • /
    • pp.297-302
    • /
    • 2008
  • The positioning technology for a moving object is an important and essential component of ubiquitous computing environment and applications, for which Radio Frequency Identification(RFID) has been considered as a core technology. RFID-based positioning system calculates the position of moving object based on k-nearest neighbor(k-nn) algorithm using detected k-tags which have known coordinates and kcan be determined according to the detection range of RFID system. In this paper, RFID-based positioning system determines the position of moving object not using weight factor which depends on received signal strength but assuming that tags within the detection range always operate and have same weight value. Because the latter system is much more economical than the former one. The geometries of tags were determined with considerations in huge buildings like office buildings, shopping malls and warehouses, so they were determined as the line in I-Dimensional space, the square in 2-Dimensional space. In 1-Dimensional space, the optimal detection range is determined as 125% of the tag spacing distance through the analytical and numerical approach. Here, the analytical approach means a mathematical proof and the numerical approach means a simulation using matlab. But the analytical approach is very difficult in 2-Dimensional space, so through the numerical approach, the optimal detection range is determined as 134% of the tag spacing distance in 2-Dimensional space. This result can be used as a fundamental study for designing RFID-based positioning system.

  • PDF

The Optimized Detection Range of RFID-based Positioning System using k-Nearest Neighbor Algorithm

  • Kim, Jung-Hwan;Heo, Joon;Han, Soo-Hee;Kim, Sang-Min
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.10a
    • /
    • pp.270-271
    • /
    • 2008
  • The positioning technology for a moving object is an important and essential component of ubiquitous communication computing environment and applications, for which Radio Frequency IDentification Identification(RFID) is has been considered as also a core technology for ubiquitous wireless communication. RFID-based positioning system calculates the position of moving object based on k-nearest neighbor(k-nn) algorithm using detected k-tags which have known coordinates and k can be determined according to the detection range of RFID system. In this paper, RFID-based positioning system determines the position of moving object not using weight factor which depends on received signal strength but assuming that tags within the detection range always operate and have same weight value. Because the latter system is much more economical than the former one. The geometries of tags were determined with considerations in huge buildings like office buildings, shopping malls and warehouses, so they were determined as the line in 1-Dimensional space, the square in 2-Dimensional space and the cubic in 3-Dimensional space. In 1-Dimensional space, the optimal detection range is determined as 125% of the tag spacing distance through the analytical and numerical approach. Here, the analytical approach means a mathematical proof and the numerical approach means a simulation using matlab. But the analytical approach is very difficult in 2- and 3-Dimensional space, so through the numerical approach, the optimal detection range is determined as 134% of the tag spacing distance in 2-Dimensional space and 143% of the tag spacing distance in 3-Dimensional space. This result can be used as a fundamental study for designing RFID-based positioning system.

  • PDF

Location Tracking in Indoor Symbolic Space with RFID Sensors (RFID 센서를 이용한 실내 기호공간에서의 위치추적)

  • Kang, Hye-Young;Hwang, Jung-Rae;Li, Ki-Joune
    • Spatial Information Research
    • /
    • v.19 no.3
    • /
    • pp.53-62
    • /
    • 2011
  • Spatial information services in indoor space are an im portant application area of GIS as in outdoor space. Unlike in outdoor space, a position in indoor space is specified by a symbolic code such as room number, rather than coordinate. Therefore tracking in indoor space is no longer a prediction of coordinates but a symbolic estimation on the current position of a moving object. In this paper, we propose a framework for tracking moving objects in indoor symbolic space with RFID sensors. First, we introduce the concepts of indoor symbolic space and tracking in indoor symbolic space, and define the accessibility graph for trackable indoor symbolic space. Second, we propose a deployment method of RFID readers and a construction algorithm of accessibility graph for trackable indoor symbolic space. Third, a tracking method is proposed for moving objects in symbolic indoor space with RFID sensors. Finally, we present an implementation exmaple and the result of experiment with real data to validate the proposed method.

A Unified Index for Moving Object Database (이동객체 데이터베이스를 위한 통합 인덱스)

  • Han Jong-Hyeong;Lee Joon-Woo;Nah Yun-Mook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.113-116
    • /
    • 2006
  • GPS 및 PDA 등의 발달과 보급으로 인해 위치기반서비스(LBS), 차량항법장치(CNS), 지리정보시스템(GIS)등 공간 데이터를 이용하는 응용프로그램이 급격하게 발달되었다. 응용프로그램의 발달과 더불어 이동객체의 양이 방대해짐에 따라 객체에 대한 효율적 처리가 요구된다. 이동 객체가 시간의 흐름에 따라 연속적으로 발생되는 위치 정보를 신속하게 관리하기 위한 통합된 인덱스 구조를 제안한다. 제안하는 인덱스구조는 이동 객체의 현재, 과거, 미래질의를 처리할 수 있도록 3 가지의 인덱스를 통합 하였으며, 또한 제안된 인덱스구조에 저장 관리자를 함께 둠으로써 이동 객체정보를 관리 할 수 있다.

  • PDF

k-NN Query Process ing for Distributed Moving Object Dat abases (분산 이동객체 데이터베이스를 위한 k-NN질의 처리)

  • Han, Jong-Hyeong;Lee, Joon-Woo;Nah, Yun-Mook
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10c
    • /
    • pp.261-266
    • /
    • 2006
  • GIS분야와 유비쿼터스 환경의 진보로 언제 어디서나 유무선으로 정보를 주고 받는 환경의 계선에 대한 발전이 계속 되어 왔다. 이런 환경에서 이동객체의 이용도가 증대됨에 따라 대용량의 객체 처리를 위해 분산 처리방식이 적용 되었다. 기존 연구의 k-NN질의는 단일 노드에서 질의 처리 비용의 절감에 중점을 두어 분할된 노드에서의 질의처리에 관련된 연구가 부족하였다. 분할된 노드에서 질의를 처리하기 위해서 고비용이 요구되는 k-NN질의를 위하여 본 논문에서는 Hybrid k-NN질의처리 방식을 제안한다. 제안방식은 k-NN질의와 범위질의 특성을 결합한 형태로 분할된 노드에 질의처리를 가능하게 하고, 질의처리 시 k-NN질의와 범위질의의 혼합으로 k-NN질의의 고비용을 절감하는 방법이다. 이 방법은 GALIS 프로토타입의 SLDS의 질의 처리 부분을 개선에 활용할 수 있다.

  • PDF