Application of Bandelet Transform in Image and Video Compression

The need for large-scale storage and transmission of data is growing exponentially With the widespread use of computers so that efficient ways of storing data have become important. With the advancement of technology, the world has found itself amid a vast amount of information. An efficient method has to be generated to deal with such amount of information. Data compression is a technique which minimizes the size of a file keeping the quality same as previous. So more amount of data can be stored in memory space with the help of data compression. There are various image compression standards such as JPEG, which uses discrete cosine transform technique and JPEG 2000 which uses discrete wavelet transform technique. The discrete cosine transform gives excellent compaction for highly correlated information. The computational complexity is very less as it has better information packing ability. However, it produces blocking artifacts, graininess, and blurring in the output which is overcome by the discrete wavelet transform. The image size is reduced by discarding values less than a prespecified quantity without losing much information. But it also has some limitations when the complexity of the image increases. Wavelets are optimal for point singularity however for line singularities and curve singularities these are not optimal. They do not consider the image geometry which is a vital source of redundancy. Here we analyze a new type of bases known as bandelets which can be constructed from the wavelet basis which takes an important source of regularity that is the geometrical redundancy.The image is decomposed along the direction of geometry. It is better as compared to other methods because the geometry is described by a flow vector rather than edges. it indicates the direction in which the intensity of image shows a smooth variation. It gives better compression measure compared to wavelet bases. A fast subband coding is used for the image decomposition in a bandelet basis. It has been extended for video compression. The bandelet transform based image and video compression method compared with the corresponding wavelet scheme. Different performance measure parameters such as peak signal to noise ratio, compression ratio (PSNR), bits per pixel (bpp) and entropy are evaluated for both Image and video compression

Multi-scale Analysis based Image Fusion

Image fusion provides a better view than that provided by any of the individual source images. The aim of multi-scale analysis is to find a kind of optimal representation for high dimensional information expression. Based on the nonlinear approximation, the principle and ways of image fusion are studied, and its development, current and future challenges are reviewed in this paper.The 2nd International Conference on Intelligent Systems and Image Processing 2014 (ICISIP2014), September 26-29, 2014, Nishinippon Institute of Technology, Kitakyushu, Japa

Multi-scale Analysis based Image Fusion

The 2nd International Conference on Intelligent Systems and Image Processing 2014 (ICISIP2014), September 26-29, 2014, Nishinippon Institute of Technology, Kitakyushu, JapanImage fusion provides a better view than that provided by any of the individual source images. The aim of multi-scale analysis is to find a kind of optimal representation for high dimensional information expression. Based on the nonlinear approximation, the principle and ways of image fusion are studied, and its development, current and future challenges are reviewed in this paper

Bandelettes et représentation géométrique des images

Les bases de bandelettes décomposent une image selon des vecteurs multiéchelles allongés le long d'un flot géométrique indiquant des directions de régularité de l'image. L'optimisation de cette géométrie est faite par un algorithme rapide de meilleur base qui permet d'obtenir des résultats de compression

A Hierarchical Bayesian Model for Frame Representation

In many signal processing problems, it may be fruitful to represent the signal under study in a frame. If a probabilistic approach is adopted, it becomes then necessary to estimate the hyper-parameters characterizing the probability distribution of the frame coefficients. This problem is difficult since in general the frame synthesis operator is not bijective. Consequently, the frame coefficients are not directly observable. This paper introduces a hierarchical Bayesian model for frame representation. The posterior distribution of the frame coefficients and model hyper-parameters is derived. Hybrid Markov Chain Monte Carlo algorithms are subsequently proposed to sample from this posterior distribution. The generated samples are then exploited to estimate the hyper-parameters and the frame coefficients of the target signal. Validation experiments show that the proposed algorithms provide an accurate estimation of the frame coefficients and hyper-parameters. Application to practical problems of image denoising show the impact of the resulting Bayesian estimation on the recovered signal quality

RGB Medical Video Compression Using Geometric Wavelet

The video compression is used in a wide of applications from medical domain especially in telemedicine. Compared to the classical transforms, wavelet transform has significantly better performance in horizontal, vertical and diagonal directions. Therefore, this transform introduces high discontinuities in complex geometrics. However, to detect complex geometrics is one key challenge for the high efficient compression. In order to capture anisotropic regularity along various curves a new efficient and precise transform termed by bandelet basis, based on DWT, quadtree decomposition and optical flow is proposed in this paper. To encode significant coefficients we use efficient coder SPIHT. The experimental results show that the proposed algorithm DBT-SPIHT for low bit rate (0.3Mbps) is able to reduce up to 37.19% and 28.20% of the complex geometrics detection compared to the DWT-SPIHT and DCuT-SPIHT algorithm

Moments-Based Fast Wedgelet Transform

In the paper the moments-based fast wedgelet transform has been presented. In order to perform the classical wedgelet transform one searches the whole wedgelets’ dictionary to find the best matching. Whereas in the proposed method the parameters of wedgelet are computed directly from an image basing on moments computation. Such parameters describe wedgelet reflecting the edge present in the image. However, such wedgelet is not necessarily the best one in the meaning of Mean Square Error. So, to overcome that drawback, the method which improves the matching result has also been proposed. It works in the way that the better matching one needs to obtain the longer time it takes. The proposed transform works in linear time with respect to the number of pixels of the full quadtree decomposition of an image. More precisely, for an image of size N ×N pixels the time complexity of the proposed wedgelet transform is O(N2 log2 N)

Rate-Distortion Analysis of Multiview Coding in a DIBR Framework

Depth image based rendering techniques for multiview applications have been recently introduced for efficient view generation at arbitrary camera positions. Encoding rate control has thus to consider both texture and depth data. Due to different structures of depth and texture images and their different roles on the rendered views, distributing the available bit budget between them however requires a careful analysis. Information loss due to texture coding affects the value of pixels in synthesized views while errors in depth information lead to shift in objects or unexpected patterns at their boundaries. In this paper, we address the problem of efficient bit allocation between textures and depth data of multiview video sequences. We adopt a rate-distortion framework based on a simplified model of depth and texture images. Our model preserves the main features of depth and texture images. Unlike most recent solutions, our method permits to avoid rendering at encoding time for distortion estimation so that the encoding complexity is not augmented. In addition to this, our model is independent of the underlying inpainting method that is used at decoder. Experiments confirm our theoretical results and the efficiency of our rate allocation strategy