|Title:||2D Z-string: A new spatial knowledge representation for image databases||Authors:||Lee A.J.T.
|Keywords:||2D C-string;2D C+-string;2D Z-string;Iconic indexing;Image database||Issue Date:||2003||Source:||Pattern Recognition Letters||Journal Volume:||24||Journal Issue:||16||Start page/Pages:||3015-3026||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. ? 2003 Elsevier B.V. All rights reserved.
|Appears in Collections:||資訊管理學系|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.