In this paper, we have assigned a unique range for both, a number of characters and groups using the characters. Long textual message which have to encrypt, is subdivided into a number of groups with n characters. The...
详细信息
ISBN:
(纸本)9783642178771
In this paper, we have assigned a unique range for both, a number of characters and groups using the characters. Long textual message which have to encrypt, is subdivided into a number of groups with n characters. Then the group of characters is encrypted into two floating point numbers by using arithmetic coding, where they are automatically compressed. Depending on key, the data bits from text are placed to some suitable nonlinear pixel and bit positions about the image. In the proposed technique, the key characters are alphanumeric and key length is also variable. Using the symmetric key technique again they are decrypted into original text message from the watermarked image.
The translational motion model can't effectively model complex motion such as scaling, shearing and rotation. That is why more complex motion models like the affine model have been proposed. However, affine motion...
详细信息
ISBN:
(纸本)9781424407286
The translational motion model can't effectively model complex motion such as scaling, shearing and rotation. That is why more complex motion models like the affine model have been proposed. However, affine motion vectors (AMV)s are more complicated to encode than the translational motion vectors. In this paper we propose several context-coder solutions based on our novel context type limited exhaustive search simulation. As a result the average compression gains of 7.9%, 5.9%, and 9.6%, for Mobile, Cost Guard, and Modified Mobile video sequences were respectively realized, with peek compression improvements of 13%. In addition, our simulation is described and successfully compared with [1].
Binary image compression is desirable for a wide range of applications, such as digital libraries, map archives, fingerprint databases, facsimile, etc. In this paper, we present a new highly efficient algorithm for lo...
详细信息
ISBN:
(纸本)9781424400379
Binary image compression is desirable for a wide range of applications, such as digital libraries, map archives, fingerprint databases, facsimile, etc. In this paper, we present a new highly efficient algorithm for lossless binary image compression. The proposed algorithm introduces a new method, Direct Redundancy Elimination, to efficiently exploit the two-dimensional redundancy of an image, as well as a novel Dynamic Context Model to improve the efficiency of arithmetic coding. Simulation results show that the proposed algorithm has comparable compression ratio to JBIG standard. In many cases, the proposed algorithm outperforms the JBIG standard.
In this paper we propose a novel efficient adaptive binary arithmetic coder which is multiplication-free and requires no look-up tables. To achieve this, we combine the probability estimation based on a virtual slidin...
详细信息
ISBN:
(纸本)9781467325332;9781467325349
In this paper we propose a novel efficient adaptive binary arithmetic coder which is multiplication-free and requires no look-up tables. To achieve this, we combine the probability estimation based on a virtual sliding window with the approximation of multiplication and the use of simple operations to calculate the next approximation after the encoding of each binary symbol. We show that the proposed algorithm is faster and provides a better compression efficiency compared to the M-coder in the CABAC entropy coding scheme of the H.264/AVC video coding standard.
In view of the contradiction between massive data of road 3D scene and bandwidth of current network transmission, a data real-time compression method for massive 3D road scene is proposed. Firstly, three-dimensional c...
详细信息
ISBN:
(纸本)9783037858042
In view of the contradiction between massive data of road 3D scene and bandwidth of current network transmission, a data real-time compression method for massive 3D road scene is proposed. Firstly, three-dimensional coordinates are reduced to two-dimensional by localization. The bit rate is also significantly reduced by relative treatment. Secondly, the inter-frame prediction method applicable to road scene rendering is proposed in order to reduce data redundancy of adjacent stations. Thirdly, a lossless and high compact data format is defined to store the coordinates for road scene network transmission. Finally, the bit stream is further compressed by using adaptive arithmetic coding and thus higher compression ratio is obtained. Applications show that this compression method meets the requirements of road scene real-time network transmission.
The hyperspectral data compression framework to well investigate various compression models is presented. Results received with arithmetic encoder, context-adaptive QM-encoder, adaptive Huffman encoder are adduced. As...
详细信息
ISBN:
(纸本)9783319542201;9783319542195
The hyperspectral data compression framework to well investigate various compression models is presented. Results received with arithmetic encoder, context-adaptive QM-encoder, adaptive Huffman encoder are adduced. As a test data the Maine frame set from the AVIRIS freely available data was used. The received results testify the efficiency of the proposed framework in comparison with some alternative lossless compression algorithms.
This paper proposes a low-complexity and high-throughput decoder (D_LBAC) based on Logarithmic Binary arithmetic coding (LBAC). The proposed D_LBAC has high throughput and low complexity. It does not use multiplicatio...
详细信息
ISBN:
(纸本)9781479983391
This paper proposes a low-complexity and high-throughput decoder (D_LBAC) based on Logarithmic Binary arithmetic coding (LBAC). The proposed D_LBAC has high throughput and low complexity. It does not use multiplication and division operations nor look up tables (LUTs). The proposed D_LBAC is a simple algorithm structure and only requires additions and shift operations. Experimental results show it can decode 3.5 symbols per cycle on average. The hardware implementation design described in this paper can achieve the high symbol processing capability and the low hardware costs.
This paper presents an improved MAP decoder to be used for joint source-channel arithmetic decoding for H.264 symbols. The proposed decoder uses not only the intentional redundancy inserted via a forbidden symbol but ...
详细信息
ISBN:
(纸本)9781628418293
This paper presents an improved MAP decoder to be used for joint source-channel arithmetic decoding for H.264 symbols. The proposed decoder uses not only the intentional redundancy inserted via a forbidden symbol but also exploits residual redundancy by a syntax checker. A breadth-first suboptimal sequential MAP decoder is employed. The decoder eliminates paths in the decoding tree that result in invalid syntax or that decode a forbidden symbol. In contrast to previous methods, this is done as each channel bit is decoded. Simulations using intra prediction modes show improvements in error rates, for example, syntax element error rate reduction by an order of magnitude for channel SNR of 7.33dB. The cost of this improvement is more computational complexity spent on the syntax checking.
Much discussion and research has been done on compression algorithms but not many have gone to the extent of developing an application that can test and compare various compression algorithms with each other. In this ...
详细信息
ISBN:
(纸本)9781538664773
Much discussion and research has been done on compression algorithms but not many have gone to the extent of developing an application that can test and compare various compression algorithms with each other. In this paper, we present an application known as the CMedia Compressor, that tests and compares various compression algorithms. The application shows that adaptive Huffman and arithmetic coding tend to outperform the others such as the Run-length encoding (RLE), Huffman coding, arithmetic coding (AC) and Lempel-Ziv-Welch (LZW) methods. Results obtained from this study are discussed and also presented graphically. The study's results indicates that arithmetic coding yields higher space-savings than Huffman coding and Adaptive Huffman coding.
In this paper, we propose an effective sequential lossless compression scheme which performs sequentially pixel by pixel in raster-scan order. The proposed method has three major components: a causal interpolation mod...
详细信息
ISBN:
(纸本)9781424448562
In this paper, we propose an effective sequential lossless compression scheme which performs sequentially pixel by pixel in raster-scan order. The proposed method has three major components: a causal interpolation module, a fixed predictor and context based adaptive arithmetic coder. The causal interpolation module estimates the values of past pixels in the context which are the same color as current predicted pixel. The predictor which is based on IF-THEN structure exploits structural redundancies between mosaic-like color components, and its residuals are well-modeled by a two-side geometry distribution centered at zero. An advantage of the proposed compression method is the clear separation between prediction and entropy coding of prediction errors. Finally, an effective and efficient arithmetic coder can be easily interfaced with our predictor. Experimental results show that our method outperforms all other evaluated schemes in all testing images in term of bit-rate while maintains modest complexity level.
暂无评论