Finding Neighbors in Images Represented By Quadtree

In this paper, we propose an algorithm for neighbors finding in images represented by quadtree data structure. We first present a scheme for addressing image pixels that takes into account the order defined on a quadtree blocks. We study various properties of this method, and then we develop a formula that establishes links between quadtree blocks. Based on these results, we present an efficient algorithm that generates the list of location codes of all possible neighbors, in all directions, for a given block of the quadtree.