A survey on content-based retrieval for multimedia databases <s> Spatial Relations <s> In this paper, we consider various spatial relationships that are of general interest in pictorial database systems. We present a set of rules that allow us to deduce new relationships from a given set of relationships. A deductive mechanism using these rules can be used in query processing systems that retrieve pictures by content. The given set of rules are shown to be sound, i.e. the deductions are logically correct. The rules are also shown to be complete for three dimensional systems, i.e. every relationship which is implied by a given consistent set of relationships F is deducible from F using the given rules. In addition, we show that the given set of rules is incomplete for two dimensional systems. <s> BIB001 </s> A survey on content-based retrieval for multimedia databases <s> Spatial Relations <s> The paper presents (i) two similarity based methods for retrieval of pictures using indices on spatial relationships; (ii) efficient algorithms for the deduction and reduction of spatial relationships, which are used for computation of similarity values; (iii) identification of a desirable property for spatial similarity functions and the construction of such a function. <s> BIB002 </s> A survey on content-based retrieval for multimedia databases <s> Spatial Relations <s> Proposes a linear-time algorithm, referred to as SIM/sub vs/, for processing spatial similarity queries in multimedia databases. SIM/sub vs/ computes the degree to which the spatial relationships among the objects in a database image conform to those specified in the query. SIM/sub vs/ recognizes translation, scale and rotation variants of an image, and variants generated by an arbitrary composition of translation, scale and rotation transformations. The performance of SIM/sub vs/ is compared with those of two previously-known algorithms using a testbed image collection. This comparison demonstrates that SIM/sub vs/ is not only more efficient but performs as well as or better than the other algorithms. <s> BIB003 </s> A survey on content-based retrieval for multimedia databases <s> Spatial Relations <s> Abstract Most image-retrieval systems rely on similarity measures for collecting images of similar types. Similarity measures are an integral part in the development of image management systems. In this paper, we propose frame-based similarity measures for accessing structured images, e.g. images can be understood by inferring from objects present and the relationships among them. The image content is described in the following ways: (1) adjacency blocks and/or (2) unary and binary attributes that are used to fill frame slots for representing image structures. The retrieval is based on similarity measures by comparing the contents of the query image and database image. The frame-based representation scheme is application-independent. Our similarity measures allow for images to be retrieved with different degrees of similarity and are flexible. We have developed a prototype system using the paradigms proposed. We demonstrate the usefulness of our system with some experimental results. <s> BIB004
Managing spatial relation is one of the mandatory feature in many multimedia applications. One of the straightforward way of managing the spatial relation between components of information is to represent it by rectangular coordinates. The spatial position of a component object is represented by coordinates and the relation between components are calculated mathematically as in BIB003 , BIB004 . Multimedia documents which consists of images, charts, and graphics as well as text is another example that requires the management of spatial relation for layout information  . In other applications such as GIS (geographical information system), the representation and indexing of abstract spatial relations is studied. A 2D string  ,  is an indexing technique for representing a spatial relation between the components of a picture; 2D strings represent abstract position of components, which consists of horizontal and vertical order of components. In addition, it represents several levels of a coarse-strict relation, where the strictness of direction differs from one level to another. Liu and Sun BIB004 permits coarse representation of spatial relation of objects as well as strict representation in rectangular coordinates. Meanwhile, other representations of spatial relation are also studied. In BIB001 , BIB002 , a set of binary relations such as 'left of,' 'right of,' 'in front of,' 'behind,' 'above,' 'below,' 'inside,' 'outside,' and 'overlaps' is defined as primitive relations for representing spatial relation of pictorial components. This approach as well as 2D string representation is suitable for coarse evaluation of spatial relation. The advantage of this approach is, of course, that it can ignore subtle difference of relations that need not to be evaluated. However, since the relation is distance-independent, interval-oriented contents are out of their scope.