33 research outputs found
Space-frequency quantization for image compression with directionlets
The standard separable 2-D wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth images. However, it fails to efficiently capture 1-D discontinuities, like edges or contours. These features, being elongated and characterized by geometrical regularity along different directions, intersect and generate many large magnitude wavelet coefficients. Since contours are very important elements in the visual perception of images, to provide a good visual quality of compressed images, it is fundamental to preserve good reconstruction of these directional features. In our previous work, we proposed a construction of critically sampled perfect reconstruction transforms with directional vanishing moments imposed in the corresponding basis functions along different directions, called directionlets. In this paper, we show how to design and implement a novel efficient space-frequency quantization (SFQ) compression algorithm using directionlets. Our new compression method outperforms the standard SFQ in a rate-distortion sense, both in terms of mean-square error and visual quality, especially in the low-rate compression regime. We also show that our compression method, does not increase the order of computational complexity as compared to the standard SFQ algorithm
Wavelet Based Image Coding Schemes : A Recent Survey
A variety of new and powerful algorithms have been developed for image
compression over the years. Among them the wavelet-based image compression
schemes have gained much popularity due to their overlapping nature which
reduces the blocking artifacts that are common phenomena in JPEG compression
and multiresolution character which leads to superior energy compaction with
high quality reconstructed images. This paper provides a detailed survey on
some of the popular wavelet coding techniques such as the Embedded Zerotree
Wavelet (EZW) coding, Set Partitioning in Hierarchical Tree (SPIHT) coding, the
Set Partitioned Embedded Block (SPECK) Coder, and the Embedded Block Coding
with Optimized Truncation (EBCOT) algorithm. Other wavelet-based coding
techniques like the Wavelet Difference Reduction (WDR) and the Adaptive Scanned
Wavelet Difference Reduction (ASWDR) algorithms, the Space Frequency
Quantization (SFQ) algorithm, the Embedded Predictive Wavelet Image Coder
(EPWIC), Compression with Reversible Embedded Wavelet (CREW), the Stack-Run
(SR) coding and the recent Geometric Wavelet (GW) coding are also discussed.
Based on the review, recommendations and discussions are presented for
algorithm development and implementation.Comment: 18 pages, 7 figures, journa
Wavelet Based Color Image Compression and Mathematical Analysis of Sign Entropy Coding
International audienceOne of the advantages of the Discrete Wavelet Transform (DWT) compared to Fourier Transform (e.g. Discrete Cosine Transform DCT) is its ability to provide both spatial and frequency localization of image energy. However, WT coefficients, like DCT coefficients, are defined by magnitude as well as sign. While algorithms exist for the coding of wavelet coefficients magnitude, there are no efficient for coding their sign. In this paper, we propose a new method based on separate entropy coding of sign and magnitude of wavelet coefficients. The proposed method is applied to the standard color test images Lena, Peppers, and Mandrill. We have shown that sign information of wavelet coefficients as well for the luminance as for the chrominance, and the refinement information of the quantized wavelet coefficients may not be encoded by an estimated probability of 0.5. The proposed method is evaluated; the results obtained are compared to JPEG2000 and SPIHT codec. We have shown that the proposed method has significantly outperformed the JPEG2000 and SPIHT codec as well in terms of PSNR as in subjective quality. We have proved, by an original mathematical analysis of the entropy, that the proposed method uses a minimum bit allocation in the sign information coding
Consolidating Literature for Images Compression and Its Techniques
With the proliferation of readily available image content, image compression has become a topic of considerable importance. As, rapidly increase of digital imaging demand, storage capability aspect should be considered. Therefore, image compression refers to reducing the size of image for minimizing storage without harming the image quality. Thus, an appropriate technique is needed for image compression for saving capacity as well as not losing valuable information. This paper consolidates literature whose characteristics have focused on image compression, thresholding algorithms, quantization algorithms. Later, related research on these areas are presented
The Effect on Compressed Image Quality using Standard Deviation-Based Thresholding Algorithm
In recent decades, digital images have become increasingly important. With many modern applications use image graphics extensively, it tends to burden both the storage and transmission process. Despite the technological advances in storage and transmission, the demands placed on storage and bandwidth capacities still exceeded its availability. Compression is one of the solutions to this problem but elimination some of the data degrades the image quality. Therefore, the Standard Deviation-Based Thresholding Algorithm is proposed to estimate an accurate threshold value for a better-compressed image quality. The threshold value is obtained by examining the wavelet coefficients dispersion on each wavelet subband using Standard Deviation concept. The resulting compressed image shows a better image quality with PSNR value above 40dB
Peak Transform for Efficient Image Representation and Coding
Digital Object Identifier 10.1109/TIP.2007.896599In this work, we introduce a nonlinear geometric transform, called peak transform (PT), for efficient image representation
and coding. The proposed PT is able to convert
high-frequency signals into low-frequency ones, making them much easier to be compressed. Coupled with wavelet transform
and subband decomposition, the PT is able to significantly reduce signal energy in high-frequency subbands and achieve a significant transform coding gain. This has important applications in efficient
data representation and compression. To maximize the transform coding gain, we develop a dynamic programming solution for
optimum PT design. Based on PT, we design an image encoder, called the PT encoder, for efficient image compression. Our extensive
experimental results demonstrate that, in wavelet-based subband decomposition, the signal energy in high-frequency subbands can be reduced by up to 60% if a PT is applied. The
PT image encoder outperforms state-of-the-art JPEG2000 and H.264 (INTRA) encoders by up to 2-3 dB in peak signal-to-noise ratio (PSNR), especially for images with a significant amount
of high-frequency components. Our experimental results also show that the proposed PT is able to efficiently capture and preserve high-frequency image features (e.g., edges) and yields significantly improved visual quality
Vector extension of monogenic wavelets for geometric representation of color images
14 pagesInternational audienceMonogenic wavelets offer a geometric representation of grayscale images through an AM/FM model allowing invariance of coefficients to translations and rotations. The underlying concept of local phase includes a fine contour analysis into a coherent unified framework. Starting from a link with structure tensors, we propose a non-trivial extension of the monogenic framework to vector-valued signals to carry out a non marginal color monogenic wavelet transform. We also give a practical study of this new wavelet transform in the contexts of sparse representations and invariant analysis, which helps to understand the physical interpretation of coefficients and validates the interest of our theoretical construction
Hybrid Neural Network Predictive-Wavelet Image Compression System
This paper considers a novel image compression technique called hybrid predictive wavelet coding. The
new proposed technique combines the properties of predictive coding and discrete wavelet coding. In
contrast to JPEG2000, the image data values are pre-processed using predictive coding to remove interpixel
redundancy. The error values, which are the difference between the original and the predicted
values, are discrete wavelet coding transformed. In this case, a nonlinear neural network predictor is
utilised in the predictive coding system. The simulation results indicated that the proposed technique
can achieve good compressed images at high decomposition levels in comparison to JPEG2000
Directional Transforms for Video Coding Based on Lifting on Graphs
In this work we describe and optimize a general scheme based on lifting transforms on graphs for video coding. A graph is constructed to represent the video signal. Each pixel becomes a node in the graph and links between nodes represent similarity between them. Therefore, spatial neighbors and temporal motion-related pixels can be linked, while nonsimilar pixels (e.g., pixels across an edge) may not be. Then, a lifting-based transform, in which filterin operations are performed using linked nodes, is applied to this graph, leading to a 3-dimensional (spatio-temporal) directional transform which can be viewed as an extension of wavelet transforms for video. The design of the proposed scheme requires four main steps: (i) graph construction, (ii) graph splitting, (iii) filte design, and (iv) extension of the transform to different levels of decomposition. We focus on the optimization of these steps in order to obtain an effective transform for video coding. Furthermore, based on this scheme, we propose a coefficien reordering method and an entropy coder leading to a complete video encoder that achieves better coding performance than a motion compensated temporal filterin wavelet-based encoder and a simple encoder derived from H.264/AVC that makes use of similar tools as our proposed encoder (reference software JM15.1 configu ed to use 1 reference frame, no subpixel motion estimation, 16 Ă— 16 inter and 4 Ă— 4 intra modes).This work was supported in part by NSF under grant CCF-1018977 and by Spanish Ministry of Economy and Competitiveness under grants TEC2014-53390-P and TEC2014-52289-R.Publicad