All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

GPU Accelerated One-pass Algorithm for Computing Minimal Rectangles of Connected Components

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00177654" target="_blank" >RIV/68407700:21230/11:00177654 - isvavai.cz</a>

  • Result on the web

    <a href="http://ieeexplore.ieee.org" target="_blank" >http://ieeexplore.ieee.org</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/WACV.2011.5711542" target="_blank" >10.1109/WACV.2011.5711542</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    GPU Accelerated One-pass Algorithm for Computing Minimal Rectangles of Connected Components

  • Original language description

    The connected component labeling is an essential task for detecting moving objects and tracking them in video surveillance application. Since tracking algorithms are designed for real-time applications, efficiencies of the underlying algorithms become critical. In this paper we present a new one-pass algorithm for computing minimal binding rectangles of all the connected components of background foreground segmented video frames (binary data) using GPU accelerator. The given image frame is scanned oncein raster scan mode and the background foreground transition information is stored in a directed graph where each transition is represented by a node. Further we use GPU acceleration to speed up feature extraction from the image to a directed graph fromwhich minimal bounding rectangles will be computed subsequently. Also we compare the performance of GPU acceleration (Tesla C2050) with the performance of multi-core (up 24 cores) general purpose CPU implementation of the algorithm.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JA - Electronics and optoelectronics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2011

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Applications of Computer Vision (WACV), 2011 IEEE Workshop

  • ISBN

    978-1-4244-9496-5

  • ISSN

    1550-5790

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    479-484

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Los Alamitos

  • Event location

    Kona, Hawaii

  • Event date

    Jan 5, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article