ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Similarity Retrieval of Iconic Images Based on 2D String Longest Common Subsequence.

Suh-Yin Lee, Man-Kwan Shan, Wei-Pang Yang: Similarity Retrieval of Iconic Images Based on 2D String Longest Common Subsequence. DASFAA 1989: 337-341
@inproceedings{DBLP:conf/dasfaa/LeeSY89,
  author    = {Suh-Yin Lee and
               Man-Kwan Shan and
               Wei-Pang Yang},
  editor    = {Sukho Lee and
               Hideko S. Kunii and
               Won Kim and
               In Sup Paik and
               Yahiko Kambayashi},
  title     = {Similarity Retrieval of Iconic Images Based on 2D String Longest
               Common Subsequence},
  booktitle = {International Symposium on Database Systems for Advanced Applications,
               Seoul, Korea, April 10-12, 1989},
  publisher = {Dept. of Computer Science, KAIST, P.O. Box 150, ChongRyang, Seoul,
               131-650, Korea},
  year      = {1989},
  pages     = {337-341},
  ee        = {db/conf/dasfaa/LeeSY89.html},
  crossref  = {DBLP:conf/dasfaa/89},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

In an iconic image database system, the perception of spatial relationships among objects in a picture is one of the important selection criteria to discriminate and retrieve the images. Since spatial relationship is a fuzzy concept, the capability of similarity retrieval for the retrieval by subpicture is essential. The data structure called 2D string, proposed, by Chang et al., is adopted to represent symbolic pictures. Similarity measure based on 2D string longest cormon subsequernce is defined. The algorithm for similarity retrieval is proposed.

Copyright © 1989 by The Organizing Commitee of the International Symposium on Database Systems for Advanced Applications. Permission to copy without all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the DASFAA copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Organizing Commitee of the International Symposium on Database Systems for Advanced Applications. To copy otherwise, or to republish, requires a fee and/or special permission from the Organizing Commitee.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

References

[1]
...
[2]
...
[3]
Christopher F. Herot: Spatial Management of Data. ACM Trans. Database Syst. 5(4): 493-513(1980) BibTeX
[4]
...
[5]
Ning-San Chang, King-sun Fu: A Relational Database System for Images. Pictorial Information Systems 1980: 288-321 BibTeX
[6]
Ning-San Chang, King-sun Fu: Query-by-Pictorial-Example. IEEE Trans. Software Eng. 6(6): 519-524(1980) BibTeX
[7]
...
[8]
Ying-Kuei Yang, King-sun Fu: A Low-Cost Geometry-Preserving Image Database System. ICDE 1984: 604-610 BibTeX
[9]
Nick Roussopoulos, Daniel Leifker: Direct Spatial Search on Pictorial Databases Using Packed R-Trees. SIGMOD Conference 1985: 17-31 BibTeX
[10]
Shi-Kuo Chang, C. W. Yan, Donald C. Dimitroff, Timothy Arndt: An Intelligent Image Database System. IEEE Trans. Software Eng. 14(5): 681-688(1988) BibTeX
[11]
...
[12]
James W. Hunt, Thomas G. Szymanski: A Fast Algorithm for Computing Longest Subsequences. Commun. ACM 20(5): 350-353(1977) BibTeX
[13]
Coenraad Bron, Joep Kerbosch: Finding All Cliques of an Undirected Graph (Algorithm 457). Commun. ACM 16(9): 575-576(1973) BibTeX
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:05:14 2009