A novel approach for the lossless compression of gray images is presented. A prediction process is performed followed by the mapping of prediction residuals. The prediction residuals are then split into bit–planes. Twodimensional (2D) differencing operation is applied to bitplanes prior to segmentation and classification. Performing an Exclusive-OR logic operation between neighboring pixels in ...

This paper presents a novel approach to the fast localization and extraction of optic disc from fundus images of the human retina. Optic disc continues to be a major landmark for fundus image registration and is indispensible for the understanding of retinal fundus images. For the detection of optic disc, we first decompose the image into its bit planes. The lower order bit planes are found to ...

The paper presents a new digital image hiding algorithm based on wavelet packets transform and singular value decomposition. The low-frequency sub-band of wavelet packets transform has strong antijamming capacity and the singular value has very strong stability. The presented algorithm implements bit plane decomposition on the secret image and wavelet packet decomposition on the carrier image. ...

The most important requirement of watermarking system is the quality of watermarked image. In most applications, the watermarking algorithm must embed the watermark such that this does not affect the quality of the underlying host data. In order to improve the quality of watermarked image of the bit-plane model, the watermark object will be inserted to the selected bit-plane and the other 7 bit...

The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary of atoms, generating a sequence of pairs specifying the atoms used and their corresponding coefficients. A particular rate distortion trade-off is achieved by setting both the number of atoms and the quantizers of the...

Binary descriptors have been instrumental in the recent evolution of computationally efficient sparse image alignment algorithms. Increasingly, however, the vision community is interested in dense image alignment methods, which are more suitable for estimating correspondences from high frame rate cameras as they do not rely on exhaustive search. However, classic dense alignment approaches are s...

A new approach to improving block truncation coding for gray-scale image compression is proposed. A set of line and edge bit planes is defined independently of input images and adaptively selected to yield lower bit rates and better reconstructed image quality.

We have developed a scalable image compression scheme with a good performance-complexity trade-off. Like JPEG, it is based on the 8 × 8 block discrete cosine transform (DCT), but it uses no additional quantization or entropy coding (such as Huffman or arithmetic coding). Bitrate or quality scalability is enabled by encoding the DCT coefficients bit plane by bit plane, starting at the most signi...

Modified two-bit transform based block motion estimation is presented in this paper. Initially video frames are converted into two-bit representations using the two-bit transform (2BT) and binary block based motion estimation is performed using these two bit-planes. Modification to the original 2BT based motion estimation scheme is introduced by conditional local or full searches using the MAD ...