Abstract
In multimedia database applications, it is necessary to retrieve multimedia documents to satisfy a user’s query based on image content. For this, we represent an image as a set of icon objects, and then do indexing by regarding the icon object as a representative of a given document. When users request content-based image retrieval, we convert a query image into a set of icon objects and retrieve relevant images in the multimedia database. In this paper, we propose new spatial-match iconic image representation schemes supporting ranking, called SRC scheme using MBC(Minimum Bounding Circle) and SRR scheme using MBR(Minimum Bounding Rectangle). Because our SRC and SRR schemes combine directional operators with positional operators, they can represent spatial relationships between icon objects precisely and can provide ranking for the retrieved images.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
V.N. Gudivada and V.V. Raghavan, “Design, and Evaluation of Algorithms for Image Retrieval by Spatial Similarity,” ACM Transactions on Information Systems, Vol. 13, No. 2, pp. 115–144, 1995.
S. K. Chang, Q.Y. Shi, and C.W. Yan, “Iconic Indexing by 2D strings”, IEEE Transaction on Pattern Recognition and Machine Intelligence, 9(3): pp. 413–428, 1987.
S.Y. Lee and F.J. Hsu, “Spatial Reasoning and Similarity Retrieval of Images using 2D C-string Knowledge Representation,” Pattern Recognition, Vol. 25, No. 3, pp. 305–318, 1992.
C.C. Chang and J.H. Jiang, “A Fast Spatial Match Retrieval Using a Superimposed Coding Techniques,” International Symposium on ADTI(Nara, Japan), pp. 71–78, 1994.
J.W. Chang, Y.J. Kim and K.J. Chang, “A Spatial Match Representation Scheme for Indexing and Querying in Iconic Image Databases,” ACM International Conference on Information and Knowledge Management, pp. 169–176, Nov. 1997.
M. Nabil, A.H. Ngu, and J. Shepherd, “Picture Similarity Retrieval Using the 2D Projection Interval Representation,” IEEE Transaction on Knowledge and Data Engineering, Vol. 8, No. 4, 1996.
T. Tagashira and T. Amagasa and M. Aritsugi and Y. Kanamori, “Interval-Based Representation of Spatio-Temporal Concepts,” 9th International Conference on Advanced Information Systems Engineering (CaiSE*97) Springer LNCS 1250, pp. 231–244, 1997.
J. Halpern and Y. Shoham, “A Prepositional Model Logic of Time Intervals”, Journal of Association Computing Machinery, Vol. 33, pp. 935–962, Oct. 1991.
M. Safar and C. Shahabi, “2D Topological and Directional Relations in the World of Minimum Bounding Circles,” International Database Engineering and Applications Symposium, pp. 239–247, 1999.
D. Papadias, Y. Theodoridis, T. Sellis and M.J. Egnhofer, “Topological Relations in the World of Minimum Bounding Rectangles: a Study with R-trees,” ACM SIGMOD on Management of Data, pp. 92–103, 1995.
C. Faloutsos and S. Christodoulakis, “Signature Files: An Access Methods for Documents and its Analytical Performance Evaluation,“ ACM Transaction on Database Systems, 2(4) pp. 267–288, 1984.
G. Salton, and M. McGill, “An Introduction to Modern Information Retrieval,” McGraw-Hill, 1983.
R.R. Korfhage, “Information Storage and Retrieval,” Wiley Computer Publishing, pp. 199–202, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, JW., Kim, YJ. (2001). Spatial-Match Iconic Image Retrieval with Ranking in Multimedia Databases. In: Wang, X.S., Yu, G., Lu, H. (eds) Advances in Web-Age Information Management. WAIM 2001. Lecture Notes in Computer Science, vol 2118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47714-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-47714-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42298-3
Online ISBN: 978-3-540-47714-3
eBook Packages: Springer Book Archive