检索结果-内蒙古大学图书馆

AHCM: Adaptive huffman code Mapping for Audio Steganography Based on Psychoacoustic Model

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2019年第8期14卷 2217-2231页

作者： Yi, Xiaowei Yang, Kun Zhao, Xianfeng Wang, Yuntao Yu, Haibo Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing 100093 Peoples R China Univ Chinese Acad Sci Sch Cyber Secur Beijing 100049 Peoples R China Baidu Autonomous Driving Business Unit Res & Dev Beijing 100094 Peoples R China

Most current audio steganographic methods are content non-adaptive which have poor security and low embedding capacity. This paper proposes a generalized adaptive huffman code mapping (AHCM) framework for obtaining higher secure payload. To avoid the frame-offset effect of audio codec, we first establish a distortion-limited suppressible code space, which realizes data embedding by using equal-length entropy codes. Furthermore, a stego key is used to dynamically build huffman code mapping of each frame for improving acoustic imperceptibility and statistical undetectability. We then consider integrating psychoacoustic model (PAM) of intra-frame with frame-level perceptual distortion of inter-frame to obtain minimized total distortion. Finally, we present an implementation of the proposed AHCM framework on MP3 audios. A distortion function based on the PAM and an optimal steganographic frame path are, respectively, devised for adaptively embedding via employing syndrome-trellis codes. Experimental results demonstrate that our approach is, indeed, able to achieve higher secure steganographic capacity and better acoustic concealment. The detection accuracy of 320-kbps-mp3 datasets is lower than 65% when the embedding payload reaches 11 kbps, which is decreased by 11.8%-13.4% than the state-of-the-art steganographic methods.

关键词： MP3 audio steganography adaptive steganography huffman code psychoacoustic model distortion function

来源：评论

学校读者我要写书评

暂无评论

LOCAL REDUNDANCY AND PROGRESSIVE BOUNDS ON THE REDUNDANCY OF A huffman code

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1991年第3期37卷 687-691页

作者： YEUNG, RW AT and T Bell Laboratories Inc. Holmdel NJ USA

The concept of local redundancy is introduced and shown that it is a simple but powerful tool for understanding the redundancy of a prefix code. Based on this concept, the redundancy theorem, which gives lower bounds on the redundancy of a prefix code when the structure of the code is partially known, is proven. It is shown how this theorem can be used to obtain well-known lower bounds on R(Huff), the redundancy of a huffman code. The theorem is used to obtain a sequence of new lower bounds on R(Huff) based on the huffman procedure. A similar sequence of upper bounds or R(Huff) is obtained. New lower and upper bounds on R(Huff) when the two smallest probabilities of the source distribution are known are given as corollaries of these results.

关键词： LOCAL REDUNDANCY THE REDUNDANCY THEOREM PROGRESSIVE BOUNDS huffman code

来源：评论

学校读者我要写书评

暂无评论

A proposal of digital rights management based on incomplete cryptography using invariant huffman code length feature

引用

MULTIMEDIA SYSTEMS 2014年第2期20卷 127-142页

作者： Ta Minh Thanh Iwakiri, Munetoshi Tokyo Inst Technol Dept Comp Sci Meguro Ku Tokyo 1528552 Japan Le Quy Don Tech Univ Dept Network Secur Hanoi Vietnam Natl Def Acad Dept Comp Sci Yokosuka Kanagawa 2398686 Japan

Digital rights management (DRM) system is a promising technique to allow copyrighted content to be commercialized in digital format without the risk of revenue loss due to piracy. However, traditional DRMs are achieved with individual function modules of cryptography and watermarking. Therefore, all digital contents are temporarily disclosed in perfect condition via decryption process in the user-side risking illegal redistribution. This paper describes the basic idea of a novel DRM method composed of an incomplete cryptography using invariant huffman code length feature and the user identification mechanism to control the quality of digital contents. The proposed incomplete cryptography consists of two processes: the incomplete encoding and the incomplete decoding. These processes are presented by randomly selecting the coefficients that belong to the same category or different category of huffman code. In our scheme, the copyright information is embedded into the decoded content during the decoding process, and the size of digital contents are invariant during the process. Experimental results with simulation confirmed that the modified codes are compatible with standard JPEG format, and revealed the proposed method to be suitable for DRM in the network distribution system.

