For storing a word or the whole text segment, we need a huge storage space. Typically a character requires 1 Byte for storing it in memory. Compression of the memory is very important for data management. In case of memory requirement compression for text data, loseless memory compression is needed. We are suggesting a lossless memory requirement compression method for text data compression. Th...

Since context-based adaptive binary arithmetic coding (CABAC) as the entropy coding method in H.264/AVC was originally designed for lossy video compression, it is inappropriate for lossless video compression. Based on the fact that there are statistical differences of residual data between lossy and lossless video compression, we propose an efficient differential pixel value coding method in CA...

In this paper, new methods to improve the encoding of connectivity and geometry of the topological surgery scheme are proposed. In connectivity compression, after obtaining the vertex and triangle spanning trees by decomposing a threedimensional object, bits are adaptively allocated to each run of two spanning trees on a threshold basis. The threshold is the length of a binary number of the max...

Context Adaptive Variable Length Coding (CAVLC) is one of the widely used entropy encoding algorithms in Video Compression standards especially in H.264/AVC. The conventional CAVLC generates a binary sequence from the Transformed and Quantized coefficients; this binary code consists of five parts namely, Total Coefficients, Trailing ones, Levels, Run Before and Total Zeros. A new method, Positi...

In this paper, a new method for image compression is proposed whose quality is demonstrated through accurate 3D reconstruction from 2D images. The method is based on the discrete cosine transform (DCT) together with a high-frequency minimization encoding algorithm at compression stage and a new concurrent binary search algorithm at decompression stage. The proposed compression method consists o...

In this paper we evaluate two lossy compression methods, JPEG and SPIHT, using a metric computation system which evaluates the distortion eeects of lossy compression as it aaects the task of target segmentation with morphological ltering. Using Forward Looking Infrared Radar (FLIR) images to develop the approach, our goal is to contrast the results of the identical tasks with and without compre...

In this paper, we investigated on how to combine M-ary modulation with shortened Reed-Solomon (RS) codes, in the context of spatial spread spectrum based watermarking schemes. Analytical expressions and bounds for the bit error rate are derived and compared with empirical results for several types of images. It is shown that, for low output error rates, there exists an improvement in performanc...

Suux array is a widely used full-text index that allows fast searches on the text. It is constructed by sorting all suuxes of the text in the lexicographic order and storing pointers to the suuxes in this order. Binary search is used for fast searches on the suux array. Compact suux array is a compressed form of the suux array that still allows binary searches, but the search times are also dep...