15 January 1997 SS+ tree: an improved index structure for similarity searches in a high-dimensional feature space
Author Affiliations +
Abstract
In this paper, we describe the SS+-tree, a tree structure for supporting similarity searches in a high- dimensional Euclidean space. Compared to the SS-tree, the tree uses a tighter bounding sphere for each node which is an approximation to the smallest enclosing sphere and it also makes a better use of the clustering property of the available data by using a variant of the k-means clustering algorithm as the split heuristic for its nodes. A local reorganization rule is also introduced during the tree building to reduce the overlapping between the nodes' bounding spheres.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ruth Kurniawati, Ruth Kurniawati, Jesse S. Jin, Jesse S. Jin, John A. Shepard, John A. Shepard, } "SS+ tree: an improved index structure for similarity searches in a high-dimensional feature space", Proc. SPIE 3022, Storage and Retrieval for Image and Video Databases V, (15 January 1997); doi: 10.1117/12.263400; https://doi.org/10.1117/12.263400
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT


Back to Top