Constant time neighbor finding in quadtrees: An experimental result

Neighbor finding is an important and a basic part of image processing in quadtrees. A constant time algorithm is proposed for neighbor finding in quadtrees in [1]. In this paper, empirical tests are given for the constant time algorithm in comparison with usual neighbor finding algorithm using quadt...

Full description

Saved in:
Bibliographic Details
Main Authors: Aizawa, K., Motomura, K., Kimura, S., Kadowaki, R., Jia Fan
Format: Conference Proceeding
Language:English
Subjects:
component
Computer science
Data structures
Image processing
linear quadtrees
Mathematics
neighbor finding
Proposals
quadtrees
Testing
Tree data structures
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Neighbor finding is an important and a basic part of image processing in quadtrees. A constant time algorithm is proposed for neighbor finding in quadtrees in [1]. In this paper, empirical tests are given for the constant time algorithm in comparison with usual neighbor finding algorithm using quadtrees [2] and another constant time algorithm using linear quadtree [3]. Experiments using synthetic images simulating worst case situations show that the proposed algorithm is in constant time complexity while others are not. Even for experiments using natural images, the proposed algorithm is more than twice as fast as algorithm using quadtrees and is slightly as fast as algorithm using linear quadtrees.
DOI:10.1109/ISCCSP.2008.4537278