• Title/Summary/Keyword: GPGPU computing

Search Result 87, Processing Time 0.043 seconds

Real-Time Quad-Copter Tracking With Multi-Cameras and Ray-based Importance Sampling (복수카메라 및 Ray-based Importance Sampling을 이용한 실시간 비행체 추적)

  • Jin, Longhai;Jeong, Mun-Ho;Lee, Key-Seo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.6
    • /
    • pp.899-905
    • /
    • 2013
  • In this paper, we focus on how to calibrate multi-cameras easily and how to efficiently detect quad-copters with small-numbered particles. Each particle is a six dimensional vector that is composed of 3D position and 3D orientation of a quad-copter in the space. Due to curse of dimensionality, that leads to explosive computational costs with a large amount of high-dimensioned particles. To detect efficiently, we need to put more particles in very promising spaces and few particles in other spaces. Though computational cost is lowered by minimizing particles, in order to track a quad-copter with multiple cameras in real-time, multiple images from the cameras should be synchronized and analyzed. Therefore, lots of the computations still need to be done. Because of this, GPGPU(General-Purpose computing on Graphics Processing Units) is implemented for parallel computing. This method has been successfully tested and gives accurate results in practical situations.

A New System Implementation for Generating Holographic Video using Natural Color Scene (실사 컬러 영상을 이용한 홀로그램 비디오 생성 시스템 구현)

  • Seo, Youngho;Lee, Yoon-Hyuk;Koo, Ja-Myung;Kim, Woo-Youl;Kim, Bo-Ra;Kim, Dong-Wook
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.149-158
    • /
    • 2013
  • In this paper, we propose a new system which can generate digital holograms for natural color scene. The system consists of both a camera system for capturing images and softwares(SWs) for various image processings. The camera system uses a vertical rig with a depth and a RGB camera and a cold mirror which has the different transmittance according to wavelength for obtaining images with the same view point. The S/W is composed by the engines for processing and servicing the captured images and computer-generated hologram (CGH) for generating digital holograms using general-purpose computing on graphics processing unit (GPGPU). Each algorithm was implemented using C/C++ and CUDA languages, and all engines were integrated in LabView environment. The proposed system can generate 10 digital holographic frames per second using about 6K light sources.

A design of GPU container co-execution framework measuring interference among applications (GPU 컨테이너 동시 실행에 따른 응용의 간섭 측정 프레임워크 설계)

  • Kim, Sejin;Kim, Yoonhee
    • KNOM Review
    • /
    • v.23 no.1
    • /
    • pp.43-50
    • /
    • 2020
  • As General Purpose Graphics Processing Unit (GPGPU) recently plays an essential role in high-performance computing, several cloud service providers offer GPU service. Most cluster orchestration platforms in a cloud environment using containers allocate the integer number of GPU to jobs and do not allow a node shared with other jobs. In this case, resource utilization of a GPU node might be low if a job does not intensively require either many cores or large size of memory in GPU. GPU virtualization brings opportunities to realize kernel concurrency and share resources. However, performance may vary depending on characteristics of applications running concurrently and interference among them due to resource contention on a node. This paper proposes GPU container co-execution framework with multiple server creation and execution based on Kubernetes, container orchestration platform for measuring interference which may be occurred by sharing GPU resources. Performance changes according to scheduling policies were investigated by executing several jobs on GPU. The result shows that optimal scheduling is not possible only considering GPU memory and computing resource usage. Interference caused by co-execution among applications is measured using the framework.

Accelerating Distance Transform Image based Hand Detection using CPU-GPU Heterogeneous Computing

  • Yi, Zhaohua;Hu, Xiaoqi;Kim, Eung Kyeu;Kim, Kyung Ki;Jang, Byunghyun
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.5
    • /
    • pp.557-563
    • /
    • 2016
  • Most of the existing hand detection methods rely on the contour shape of hand after skin color segmentation. Such contour shape based computations, however, are not only susceptible to noise and other skin color segments but also inherently sequential and difficult to efficiently parallelize. In this paper, we implement and accelerate our in-house distance image based approach using CPU-GPU heterogeneous computing. Using emerging CPU-GPU heterogeneous computing technology, we achieved 5.0 times speed-up for $320{\times}240$ images, and 17.5 times for $640{\times}480$ images and our experiment demonstrates that our proposed distance image based hand detection is robust and fast, reaching up to 97.32% palm detection rate, 80.4% of which have more than 3 fingers detected on commodity processors.

Visualization of Internal Electric Field on Plasma (플라즈마 내부 전기장 가시화)

  • Shin, Han Sol;Yu, Tae Jun;Lee, Kun
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.1
    • /
    • pp.80-85
    • /
    • 2016
  • It costs high in both memory usage and time consuming to sample the space to compute charge density and calculate electric field on that with large size of plasma data. In real-time and interactive application, accelerating the compute time is critical problem. In this paper, we suggest new method to visualize electric field by using convolution theorem, and the parallel computing to accelerate computing time by using GPGPU. We conduct a simulation that compare running time between the methods with convolution and without convolution. We discussed the method of visualization of multivariate data in three dimensional space using colored volume rendering and surface construction.

