GPU Implementation of Linear Morphological Openings with Arbitrary Angle

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00080555" target="_blank" >RIV/00216224:14330/15:00080555 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s11554-012-0248-7" target="_blank" >http://dx.doi.org/10.1007/s11554-012-0248-7</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11554-012-0248-7" target="_blank" >10.1007/s11554-012-0248-7</a>

Jazyk výsledku

angličtina

Název v původním jazyce

GPU Implementation of Linear Morphological Openings with Arbitrary Angle

Popis výsledku v původním jazyce

Linear morphological openings and closings are important non-linear operators from mathematical morphology. In practical applications, many different orientations of digital line segments must typically be considered. In this paper, we (1) review efficient sequential as well as parallel algorithms for the computation of linear openings and closings, (2) compare the performance of CPU implementations of four state-of-the-art algorithms, (3) describe GPU implementation of two recent efficient algorithms allowing arbitrary orientation of the line segments, (4) propose, as the main contribution, an efficient and optimized GPU implementation of linear openings, and (5) compare the performance of all implementations on real images from various applications.From our experimental results, it turned out that the proposed GPU implementation is suitable for applications with large, industrial images, running under severe timing constraints.

Název v anglickém jazyce

GPU Implementation of Linear Morphological Openings with Arbitrary Angle

Popis výsledku anglicky

Linear morphological openings and closings are important non-linear operators from mathematical morphology. In practical applications, many different orientations of digital line segments must typically be considered. In this paper, we (1) review efficient sequential as well as parallel algorithms for the computation of linear openings and closings, (2) compare the performance of CPU implementations of four state-of-the-art algorithms, (3) describe GPU implementation of two recent efficient algorithms allowing arbitrary orientation of the line segments, (4) propose, as the main contribution, an efficient and optimized GPU implementation of linear openings, and (5) compare the performance of all implementations on real images from various applications.From our experimental results, it turned out that the proposed GPU implementation is suitable for applications with large, industrial images, running under severe timing constraints.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název periodika

Journal of Real-Time Image Processing

ISSN

1861-8200

e-ISSN

—

Svazek periodika

10

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

15

Strana od-do

27-41

Kód UT WoS článku

000350563300003

EID výsledku v databázi Scopus

—