关键词： Digital rights management (DRM) huffman code JPEG algorithm Digital images Copyright protection Incomplete cryptography Invisible watermarking Invariant huffman code length feature

来源：评论

学校读者我要写书评

暂无评论

Hierarchical transmission of huffman code using multi-code/multi-rate DS/SS modulation with appropriate power control

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 1998年第12期E81B卷 2283-2289页

作者： Makido, S Yamazato, T Katayama, M Ogawa, A Nagoya Univ Grad Sch Engn Nagoya Aichi 4648603 Japan

For transmission of video signals, it is important that the system allows a certain degree of flexibility in bit rate as well as quality, depending upon the requirements of media and channel conditions. In this paper, we discuss the hierarchical transmission of huffman code using multi-code/multi-rate DS/SS system to realize flexible transmission. We first discuss and show that the structure of huffman code tree directly expresses hierarchical structure, and that parallel transmission of huffman code can achieve hierarchical transmission. By assigning different transmission data rate to the bits in each stratum, it is possible to transmit different amount of information from each stratum. Further, we show the quality of each of the stratum can easily controlled by an appropriate power distribution to each parallel transmission branch.

关键词： huffman code multi-code SS parallel transmission hierarchical transmission

来源：评论

学校读者我要写书评

暂无评论

Optimality of huffman code in the Class of 1-Bit Delay Decodable codes

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY

引用

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2022年第4期3卷 616-625页

作者： Hashimoto, Kengo Iwata, Ken-ichi Univ Fukui Grad Sch Engn Fukui 9108507 Japan

For a given independent and identically distributed (i.i.d.) source, huffman code achieves the optimal average codeword length in the class of instantaneous codes with a single code table. However, it is known that there exist time-variant encoders, which achieve a shorter average codeword length than the huffman code, using multiple code tables and allowing at most k-bit decoding delay for k = 2, 3, 4, . . .. On the other hand, it is not known whether there exists a 1-bit delay decodable code, which achieves a shorter average length than the huffman code. This paper proves that for a given i.i.d. source, a huffman code achieves the optimal average codeword length in the class of 1-bit delay decodable codes with a finite number of code tables.

关键词： Data compression source coding huffman code decoding delay

来源：评论

学校读者我要写书评

暂无评论

A NOTE ON THE COMPETITIVE OPTIMALITY OF THE huffman code

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1992年第2期38卷 436-439页

作者： FEDER, M Department of Electrical Engineering-Systems Faculty Engineering Tel-Aviv University Tel-Aviv Israel

It is known that a bound on the probability that the length of any source code will be shorter than the self information by gamma-bits can be obtained using a Chebychev-type argument. From this bound, one can establish the competitive optimality of the self information and of the Shannon-Fano code (up to one bit). In general, however, the huffman code cannot be examined using this technique. Nevertheless, in this correspondence the competitive optimality (up to one bit) of the huffman code for general sources is also established using a different technique.

关键词： COMPETITIVE OPTIMALITY huffman code SELF INFORMATION CHEBYSHEV INEQUALITY

来源：评论

学校读者我要写书评

暂无评论

Incomplete Cryptography Method Using Invariant huffman code Length to Digital Rights Management

Incomplete Cryptography Method Using Invariant Huffman Code ...

引用

26th IEEE International Conference on Advanced Information Networking and Applications (AINA)

作者： Iwakiri, Munetoshi Ta Minh Thanh Natl Def Acad Dept Comp Sci 1-10-20 Hashirimizu Yokosuka Kanagawa 2398686 Japan Tokyo Inst Technol Dept Comp Sci Meguro Ku Tokyo 1528552 Japan

ISBN: (纸本)9780769546513

