The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Representing Symbolic Pictures Using Iconic Indexing
Abstract
2D-string and 2D H-string are commonly used to describe the spatial relationships among the objects of a picture. This chapter introduces a new data structure, called N-string, to characterize the spatial information of the objects on a picture. The N-string is isomorphic to the 2D H-string in postfix notation. Algorithms for transformations between symbolic pictures and N-strings are developed as well. In addition, this chapter also provides an efficient method for image matching based on the N-string representation. This chapter shows that in most cases the storage space needed by N-strings is less than that by 2D-strings, too. Besides, the experimental results show that N-strings are superior to 2D-strings. Hence both N-string and 2D H-string in postfix notation are good for representing symbolic pictures. That is, both N-string and 2D H-string in postfix notation are good for iconic indexing of pictures.
Related Content
Nithin Kalorth, Vidya Deshpande.
© 2024.
7 pages.
|
Nitesh Behare, Vinayak Chandrakant Shitole, Shubhada Nitesh Behare, Shrikant Ganpatrao Waghulkar, Tabrej Mulla, Suraj Ashok Sonawane.
© 2024.
24 pages.
|
T.S. Sujith.
© 2024.
13 pages.
|
C. Suganya, M. Vijayakumar.
© 2024.
11 pages.
|
B. Harry, Vijayakumar Muthusamy.
© 2024.
19 pages.
|
Munise Hayrun Sağlam, Ibrahim Kirçova.
© 2024.
19 pages.
|
Elif Karakoç Keskin.
© 2024.
19 pages.
|
|
|