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

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

Show other versions (1)

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 t...

Full description

Bibliographic Details
Main Author: Tang, Shao Kang
Language:English
Published: 2009
Online Access:http://hdl.handle.net/2429/5545
id ndltd-LACETR-oai-collectionscanada.gc.ca-BVAU.2429-5545
record_format oai_dc
spelling ndltd-LACETR-oai-collectionscanada.gc.ca-BVAU.2429-55452014-03-14T15:40:36Z A non-recursive border finding algorithm for linear quadtree based images Tang, Shao Kang 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). 2009-03-05T19:57:04Z 2009-03-05T19:57:04Z 1994 2009-03-05T19:57:04Z 1994-11 Electronic Thesis or Dissertation http://hdl.handle.net/2429/5545 eng UBC Retrospective Theses Digitization Project [http://www.library.ubc.ca/archives/retro_theses/]
collection NDLTD
language English
sources NDLTD
description 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).
author Tang, Shao Kang
spellingShingle Tang, Shao Kang
A non-recursive border finding algorithm for linear quadtree based images
author_facet Tang, Shao Kang
author_sort Tang, Shao Kang
title A non-recursive border finding algorithm for linear quadtree based images
title_short A non-recursive border finding algorithm for linear quadtree based images
title_full A non-recursive border finding algorithm for linear quadtree based images
title_fullStr A non-recursive border finding algorithm for linear quadtree based images
title_full_unstemmed A non-recursive border finding algorithm for linear quadtree based images
title_sort non-recursive border finding algorithm for linear quadtree based images
publishDate 2009
url http://hdl.handle.net/2429/5545
work_keys_str_mv AT tangshaokang anonrecursiveborderfindingalgorithmforlinearquadtreebasedimages
AT tangshaokang nonrecursiveborderfindingalgorithmforlinearquadtreebasedimages
_version_ 1716650660049453056

Similar Items