The high quality of the image produced by CT scan and MRI techniques is required to be maintained in order to avoid wrong diagnosis along with reduced file size. A lossless compression technique retains the image quality but achieves low to moderate compression ratio. Lossy compression, on the other hand, provides higher compression at the cost of degraded image quality. Thus there is need of i...

Two approaches to reducing effort in switch-based text entry for augmentative and alternative communication devices are word prediction and efficient coding schemes, such as Huffman. However, character distributions that inform the latter have never accounted for the use of the former. In this paper, we provide the first combination of Huffman codes and word prediction, using both trigram and l...

Minimum-redundancy prefix codes have been a mainstay of research and commercial compression systems since their discovery by David Huffman more than 50 years ago. In this experimental evaluation we compare techniques for decoding minimum-redundancy codes, and quantify the relative benefits of recently developed restricted codes that are designed to accelerate the decoding process. We find that ...

The growth of various types information happens day by day. increased production data, in turn, led to the invention data storage tools. idea storing DNA is now one major focuses. There are so many methods for DNA, method put forward Nick Goldman and Evan Birney has advantages over other methods. They had converted binary form into ternary using improved Huffman coding base 3. This helped reduc...

We will show that • the entropy for a random variable gives a lower bound on the number of bits needed per character for a binary coding • Huffman codes are optimal in the average number of bits used per character among binary codes • the average bits per character used by Huffman codes is close to the entropy of the underlying random variable • one can get arbitrarily close to the entropy of a...

This paper presents a scalable FPGA/ASIC implementation architecture for high-speed parallel table-lookup-coding using multiported content addressable memory, aiming at facilitating effective tablelookup-coding solutions. The multi-ported CAM adopts a Flexible Multiported Content Addressable Memory (FMCAM) technology, which represents an effective parallel processing architecture and was previo...

We describe a class of prefix-free codes for the nonnegative integers. We apply a family of codes in this class to the problem of runlength coding, specifically as part of an adaptive algorithm for compressing quantized subbands of wavelettransformed images. On test images, our adaptive coding algorithm is shown to give compression effectiveness comparable to the best performance achievable by ...

Here is proposed a review of the different choices to structure spike trains, using deterministic metrics. Temporal constraints observed in biological or computational spike trains are first taken into account The relation with existing neural codes (rate coding, rank coding, phase coding, ..) is then discussed. To which extend the “neural code” contained in spike trains is related to a metric ...

Interframe transform coding is affected not only by the statistics of spatial details within a frame, but also by the variation of the amount of movement and other temporal activities in different regions of the image sequence. Therefore, adaptive techniques have to be used in order to achieve good image quality. In this paper, we propose a new version of the adaptive interframe coding method, ...