Abstract: The current application is-directed to flexible methods for motion-vector-based encoding of macroblocks within video: frames. The flexible methods for encoding video-frame macroblocks provide for segmentation of a video-frame block and encoding the segmented video-frame block by a segmented-block motion vector that includes a reference to a segmentation-defining region of a segmentation map and that also includes references to sources of intensity-and-color data for each segment. Segmented-block motion vectors provide for flexible segmentation-based encoding of video-frame blocks without sacrificing the coding efficiencies attendant with conventional motion-vector-based video encoding.

Abstract: In this paper a two Special Huffman Tree (SHT) algorithms have been designed and implemented to be encoded with an MPEG video file instead of the standard Huffman tree algorithm. The first SHT has been built with 89-entries, and the other with 100-entries. The SHTs are encrypted using part of the key-stream generated by Rabbit algorithm. The other part of the key-stream is used in insertion operation. In this latter operation, a number of bits of the key-stream are inserted in the coded desired file. The encrypted SHTs with the encoded desired file are sent to the receiver, so no one knows the tree used to encode the file except the sender and the receiver. Many types of tests and measurements (such as efficiency, compression, speed, and security measurements) have been performed to evaluate the performance of this algorithm. Calculation of the compression efficiency of SHTs has been found to be higher than that of the standard Huffman tree. Also, it has been shown that the increasing ratio in size of the generated file to that of the original file is very small and can be neglected.

Abstract: Halftoning is the printing technology in which each pixel in halftone image is represented by single bit. Hence halftoning gives 87.5% compression ratio. Modified Huffman encoding technique is used on halftone image for further compression of image data. This algorithm achieves a high compression ratio that ensures optimum utilization of network resources and storage. In our earlier work a small operator of size 3x3 is used, which effectively takes only one tap operation. Floyd-Steinberg operator which takes 5 tap operations has been used. Thus factors, like computational complexity, memory space and image quality, have been considered. The proposed algorithm has been implemented on MATLAB platform and has been tested on various images of size 256x256. The image quality measurement has been done using Mean Square Error and Structural Similarity Index parameters. The proposed technique can be used for storage of images in this hybrid compressed form, and low bit rate data transmission for video conferencing.

Abstract: By introduction on the theories of the two dictionary compression algorithms of LZSS and LZW, this paper analyzes the pros and cons of these two algorithms for compression, on the premise of improvement on these two algorithms, designs the compression algorithm combining LZSS and LZW. Based on this, this paper further improves the combinational compression algorithm, introduces Huffman code to implement coding output for the compression result, and increases the compression rate of the combinational compression algorithm. Finally, comparison between these compression algorithms aforementioned was carried out; the combinational algorithm based on Huffman coding obtained relatively good compression effect

Abstract: 1. ABSTRACT In information age, sending the data from one end to another end need lot of space as well as time. Data compression is a technique to compress the information source (e.g. a data file, a speech signal, an image, or a video signal) in poss ible few numbers of bits. One of the major factors that influence the Data Compression technique is the procedure to encode the source data and space required for encoded data. There are many data compressions methods which are used for data compression an d out of which Huffman is mostly used for same. Huffman algorithms have two ranges static as well as adaptive. Static Huffman algorithm is a technique that encoded the data in two passes. In first pass it requires to calculate the frequency of each symbol and in second pass it constructs the Huffman tree. Adaptive Huffman algorithm is expanded on Huffman algorithm that constructs the Huffman tree but take more space than Static Huffman algorithm. This paper introduces a new data compression Algorithm which is based on Huffman coding. This algorithm not only reduces the number of pass but also reduce the storage space in compare to adaptive Huffman algorithm and comparable to static.

Abstract: In this work we introduce a power-aware adaptive bus encoding method (or simply PABEM) based on Huffman algorithm. PABEM relies on a change in adaptive Huffman coding algorithm. Ignoring the updating stage of the adaptive Huffman algorithm when a symbol appears for the first time is the modification which we applied in our method. PABEM results in fewer bit transitions of output code words, lower numbers of switching activities and therefore power consumption reduction. We evaluate PABEM using 30 sources (text files with different sizes), and show that it is possible to reduce the numbers of bit transitions and bus power dissipation about 49% and 46% in comparison to adaptive Huffman coding respectively.

