Iconic Indexing by 2-D Strings
- 1 May 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-9 (3) , 413-428
- https://doi.org/10.1109/tpami.1987.4767923
Abstract
In this paper, we describe a new way of representing a symbolic picture by a two-dimensional string. A picture query can also be specified as a 2-D string. The problem of pictorial information retrieval then becomes a problem of 2-D subsequence matching. We present algorithms for encoding a symbolic picture into its 2-D string representation, reconstructing a picture from its 2-D string representation, and matching a 2-D string with another 2-D string. We also prove the necessary and sufficient conditions to characterize ambiguous pictures for reduced 2-D strings as well as normal 2-D strings. This approach thus allows an efficient and natural way to construct iconic indexes for pictures.Keywords
This publication has 7 references indexed in Scilit:
- Query-by-pictorial-examplePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Three-dimensional object recognitionACM Computing Surveys, 1985
- Picture Indexing and Abstraction Techniques for Pictorial DatabasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- The reconstruction of binary patterns from their projectionsCommunications of the ACM, 1971