返回
Data embedding in random domain
DOI:10.1016/j.sigpro.2014.08.037.png)
摘要
En 中文
A universal data embedding method based on histogram mapping called DeRand (Data embedding in Random domain) is proposed. DeRand theoretically defines redundancy in any digital signal by applying the universal parser such that high entropy random signals can certainly be utilized for data embedding. First, DeRand recursively parses a random signal into a set of tuples each of certain length until there exist some tuples of zero occurrences in the histogram. Then, tuples that occur in the histogram are associated with those of zero occurrences. Next, a tuple (of non-zero occurrence) is mapped to its corresponding associated tuple to embed 1, while the tuple is left unmodified to embed 0. DeRand is universal, reversible, applicable to any random signal and scalable in terms of embedding capacity and signal quality. Experimental results show that DeRand achieves an embedding capacity up to 4909 bits in random signal of size 256 Kbytes. In addition, the quality of the processed signal ranges from 0.0075 to 395.67 in terms of MSE. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
DeRand
Random domain
Universal data embedding
Universal parser
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
Blind and robust audio watermarking scheme based on SVD-DCT基于svd-dct的盲鲁棒音频水印方案
SIGNAL PROCESSING
IF3.6
A New Histogram Modification Based Reversible Data Hiding Algorithm Considering the Human Visual System一种新的基于直方图修正的考虑人类视觉系统的可逆数据隐藏算法

