2D Z-string: a new spatial knowledge representation for image databases

  • Authors:
  • Anthony J. T. Lee;Han-Pang Chiu

  • Affiliations:
  • Department of Information Management, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei 106, Taiwan, ROC;Department of Information Management, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei 106, Taiwan, ROC

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2003

Quantified Score

Hi-index 0.10

Visualization

Abstract

The knowledge structure called the 2D C+-string, proposed by Huang et al., to represent symbolic pictures allows a natural way to construct iconic indexes for images. According to the cutting mechanism of the 2D C+-string, an object may be partitioned into several subparts The number of partitioned subparts is bounded to O(n2), where n is the number of objects in the image. Hence, the string length is also bounded to O(n2). In this paper, we propose a new spatial knowledge representation called the 2D Z-string. Since there are no cuttings between objects in the 2D Z-string, the integrity of objects is preserved and the string length is bounded to O(n). Finally, some experiments are conducted to compare the performance of both approaches.