完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | WU, KS | en_US |
dc.contributor.author | LIN, JC | en_US |
dc.date.accessioned | 2014-12-08T15:03:13Z | - |
dc.date.available | 2014-12-08T15:03:13Z | - |
dc.date.issued | 1995-08-17 | en_US |
dc.identifier.issn | 0013-5194 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1049/el:19950978 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/1779 | - |
dc.description.abstract | When the high-mean and low-mean generated by the BTC image compression technique are to be quantised using VQ, the computation time required to search for the nearest centroid can be reduced significantly using the proposed method. Experiments comparing the full-search and EHPM algorithms demonstrate this. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | IMAGE PROCESSING | en_US |
dc.subject | DATA COMPRESSION | en_US |
dc.subject | VECTOR QUANTIZATION | en_US |
dc.subject | BLOCK CODES | en_US |
dc.title | FAST LEG CODEBOOK GENERATOR FOR ETC IMAGE COMPRESSION | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1049/el:19950978 | en_US |
dc.identifier.journal | ELECTRONICS LETTERS | en_US |
dc.citation.volume | 31 | en_US |
dc.citation.issue | 17 | en_US |
dc.citation.spage | 1427 | en_US |
dc.citation.epage | 1428 | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:A1995RT37400024 | - |
dc.citation.woscount | 0 | - |
顯示於類別: | 期刊論文 |