계층적 이분트리를 활용한 이진 이미지 탐색 기법 = Binary Image Search using Hierarchical Bintree

다국어 초록 (Multilingual Abstract)

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

참고문헌 (Reference)

1 김성완, "계층형 집약 이진 트리의 검색 성능 개선" 한국창의정보문화학회 5 (5): 345-353, 2019

2 Masami Shishibori, "Two improved access methods on compact binary (CB) trees" 36 (36): 379-399, 2000

3 Jonge, W., "Two access methods using compact binary trees" 13 (13): 799-810, 1987

4 Hanan Samet, "The Design and Analysis of Spatial Data Structures" Addison-Wesley Publishing 1990

5 Jonge, W., "S+-Tree:An Efficient Structure for he Representation of Large Pictures" 59 (59): 265-280, 1994

6 Y. Manolopoulos, "Advanced Signature Indexing for Multimedia and Web Applications" Springer Science+Business Media 2003