Analytical fragility curves of a structure subject to tsunami waves using smooth particle hydrodynamics

  • Sihombing, Fritz;Torbol, Marco
    • Smart Structures and Systems
    • /
    • v.18 no.6
    • /
    • pp.1145-1167
    • /
    • 2016
  • This study presents a new method to computes analytical fragility curves of a structure subject to tsunami waves. The method uses dynamic analysis at each stage of the computation. First, the smooth particle hydrodynamics (SPH) model simulates the propagation of the tsunami waves from shallow water to their impact on the target structure. The advantage of SPH over mesh based methods is its capability to model wave surface interaction when large deformations are involved, such as the impact of water on a structure. Although SPH is computationally more expensive than mesh based method, nowadays the advent of parallel computing on general purpose graphic processing unit overcome this limitation. Then, the impact force is applied to a finite element model of the structure and its dynamic non-linear response is computed. When a data-set of tsunami waves is used analytical fragility curves can be computed. This study proves it is possible to obtain the response of a structure to a tsunami wave using state of the art dynamic models in every stage of the computation at an affordable cost.

Sub-Frame Analysis-based Object Detection for Real-Time Video Surveillance

  • Jang, Bum-Suk;Lee, Sang-Hyun
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.76-85
    • /
    • 2019
  • We introduce a vision-based object detection method for real-time video surveillance system in low-end edge computing environments. Recently, the accuracy of object detection has been improved due to the performance of approaches based on deep learning algorithm such as Region Convolutional Neural Network(R-CNN) which has two stage for inferencing. On the other hand, one stage detection algorithms such as single-shot detection (SSD) and you only look once (YOLO) have been developed at the expense of some accuracy and can be used for real-time systems. However, high-performance hardware such as General-Purpose computing on Graphics Processing Unit(GPGPU) is required to still achieve excellent object detection performance and speed. To address hardware requirement that is burdensome to low-end edge computing environments, We propose sub-frame analysis method for the object detection. In specific, We divide a whole image frame into smaller ones then inference them on Convolutional Neural Network (CNN) based image detection network, which is much faster than conventional network designed forfull frame image. We reduced its computationalrequirementsignificantly without losing throughput and object detection accuracy with the proposed method.

Implementation of Efficient Power Method on CUDA GPU (CUDA 기반 GPU에서 효율적인 Power Method의 구현)

  • Kim, Jung-Hwan;Kim, Jin-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.9-16
    • /
    • 2011
  • GPU computing is emerging in high performance application area since it can easily exploit massive parallelism in a way of cost-effective computing. The power method which finds the eigen vector of a given matrix is widely used in various applications such as PageRank for calculating importance of web pages. In this research we made the power method efficiently parallelized on GPU and also suggested how it can be improved to enhance its performance. The power method mainly consists of matrix-vector product and it can be easily parallelized. However, it should decide the convergence of the eigen vector and need scaling of the vector subsequently. Such operations incur several calls to GPU kernels and data movement between host and GPU memories. We improved the performance of the power method by means of reduced calls to GPU kernels, optimized thread allocation and enhanced decision operation for the convergence.

A Study on Improved Image Matching Method using the CUDA Computing (CUDA 연산을 이용한 개선된 영상 매칭 방법에 관한 연구)

  • Cho, Kyeongrae;Park, Byungjoon;Yoon, Taebok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2749-2756
    • /
    • 2015
  • Recently, Depending on the quality of data increases, the problem of time-consuming to process the image is raised by being required to accelerate the image processing algorithms, in a traditional CPU and CUDA(Compute Unified Device Architecture) based recognition system for computing speed and performance gains compared to OpenMP When character recognition has been learned by the system to measure the input by the character data matching is implemented in an environment that recognizes the region of the well, so that the font of the characters image learning English alphabet are each constant and standardized in size and character an image matching method for calculating the matching has also been implemented. GPGPU (General Purpose GPU) programming platform technology when using the CUDA computing techniques to recognize and use the four cores of Intel i5 2500 with OpenMP to deal quickly and efficiently an algorithm, than the performance of existing CPU does not produce the rate of four times due to the delay of the data of the partition and merge operation proposed a method of improving the rate of speed of about 3.2 times, and the parallel processing of the video card that processes a result, the sequential operation of the process compared to CPU-based who performed the performance gain is about 21 tiems improvement in was confirmed.

Molecular Docking System using Parallel GPU (병렬 GPU를 이용한 분자 도킹 시스템)

  • Park, Sung-Jun
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.12
    • /
    • pp.441-448
    • /
    • 2008
  • The molecular docking system needs a large amount of computation and requires super-computing power. Since the experiment requires a large amount of time, the experiment is conducted in the distributed environment or in the grid environment. Recently, researches on using parallel GPU of far higher performance than that of CPU in scientific computing have been very actively conducted. CUDA is an open technique by which a parallel GPU programming is made possible. This study proposes the molecular docking system using CUDA. It also proposes algorithm that parallels energy-minimizing-computation. To verify such experiments, this study conducted a comparative analysis on the time required for experimenting molecular docking in general CPU and the time and performance of the parallel GPU-based molecular docking which is proposed in this study.