Abstract: Transmission of audio-video data over internet applications like Multimedia is increasing with fast pace. Biometric, Content Based Image Retrieval (CBIR), CCTV footage applications require huge storage of images in database. For such applications this combination of half tone with Huffman coding is useful. Half toning is lossy technique used in printing industry where binary image is required. Objective of achieving higher Compression Ratio by combining lossy half tone and lossless Modified Huffman coding techniques is used. Apart from standard operator like Floyd-Steinberg and Jarvis operators, Small and South-East operator are used. Halftone and Huffman coding technique is implemented on 10 different color images of size 512x512. For measurement of image quality, Mean Square Error (MSE) and Peak Signal-to-Noise Ratio (PSNR) and Structure Similarity Index (SSIM) are used. This hybrid technique can use for low bit rate video data transmission and mass image storage.

Abstract: This paper proposes a 2-tier data hiding technique that involves Exploiting Modification Direction (EMD) method and Huffman Coding. Firstly, a secret message of an arbitrary plain text is encrypted, compressed and transformed into a stream of bits. Subsequently, the bits are converted into secret digits by using the Huffman dictionary table. Secondly, a cover image is segmented into groups of n pixels and each group is embedded with one secret digit by modifying one gray-scale value at most to hide the secret digit in (2n+1)-ary notational system. The experimental results have shown that both PSNR and payload of the proposed method are higher than that of well-known methods namely, OPAP, EMD and Opt EMD.

Abstract: A context adaptive tri-element Run length coding algorithm and an Exp-Golomb coding alogorithm were introduced.The Run-length coding was used to model the image wavelet coefficients and the Region of Interest(ROI) mask and to yield tri-element codes.Then,the conventional Exp-Golomb coding was expanded to encode tri-element codes from Run-length coding and to carry the ROI mask together.Based on the two algorithms above,a high efficient algorithm to distinguish the ROI and background was obtained and a ROI codec framework was proposed.The framework includes 5/3 wavelet transform,wavelet domain mask generation,non-uniform optimal quantization,context adaptive tri-element Run-length coding and generalized Exp-Golomb coding.The tri-element Run-length coding in this algorithm is brief,and the expanded Exp-Golomb coding can be expressed by a closed formula.Experimental results show that the algorithm supports multiple arbitrary-shaped ROI and the adjustability of the ROI is prior to that of the background region.Furthermore,it achieves higher compressing performance as compared with the BbB-shift based SPIHT compression algorithm.

Abstract: The design of the channel part of a digital communication system (e.g., error correction, modulation) is heavily based on the assumption that the data to be transmitted forms a fair bit stream. However, simple source encoders such as short Huffman codes generate bit streams that poorly match this assumption. As a result, the channel input distribution does not match the original design criteria. In this work, a simple method called half Huffman coding (HALFHC) is developed. HALFHC transforms a Huffman code into a source code whose output is more similar to a fair bit stream. This is achieved by permuting the codewords such that the frequency of 1s at the output is close to 0.5. The permutations are such that the optimality in terms of achieved compression ratio is preserved. HALFHC is applied in a practical example, and the resulting overall system performs better than when conventional Huffman coding is used.

Abstract: The Huffman algorithm is improved in this article,a new method based on "heap sort" is proposed,mainly for the improvement of sorting of building Huffman tree structure in Huffman coding.The minimum value can be found by "heap sort" then the Huffman coding can be achieved.After this improvement,the Modified Huffman Algorithm greatly reduced the number of read and write in memory and improved the response speed 。 So Huffman coding efficiency is improved.Through the analysis of Huffman compression algorithm of JPEG and the simulation experiments adopting 4 JPG files on both the improved and traditional versions of Huffman algorithm,it is indicated that the Compression ratio and Compression time of the improved version is indeed enhanced.

Abstract: In this paper, a new model-based Mandarin-speech coding system is proposed. It employs a prosody-enriched ASR with a hierarchical prosodic model (HPM) to generate from the input speech enriched transcriptions, including linguistic features, prosodic tags and spectral parameters in the encoder. By sending these features to the decoder, we can first reconstruct the prosodic-acoustic features of syllable pitch contour, syllable duration, syllable energy level, and intersyllable pause duration by HPM using the linguistic features and prosodic tags; and then combined with spectral parameters to reconstruct the input speech signal by an HMMbased speech synthesizer. Experimental results show that the reconstructed speech has good quality at a low data rate of 543 bits/s.

