Real-time implementation of morphological filters with polygonal structuring elements

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23220%2F15%3A43925094" target="_blank" >RIV/49777513:23220/15:43925094 - isvavai.cz</a>

Výsledek na webu

<a href="http://link.springer.com/content/pdf/10.1007%2Fs11554-012-0271-8.pdf" target="_blank" >http://link.springer.com/content/pdf/10.1007%2Fs11554-012-0271-8.pdf</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Real-time implementation of morphological filters with polygonal structuring elements

Popis výsledku v původním jazyce

In mathematical morphology, circular structuring elements (SE) are used whenever one needs angular isotropy. The circles-difficult to implement efficiently-are often approximated by convex, symmetric polygons that decompose under the Minkowski addition to 1-D inclined segments. In this paper, we show how to perform this decomposition efficiently, in stream with almost optimal latency to compute gray-scale erosion and dilation by flat regular polygons. We further increase its performance by introducing aspatial parallelism while maintaining sequential access to data. We implement these principles in a dedicated hardware block. Several of these blocks can be concatenated to efficiently compute sequential filters, or granulometries in one scan. With a configurable image size and programmable SE size, this architecture is usable in high-end, real-time industrial applications. We show on an example that it conforms to real-time requirements of the 100Hz 1080p FullHD TV standard, even for s

Název v anglickém jazyce

Real-time implementation of morphological filters with polygonal structuring elements

Popis výsledku anglicky

In mathematical morphology, circular structuring elements (SE) are used whenever one needs angular isotropy. The circles-difficult to implement efficiently-are often approximated by convex, symmetric polygons that decompose under the Minkowski addition to 1-D inclined segments. In this paper, we show how to perform this decomposition efficiently, in stream with almost optimal latency to compute gray-scale erosion and dilation by flat regular polygons. We further increase its performance by introducing aspatial parallelism while maintaining sequential access to data. We implement these principles in a dedicated hardware block. Several of these blocks can be concatenated to efficiently compute sequential filters, or granulometries in one scan. With a configurable image size and programmable SE size, this architecture is usable in high-end, real-time industrial applications. We show on an example that it conforms to real-time requirements of the 100Hz 1080p FullHD TV standard, even for s

Druh

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

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

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

13

Strana od-do

175-187

Kód UT WoS článku

000350563300014

EID výsledku v databázi Scopus

—