Results 161 to 170 of about 23,846 (200)

An adaptive Huffman algorithm for data compression in wireless sensor networks

ISSCS 2011 - International Symposium on Signals, Circuits and Systems, 2011
The major problem in wireless sensor networks (WSN) is the limited energy supply. As the transmission of the data is the largest energy consumption, many studies have turned attention on reducing the amount of bits transmitted. The solution consists in data compression. This article presents a dynamic algorithm based on an adaptive dictionary.
Dragos Ioan Sacaleanu, Rodica Stoian, Dragos Mihai Ofrim   +2 more
openaire   +1 more source

Analysis and comparison of adaptive huffman coding and arithmetic coding algorithms

2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 2017
One ongoing problem with digital image file sizes is the cost of transferring data over a network. Larger image file sizes result in larger webpage file sizes. Larger webpage file sizes take more time to load and users incur higher data transfer costs when opening these larger webpages.
Phyela Mbewe, Sampson D. Asare
openaire   +1 more source

Compression of text and binary files using adaptive Huffman coding techniques

Conference Proceedings '88., IEEE Southeastcon, 2003
The authors measure the amount of compression that can be accomplished by the use of Huffman coding, and the effects of adaption based on the statistics of the input file. The coding algorithm has been designed to generate codes for character strings instead of for a single character. Each compressed file has a unique set of Huffman codes.
A. Desoky, M. Gregory
openaire   +1 more source

Research on Adaptive Optimal Shaping Gain Selection MethodBased on Huffman Coding

2019 18th International Conference on Optical Communications and Networks (ICOCN), 2019
In this paper, an adaptive optimal shaping gain selection method based on huffman coding is proposed. By nonuniform mapping, the input signal satisfies the optimal (secondary) distribution under different SNR, that is, the input signal is infinitely close to Maxwell Boltzmann distribution, so that the channel capacity wirelessly approaches the Shannon ...
Ziqi Ren, Qi Zhang, Xiangjun Xin, Feng Tian, QingHua Tian, Ming Lin, Yang Wang, Yongjun Wang, Leijing Yang, Jinlong Zhang   +9 more
openaire   +1 more source

Implementation of Adaptive Huffman Codes for PAPR Reduction in OFDM Systems

2020
Orthogonal Frequency Division Multiplexing (OFDM) is one of the upcoming techniques for achieving large data rates in 4G/5G wireless communication. In OFDM system, the data are transmitted over sizable subcarriers and modulated with low symbol rate. High-peak-to-average-power ratio (PAPR) is the major disadvantage in OFDM systems that results in out of
S. P. Vimal, N. Sathish Kumar, M. Kasiselvanathan   +2 more
openaire   +1 more source

Comments on "Probability estimation in arithmetic and adaptive-Huffman entropy coders"

IEEE Transactions on Image Processing, 1997
This comment points out some omissions in the work of Duttweiler and Chazmas (see ibid., vol.4, p.237, 1995) on credit related to scaled-count estimators that perform count-scaling when the count of the less probable symbol (LPS) reaches a limiting value.
openaire   +2 more sources

An efficient and selective image compression scheme using Huffman and adaptive interpolation

2009 24th International Conference Image and Vision Computing New Zealand, 2009
This paper proposes a hybrid approach to compression. It incorporates lossy as well as lossless compression. Various parts of image are compressed in either way, depending on the amount of information held in that part. This scheme consists of two stages. In the first stage the image is filtered by a high pass filter to find the areas that have details.
Sunil Bhooshan, Shipra Sharma
openaire   +1 more source

Adaptive Region Based Huffman Compression Technique with Selective Code Interchanging

2012
Adaptive version of loss-less Region Based Huffman compression techniques are proposed where a proposed region formation algorithm is used to divide the input file into a number of regions that adapts region size depending on the ASCII value difference of symbols. Huffman codes are obtained for entire file after formation of regions. Code interchanging
Utpal Nandi, Jyotsna Kumar Mandal
openaire   +1 more source

Adaptive Radiographic Image Compression Technique using Hierarchical Vector Quantization and Huffman Encoding

Journal of Ambient Intelligence and Humanized Computing, 2018
The objective of this paper is to provide a proposed method for radiographic image compression with maximum Compression Ratio (CR) as possible and keeping all details, especially in the Region Of Interest (ROI) that contains the important information in the image.
H. Kasban, S. Hashima
openaire   +1 more source

AHCM: Adaptive Huffman Code Mapping for Audio Steganography Based on Psychoacoustic Model

IEEE Transactions on Information Forensics and Security, 2019
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 ...
Xiaowei Yi, Kun Yang, Xianfeng Zhao, Yuntao Wang, Haibo Yu   +4 more
openaire   +1 more source