| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Algoritem za učinkovit izračun verige elementarnih morfoloških filtrov na centralni procesni enoti : doktorska disertacija
Authors:Žlaus, Danijel (Author)
Mongus, Domen (Mentor) More about this mentor... New window
Files:.pdf DOK_Zlaus_Danijel_2021.pdf (6,71 MB)
MD5: B680368471BAE7CD0A570CF7716F6887
 
.zip DOK_Zlaus_Danijel_2021.zip (1,70 MB)
MD5: 3C80D1FC2AA2E5C39E0B62FBB899F9A2
 
Language:Slovenian
Work type:Doctoral dissertation (mb31)
Typology:2.08 - Doctoral Dissertation
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V doktorski disertaciji predstavimo nov algoritem za učinkovit izračun verige elementarnih filtrov na centralni procesni enoti. Verige filtrov so temeljni del tako imenovanih geodetskih operatorjev, ki uporabljajo postopek morfološke rekonstrukcije. Ta iterativno filtrira in omejuje vrednosti filtrirane slike. Dobljeno učinkovitost razvitega algoritma delimo na dva dela. Prvi del se zanaša na učinkovit enonitni izračun elementarnih morfoloških filtrov, kar dosežemo s procesiranjem na mestu, dekompozicijo strukturnega elementa in uporabo vektorskih registrov za pohitritev izračuna. Drugi del pa razvite filtre uporabi za učinkovit vzporeden in hkraten izračun več filtrov v podani verigi. Vzporedni izračun je osnovan na emulaciji podatkovno pretokovnega procesiranja, kjer z analizo topologije predpomnilnika CPE in primernim pripenjanjem niti zagotovimo, da prenos podatkov med jedri CPE poteka preko predpomnilnika. Pokazali smo, da dosežemo največjo prepustnost procesiranja ob uporabi več neodvisnih vzporednih procesnih cevovodov, medtem ko najhitrejše odzivne čase dosežemo z uporabo enega cevovoda. Primerjava z algoritmi stanja tehnike in odprtokodnimi knjižnicami je pokazala, da je predlagani algoritem vedno dosegel boljše računske čase pri obdelavi verig filtrov. V primerjavi z iterativnim izračunom verige filtrov na splošnonamenskih grafičnih procesnih enotah se je predlagani algoritem prav tako izkazal za bistveno hitrejšega, tudi ko smo uporabili CPE nižjega cenovnega ranga.
Keywords:morfološki filtri, geodetski operatorji, veriga filtrov, obdelava slik, vzporedno procesiranje, podatkovno pretočna obdelava, vektorsko procesiranje, SIMD, centralna procesna enota
Year of publishing:2021
Place of performance:Maribor
Publisher:[D. Žlaus]
Number of pages:VI, 123 str.
Source:Maribor
UDC:004.925.8:519.254(043.3)
COBISS_ID:59591683 New window
NUK URN:URN:SI:UM:DK:V4UXNCNU
Views:65
Downloads:24
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FERI
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:02.09.2020

Secondary language

Language:English
Title:Algorithm for efficient computation of elementary morphological filter chain on central processing unit
Abstract:In this doctoral dissertation we introduce a new algorithm for efficient calculation of filter chains on central processing unit. Filter chains are a fundamental part of the so-called geodesic operators, which use morphological reconstruction. The latter iteratively filters and bounds the values of the input image. The efficiency of the developed algorithm is compared from two points of view. The first relies on the efficient single-threaded calculation of elementary morphological filters, which is achieved by in-place processing, decomposition of the structuring element and the use of vector registers to speed up calculations. The second part uses the developed filters to efficiently process multiple filters from a given filter chain in parallel. The parallel calculation is based on emulating dataflow processing, where analysis of CPU's cache topology and appropriate thread pinning ensures optimal data transfers between threads via the hierarchical cache. We have shown that the highest processing throughput is achieved using several independent processing pipelines in parallel, while the lowest processing latency is obtained with a single pipeline. A comparison with state-of-the-art algorithms and open source libraries showed that the proposed algorithm always achieves better computational times when processing filter chains. A comparison of computation times of filter chains using general-purpose graphics processing units showed that the proposed algorithm also significantly outperforms them, even when using a lower priced CPU.
Keywords:morphological filters, geodesic operators, filter chain, image processing, parallel processing, dataflow processing, vector processing, SIMD, central processing unit


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica