Archival and retrieval of symbolic images: an invariant scheme based on triangular spatial relationship

Authors:
D. S. Guru;P. Punitha;P. Nagabhushan
Affiliations:
Department of studies in Computer Science, University of Mysore, Manasagangothri, Mysore 570006, Karnataka, India;Department of studies in Computer Science, University of Mysore, Manasagangothri, Mysore 570006, Karnataka, India;Department of studies in Computer Science, University of Mysore, Manasagangothri, Mysore 570006, Karnataka, India
Venue:
Pattern Recognition Letters
Year:
2003

Citing 20
Cited 7

Data base management systems (2nd ed.)

Data base management systems (2nd ed.)
Iconic indexing by 2-D strings

IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity retrieval of iconic image database

Pattern Recognition
2D C-string: a new spatial knowledge representation for image database systems

Pattern Recognition
Retrieval of similar pictures on pictorial databases

Pattern Recognition
Spatial reasoning and similarity retrieval of images using 2D C-string knowledge representation

Pattern Recognition
Retrieving the most similar symbolic pictures from pictorial databases

Information Processing and Management: an International Journal
Application of geometric hashing to iconic database retrieval

Pattern Recognition Letters
An exact match retrieval scheme based upon principal component analysis

Pattern Recognition Letters
A spatial data representation: an adaptive 2D-H string

Pattern Recognition Letters
Retrieving similar pictures from iconic databases using G-tree

Pattern Recognition Letters
Retrieving similar pictures from a pictorial database by an improved hashing table

Pattern Recognition Letters
A note on adaptive 2D-H strings

Pattern Recognition Letters
The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
Image retrieval based on object's orientation spatial relationship

Pattern Recognition Letters - Special issue on image/video indexing and retrieval
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Intelligent Image Database System

IEEE Transactions on Software Engineering
Extended Symbolic Projections as a Knowledge Structure for Spatial Reasoning

Proceedings of the 4th International Conference on Pattern Recognition
A letter oriented minimal perfect hashing function

ACM SIGPLAN Notices

An invariant scheme for exact match retrieval of symbolic images: Triangular spatial relationship based approach

Pattern Recognition Letters
An Effective and Efficient Exact Match Retrieval Scheme for Symbolic Image Database Systems Based on Spatial Reasoning: A Logarithmic Search Time Approach

IEEE Transactions on Knowledge and Data Engineering
Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree

Pattern Recognition
Retrieval of images by spatial and object similarities

Information Processing and Management: an International Journal
Graph-based representation for similarity retrieval of symbolic images

Data & Knowledge Engineering
Spatial topology of equitemporal points on signatures for retrieval

PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Indexing and retrieval of document images by spatial reasoning

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.10

Visualization

Abstract

In this paper, a novel scheme for representing symbolic images in a symbolic image database (SID) is proposed. The proposed scheme is based on triangular spatial relationship (TSR) [Pattern Recognition Lett. 22 (2001) 999]. The scheme preserves TSR among the components in a symbolic image by the use of quadruples. A SID is created through the construction of B-tree, an efficient multilevel indexing structure. A methodology to retrieve similar 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 could be extended towards dynamic databases.