Some image operations on S-tree-related spatial data structures

摘要

The S-tree is an efficient spatial data structure for representing binary images. However, for some image operations, such as set, query, and neighbour-finding operations, a linear scan through the entire representation is required. This paper first presents a modified compact S-tree (MCST) for representing binary images. Then, some efficient set, query, and neighbour-finding operations on the MCST are presented. Some experimental results are carried out to demonstrate the computational advantage of the proposed method.