Capacity maximization for reversible data hiding based on dynamic programming approach

DOI10.1016/J.AMC.2008.10.066MaRDI QIDQ1004193zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 2 March 2009

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2008.10.066

zbMATH Keywords

dynamic programminghistogram modificationPSNRreversible data hidingembedding capacity maximization

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Dynamic programming (90C39) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)

Recommendations

• High-performance reversible data hiding
• Multilevel reversible data hiding based on histogram modification of difference images
• New reversible data hiding algorithm using difference expansion embedding
• A reversible data hiding scheme using bit flipping strategy
• Reversible data hiding exploiting spatial correlation between sub-sampled images

Cites work

• scientific article; zbMATH DE number 1893209 (Why is no real title available?)
• A novel \(SVD\)- and \(VQ\)-based image hiding scheme
• On SVD-based watermarking algorithm

Cited in

(2)

• High-performance reversible data hiding
• Moment-based local image watermarking via genetic optimization

This page was built for publication: Capacity maximization for reversible data hiding based on dynamic programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004193)