Efficient search algorithm on compact S-trees

Kuo Liang Chung, Jung Gen Wu, Jer Kuang Lan

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

Based on the S-tree, the modified S-tree is a newly proposed spatial data structure for representing digital binary images, which can support fast search and query in pictorial database. In this paper, we first present a new spatial data structure called the compact S-tree to represent binary images, which uses less memory when compared to the modified S-tree. We then present a fast search algorithm on the compact S-tree. Further, the application to neighbor finding is also investigated. Experimental results show that the proposed search algorithm is faster than the previous known results on the S-tree and the modified S-tree.

Original languageEnglish
Pages (from-to)1427-1434
Number of pages8
JournalPattern Recognition Letters
Volume18
Issue number14
DOIs
Publication statusPublished - 1997 Dec

Keywords

  • Compact S-trees
  • Image algorithms
  • Neighbor finding
  • Search
  • Spatial data structures

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Efficient search algorithm on compact S-trees'. Together they form a unique fingerprint.

Cite this