• Title/Summary/Keyword: Grid Coverage

Search Result 68, Processing Time 0.03 seconds

Grid Coverage Component Development Reusing Existing Grid Coverage Components

  • Kim, Hong-Gab;Lim, Young-Jae;Kim, Kyung-Ok
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1105-1107
    • /
    • 2003
  • Remote sensing data processing and analysis system can be developed based on the Grid Coverage Specification and this kind of system is also can be easily interoperate with GIS systems conforming OpenGIS specification. This paper proposes a method to implement easily and quickly the new grid coverages that provide new operations, or services, by reusing the existing grid coverage components, which is based on the fact that the pipeline constructed by grid coverages can be represented in one grid coverage. This method complements easily the deficiency of the existing grid coverage components and enables quick implementation of the new grid coverage that provides complex processing operations.

  • PDF

The Implementation of a Pipe-lined Grid Coverage and Grid Coverage Processor

  • Kim, Hong-Gab;Kim, Kyung-Ok
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.70-73
    • /
    • 2002
  • This paper describes the way to embody the grid coverage and the grid coverage processor which can construct pipelines. The pipeline constructed by the developed grid coverages has internal pipelines that have different resolution and it provides the way of access to very large datasets efficiently. Several operations, such as filtering, image enhancement and band operation, are embedded in the developed grid coverage and grid coverage processor COM components. The practical usefulness of the developed grid coverage and grid coverage processor has been proven by applying them in developing an image processing software for very large images.

  • PDF

Implementation of a Change Detection System based on OGC Grid Coverage Specification (OGC Grid Coverage 기반 다기능 변화탐지 시스템의 구현)

  • Lim, Young-Jae;Jeong, Soo;Kim, Kyung-Ok
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2003.10a
    • /
    • pp.379-384
    • /
    • 2003
  • In this paper, we introduce a change detection system that can extract and analyze change elements from high-resolution satellite imagery as well as low- or middle-resolution satellite imagery. The developed system provides not only 7 pixel-based methods that can be used to detect change from low- or middle-resolution satellite images but also a float window concept that can be used in manual change detection from high-resolution satellite images. This system enables fast process of the very large image, because it is constituted by OGC grid coverage components. Also new change detection algorithms can be easily added into this system if once they are made into grid coverage components.

  • PDF

Implementation of an Enhanced Change Detection System based on OGC Grid Coverage Specification

  • Lim, Young-Jae;Kim, Hong-Gab;Kim, Kyung-Ok
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1099-1101
    • /
    • 2003
  • Change detection technology, which discovers the change information on the surface of the earth by comparing and analyzing multi-temporal satellite images, can be usefully applied to the various fields, such as environmental inspection, urban planning, forest policy, updating of geographical information and the military usage. In this paper, we introduce a change detection system that can extract and analyze change elements from high-resolution satellite imagery as well as low- or middle-resolution satellite imagery. The developed system provides not only 7 pixelbased methods that can be used to detect change from low- or middle-resolution satellite images but also a float window concept that can be used in manual change detection from highresolution satellite images. This system enables fast access to the very large image, because it is constituted by OGC grid coverage components. Also new change detection algorithms can be easily added into this system if once they are made into grid coverage components.

  • PDF

Time-Efficient Trajectory Planning Algorithms for Multiple Mobile Robots in Nuclear/Chemical Reconnaissance System (화방 정찰 체계에서의 다수의 이동 로봇을 위한 시간 효율적인 경로 계획 알고리즘에 대한 연구)

  • Kim, Jae-Sung;Kim, Byung-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.10
    • /
    • pp.1047-1055
    • /
    • 2009
  • Since nuclear and chemical materials could damage people and disturb battlefield missions in a wide region, nuclear/chemical reconnaissance systems utilizing multiple mobile robots are highly desirable for rapid and safe reconnaissance. In this paper, we design a nuclear/chemical reconnaissance system including mobile robots. Also we propose time-efficient trajectory planning algorithms using grid coverage and contour finding methods for reconnaissance operation. For grid coverage, we performed in analysis on time consumption for various trajectory patterns generated by straight lines and arcs. We proposed BCF (Bounded Contour Finding) and BCFEP (Bounded Contour Finding with Ellipse Prediction) algorithms for contour finding. With these grid coverage and contour finding algorithms, we suggest trajectory planning algorithms for single, two or four mobile robots. Various simulations reveal that the proposed algorithms improve time-efficiency in nuclear/chemical reconnaissance missions in the given area. Also we conduct basic experiments using a commercial mobile robot and verify the time efficiency of the proposed contour finding algorithms.

