A Reversible Data Hiding Scheme Based on Code Division Multiplexing

Bin Ma, Yun Q. Shi

Research output: Contribution to journalArticlepeer-review

65 Scopus citations

Abstract

In this paper, a novel code division multiplexing (CDM) algorithm-based reversible data hiding (RDH) scheme is presented. The covert data are denoted by different orthogonal spreading sequences and embedded into the cover image. The original image can be completely recovered after the data have been extracted exactly. The Walsh Hadamard matrix is employed to generate orthogonal spreading sequences, by which the data can be overlappingly embedded without interfering each other, and multilevel data embedding can be utilized to enlarge the embedding capacity. Furthermore, most elements of different spreading sequences are mutually cancelled when they are overlappingly embedded, which maintains the image in good quality even with a high embedding payload. A location-map free method is presented in this paper to save more space for data embedding, and the overflow/underflow problem is solved by shrinking the distribution of the image histogram on both the ends. This would further improve the embedding performance. Experimental results have demonstrated that the CDM-based RDH scheme can achieve the best performance at the moderate-to-high embedding capacity compared with other state-of-the-art schemes.

Original languageEnglish (US)
Article number7467481
Pages (from-to)1914-1927
Number of pages14
JournalIEEE Transactions on Information Forensics and Security
Volume11
Issue number9
DOIs
StatePublished - Sep 2016

All Science Journal Classification (ASJC) codes

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications

Keywords

  • Code division multiplexing (CDM)
  • embedding capacity
  • location-map free
  • prediction-error
  • reversible data hiding (RDH)

Fingerprint Dive into the research topics of 'A Reversible Data Hiding Scheme Based on Code Division Multiplexing'. Together they form a unique fingerprint.

Cite this