Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.