Abstract

This chapter describes the 2D string representation as the symbolic projection of a picture, and defines the absolute, normal, and reduced 2D strings. The chapter also presents algorithms for picture reconstruction from the 2D string, and defines the augmented 2D string, as well as picture matching by 2D subsequence matching. It outlines the methodology of iconic indexing and analyzes the problem of ambiguous pictures and their characterization. A summary of the algorithms and ambiguity results for the various 2D string representations is presented as well. The 2D string representation is ideally suited for formulating picture queries.

Full Text
Paper version not known

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 call

Disclaimer: 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.