Efficient search algorithm on compact S-trees

Kuo Liang Chung*, Jung Gen Wu, Jer Kuang Lan

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

4 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
頁(從 - 到)1427-1434
頁數8
期刊Pattern Recognition Letters
18
發行號14
DOIs
出版狀態已發佈 - 1997 十二月

ASJC Scopus subject areas

  • 軟體
  • 訊號處理
  • 電腦視覺和模式識別
  • 人工智慧

指紋

深入研究「Efficient search algorithm on compact S-trees」主題。共同形成了獨特的指紋。

引用此