Retrieval of similar pictures on pictorial databases

doi:10.1016/0031-3203(91)90034-3

Pattern Recognition

Volume 24, Issue 7, 1991, Pages 675-680

https://doi.org/10.1016/0031-3203(91)90034-3 Get rights and content

Abstract

In this paper, we suggest a method of retrieving iconic pictures in a pictorial database based upon the spatial relationship among the objects in the picture. This special kind of database query problem is generally known as a spatial match retrieval problem. We transform each picture or query into a set of ordered triples (O_i, O_j, r_ij)s, where O_i and O_j are two symbolic objects and r_ij is the spatial relationship between O_i and O_j. Then we construct a hashing table for all (O_i, O_j, r_ij)s of all the pictures in the pictorial database. By searching the preconstructed hashing table for all of the (O_i, O_j, r_ij)s associated with a query, the pictures satisfying that query can be easily determined.

References (5)

S.Y. Lee et al.
Similarity retrieval of iconic image databases
Pattern Recognition
(1989)
S.K. Chang et al.
An intelligent image database system
IEEE Trans. Software Engng
(1988)

There are more references available in the full text version of this article.

Cited by (90)

A new relevance feedback technique for iconic image retrieval based on spatial relationships
2009, Journal of Systems and Software
Due to the popularity of Internet and the growing demand of image access, the volume of image databases is exploding. Hence, we need a more efficient and effective image searching technology. Relevance feedback technique has been popularly used with content-based image retrieval (CBIR) to improve the precision performance, however, it has never been used with the retrieval systems based on spatial relationships. Hence, we propose a new relevance feedback framework to deal with spatial relationships represented by a specific data structure, called the 2D B_e-string. The notions of relevance estimation and query reformulation are embodied in our method to exploit the relevance knowledge. The irrelevance information is collected in an irrelevant set to rule out undesired pictures and to expedite the convergence speed of relevance feedback. Our system not only handles picture-based relevance feedback, but also deals with region-based feedback mechanism, such that the efficacy and effectiveness of our retrieval system are both satisfactory.
State-of-the-art on spatio-temporal information-based video retrieval
2009, Pattern Recognition
Citation Excerpt :
Apart from the 2D string and its variants, some other spatial models are also used in computer vision. These models have gained less popularity but none the less offer a novel and fresh perspective for solving the problem of image and video retrieval, such as 2D projection interval relationships (2D-PIR) [56], the nine direction low triangular (9DLT) matrix [27], qualitative pairwise salient region patch [57], CRTs [26], attributed relational graphs (ARGs) [58–61], θ–R representations (also called spatial orientation graph) [30,62], and mixed directional relations-based quadtree representation [63]. Some studies compare spatial relationships in a weak manner based on spatial partition of the image without image segmentation, such as weighted five fuzzy regions [23], 2D tagging 5×5 grid scheme in CAETI Internet multimedia library [64] and the entities and attributes model [65,66].
Video retrieval is increasingly based on image content. A number of studies on video retrieval have used low-level pixel content related to statistical moments, shape, colour and texture. However, it is well recognised that such information is not enough for uniquely discriminating across different multimedia content. The use of semantic information, especially which derived from spatio-temporal analysis is of great value in multimedia annotation, archiving and retrieval. In this review paper, we detail how the use of spatiotemporal semantic knowledge is changing the way in which modern research the conducted. In this paper we review a number of studies and concepts related to such analysis, and draw important conclusions on where future research is headed.
Archival image indexing with connectivity features using randomized masks
2008, Applied Soft Computing Journal
Citation Excerpt :
A data structure called discrimination tree, consisting of a hierarchical arrangement of kd-trees [2] is also proposed for efficient indexing of images. There are two principal approaches to image indexing: (i) those based on the features extracted from raw image data [9,11,13,14,23,26,30], and (ii) those based on the coefficients in the compressed or transformed domain [15,17,20,33,34]. A majority of the techniques proposed in the image indexing literature extract robust features, meant for high similarity matches.
Connectivity properties capture a natural spatial feature of a binary image. Albeit they are easy to compute, more often than not, they alone fail to provide a good characterization of the image because of the fact that several different images may have the same connectivity features. Typically, other types of parameters, e.g., moments, are used to augment the connectivity feature for efficient indexing and retrieval purposes. In this work, an alternative approach is proposed. Instead of considering other diverse features, which are computationally intensive, only the connectivity features of the image are used iteratively using a novel concept of spatial masking. For this purpose, a greedy algorithm for constructing a spatial feature vector of variable length for a binary image, is proposed. The algorithm is based on XOR-ing the image bit-plane with a few pseudo-random synthetic masks, and its novelty lies in computing the feature vector iteratively, depending on the size and diversity of the image database. The classical Euler number and the two primary connectivity features from which it is derived, namely, the number of connected components and the number of holes, are used to finally generate a unique feature vector for each binary image in the database using a fuzzy membership function customized for the given database. The method is particularly suitable for large-sized image archives of a digital library, where each image contains one or more objects. It is found to converge within only three iterations for a postal stamp database consisting of 2598 images, and also for a logo database of 1034 images. A data structure called discrimination tree has been introduced for supporting efficient storage and indexing of the images using the above feature vector.
Graph-based representation for similarity retrieval of symbolic images
2008, Data and Knowledge Engineering
Citation Excerpt :
Directional similarity [5], a more flexible matching, has been proved to be NP-complete [26]. In addition to these object-matching methods, some algorithms hash or index the extracted features of all database images as a hash table or a tree structure [3,12]. Each feature has a linked list of image identifiers that contain this feature.
Image retrieval from an image database by the image objects and their spatial relationships has emerged as an important research subject in these decades. To retrieve images similar to a given query image, retrieval methods must assess the similarity degree between a database image and the query image by the extracted features with acceptable efficiency and effectiveness. This paper proposes a graph-based model SRG (spatial relation graph) to represent the semantic information of the contained objects and their spatial relationships in an image with no file annotation. In an SRG graph, the image objects are symbolized by the predefined class names as vertices and the spatial relations between object pairs are represented as arcs. The proposed model assesses the similarity degree between two images by calculating the maximum common subgraph of two corresponding SRG’s through intersection, which has quadratic time complexity owing to the characteristics of SRG. Its efficiency remains quadratic regardless of the duplication rate of the object symbols. The extended model SRG_T is also proposed, with the same time complexity, for the applications that need to consider the topological relations among objects. A synthetic symbolic image database and an existing image dataset are used in the conducted experiments to verify the performance of the proposed models. The experimental results show that the proposed models have compatible retrieval quality with remarkable efficiency improvements compared with three well-known methods LCS_Clique, SIM_R, and 2D Be-string, where LCS_Clique utilizes the number of objects in the maximum common subimage as its similarity function, SIM_R uses accumulation-based similarity function of similar object pairs, and 2D Be-string calculates the similarity of 2D patterns by the linear combination of two 1D similarities.
Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree
2008, Pattern Recognition
In this paper, the problem of indexing symbolic images based on spatial similarity is addressed. A model based on modified triangular spatial relationship (TSR) and B-tree is proposed. The model preserves TSR among the components in a symbolic image by the use of quadruples. A Symbolic Image Database (SID) is created through the construction of B-tree, an efficient multilevel indexing structure. A methodology to retrieve similar symbolic images for a given query image is also presented. The presented retrieval model has logarithmic search time complexity. The study made in this work reveals that the model bears various advantages when compared to other existing models and it could be extended towards dynamic databases. An extensive experimentation is conducted on various symbolic images and also on the ORL and YALE face databases. The results of the experimentation conducted have revealed that the proposed scheme outperforms the existing algorithms and is of practical relevance.
Retrieval of images by spatial and object similarities
2008, Information Processing and Management
In the last several decades it has become an important basis to retrieve images from image databases (IDBs) by the semantic information held in the image objects and the spatial patterns formed by these objects. In this paper, we propose a new method for similarity retrieval of symbolic images by both the attributes and the spatial relationships of the contained objects. The proposed method CPM (common pattern method) retains the common spatial patterns of two images in new data structures CP_DAG (common pattern directed acyclic graph) and performs the similarity calculation efficiently in practice. The conducted experiments use both a synthetic dataset and an existing image database. The experimental results show that CPM outperforms LCS_Clique, SIM_R, SIM_DTC, and 2D Be-string for average efficiency and effectiveness. CPM also has steady efficiency while the number of image objects and the object symbol duplication rates increase.

View all citing articles on Scopus

View full text

Retrieval of similar pictures on pictorial databases

Abstract

Pattern Recognition

An intelligent image database system

IEEE Trans. Software Engng