完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChung, Kuo-Liang
dc.contributor.authorTseng, Shou-Yi
dc.contributor.authorChen, I-Chien
dc.date.accessioned2009-06-02T06:20:55Z
dc.date.accessioned2020-05-25T06:36:48Z-
dc.date.available2009-06-02T06:20:55Z
dc.date.available2020-05-25T06:36:48Z-
dc.date.issued2006-11-17T07:58:16Z
dc.date.submitted2000-12-08
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/3277-
dc.description.abstractGiven a binary image, this paper first observes that the conventional tree-based spatial data structures (SDSs) spend some amount of memory for storing the external nodes and internal nodes near leaves. Next, we present an adaptive two-phase (ATP) representation to reduce the memory requirement. In addition, some geometric operations, such as computing the area and centroid, on the proposed ATP representation are also discussed. Experimental results show that not only the proposed ATP representation can reduce the memory requirement when compared to the existing ones, but also can lead to faster concerning geometrical operations. Finally, the proposed results are extended to compress gray images.
dc.description.sponsorship中正大學,嘉義縣
dc.format.extent7p.
dc.format.extent161031 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2000 ICS會議
dc.subject.otherImage Compression
dc.titleAdaptive Two-Phase Tree-Based Spatial Data Structures and Their Application to Image Compression
分類:2000年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002000000138.pdf157.26 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。