| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 沈錳坤 | zh_TW |
| dc.creator (作者) | Lee,Suh-Yin;Shan,Man-Kwan;Yang,Wei-Pang | en_US |
| dc.date (日期) | 1989 | en_US |
| dc.date.accessioned | 21-八月-2014 12:04:52 (UTC+8) | - |
| dc.date.available | 21-八月-2014 12:04:52 (UTC+8) | - |
| dc.date.issued (上傳時間) | 21-八月-2014 12:04:52 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69116 | - |
| dc.description.abstract (摘要) | The perception of spatial relationships among objects in a picture is one of the important selection criteria to discriminate and retrieve the images in an iconic image database system. The data structure called 2D string, proposed by Chang et al., is adopted to represent symbolic pictures. The 2D string preserves the objects` spatial knowledge embedded in images. Since spatial relationship is a fuzzy concept, the capability of similarity retrieval for the retrieval by subpicture is essential. In this paper, similarity measure based on 2D string longest common subsequence is defined. The algorithm for similarity retrieval is also proposed. Similarity retrieval provides the iconic image database with the distinguishing function different from a conventional database. | en_US |
| dc.format.extent | 129 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Pattern Recognition,22(6),675-682 | en_US |
| dc.subject (關鍵詞) | Image database; Spatial relationship; Similarity retrieval; 2D string; Longest common subsequence; Maximal complete subgraph | en_US |
| dc.title (題名) | Similarity retrieval of iconic image database | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1016/0031-3203(89)90004-6 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1016/0031-3203(89)90004-6 | en_US |
