Parallel implementation of sequential morphological filters

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23220%2F14%3A43922025" target="_blank" >RIV/49777513:23220/14:43922025 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/article/10.1007/s11554-011-0226-5" target="_blank" >http://link.springer.com/article/10.1007/s11554-011-0226-5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11554-011-0226-5" target="_blank" >10.1007/s11554-011-0226-5</a>

Result language
angličtina
Original language name
Parallel implementation of sequential morphological filters
Original language description
Many useful morphological filters are built as more or less long concatenations of erosions and dilations: openings, closings, size distributions, sequential filters, etc. An efficient implementation of these concatenations would allow all the sequentially concatenated operators run simultaneously, on the time-delayed data. A recent algorithm (see below) for the morphological dilation/erosion allows such inter-operator parallelism. This paper introduces an additional, intra-operator level of parallelismin this dilation/erosion algorithm. Realized in a dedicated hardware, for rectangular structuring elements with programmable size, such an implementation allows obtaining previously unachievable, real-time performances for these traditionally costly operators. Low latency and memory requirements are the main benefits when the performance is not deteriorated even for long concatenations or high-resolution images.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JA - Electronics and optoelectronics
OECD FORD branch
—

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

Similar results(10)