Abstract
We present a method for the multiple two-dimensional pattern matching problem and its application in image database systems. In this problem, we are given a set S = {T 1, T 2, ⋯, T N } of two-dimensional matrices and another two-dimensional matrix P, called the pattern, and we want to find all occurrences of the pattern P in the set S. The main idea behind our method is to represent two-dimensional matrices with one-dimensional strings (called fingerprint strings or simply fingerprints) thus reducing the two-dimensional matrix matching problem into a one-dimensional string matching problem. We use a data structure, called the generalized suffix array, as our index structure to organize the fingerprints of the set S. The construction of the index (including converting the matrices in the set S into fingerprint strings) takes O(M log n) time and the index occupies O(M) space ,where M denotes the total number of elements in all matrices in S and n the width of the widest matrix in S. Once the index is available, a query for the occurrences of an m × m pattern in the set S can be answered in O(m 2 + log M) time. The reduction of the two-dimensional matrix problem into a one-dimensional string problem, however, can introduce errors, called false matches. A false match occurs if the algorithm claims a “match” between the pattern P and some submatrix of some matrix in the set S while they are actually not equal. But as will be seen, the probability that a false match can occur is negligible. For instance, suppose our patterns are 512 × 512 images. Then the probability that a “match” that is claimed by our algorithm is a false one is less than 2.39 × 10− 7.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Giancarlo, R.: The Suffix of a Square Matrix, with Applications. In: Proc. Fourth Symposium on Discrete Algorithms, pp. 402–411. ACM-SIAM, New York (1993)
Giancarlo, R., Grossi, R.: Suffix Tree Data Structures for Matrices. In: Apostolico, A., Galil, Z. (eds.) Pattern Matching Algorithms, pp. 293–340. Oxford University Press, Oxford (1997)
Fredriksson, K., Navarro, G., Ukkonen, E.: Optimal exact and fast approximate two dimensional pattern matching allowing rotations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 235–248. Springer, Heidelberg (2002)
Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing 22, 935–948 (1993)
Petrakis, E.G.M., Faloutsos, C.: Similarity Searching in Medical Image Databases. IEEE Trans. Knowl. Data Eng. 9(3), 435–447 (1997)
Shi, F.: Suffix arrays for multiple strings: a method for on-line multiple string searches. In: Jaffar, J., Yap, R.H.C. (eds.) ASIAN 1996. LNCS, vol. 1179, pp. 11–22. Springer, Heidelberg (1996)
Shi, F., AlShibli, A.: An Indexing Method For Two-D Pattern Matching. In: Proc. of the 7th Asia Pacific Web Conference, March 2005. LNCS, pp. 875–884. Springer, Heidelberg (2005)
Zhu, R.F., Takaoka, T.: A Technique for Two-Dimensional Pattern Matching. Communications of the ACM 32(9), 1110–1120 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shi, F., AlShibli, A. (2005). Searching Patterns in Digital Image Databases. In: Grumbach, S., Sui, L., Vianu, V. (eds) Advances in Computer Science – ASIAN 2005. Data Management on the Web. ASIAN 2005. Lecture Notes in Computer Science, vol 3818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596370_16
Download citation
DOI: https://doi.org/10.1007/11596370_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30767-9
Online ISBN: 978-3-540-32249-8
eBook Packages: Computer ScienceComputer Science (R0)