Capacity maximization for reversible data hiding based on dynamic programming approach

DOI10.1016/J.AMC.2008.10.066zbMath1155.94304OpenAlexW2038846832MaRDI QIDQ1004193

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

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

Related Items (1)

Moment-based local image watermarking via genetic optimization

Cites Work

• Unnamed Item
• On SVD-based watermarking algorithm
• A novel SVD- and VQ-based image hiding scheme

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