完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Guan, D.J. | |
| dc.contributor.author | Chou, Chun-Yen | |
| dc.contributor.author | Chen, Chiou-Wei | |
| dc.date.accessioned | 2009-06-02T07:23:34Z | |
| dc.date.accessioned | 2020-05-29T06:18:15Z | - |
| dc.date.available | 2009-06-02T07:23:34Z | |
| dc.date.available | 2020-05-29T06:18:15Z | - |
| dc.date.issued | 2006-10-27T07:34:02Z | |
| dc.date.submitted | 1999-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/2762 | - |
| dc.description.abstract | Iconic indexing is an important tool for image database. For similarity retrieval of iconic image database, there are 3types of similarity. Only one of them is isometric, hence transitive. We present polynomial time algorithms to find maximum similar subpicture of two given pictures when the similarity is isometric. For nonisometric types, we show that the problems are NP-complete, even when all symbols are distinct, by reducing the 3CNF satisfiability problem to them. | |
| dc.description.sponsorship | 淡江大學, 台北縣 | |
| dc.format.extent | 5p. | |
| dc.format.extent | 387134 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1999 NCS會議 | |
| dc.subject | Image dataabse | |
| dc.subject | Spatial relationship | |
| dc.subject | Similarity retrieval | |
| dc.subject.other | Image/Multimedia Database | |
| dc.title | Computational complexity of Similarity Retrieval in Iconic Image Database | |
| 分類: | 1999年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs001999000044.pdf | 378.06 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。