Javascript must be enabled for the correct page display

Analysis of the Euclidean Feature Transform algorithm

Verschoor, S. R. (2012) Analysis of the Euclidean Feature Transform algorithm. Bachelor's Thesis, Computing Science.

INF-BA-2012_S-R-Verschoor.pdf - Published Version

Download (1MB) | Preview
[img] Text
AkkoordRenardel.pdf - Other
Restricted to Registered users only

Download (27kB)


In this thesis I mechanically verify the correctness and linear time complexity of the core of the Euclidean Feature Transform (EFT) algorithm, using the proof assistant PVS. The EFT algorithm computes the EFT function for a data grid of arbitrary dimension. The EFT function calculates the set of nearest "background" data points, for each data point in the grid. The distance between data points is measured by the standard Euclidean distance.

Item Type: Thesis (Bachelor's Thesis)
Degree programme: Computing Science
Thesis type: Bachelor's Thesis
Language: English
Date Deposited: 15 Feb 2018 07:50
Last Modified: 15 Feb 2018 07:50

Actions (login required)

View Item View Item