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

AREA-EFFICIENT VLSI ARCHITECTURES FOR huffman coding

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING 1993年第9期40卷 568-575页

作者： PARK, H PRASANNA, VK SAMSUNG ELECTR CO LTD VLSI SIGNAL PROC LABKYUNGGI DUSOUTH KOREA

In this paper, we present simple and area efficient VLSI architectures for huffman coding, an industrial standard proposed by MPEG, JPEG, and others. We use a memory of size 0(n log n) bits to store a huffman code tree, where n is the number of symbols. This storage scheme supports real-time encoding and decoding. In addition, few simple arithmetic operations are performed on the chip for encoding and decoding. Based on our scheme, we show a design for 8-bit symbols. The proposed design requires 256 X 9 and 64 X 18-bit memory modules to process 8-bit symbols. The chip occupies a silicon area of 3.5 X 3.5 mm2 using 1.2 micron CMOSN standard library cells. Compared with the known parallel implementation in [1] which requires upto 65536 PE's, the proposed architecture leads to a single PE design. It requires significantly less area than the known single PE design in [2]. Different huffman codes can be stored by changing the contents of the memory, without changing the design.

关键词： Very large scale integration huffman coding Image coding Decoding Application software Binary trees Arithmetic Silicon Libraries Bit rate

来源：评论

学校读者我要写书评

暂无评论

A FAST-ADAPTIVE huffman coding ALGORITHM

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1993年第4期41卷 535-538页

作者： LU, WW GOUGH, MP School of Engineering and Applied Sciences University of Sussex Brighton UK

The huffman code in practice suffers from two problems: the prior knowledge of the probability distribution of the data source to be encoded is necessary, and the encoded data propagate errors. The first problem can be solved by an adaptive coding, while the second problem can be partly solved by segmenting data into segments. But the adaptive huffman code performs badly when segmenting data into relatively small segments because of its relatively slow adaptability. This paper offers a fast-adaptive coding algorithm which tracks the local data statistics more quickly, thus yielding better compression efficiency.

关键词： huffman coding Adaptive coding Statistics Probability distribution Statistical distributions Bit rate Data compression Entropy Counting circuits Frequency

来源：评论

学校读者我要写书评

暂无评论

Optimal huffman coding of DCT blocks

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2004年第4期14卷 522-527页

作者： Lakhani, G Texas Tech Univ Lubbock TX 79409 USA

It is a well-observed characteristic that, when a discrete cosine transform block is traversed in the zigzag order, ac coefficients generally decrease in size and the runs of zero coefficients increase in length. This paper presents a minor modification to the huffman coding of the JPEG baseline compression algorithm to exploit this characteristic. During the run-length coding, instead of pairing a nonzero ac coefficient with the run-length of the preceding zero coefficients, our encoder pairs it with the run-length of subsequent zeros. This small change makes it possible for our codec to code a pair using a separate huffman code table optimized for the position of the nonzero coefficient denoted by the pair. These position-dependent code tables can be encoded efficiently without incurring a sizable overhead. Experimental results show that our encoder produces a further reduction in the ac coefficient huffman code size by about 10%-15%.

关键词： discrete cosine transform (DCT) huffman coding JPEG image compression

来源：评论

学校读者我要写书评

暂无评论

Extending Multi-MSB Prediction and huffman coding for Reversible Data Hiding in Encrypted HDR Images

引用

IEEE ACCESS 2022年 10卷 49347-49358页

作者： TSAI, YUAN-YU LIU, HONG-LIN KUO, PEI-LIN CHAN, CHI-SHIANG Asia Univ Dept Commerce & Multimedia Applicat M Taichung 41354 Taiwan China Med Univ China Med Univ Hosp Dept Med Res Taichung 40447 Taiwan

