Efficient Reversible Data Hiding Algorithms Based on Dual Prediction

May 09, 2016 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Enas N. Jaara, Iyad F. Jafar arXiv ID 1605.02605 Category cs.MM: Multimedia Citations 0 Venue arXiv.org Last Checked 4 months ago
Abstract
In this paper, a new reversible data hiding (RDH) algorithm that is based on the concept of shifting of prediction error histograms is proposed. The algorithm extends the efficient modification of prediction errors (MPE) algorithm by incorporating two predictors and using one prediction error value for data embedding. The motivation behind using two predictors is driven by the fact that predictors have different prediction accuracy which is directly related to the embedding capacity and quality of the stego image. The key feature of the proposed algorithm lies in using two predictors without the need to communicate additional overhead with the stego image. Basically, the identification of the predictor that is used during embedding is done through a set of rules. The proposed algorithm is further extended to use two and three bins in the prediction errors histogram in order to increase the embedding capacity. Performance evaluation of the proposed algorithm and its extensions showed the advantage of using two predictors in boosting the embedding capacity while providing competitive quality for the stego image.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Multimedia

R.I.P. πŸ‘» Ghosted

Video Generation From Text

Yitong Li, Martin Renqiang Min, ... (+3 more)

cs.MM πŸ› AAAI πŸ“š 300 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted