Abstract
S. K. Chang et al. [1] 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 [2] 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
