Open Access
Translator Disclaimer
2004 On Completeness of Reasoning about Planar Spatial Relationships in Pictorial Retrieval Systems
Stephen S.-T. Yau, Qing-Long Zhang
Commun. Inf. Syst. 4(3): 211-234 (2004).

Abstract

In this paper we consider the completeness problem of reasoning about planar spatial relationships in pictorial retrieval systems. We define a large class of two-dimensional scenes, the extended pseudo-symbolic pictures. The existing rule system R is proved to be complete for (extended) pseudo-symbolic pictures. We also introduce a new iconic indexing, the (extended) pseudo- 2D string representation, for them. The (extended) pseudo-2D string has the good properties of the 2D string. It is unambiguous, like the augmented 2D string, and has a compact form suitable for image retrieval. We then present efficient algorithms to determine whether a given planar picture is (extended) pseudo-symbolic or not, and if it is, these algorithms also return its (extended) pseudo-2D string representation. Picture retrieval by (extended) pseudo-2D strings is also discussed.

Citation

Download Citation

Stephen S.-T. Yau. Qing-Long Zhang. "On Completeness of Reasoning about Planar Spatial Relationships in Pictorial Retrieval Systems." Commun. Inf. Syst. 4 (3) 211 - 234, 2004.

Information

Published: 2004
First available in Project Euclid: 30 September 2005

zbMATH: 1101.68543
MathSciNet: MR2200876

Rights: Copyright © 2004 International Press of Boston

JOURNAL ARTICLE
24 PAGES


SHARE
Vol.4 • No. 3 • 2004
Back to Top