Results 181 to 190 of about 1,866 (211)
Some of the next articles are maybe not open access.
XAdap: An Adaptive Huffman Coding on Markup Languages
International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007), 2007Suneeta Agarwal
exaly +2 more sources
Adaptive Huffman Coding with Memory Optimization
2024 5th International Conference on Smart Electronics and Communication (ICOSEC)Ramyasri Maturi +3 more
exaly +2 more sources
Design of a digital pixel image sensor array with adaptive quantization and pseudo Huffman coding
, 2008 In this paper, adaptive quantization algorithm with pseudo Huffman coding scheme used for image compression application integrated along with a digital pixel sensor (DPS) array is proposed.
Milin Zhang, Amine Bermak
exaly +2 more sources
Low-Complexity Huffman Coding-Based Adaptive Spatial Modulation
IEEE Communications LettersPingping Shang +2 more
exaly +2 more sources
Adaptive image compression using Adaptive Huffman and LZW
2016 International Conference on Information & Communication Technology and Systems (ICTS), 2016In this digital era, the need of storing data has increased rapidly. This circumstance is proportional to the size of files and their storage. In order to decrease the required big size of storage, the file size should be reduced by still considering the quality of the respective data.
Djuned Fernando Djusdek +2 more
openaire +1 more source
Probability estimation in arithmetic and adaptive-Huffman entropy coders
IEEE Transactions on Image Processing, 1995Entropy coders, such as Huffman and arithmetic coders, achieve compression by exploiting nonuniformity in the probabilities under which a random variable to be coded takes on its possible values. Practical realizations generally require running adaptive estimates of these probabilities. An analysis of the relationship between estimation quality and the
Donald L. Duttweiler +1 more
openaire +2 more sources
Dynamic mapping technique for adaptive Huffman code
Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation, 2002A new adaptive Huffman code which has low hardware cost and high compression efficiency is proposed. The adaptation principle of this code is to dynamically change the mapping relationship between symbols and codewords while keeping all codewords unchanged.
null Liang-Wei Lee +3 more
openaire +1 more source
ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS
International Journal of Foundations of Computer Science, 2012In this paper we propose an efficient approach to the compressed string matching problem on Huffman encoded texts, based on the BOYER-MOORE strategy. Once a candidate valid shift has been located, a subsequent verification phase checks whether the shift is codeword aligned by taking advantage of the skeleton tree data structure.
Domenico Cantone +2 more
openaire +3 more sources
IEEE Transactions on MultimediaWith the development of data security and privacy requirements in the field of cloud computing, Reversible Data Hiding in Encrypted Images (RDHEI) in encryption domain has received increasing attention.
Chi Ji, Guangyong Gao, Yun-Qing Shi
exaly +2 more sources
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), 2017One 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