Results 171 to 180 of about 23,946 (190)
Some of the next articles are maybe not open access.
Comments on "Probability estimation in arithmetic and adaptive-Huffman entropy coders"
IEEE Transactions on Image Processing, 1997This 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
A memory-efficient adaptive Huffman coding algorithm for very large sets of symbols
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), 2002Summary form only given. The problem of computing the minimum redundancy codes as we observe symbols one by one has received a lot of attention. However, existing algorithms implicitly assumes that either we have a small alphabet or that we have an arbitrary amount of memory at our disposal for the creation of a coding tree.
Steven Pigeon, Yoshua Bengio
openaire +1 more source
Implementation of Adaptive Huffman Codes for PAPR Reduction in OFDM Systems
2020Orthogonal 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 +2 more
openaire +1 more source
Adaptive Huffman coding of 2-D DCT coefficients for image sequence compression
Signal Processing: Image Communication, 1995Abstract This paper presents a new approach to adaptive Huffman coding of 2-D DCT coefficients for image sequence compression. Based on the popular motion-compensated interframe coding, the proposed method employs self-switching multiple Huffman codebooks for entropy coding of quantized transform coefficients.
Jechang Jeong, Jae Moon Jo
openaire +1 more source
An efficient and selective image compression scheme using Huffman and adaptive interpolation
2009 24th International Conference Image and Vision Computing New Zealand, 2009This 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
Compression of text and binary files using adaptive Huffman coding techniques
Conference Proceedings '88., IEEE Southeastcon, 2003The 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), 2019In 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 +9 more
openaire +1 more source
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.
Hany Kasban, Sherief Hashima
openaire +1 more source
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.
Hany Kasban, Sherief Hashima
openaire +1 more source
An Adaptive Multiple Order Context Huffman Compression Algorithm Based on Markov Model
2017In this paper, an adaptive multiple order context Huffman compression algorithm based on Markov chain is proposed. Firstly, the data to be compressed is traversed, and the character space of the data and the times that one character transfers to its neighboring character are figured out.
Yonghua Huo +4 more
openaire +1 more source
The Worst-case Performance Of Adaptive Huffman Codes
Proceedings. 1991 IEEE International Symposium on Information Theory, 2005openaire +1 more source