On consistency checking of spatial relationships in content-based image database systems

In this paper we investigate the consistency problem for spatial relationships in content-based image database systems. We use the mathematically simple matrix representation approach to present an efficient (i.e., polynomial-time) algorithm for consistency checking of spatial relationships in an image. It is shown that, there exists an efficient algorithm to detectwhether, given a set SR of absolute spatial relationships, the maximal set of SR under R contains one pair of contradictory spatial relationships. The time required by it is at most a constant multiple of the time to compute the transitive reduction of a graph or to compute the transitive closure of a graph or to perform Boolean matrix multiplication, and thus is always bounded by time complexity O(n3) (and space complexity O(n2)), where n is the number of all involved objects. As a corollary, this detection algorithm can completely answer whether a given set of three-dimensional absolute spatial relationships is consistent.

[1]  Clement T. Yu,et al.  Reasoning About Spatial Relationships in Picture Retrieval Systems , 1994, VLDB.

[2]  Shi-Kuo Chang.  Pictorial Information Systems , 1981, Computer.

[3]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[4]  Qing-Long Zhang,et al.  Finding minimal and maximal sets of spatial relationships in pictorial retrieval systems , 2005, Commun. Inf. Syst..

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  Qing-Long Zhang,et al.  An Experimental Result in Image Indexing Using GEP-2D Strings , 1998, Image Databases and Multi-Media Search.

[7]  Shi-Kuo Chang,et al.  Iconic Indexing by 2-D Strings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Qing-Long Zhang,et al.  The consistency problem of content-based pictorial description in pictorial database systems , 2001, Commun. Inf. Syst..

[9]  Vijay V. Raghavan,et al.  Design and evaluation of algorithms for image retrieval by spatial similarity , 1995, TOIS.

[10]  Allen Van Gelder,et al.  Computer Algorithms: Introduction to Design and Analysis , 1978 .

[11]  Geoffrey Z. Liu.  Symbolic projection for image information retrieval and spatial reasoning , 1997 .

[12]  Qing-Long Zhang,et al.  A Unified Approach to Iconic Indexing, Retrieval, and Maintenance of Spatial Relationships in Image Databases , 1996, J. Vis. Commun. Image Represent..

[13]  Suh-Yin Lee,et al.  Retrieval of similar pictures on pictorial databases , 1991, Pattern Recognit..

[14]  G. Golub,et al.  Experimental Results : , 2013 .

[15]  Essam A. El-Kwae,et al.  A robust framework for content-based retrieval by spatial similarity in image databases , 1999, TOIS.

[16]  Venkat N. Gudivada.  Spatial similarity measures for multimedia applications , 1995, Electronic Imaging.

[17]  Peter Stanchev,et al.  Content-Based Image Retrieval Systems , 2001 .

[18]  Qinglong. Zhang.  A unified framework for iconic indexing of spatial relationships in image database. , 1996 .

[19]  Dragutin Petkovic,et al.  Query by Image and Video Content: The QBIC System , 1995, Computer.

[20]  Peiya Liu,et al.  Content-based indexing technique using relative geometry features , 1992, Electronic Imaging.

[21]  Shi-Kuo Chang,et al.  Image Information Systems: Where Do We Go From Here? , 1992, IEEE Trans. Knowl. Data Eng..

[22]  Alex Pentland,et al.  Photobook: Content-based manipulation of image databases , 1996, International Journal of Computer Vision.

[23]  W. Ames.  Computer Algorithms — Introduction to design and analysis (second edition) : S. Baase, Addison Wesley, Reading, Mass., 1988. 415 pp., US $40.95. ISBN 0-201-06035-3 , 1990 .