Open Collections

A non-recursive border finding algorithm for linear quadtree based images

University of British Columbia

Given a digital binary image represented in a linear quadtree, its border is to be found as another linear quadtree. A new algorithm is proposed that can generate the border in sorted order. A pattern is found for the order of the edge pixels of a node. The differences of the location codes for the edge pixels of a node with grouping factor g is stored in a lookup table. The lookup table also provides the information about which edge a given pixel is on. Through a probabilistic analysis, the new algorithm is able to avoid recursion which reduces the number of neighbour finding operations significantly. The algorithm performs better, when compared to the one by Yang & Lin, in both the run time (40% improvement) and the number of neighbour finding operations incurred (60% reduction).

Thesis/Dissertation

application/pdf

2009-03-05

For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.

http://hdl.handle.net/2429/5545

Electrical and Computer Engineering

University of British Columbia

UBCV

DSpace