Compressive Sampling with Multiple Bits Spread Spectrum-Based Data Hiding

preprint OA: closed
View at publisher

Abstract

We propose a novel data hiding method in an audio host with a compressive sampling technique. An over-complete dictionary represents a group of the watermark. Each row of the dictionary is a Hadamard sequence representing multiple bits of the watermark. Then, the singular values of segment-based host audio in a diagonal matrix multiply by the over-complete dictionary producing a lower size matrix. At the same time, we embed the watermark into the compressed audio. In the detector, we detect the watermark and reconstruct the audio. This proposed method offers not only hiding the information but also compressing the audio host. The application of the proposed method is a broadcast monitoring and biomedical signal recording. We can mark and secure the signal content by hiding the watermark inside the signal while we compress the signal for memory efficiency. We evaluate the performance in terms of payload, compression ratio, audio quality, and watermark quality. The proposed method can hide the data imperceptibly, in range 729-5292 bps with compression ratio 1.47-4.84 and perfect detected watermark.

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