A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures ?
In this paper, we propose an efficient iconic indexing strategy called unique-ID-based matrix (UID matrix) for symbolic pictures, in which each spatial relationship between any two objects is assigned with a unique identifier (ID) and is recorded in a matrix. Basically, the proposed strategy can represent those complex relationships that are represented in 2D C-strings in a matrix, and an efficient range checking operation can be used to support pictorial query, spatial reasoning and similarity retrieval; therefore, they are efficient enough as compared to the previous approaches. From our simulation, we show that the proposed UID matrix strategy requires shorter time to convert the input data into the corresponding representation than the 2D C-string strategy, so is the case with query processing. Moreover, our proposed UID matrix strategy may require lesser storage cost than the 2D C-string strategy in some cases.
2d c-string pictorial query spatial reasoning similarity retrieval 2d string image databases symbolic databases