• Title/Summary/Keyword: Quadtree grid

Search Result 15, Processing Time 0.017 seconds

An Oobject-Oriented Hierarchical Motion Compensation Technique Using the Greedy Method (Greedy기법을 이용한 계층적 객체 기반 움직임 보상)

  • 이준서;김인철;이상욱
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.7
    • /
    • pp.62-71
    • /
    • 1998
  • In this paper, we describe the object-oriented motioncompensation technique using the hierarchical grid interpolation(HGI). By noting that the HGI does not exploit effetively the rate-distortion (R-D) trade-off inherent in the quadtree decomposition, we propose an objectoriented HGI technique employing the greedy method. In the proposed technique, input image is decomposed in a quadtree basis using the greedy method, yielding maximum split gain in the R-D sense. Then, the motion compensation is performed using the HGI technique. The performance of the proposed technique is examined in simulation, and it will be show that the proposed technique provides better performance than the conventional object-oriented motion compensation techniques.

  • PDF

Application of adaptive mesh refinement technique on digital surface model-based urban flood simulation

  • Dasallas, Lea;An, Hyunuk
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2020.06a
    • /
    • pp.122-122
    • /
    • 2020
  • Urban flood simulation plays a vital role in national flood early warning, prevention and mitigation. In recent studies on 2-dimensional flood modeling, the integrated run-off inundation model is gaining grounds due to its ability to perform in greater computational efficiency. The adaptive quadtree shallow water numerical technique used in this model implements the adaptive mesh refinement (AMR) in this simulation, a procedure in which the grid resolution is refined automatically following the flood flow. The method discounts the necessity to create a whole domain mesh over a complex catchment area, which is one of the most time-consuming steps in flood simulation. This research applies the dynamic grid refinement method in simulating the recent extreme flood events in Metro Manila, Philippines. The rainfall events utilized were during Typhoon Ketsana 2009, and Southwest monsoon surges in 2012 and 2013. In order to much more visualize the urban flooding that incorporates the flow within buildings and high-elevation areas, Digital Surface Model (DSM) resolution of 5m was used in representing the ground elevation. Results were calibrated through the flood point validation data and compared to the present flood hazard maps used for policy making by the national government agency. The accuracy and efficiency of the method provides a strong front in making it commendable to use for early warning and flood inundation analysis for future similar flood events.

  • PDF

A Study on New Map Construction Method for Path Planing of Mobile Robots (이동 로봇의 경로 계획을 위한 새로운 지도 작성 방법에 관한 연구)

  • Oh, Joon-Seop;Park, Jin-Bae;Choi, Yoon-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1999.11c
    • /
    • pp.606-608
    • /
    • 1999
  • 본 논문에서는 이동 로봇의 유연하고 짧은 경로 계획을 위하여 기존의 그리드 셀(grid cell)로 구성되는 지도 대신에 삼각형을 이용하여 지도를 구성하는 새로운 방법을 제안한다. 기존의 그리드 셀로 구성되는 지도의 경우 이동 로봇가 현재 셀에서 다음 셀로 진행시 진행 방향이 8 방향이나, 본 논문에서 제안한 방법에 의해 구성된 새로운 지도는 셀을 삼각형으로 표현함으로써, 이동 로봇의 진행 방향이 12 방향이 된다. 이와 같이 이동 로봇의 진행 방향이 증가한다는 것은 이동 로봇이 더욱 유연하게 장애물을 회피하며 더욱 짧은 경로로 주행할 수 있는 가능성을 의미한다. 한편, 본 논문에서 제안한 삼각형 지도 작성 방법의 효율성을 기존의 그리드 셀을 이용한 경로 계획 알고리즘인 거리 변환(path transform) 경로 계획을 통하여 증명한다. 또한 새로운 삼각형 지도 구성이 메모리의 효율성 위해 이동 로봇의 주행 환경을 장애물이 비어있는 공간을 가능한 하나의 셀로 병합하는 4진트리 방법(quadtree method)에도 적용 가능함을 보인다.

  • PDF

Cloud P2P OLAP: Query Processing Method and Index structure for Peer-to-Peer OLAP on Cloud Computing (Cloud P2P OLAP: 클라우드 컴퓨팅 환경에서의 Peer-to-Peer OLAP 질의처리기법 및 인덱스 구조)

  • Joo, Kil-Hong;Kim, Hun-Dong;Lee, Won-Suk
    • Journal of Internet Computing and Services
    • /
    • v.12 no.4
    • /
    • pp.157-172
    • /
    • 2011
  • The latest active studies on distributed OLAP to adopt a distributed environment are mainly focused on DHT P2P OLAP and Grid OLAP. However, these approaches have its weak points, the P2P OLAP has limitations to multidimensional range queries in the cloud computing environment due to the nature of structured P2P. On the other hand, the Grid OLAP has no regard for adjacency and time series. It focused on its own sub set lookup algorithm. To overcome the above limits, this paper proposes an efficient central managed P2P approach for a cloud computing environment. When a multi-level hybrid P2P method is combined with an index load distribution scheme, the performance of a multi-dimensional range query is enhanced. The proposed scheme makes the OLAP query results of a user to be able to reused by other users' volatile cube search. For this purpose, this paper examines the combination of an aggregation cube hierarchy tree, a quad-tree, and an interval-tree as an efficient index structure. As a result, the proposed cloud P2P OLAP scheme can manage the adjacency and time series factor of an OLAP query. The performance of the proposed scheme is analyzed by a series of experiments to identify its various characteristics.

Efficient GPU Framework for Adaptive and Continuous Signed Distance Field Construction, and Its Applications

  • Kim, Jong-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.3
    • /
    • pp.63-69
    • /
    • 2022
  • In this paper, we propose a new GPU-based framework for quickly calculating adaptive and continuous SDF(Signed distance fields), and examine cases related to rendering/collision processing using them. The quadtree constructed from the triangle mesh is transferred to the GPU memory, and the Euclidean distance to the triangle is processed in parallel for each thread by using it to find the shortest continuous distance without discontinuity in the adaptive grid space. In this process, it is shown through experiments that the cut-off view of the adaptive distance field, the distance value inquiry at a specific location, real-time raytracing, and collision handling can be performed quickly and efficiently. Using the proposed method, the adaptive sign distance field can be calculated quickly in about 1 second even on a high polygon mesh, so it is a method that can be fully utilized not only for rigid bodies but also for deformable bodies. It shows the stability of the algorithm through various experimental results whether it can accurately sample and represent distance values in various models.