The DOI matches its Crossref record.
A Reversible Data Hiding Scheme Based on Code Division Multiplexing
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Reversible data hiding: Advances in the past two decades
Shi, Y.-Q., Li, X., Zhang, X., Wu, H.-T., & Ma, B. (2016) · IEEE Access · doi:10.1109/access.2016.2573308 · Cited by 594
Self-citationA High-Performance Region Recognition Network-Enhanced Deep CNN for Image Content Perceptual Hashing
Yang, M., Qi, B., Ma, B., Xu, J., Xian, Y., & Li, X. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3559675 · Cited by 6
Self-citation
Metadata
- Authors
- Ma, B., & Shi, Y. Q.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2016-09
- Volume
- 11
- Issue
- 9
- Pages
- 1914-1927
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2359175208
- Cited by
- 175
- References
- 0
- FWCI
- 9.58
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Reversible Data Hiding Scheme Based on Code Division Multiplexing. https://app.cochat.ai/papers/10.1109/tifs.2016.2566261
- The paper
- Ma, B., & Shi, Y. Q. (2016). A Reversible Data Hiding Scheme Based on Code Division Multiplexing. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2016.2566261
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.