Name
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. (C) 1997 Elsevier Science B.V. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0167-8655(97)00074-3 | PATTERN RECOGNITION LETTERS |
Keywords | Field | DocType |
spatial data structures,compact S-trees,image algorithms,search,neighbor finding | Search algorithm,Pattern recognition,Best bin first,Beam search,Dichotomic search,Artificial intelligence,Binary search algorithm,Ternary search tree,Uniform binary search,Mathematics,Best-first search | Journal |
Volume | Issue | ISSN |
18 | 14 | 0167-8655 |
Citations | PageRank | References |
2 | 0.38 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kuo-Liang Chung | 1 | 1166 | 121.24 |
| Jung-Gen Wu | 2 | 39 | 7.28 |
| Jer-Kuang Lan | 3 | 2 | 0.38 |