An efficient data structure for storing similar binary images

Authors:
Yung-Kuan Chan;Chin-Chen Chang
Affiliations:
National Chung Cheng Univ., Taiwan, Chiayi;National Chung Cheng Univ., Taiwan, Chiayi
Venue:
Information organization and databases
Year:
2000

Citing 4
Cited 0

The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
An effective way to represent quadtrees

Communications of the ACM
Efficiency analysis of overlapped quadtrees

Nordic Journal of Computing
Set operations on constant bit-length linear quadtrees

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the overlapping concept, this paper defines an efficient data structure, called the common-component binary tree (CCBT), to hold the linear quadtrees corresponding to a set of similar binary images. This structure removes the redundant information among the linear quadtrees. The processing time required by the operations on the CCBT structure is only proportional to the number of involved nodes in a specified linear quadtree. Additionally, there is a high storage space reduction for storing the similar images based on the CCBT structure.