Binary Image Steganography based on Permutation
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract We propose a steganographic scheme based on permutations, which improves the capacity of embedding information in a series of p host binary images. Given a host binary image block of size m x n bits and any embedding technique T, where T can hide Q(m, n) bits of data in the image; given p images, T can hide p x Q(m, n) bits of data in these images. Our scheme improves the capacity of embedding information in p images such that, instead of p x Q(m, n) bits, it can hide p x log2(p) + p x Q(m, n)bits. The results which have been obtained by experiments, show that our model performs a better hiding process in terms of hiding capacity.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-24T02:00:01.246996+00:00
License: CC-BY-4.0