An Optimal Data Hiding Scheme With Tree-Based Parity Check
| dc.citation.epage | 886 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 880 | en_US |
| dc.citation.volume | 20 | en_US |
| dc.citation.woscount | 4 | |
| dc.contributor.author | Hou, Chung-Li | en_US |
| dc.contributor.author | Lu, ChangChun | en_US |
| dc.contributor.author | Tsai, Shi-Chun | en_US |
| dc.contributor.author | Tzeng, Wen-Guey | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:12:05Z | |
| dc.date.available | 2014-12-08T15:12:05Z | |
| dc.date.issued | 2011-03-01 | en_US |
| dc.description.abstract | Reducing distortion between the cover object and the stego object is an important issue for steganography. The tree-based parity check method is very efficient for hiding a message on image data due to its simplicity. Based on this approach, we propose a majority vote strategy that results in least distortion for finding a stego object. The lower embedding efficiency of our method is better than that of previous works when the hidden message length is relatively large. | en_US |
| dc.identifier.doi | 10.1109/TIP.2010.2072513 | en_US |
| dc.identifier.issn | 1057-7149 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON IMAGE PROCESSING | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/TIP.2010.2072513 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/9263 | |
| dc.identifier.wosnumber | WOS:000287400700023 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Image coding | en_US |
| dc.subject | image processing | en_US |
| dc.subject | information security | en_US |
| dc.title | An Optimal Data Hiding Scheme With Tree-Based Parity Check | en_US |
| dc.type | Article | en_US |