• Title/Summary/Keyword: Depth-sort Algorithm

Search Result 5, Processing Time 0.018 seconds

An Adaptive Z-buffer Algorithm for PDA Platform (PDA 플랫폼을 위한 적응형 Z-버퍼 알고리즘)

  • Kim Dae-Young;Kim Hyo-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.1
    • /
    • pp.41-50
    • /
    • 2006
  • This paper aims to improve the efficiency of a 3D-graphic software engine in a PDA platform and the performance of a rasterizer. There are many problems in implementing a software engine in a mobile platform, due to its relatively weak processing power. Taking the advantages and complementing weaknesses of the depth-sort algorithm and the Z-buffer algorithm, we implemented an adaptive Z-buffer algorithm and proved its performance on several PDA platforms. Our algorithm was evaluated to have midway speed compared with two conventional algorithms. It also removed reversal errors in comparison with the depth-sort algorithm.

  • PDF

External-Memory Depth-First Search Algorithm for Solid Grid Graphs (Solid Grid 그래프를 위한 입출력 효율적인 Depth-First Search 알고리즘)

  • ;R. S. Ramakrishna
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.979-981
    • /
    • 2004
  • 여러 과학 및 공학 응용 프로그램에서 다루는 그래프 데이터는 종종 그 크기가 너무 커서 컴퓨터의 주 메모리에 다 들어 갈 수 없는 경우가 많다. 이러한 방대한 크기의 자료를 처리하면서 입출력의 빈도가 자연적으로 커지게 되고 전체 계산에서 주요한 병목 요인으로 작용한다. 본 논문은 solid grid 그래프를 위한 입출력 복잡도 (I/O-complexity)가 O(sort(N))인 depth-first search (DFS) 알고리즘을 제안한다. 여기서, N=|V|+|E|이고 Sort(N)=Θ((N/B)logM/B(N/B)) 이다. 이 전까지 알려진 가장 좋은 알고리즘은 적절한 Sub-grid 입출력을 바탕으로 한 전통적 DFS 알고리즘으로 그 입출력 복잡도는 O((N/B)$B^{1}$2/) 이다.

  • PDF

Real-Time Motion Blur Using Triangular Motion Paths

  • Hong, MinhPhuoc;Oh, Kyoungsu
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.818-833
    • /
    • 2017
  • This paper introduces a new algorithm that renders motion blur using triangular motion paths. A triangle occupies a set of pixels when moving from a position in the start of a frame to another position in the end of a frame. This is a motion path of a moving triangle. For a given pixel, we use a motion path of each moving triangle to find a range of time that this moving triangle is visible to the camera. Then, we sort visible time ranges in the depth-time dimensions and use bitwise operations to solve the occlusion problem. Thereafter, we compute an average color of each moving triangle based on its visible time range. Finally, we accumulate an average color of each moving triangle in the front-to-back order to produce the final pixel color. Thus, our algorithm performs shading after the visibility test and renders motion blur in real time.

Depth tracking of occluded ships based on SIFT feature matching

  • Yadong Liu;Yuesheng Liu;Ziyang Zhong;Yang Chen;Jinfeng Xia;Yunjie Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1066-1079
    • /
    • 2023
  • Multi-target tracking based on the detector is a very hot and important research topic in target tracking. It mainly includes two closely related processes, namely target detection and target tracking. Where target detection is responsible for detecting the exact position of the target, while target tracking monitors the temporal and spatial changes of the target. With the improvement of the detector, the tracking performance has reached a new level. The problem that always exists in the research of target tracking is the problem that occurs again after the target is occluded during tracking. Based on this question, this paper proposes a DeepSORT model based on SIFT features to improve ship tracking. Unlike previous feature extraction networks, SIFT algorithm does not require the characteristics of pre-training learning objectives and can be used in ship tracking quickly. At the same time, we improve and test the matching method of our model to find a balance between tracking accuracy and tracking speed. Experiments show that the model can get more ideal results.

A Modified grid-based KIneMatic wave STOrm Runoff Model (ModKIMSTORM) (I) - Theory and Model - (격자기반 운동파 강우유출모형 KIMSTORM의 개선(I) - 이론 및 모형 -)

  • Jung, In Kyun;Lee, Mi Seon;Park, Jong Yoon;Kim, Seong Joon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.6B
    • /
    • pp.697-707
    • /
    • 2008
  • The grid-based KIneMatic wave STOrm Runoff Model (KIMSTORM) by Kim (1998) predicts the temporal variation and spatial distribution of overland flow, subsurface flow and stream flow in a watershed. The model programmed with C++ language on Unix operating system adopts single flowpath algorithm for water balance simulation of flow at each grid element. In this study, we attempted to improve the model by converting the code into FORTRAN 90 on MS Windows operating system and named as ModKIMSTORM. The improved functions are the addition of GAML (Green-Ampt & Mein-Larson) infiltration model, control of paddy runoff rate by flow depth and Manning's roughness coefficient, addition of baseflow layer, treatment of both spatial and point rainfall data, development of the pre- and post-processor, and development of automatic model evaluation function using five evaluation criteria (Pearson's coefficient of determination, Nash and Sutcliffe model efficiency, the deviation of runoff volume, relative error of the peak runoff rate, and absolute error of the time to peak runoff). The modified model adopts Shell Sort algorithm to enhance the computational performance. Input data formats are accepted as raster and MS Excel, and model outputs viz. soil moisture, discharge, flow depth and velocity are generated as BSQ, ASCII grid, binary grid and raster formats.