Application of a reciprocal confluence tree unit to similar-picture retrieval
S. K. Chang et al.  defined three types of pattern matching to retrieve “similar” symbolic pictures from a symbolic picture database. Symbolic pictures are composed of icons. Each pair of icons have 9 possible spatial relationships, depending on whether their x an y coordinates are <, =, or >. In this paper we propose the use of a reciprocal confluence tree unit  to compute and represent each symbolic picture as a large integer. An algorithm is then given for determining whether or not a pattern picture matches a subject picture. This algorithm runs in O(n2 log(m) + m2) time, where n is the number of icons in the pattern and m is the number of icons in the subject.
Unable to display preview. Download preview PDF.
- 1.S.K. Chang, Q.Y. Shi, and C.W. Yan: Iconic Indexing by 2-D Strings. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-9, No. 3, 413–428 (1987).Google Scholar
- 2.C.C. Chang, C.H. Lin: A Reciprocal Confluence Tree Unit and Its Applications. BIT, Vol. 30, 27–33, 1990.Google Scholar
- 3.F.J. Taylor: Residue Arithmetic: A Tutorial with Examples. Computer, Vol. 17, No. 5, 540–546 (1984).Google Scholar
- 4.G. Jaeschke: Reciprocal Hashing: A Method for Generating Minimal Perfect Hashing Functions. Communications of the ACM, Vol. 24, No. 12, 829–833 (1981).Google Scholar
- 5.C.C. Chang: A Fast Algorithm to Retrieve Symbolic Pictures. International Journal of Computer Mathematics, Vol. 43, No. 1&2 (1992).Google Scholar
- 6.S.K. Chang: Principles of Pictorial Information Systems Design, Prentice-Hall International, Englewood Cliffs, New Jersey, 1989.Google Scholar