Reversible data hiding in encrypted images can simultaneously enhance the image privacy and preserve the message security for the purpose of covert communication and cloud data management. The algorithm extends the multi-MSB prediction and huffman coding to propose the first reversible data hiding in encrypted HDR images in the Radiance RGBE format. Because of the high similarity among the exponent channel values of neighboring pixels, we directly applied multi-MSB prediction in our proposed preprocessing procedure, yielding considerably increased embedding capacity. We also proposed a novel image encryption method to maintain the characteristics of the images. Subsequently, a distortion-free data hiding algorithm, namely the homogeneity index modification algorithm, was added to further increase embedding capacity. The experimental results demonstrate the feasibility of the proposed algorithm and its ability to increase embedding capacity, embedding rate, and image privacy, support two data hiders, and enable reversibility and separability.

关键词： Encryption Prediction algorithms Indexes huffman coding Image coding Data privacy Biomedical imaging Encrypted media HDR images homogeneity index modification huffman coding multi-MSB prediction reversible data hiding

来源：评论

学校读者我要写书评

暂无评论

New Text Steganography Technique based on Multilayer Encoding with Format-Preserving Encryption and huffman coding

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2022年第12期13卷 163-172页

作者： Majeed, Mohammed Abdul Sulaiman, Rossilawati Shukur, Zarina Univ Kebangsaan Malaysia Fac Informat Sci & Technol Ctr Cyber Secur UKM Bangi 43600 Selangor Malaysia

Steganography is the process of hiding secret data inside other media or cover media. Balancing the requirements for capacity, security, and imperceptibility is the main challenge for any successful steganography system. In text steganography, the data hiding capacity is limited because of the lack of redundant data compared to other digital media, such as images, video, or audio. Other challenges in text steganography are imperceptibility and security. Poor imperceptibility results from the structure of the text file, which is more visually apparent in terms of syntax and grammar than in other media. Low level of security results from the sequential selection of positions for embedding secret data due to insufficient redundant data in a text file. Therefore, an attacker or a third party would notice slight changes in the text file. This paper proposes a new text steganography method that combines cryptography and compression techniques to deal with these issues. This technique is used to conceal secret data to achieve high data hiding capacity in the cover text while maintaining security and imperceptibility. Multilayer encoding and Format-Preserving Encryption (FPE) with huffman coding, are applied to secret data before embedding. Invisible Unicode characters are employed to embed secret data into English text files to generate stego files. Results show that the proposed method satisfies capacity and imperceptibility in the cover file by comparing it with previously developed methods.

关键词： Text steganography format-preserving encryption huffman coding unicode characters

来源：评论

学校读者我要写书评

暂无评论

Reversible data hiding scheme based on the AMBTC compression technique and huffman coding

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2020年第4期22卷 383-393页

作者： Xia, Ting-Ting Lin, Juan Chang, Chin-Chen Lu, Tzu-Chuen Wuyi Univ Sch Math & Comp Sci Wuyishan 354300 Peoples R China Fujian Normal Univ Fuqing Branch Sch Elect & Informat Engn Fuzhou 350300 Peoples R China Feng Chia Univ Dept Informat Engn & Comp Sci Taichung 40724 Taiwan Chaoyang Univ Technol Dept Informat Management Taichung 41349 Taiwan

This paper proposes a reversible data hiding (RDH) method based on the absolute moment block truncation coding (AMBTC) compression technique and huffman coding. First, AMBTC is used to compress the original greyscale image to obtain two quantisation levels and a bitmap of each block. Next, the bitmap of each block is converted into a decimal number to calculate the frequency of the decimal number. A user-defined threshold is used to classify the block as embeddable or not. If the frequency of the decimal number is larger than or equal to the threshold, the bitmap is embeddable and is then compressed by the huffman coding technology. The scheme takes the redundancy of each block by using the huffman code instead of the bitmap to embed secret information. Experimental results show that our proposed scheme has a better hiding payload than other methods, as well as an acceptable image visual quality.

关键词： reversible data hiding RDH AMBTC huffman coding hiding capacity image visual quality peak-signal-to-noise ratio PSNR information security compression domain

来源：评论

学校读者我要写书评

暂无评论

A new lossless compression scheme based on huffman coding scheme for image compression

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2000年第4期16卷 367-372页