UAV Path Planning for ISR Mission and Survivability (무인항공기의 생존성을 고려한 감시정찰 임무 경로 계획)

  • Bae, Min-Ji
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.7
    • /
    • pp.211-217
    • /
    • 2019
  • In an complicated battlefield environment, information from enemy's camp is an important factor in carrying out military operations. For obtaining this information, the number of UAVs that can be deployed to the mission without our forces' loss and at low cost is increasing. Because the mission environment has anti-aircraft weapons, mission space is needed for UAV to guarantee survivability without being killed. The concept of Configuration Space is used to define the mission space considering with range of weapons and detect range of UAV. UAV must visit whole given area to obtain the information and perform Coverage Path Planning for this. Based on threats to UAV and importance of information that will be obtained, area that UAV should visit first is defined. Grid Map is generated and mapping threat information to each grid for UAV path planning. On this study, coverage conditions and path planning procedures are presented based on the threat information on Grid Map, and mission space is expanded to improve detection efficiency. Finally, simulations are performed, and results are presented using the suggested UAV path planning method in this study.

Probabilistic Map Building Using Ultrasonic Sensor for Autonomous Mobile Robot (초음파 센서를 이용한 자율이동로봇의 확률지도 작성)

  • Lee, Sang-Soo;Oh, Joon-Seop;Choi, Yoon-Ho;Park, Jin-Bae
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2840-2842
    • /
    • 2000
  • This paper describes sensor-based occupancy grid map construction method through complete coverage navigation algorithm in unknown environment. In this paper, we use the updated Baysian model for probabilistic grid map. For map construction, complete coverage navigation method in which mobile robot can navigate complete field through as short path as possible in unknown environment, is used. The computer simulations result show that map construction method using complete coverage algorithm is efficient.

  • PDF

A Robot Coverage Algorithm Integrated with SLAM for Unknown Environments (미지의 환경에서 동작하는 SLAM 기반의 로봇 커버리지 알고리즘)

  • Park, Jung-Kyu;Jeon, Heung-Seok;Noh, Sam-H.
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.1
    • /
    • pp.61-69
    • /
    • 2010
  • An autonomous robot must have a global workspace map in order to cover the complete workspace. However, most previous coverage algorithms assume that they have a grid workspace map that is to be covered before running the task. For this reason, most coverage algorithms can not be applied to complete coverage tasks in unknown environments. An autonomous robot has to build a workspace map by itself for complete coverage in unknown environments. Thus, we propose a new DmaxCoverage algorithm that allows a robot to carry out a complete coverage task in unknown environments. This algorithm integrates a SLAM algorithm for simultaneous workspace map building. Experimentally, we verify that DmaxCoverage algorithm is more efficient than previous algorithms.

The Design and Implementation of a Reusable Viewer Component

  • Kim, Hong-Gab;Lim, Young-Jae;Kim, Kyung-Ok
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.66-69
    • /
    • 2002
  • This article outlines the capabilities of a viewer component called GridViewer, and proves its reusability. GridViewer was designed for the construction of the image display part of GIS or remote sensing application software, and consequently it is particularly straightforward to closely couple GridViewer with access to very large images. Displaying is performed through pyramid structure, which enables to treat very large dataset up to several gigabytes in size under the limited capability of PC. GridViewer is free from responsibility to handle various formats of raster data files by taking grid coverage, which is designed by OGC to promote interoperability between implementations done by data vendors and software vendors providing analysis and grid processing implementations. GridViewer differs from other such viewer by allowing for clients to extend its function and capability by using small set of methods originally implemented in it. We show its reusability and expandability by applying it in developing application programs performing various functions not supported originally by the GridViewer COM component.

  • PDF

Full-Coverage algorithm with local obstacle avoidance algorithm (지역적 회피 알고리즘을 갖는 Full-Coverage 알고리즘)

  • Park G-M.;Son Y-D.;Kim Y.B.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.06a
    • /
    • pp.1468-1471
    • /
    • 2005
  • This Paper is to find out a solution for the full-coverage algorithm requiring the real-time processing such as mobile home service robots and vacuum cleaner robots. Previous methods are used by adopting based grid approach method. They used lots of sensors, a high speed CPU, expensive ranger sensors and huge memory. Besides, most full-coverage algorithms should have a map before obstacle avoidance. However, if a robot able to recognize the tangent vector of obstacles, it is able to bring the same result with less sensors and simplified hardware. Therefore, this study suggests a topological based approach and a local obstacle voidance method using a few of PSD sensors and ultra sonic sensors. The simulation results are presented to prove its applicability.

  • PDF