891 research outputs found
Adaptive gradient-based block compressive sensing with sparsity for noisy images
This paper develops a novel adaptive gradient-based block compressive sensing (AGbBCS_SP) methodology for noisy image compression and reconstruction. The AGbBCS_SP approach splits an image into blocks by maximizing their sparsity, and reconstructs images by solving a convex optimization problem. In block compressive sensing, the commonly used square block shapes cannot always produce the best results. The main contribution of our paper is to provide an adaptive method for block shape selection, improving noisy image reconstruction performance. The proposed algorithm can adaptively achieve better results by using the sparsity of pixels to adaptively select block shape. Experimental results with different image sets demonstrate that our AGbBCS_SP method is able to achieve better performance, in terms of peak signal to noise ratio (PSNR) and computational cost, than several classical algorithms
Audio Compression using a Modified Vector Quantization algorithm for Mastering Applications
Audio data compression is used to reduce the transmission bandwidth and storage requirements of audio data. It is the second stage in the audio mastering process with audio equalization being the first stage. Compression algorithms such as BSAC, MP3 and AAC are used as standards in this paper. The challenge faced in audio compression is compressing the signal at low bit rates. The previous algorithms which work well at low bit rates cannot be dominant at higher bit rates and vice-versa. This paper proposes an altered form of vector quantization algorithm which produces a scalable bit stream which has a number of fine layers of audio fidelity. This modified form of the vector quantization algorithm is used to generate a perceptually audio coder which is scalable and uses the quantization and encoding stages which are responsible for the psychoacoustic and arithmetical terminations that are actually detached as practically all the data detached during the prediction phases at the encoder side is supplemented towards the audio signal at decoder stage. Therefore, clearly the quantization phase which is modified to produce a bit stream which is scalable. This modified algorithm works well at both lower and higher bit rates. Subjective evaluations were done by audio professionals using the MUSHRA test and the mean normalized scores at various bit rates was noted and compared with the previous algorithms
Identification of Sparse Audio Tampering Using Distributed Source Coding and Compressive Sensing Techniques
In the past few years, a large amount of techniques have been proposed to identify whether a multimedia content has been illegally tampered or not. Nevertheless, very few efforts have been devoted to identifying which kind of attack has been carried out, especially due to the large data required for this task. We propose a novel hashing scheme which exploits the paradigms of compressive sensing and distributed source coding to generate a compact hash signature, and we apply it to the case of audio content protection. The audio content provider produces a small hash signature by computing a limited number of random projections of a perceptual, time-frequency representation of the original audio stream; the audio hash is given by the syndrome bits of an LDPC code applied to the projections. At the content user side, the hash is decoded using distributed source coding tools. If the tampering is sparsifiable or compressible in some orthonormal basis or redundant dictionary, it is possible to identify the time-frequency position of the attack, with a hash size as small as 200 bits/second; the bit saving obtained by introducing distributed source coding ranges between 20% to 70%
Image Compressive Sensing Recovery Using Adaptively Learned Sparsifying Basis via L0 Minimization
From many fewer acquired measurements than suggested by the Nyquist sampling
theory, compressive sensing (CS) theory demonstrates that, a signal can be
reconstructed with high probability when it exhibits sparsity in some domain.
Most of the conventional CS recovery approaches, however, exploited a set of
fixed bases (e.g. DCT, wavelet and gradient domain) for the entirety of a
signal, which are irrespective of the non-stationarity of natural signals and
cannot achieve high enough degree of sparsity, thus resulting in poor CS
recovery performance. In this paper, we propose a new framework for image
compressive sensing recovery using adaptively learned sparsifying basis via L0
minimization. The intrinsic sparsity of natural images is enforced
substantially by sparsely representing overlapped image patches using the
adaptively learned sparsifying basis in the form of L0 norm, greatly reducing
blocking artifacts and confining the CS solution space. To make our proposed
scheme tractable and robust, a split Bregman iteration based technique is
developed to solve the non-convex L0 minimization problem efficiently.
Experimental results on a wide range of natural images for CS recovery have
shown that our proposed algorithm achieves significant performance improvements
over many current state-of-the-art schemes and exhibits good convergence
property.Comment: 31 pages, 4 tables, 12 figures, to be published at Signal Processing,
Code available: http://idm.pku.edu.cn/staff/zhangjian/ALSB
- …