Abstract: While the data embedding method [1] is able to achieve high carrier capacity, it is not reversible. In this work, we improve [1] from rewritable to reversible in which case the original content can be completely reconstructed from its manipulated counterpart. The last coefficient from each 8 × 8 block is first encoded using slightly modified Huffman coding method and it is treated as part of the external information. This concatenated information will be embedded as a whole into a DCT compressed content. Although carrier capacity is slightly compromised to accommodate the last coefficients, the carrier capacity is improved by using multiple-base notational system [2]. Quality of the output content is also improved by controlling entries in the quantization table. Experiments were carried out to verify the aforementioned improvements.

Abstract: Run length-Huffman coding(RL-VLC) in JPEG is normally used as entropy coding method for multi-dimensional vector matrix discrete cosine transform(MD-VMDCT).However it can not effectively compress image since there are lots of long run length of quantized coefficients after three-dimensional scan,here an improved RL-VLC coding method was proposed.According to the Huffman code table which is designed by the probability distributions of level and run level combination,this algorithm achieved entropy coding for color image.Experimental results show that the compression efficiency of proposed algorithm is better than traditional Huffman coding,in the case of the same PSNR,the proposed algorithm saves bit rate at least 9%,much better than JPEG,and there are good prospects for the application of higher-dimensional video frames compression.

Abstract: The invention relates to a method for data transmission from a programming appliance to an electronic control appliance, according to which the data to be transmitted is compressed with two different Huffman encoding trees, preferably with a 16-bit and an 8-bit coding tree. The data words encoded with different encoding trees are differentiated by a code bit.

Abstract: PROBLEM TO BE SOLVED: To suppress degradation in image quality in decoding regardless of the state of an imaging unit.SOLUTION: A rate control unit, on the basis of the state of an imaging unit in imaging a coding object image to be coded, adjusts a target code amount which is a target of a code amount when the coding object image is coded, and an orthogonal transform unit, a quantization unit, and a variable-length coding unit code the coding object image in accordance with the adjusted target code amount. The present disclosure can be applied to, for example, a coding device for coding each image obtained through imaging by an imaging unit.

Abstract: Currently information security is becoming more important in data storage and transmission. Images are broadly used in several processes. Therefore, the protection of image data from unauthorized access is essential. Image encryption plays a major role in the field of information hiding. The objective of this paper is to provide an efficient coding technique for compress the encrypted gray scale images without any loss. This is made possible by using Huffman coding. This paper uses resolution-progressive compression (RPC) technique to achieve better result. RPC compresses an encrypted image progressively in resolution, such that the decoder can observe a low-resolution version of the image, study local statistics based on it, and use the statistics to decode the next resolution level. The experimental results show that the method used in this paper for compression gives good result.

Abstract: Re-encoding of once compressed files is one of the difficult challenges in measuring the efficiency of coding methods. Variable length coding with a variable source delimiting scheme is a promising method for improving re-encoding efficiency. Analyses of coded files with fixed length delimiting and with variable length delimiting are reviewed. Motion vector codes of MPEG-2 encoded files are modified as a variable-to-variable coding point of view. Length, bit-rates, and varieties of videos are examined. One of the largest file is 16 seconds of D1 full size at 720 ×480, and in total, the length of videos used in the experiments is more than 750 seconds. By coding using Huffman codes and arithmetic codes, an improvement of more than 20% in coding efficiency over the conventional MPEG-2 is obtained. Because the proposed method is a lossless re-encoding, the video quality is the same as before.

Abstract: In this paper, we proposed and implemented a dedicated hardware for Huffman coding which is a method of entropy coding to use compressing multimedia data with video coding. The proposed Huffman codec consists Huffman encoder and decoder. The Huffman encoder converts symbols to Huffman codes using look-up table. The Huffman code which has a variable length is packetized to a data format with 32 bits in data packeting block and then sequentially output in unit of a frame. The Huffman decoder converts serial bitstream to original symbols without buffering using FSM(finite state machine) which has a tree structure. The proposed hardware has a flexible operational property to program encoding and decoding hardware, so it can operate various Huffman coding. The implemented hardware was implemented in Cyclone III FPGA of Altera Inc., and it uses 3725 LUTs in the operational frequency of 365MHz