Pohitritev transformacije domnevnih razdalj

Žlaus, Danijel

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	Pohitritev transformacije domnevnih razdalj
Authors:	ID Žlaus, Danijel (Author) ID Mongus, Domen (Mentor) More about this mentor...
Files:	MAG_Zlaus_Danijel_2016.pdf (6,77 MB) MD5: 78A2715B74A1A86C6C8CF6A6E44D16A4
Language:	Slovenian
Work type:	Master's thesis/paper
Organization:	FERI - Faculty of Electrical Engineering and Computer Science
Abstract:	V magistrskem delu opisujemo pohitritev transformacije domnevnih razdalj, ki je izpeljanka tradicionalnih algoritmov transformacij razdalj. Transformacije razdalj običajno delujejo nad dvodimenzionalnimi binarnimi slikami, kjer vsakemu elementu ospredja določijo oddaljenost do najbližjega elementa ozadja. Kadar slika ni binarna, je nad njo potrebno izvesti dodano predprocesiranje, ki vključuje korak binarizacije. Nasprotno pa lahko transformacijo domnevnih razdalj uporabimo neposredno nad sivinskimi, barvnimi in multispektralnimi slikami in se tako izognemo pogoste neželenemu predprocesiranju. Slabost tega pristopa pa je časovna zahtevnost, ki je v naivni implementaciji kar O(N^2.5). V magistrskem delu predstavimo pohitren algoritem transformacije domnevnih razdalj ter teoretično analizo njegove časovne zahtevnosti. Nad implementiranim algoritmom izvedemo tudi meritve, s čimer potrdimo teoretične časovne zahtevnosti pohitrenega pristopa, ki je enaka O(N^1.5) v pričakovanem ter O(N^2) v najslabšem primeru.
Keywords:	matematična morfologija, transformacija domnevnih razdalj, transformacija razdalj, časovna zahtevnost, optimizacijske metode
Place of publishing:	[Maribor
Publisher:	D. Žlaus
Year of publishing:	2016
PID:	20.500.12556/DKUM-62069
UDC:	004.93'11(043.2)
COBISS.SI-ID:	19836182
NUK URN:	URN:SI:UM:DK:FIOSK6PM
Publication date in DKUM:	06.09.2016
Views:	1849
Downloads:	191
Metadata:
Categories:	KTFMB - FERI
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

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

Secondary language

Language:	English
Title:	Optimization of Quasi Distance Transform
Abstract:	This thesis presents an optimisation of Quasi Distance Transform, derived from traditional distance transformation algorithms. Distance transform is typically applied on two-dimensional binary images, where each foreground element is assigned the distance to its closest background element. When the image is not binary, additional preprocessing with binarisation is required. On the other hand, Quasi Distance Transform can be applied directly to grayscale, colour or multi-spectral images, thus avoiding often unwanted preprocessing. However, the weakness of the method is its time complexity, which is in naive implementation equal to O(N^2.5). In this thesis, we present a new optimised algorithm and the theoretical analysis of its time complexity. We confirm the theoretical time complexity for quasi distance transformation together with measurements, thus proving they are N^(1.5) for the expected and O(N^2) for the worst case.
Keywords:	mathematical morphology, quasi distance transform, distance transform, time complexity, optimisation methods

Comments

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back