Fault-tolerant and progressive transmission of images
| dc.citation.epage | 2471 | en_US |
| dc.citation.issue | 12 | en_US |
| dc.citation.spage | 2466 | en_US |
| dc.citation.volume | 38 | en_US |
| dc.citation.woscount | 29 | |
| dc.contributor.author | Chen, SK | en_US |
| dc.contributor.author | Lin, JC | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:17:59Z | |
| dc.date.available | 2014-12-08T15:17:59Z | |
| dc.date.issued | 2005-12-01 | en_US |
| dc.description.abstract | A fault-tolerant progressive image transmission method is proposed. The advantages include the following: (1) Unlike most progressive methods, the image is divided into n parts with equal importance to avoid worrying about which part is lost or transmitted first. (2) If the image is a secret image, then the transmission can use n distinct channels (one shared result per channel), and intercepting up to r(1) - 1 channels by the enemy (r(1) <= (...) <= r(k) <= n are all pre-set constants) will not reveal any secret. Meanwhile, the disconnection up to n - rk channels will not affect the lossless recovery of the secret image. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/j.patcog.2005.04.002 | en_US |
| dc.identifier.issn | 0031-3203 | en_US |
| dc.identifier.journal | PATTERN RECOGNITION | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.patcog.2005.04.002 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/13002 | |
| dc.identifier.wosnumber | WOS:000232703000022 | |
| dc.language.iso | en_US | en_US |
| dc.subject | progressive | en_US |
| dc.subject | image sharing | en_US |
| dc.subject | image hiding | en_US |
| dc.subject | quality-control | en_US |
| dc.title | Fault-tolerant and progressive transmission of images | en_US |
| dc.type | Article | en_US |