This paper describes the basic idea of a novel Digital Rights Management(DRM) method which is composed of an incomplete cryptography using invariant huffman code length feature and the user identification mechanism to control the quality of the digital contents. We adopt the huffman code length feature of the DCT coefficient in the JPEG codec to the implement incomplete cryptography. The encoding process and the decoding process are presented by randomly selected the coefficients that belong to same category in the huffman table. In the our scheme, the copyright information is embedded into the decoded content while decoding process, and the size of digital contents are invariance during process. Experimental results with simulation confirmed that the modified codes keep compatibility with standard JPEG format, and revealed the proposed method is suitable for DRM in the network distribution system.

关键词： Digital Rights Management (DRM) huffman code DC coefficient AC coefficient Digital images Copyright Protection Incomplete Cryptography Invisible Watermarking

来源：评论

学校读者我要写书评

暂无评论

Fast synchronization recovery for lossy image transmission with a suffix-rich huffman code

Fast synchronization recovery for lossy image transmission w...

引用

Conference on Applications of Digital Image Processing XXI

作者： Yang, TC Kuo, CCJ Univ So Calif Dept Elect Engn Syst Integrated Media Syst Ctr Los Angeles CA 90089 USA

ISBN: (纸本)0819429155

A new entropy codec, which can recover quickly from the loss of synchronization due to the, occurrence of transmission errors, is proposed and applied to wireless image transmission in this research. This entropy codec is designed based on the huffman code with a careful choice of the assignment of 1's and 0's to each branch of the huffman tree. The design satisfies the suffix-rich property, i.e. the number of a codeword to be the suffix of other codewords is maximized. After the huffman coding tree is constructed, the source can be coded by using the traditional huffman code. Thus, this coder does not introduce Rnv overhead to sacrifice its coding efficiency. Statistically, the decoder can automatically recover the lost synchronization with the shortest error propagation length. Experimental results show that fast synchronization recovery reduces quality degradation on the reconstructed image while maintaining the same coding efficiency.

关键词： huffman code error resilience synchronization recovery

来源：评论

学校读者我要写书评

暂无评论

A huffman code Based Image Steganography Technique 1

A Huffman Code Based Image Steganography Technique

引用

1st International Conference on Applied Algorithms (ICAA)

作者： Nag, Amitava Singh, Jyoti Prakash Biswas, Sushanta Sarkar, Debasree Sarkar, Partha Pratim Acad Technol Hooghly W Bengal India Natl Inst Technol Patna Bihar India Univ Kalyani Kalyani W Bengal India

ISBN: (纸本)9783319041261;9783319041254

We present here a novel steganographic method based on huffman coding and the least significant bit substitution in order to provide high embedding capacity, a strong security and imperceptible visual quality to secret message. Every eight bits of the secret image are first encoded by building a huffman tree. After that those encoded bits of secret image are divided into 4 groups. Each part has a decimal value between 0 to 3. These decimal values determine the location where to embed the message in a particular pixel of cover image. To embed the message we just put a one in the corresponding location in a pixel of the cover image which identified by the decimal values of the secret image. Since huffman Table reduces the size of the original image, an attacker cannot easily recover from the stego image those fine details of the original image that would enable him to mount a reliable attack. We have got comparable visual quality as the Peak Signal to Noise Ratio values lie between 30 dB to 31 dB.

关键词： Steganography huffman code LSB Technique Information Hiding Image Processing

来源：评论

学校读者我要写书评

暂无评论

Nonuniform QAM GFDM RoF system based on probabilistic shaping with huffman code

Nonuniform QAM GFDM RoF system based on probabilistic shapin...

引用

Asia Communications and Photonics Conference (ACP)

作者： Ren, Jianxin Liu, Bo Zhang, Lijia Zhang, Qi Tian, Qinghua Tian, Feng Xin, Xiangjun Zhao, Lilong Sun, Tingting Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China Nanjing Univ Informat Sci & Technol Inst Opt & Elect Nanjing 210044 Jiangsu Peoples R China Beijing Univ Posts & Telecommun Beijing Key Lab Space Ground Interconnect & Conve Beijing 100876 Peoples R China

A nonuniform QAM GFDM RoF system based on probabilistic shaping with huffman code is proposed. Simulation results show that the proposed system obtains better BER performance than uniform QAM schemes.

ISBN: (纸本)9781538661581

关键词： nonuniform QAM generalized frequency division multiplexing radio over fiber probabilistic shaping huffman code

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：