Iconic Indexing by 2-D Strings

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-9, Issue 3, 1987, Pages 413-428

  Shi, Qing Yun ^c,d   Yan, Cheng Wen ^a,b  

^a Ilinois Institute of Technology   (United States)

^b UNIVERSITY OF PITTSBURGH   (United States)

^c ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^d PEKING UNIVERSITY   (China)

Author keywords

Iconic indexing; matching algorithms; pictorial information retrieval; string; two dimensional string representation

Indexed keywords

PATTERN RECOGNITION;

AMBIGUOUS PICTURES; ICONIC INDEXING; SYMBOLIC PICTURE; TWO-DIMENSIONAL STRINGS;

IMAGE PROCESSING;

EID: 0023347145     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1987.4767923     Document Type: Article

References (11)

1. P. J. Basl and R. C. Jain, “Three-dimensional object recognition,” ACM Comput. Surveys, vol. 17, no. 1, pp. 75–145, Mar. 1985.
2. N. S. Chang and K. S. Fu, “Query-by-pictorial-example,” in Proc. COMPSAC 79, IEEE Comput. Soc., 1979, pp. 325–330.
3. S. K. Chang, “The reconstruction of binary patterns from their projections,” Commun. ACM, vol. 14, no. 1, pp. 21–25, Jan. 1971.
4. S. K. Chang and T. Kunii, “Pictorial database systems,” Computer (Special Issue on Pictorial Information Systems), S. K. Chang, Ed., pp. 13–21, Nov. 1981.
5. S. K. Chang and S. H. Liu, “Indexing and abstraction techniques for pictorial databases,” IEEE Trans. Pattern Anal. Machine Intell., pp. 475–484, July 1984.
6. S. K. Chang and O. Clarisse, “Interpretation and construction of icons for man-machine interface in an image information system,” in IEEE Proc. Languages for Automation, Nov. 1–3, 1984, pp. 38–45.
7. S. K. Chang and E. Jungert, “A pictorial data structure for spatial reasoning using orthogonal symbolic projections,” in Proc. FJCC’86, Dallas, TX, Nov. 2–6, 1986.
8. D. S. Hirschberg, “Algorithms for the longest common subsequence problem,” J. ACM, vol. 24, pp. 664–675, 1977.
9. J. W. Hunt and T. G. Szymanski, “A fast algorithm for computing longest common subsequences,” Commun. ACM, vol. 20, pp. 350–353, 353, 1977.
10. H. Samet, “The quadtree and related data structures,” ACM Comput. Survey, vol. 16, no. 2, pp. 187–260, June 1984.
11. S. L. Tanimoto, “An iconic/symbolic data structuring scheme,” in Pattern Recognition and Artificial Intelligence, C. H. Chen, Ed. New York: Academic, 1976.