作者： Hu, YC Chang, CC Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi 621 Taiwan

A novel lossless image-compression scheme is proposed in this paper. A two-stage structure is embedded in this scheme. A linear predictor is used to decorrelate the raw image data in the first stage. Then in the second stage, an effective scheme based on the huffman coding method is developed to encode the residual image. This newly proposed scheme could reduce the cost for the huffman coding table while achieving high compression ratio. With this algorithm, a compression ratio higher than that of the Lossless JPEG method for 512 x 512 images can be obtained. In other words, the newly proposed algorithm provides a good means for lossless image compression. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： lossless image compression huffman coding JPEG

来源：评论

学校读者我要写书评

暂无评论

Sub-Trees Modification of huffman coding for Stuffing Bits Reduction and Efficient NRZI Data Transmission

引用

IEEE TRANSACTIONS ON BROADCASTING 2012年第2期58卷 221-227页

作者： Pai, Yu-Ting Cheng, Fan-Chieh Lu, Shu-Ping Ruan, Shanq-Jang Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei 106 Taiwan

In recent decades, image and video compression was widely used on network access. However, there are few researches focused on the behavior between data transmission and multimedia compression. Therefore, this paper considers this problem between the encoding of compression and transmission to develop a low bit rate transmission scheme based on huffman encoding. The proposed method can balance "0" and "1" bits to save the issue by analyzing the probability of the miss match in the typical huffman tree. Moreover, the proposed method also can modify the transitional tree under the same compression ratio. Experimental results show that the proposed method can reduce the stuffing bits to 51.13% of standard JPEG compression. Besides, the file size after the proposed encoding is the same with the original one. It is observed that the proposed method provides a way to reduce the transmitted bits under the same compression ratio.

关键词： huffman coding image compression multimedia communication NRZI data transmission

来源：评论

学校读者我要写书评

暂无评论

Entropy of Malayalam Language and Text Compression Using huffman coding 1

Entropy of Malayalam Language and Text Compression Using Huf...

引用

First International Conference on Computational Systems and Communications (ICCSC)

作者： Kuruvila, Melbin Gopinath, Deepa P. Coll Engn Dept ECE Trivandrum 695016 Kerala India

ISBN: (纸本)9781479960132

Entropy is a statistical parameter which measures how much information is produced on the average for each letter of a text in the language. Every language normally has certain hidden statistically significant features and certain redundancy. These features can be utilized to form a suitable text compression tool for the optimum use of resources. Being motivated by the language studies of English and other languages based on Shannon theory, an informational analysis of Malayalam language text is done in this paper. Entropy of Malayalam language is calculated and is obtained as 4.8 bits per character. The Malayalam text compressor discussed in this paper, follows huffman coding technique which takes both Malayalam and English alphabets along with arithmetic numbers and most probable character is represented by less number of bits. It is found that the huffman compression algorithm achieves a compression ratio of 66 percentage for a standard Malayalam database taken. A comparison is made on compression ratio for different databases taken.

关键词： Entropy Text compression huffman coding Compression ratio

来源：评论

学校读者我要写书评

暂无评论

A Fragile Audio Aggregation Watermarking Algorithm Based on huffman coding

A Fragile Audio Aggregation Watermarking Algorithm Based on ...

引用

IEEE International Conference on Electronics, Communications and Control (ICECC)

作者： Li, Juan Wang, Rangding Zhu, Jie Ningbo Univ CKC Software Lab Ningbo 315211 Zhejiang Peoples R China

ISBN: (纸本)9781457703218

In order to authenticate the integrity of audio aggregation, a fragile watermarking algorithm based on vector quantization has proposed which combining with huffman coding. Put the output index into huffman coding after obtaining the index's probability distribution by quantifying index address table. Then use the classical method of cryptography to complete zero-watermark embedding. The experimental results show that the proposed algorithm has good imperceptibility and high security. It has strong vulnerability for audio attacks, and can authenticate the integrity of audio aggregation.

关键词： audio aggregation huffman coding vector quantization fragile watermarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：