Efficient search algorithm on compact S-trees

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

Research output: Contribution to journalArticle

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 Jan 1

Fingerprint

Binary images
Data structures
Data storage equipment

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

Cite this

Efficient search algorithm on compact S-trees. / Chung, Kuo Liang; Wu, Jung-Gen; Lan, Jer Kuang.

In: Pattern Recognition Letters, Vol. 18, No. 14, 01.01.1997, p. 1427-1434.

Research output: Contribution to journalArticle

Chung, Kuo Liang ; Wu, Jung-Gen ; Lan, Jer Kuang. / Efficient search algorithm on compact S-trees. In: Pattern Recognition Letters. 1997 ; Vol. 18, No. 14. pp. 1427-1434.
@article{86e8c14d7cb54ff5af8419715d60ea58,
title = "Efficient search algorithm on compact S-trees",
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.",
keywords = "Compact S-trees, Image algorithms, Neighbor finding, Search, Spatial data structures",
author = "Chung, {Kuo Liang} and Jung-Gen Wu and Lan, {Jer Kuang}",
year = "1997",
month = "1",
day = "1",
doi = "10.1016/S0167-8655(97)00074-3",
language = "English",
volume = "18",
pages = "1427--1434",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "14",

}

TY - JOUR

T1 - Efficient search algorithm on compact S-trees

AU - Chung, Kuo Liang

AU - Wu, Jung-Gen

AU - Lan, Jer Kuang

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

KW - Compact S-trees

KW - Image algorithms

KW - Neighbor finding

KW - Search

KW - Spatial data structures

UR - http://www.scopus.com/inward/record.url?scp=0031369383&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031369383&partnerID=8YFLogxK

U2 - 10.1016/S0167-8655(97)00074-3

DO - 10.1016/S0167-8655(97)00074-3

M3 - Article

AN - SCOPUS:0031369383

VL - 18

SP - 1427

EP - 1434

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 14

ER -