完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chao, Che-Yi | en_US |
dc.contributor.author | Lin, Ja-Chen | en_US |
dc.date.accessioned | 2020-07-01T05:22:13Z | - |
dc.date.available | 2020-07-01T05:22:13Z | - |
dc.date.issued | 2020-05-01 | en_US |
dc.identifier.issn | 1016-2364 | en_US |
dc.identifier.uri | http://dx.doi.org/10.6688/JISE.202005_36(3).0009 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/154633 | - |
dc.description.abstract | Reversible data hiding is widely used because the host image can be recovered without errors after the extraction of hidden data. One of the popular schemes for reversibility involves the use of prediction-error expansion (PEE). Scholars often modify the basic PEE scheme to hide more secret bits or to improve the quality in stego images. Examples include the pairwise PEE, the difference expansion approach, and others. In our PEE-based method here, by identifying which parts of a prediction error histogram indicate inefficient hiding, we propose increasing the ratio of pixels hiding data to the pixels shifted without hiding data, called the efficiency ratio (ER). We used four tests to improve ER and hence improve the quality of stego images. The basic concept of our method is to check whether an image block or pixel is suitable for embedding data. After deleting the blocks or pixels that are likely to yield erroneous predictions, we can reduce the chance of a high PE. A high PE not only deteriorates the quality of stego images, but also contributes nothing to the embedding capacity. As shown in experiments, our image quality is better than that of many other PEE-based algorithms when similar amounts of data are hidden. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | reversible hiding | en_US |
dc.subject | prediction-error expansion (PEE) methods | en_US |
dc.subject | prediction-error (PE) histogram | en_US |
dc.subject | efficiency ratio (ER) | en_US |
dc.subject | selection of embedding area | en_US |
dc.title | Selection of Embedding Area: A Better Way to Use Prediction-Error Expansion Method for Reversible Hiding | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.6688/JISE.202005_36(3).0009 | en_US |
dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.citation.volume | 36 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 621 | en_US |
dc.citation.epage | 641 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000537594300009 | en_US |
dc.citation.woscount | 0 | en_US |
顯示於類別: | 期刊論文 |