Delay-Coordinates Embeddings as a Data Mining Tool for Denoising Speech Signals

In this paper we utilize techniques from the theory of non-linear dynamical systems to define a notion of embedding threshold estimators. More specifically we use delay-coordinates embeddings of sets of coefficients of the measured signal (in some chosen frame) as a data mining tool to separate structures that are likely to be generated by signals belonging to some predetermined data set. We describe a particular variation of the embedding threshold estimator implemented in a windowed Fourier frame, and we apply it to speech signals heavily corrupted with the addition of several types of white noise. Our experimental work seems to suggest that, after training on the data sets of interest,these estimators perform well for a variety of white noise processes and noise intensity levels. The method is compared, for the case of Gaussian white noise, to a block thresholding estimator

A Survey of Image Denoising Algorithms

Images play an important role in conveying important information but the images received after transmission are often corrupted and deviate from the original value. When an Image is formed various factors such as lighting spectra, source, intensity and camera Characteristics (sensor response, lenses) affect the image. The major factor that reduces the quality of the image is Noise. It hides the important details of images and changes value of image pixels at key locations causing blurring and various other deformities. We have to remove noises from the images without loss of any image information. Noise removal is the preprocessing stage of image processing. There are many types of noises which corrupt the images. These noises are appeared on images in different ways: at the time of acquisition due to noisy sensors, due to faulty scanner or due to faulty digital camera, due to transmission channel errors, due to corrupted storage media. The image needs image denoising before it can be used in applications to obtain accurate results. Various types of noises that create fault in image are discussed. Many image denoising algorithms exist none of them are universal and their performance largely depends upon the type of image and the type of noise. In this paper we will be discussing some of the image denoising algorithms and comparing them with each other. A quantitative measure of the image denoising algorithms is provided by the signal to noise ratio and the computation time of various algorithms working on a provided noisy image

Low Bit-rate Color Video Compression using Multiwavelets in Three Dimensions

In recent years, wavelet-based video compressions have become a major focus of research because of the advantages that it provides. More recently, a growing thrust of studies explored the use of multiple scaling functions and multiple wavelets with desirable properties in various fields, from image de-noising to compression. In term of data compression, multiple scaling functions and wavelets offer a greater flexibility in coefficient quantization at high compression ratio than a comparable single wavelet. The purpose of this research is to investigate the possible improvement of scalable wavelet-based color video compression at low bit-rates by using three-dimensional multiwavelets. The first part of this work included the development of the spatio-temporal decomposition process for multiwavelets and the implementation of an efficient 3-D SPIHT encoder/decoder as a common platform for performance evaluation of two well-known multiwavelet systems against a comparable single wavelet in low bitrate color video compression. The second part involved the development of a motion-compensated 3-D compression codec and a modified SPIHT algorithm designed specifically for this codec by incorporating an advantage in the design of 2D SPIHT into the 3D SPIHT coder. In an experiment that compared their performances, the 3D motion-compensated codec with unmodified 3D SPIHT had gains of 0.3dB to 4.88dB over regular 2D wavelet-based motion-compensated codec using 2D SPIHT in the coding of 19 endoscopy sequences at 1/40 compression ratio. The effectiveness of the modified SPIHT algorithm was verified by the results of a second experiment in which it was used to re-encode 4 of the 19 sequences with lowest performance gains and improved them by 0.5dB to 1.0dB. The last part of the investigation examined the effect of multiwavelet packet on 3-D video compression as well as the effects of coding multiwavelet packets based on the frequency order and energy content of individual subbands

Correspondence between Multiwavelet Shrinkage/Multiple Wavelet Frame Shrinkage and Nonlinear Diffusion

There are numerous methodologies for signal and image denoising. Wavelet, wavelet frame shrinkage, and nonlinear diffusion are effective ways for signal and image denoising. Also, multiwavelet transforms and multiple wavelet frame transforms have been used for signal and image denoising. Multiwavelets have important property that they can possess the orthogonality, short support, good performance at the boundaries, and symmetry simultaneously. The advantage of multiwavelet transform for signal and image denoising was illustrated by Bui et al. in 1998. They showed that the evaluation of thresholding on a multiwavelet basis has produced good results. Further, Strela et al. have showed that the decimated multiwavelet denoising provides superior results than decimated conventional (scalar) wavelet denoising. Mrazek, Weickert, and Steidl in 2003 examined the association between one-dimensional nonlinear diffusion and undecimated Haar wavelet shrinkage. They proved that nonlinear diffusion could be presented by using wavelet shrinkage. High-order nonlinear diffusion in terms of one-dimensional frame shrinkage and two-dimensional frame shrinkage were presented in 2012 by Jiang, and in 2013 by Dong, Jiang, and Shen, respectively. They obtained that the correspondence between both approaches leads to a different form of diffusion equation that mixes benefits from both approaches. The objective of this dissertation is to study the correspondence between one-dimensional multiwavelet shrinkage and high-order nonlinear diffusion, and to study high-order nonlinear diffusion in terms of one-dimensional multiple frame shrinkage also well. Further, this dissertation formulates nonlinear diffusion in terms of 2D multiwavelet shrinkage and 2D multiple wavelet frame shrinkage. From the experiment results, it can be inferred that nonlinear diffusion in terms of multiwavelet shrinkage/multiple frame shrinkage gives better results than a scalar case. On the whole, this dissertation expands nonlinear diffusion in terms of wavelet shrinkage and nonlinear diffusion in terms of frame shrinkage from the scalar wavelets and frames to the multiwavelets and multiple frames

Adaptive Orthogonal Matrix-Valued Wavelets and Compression of Vector-Valued Signals

Wavelet transforms using matrix-valued wavelets (MVWs) can process the components of vector-valued signals jointly, and thus offer potential advantages over scalar wavelets. For every matrix-valued scaling filter, there are infinitely many matrix-valued wavelet filters corresponding to rotated bases. We show how the arbitrary orthogonal factor in the choice of wavelet filter can be selected adaptively with a modified SIMPLIMAX algorithm. The 3×3 orthogonal matrix-valued scaling filters of length 6 with 3 vanishing moments have one intrinsic free scalar parameter in addition to three scalar rotation parameters. Tests suggest that even when optimising over these parameters, no significant improvement is obtained when compared to the naive scalar-based filter. We have found however in an image compression test that, for the naive scaling filter, adaptive basis rotation can decrease the RMSE by over 20%

Gröbner bases and wavelet design

AbstractIn this paper, we detail the use of symbolic methods in order to solve some advanced design problems arising in signal processing. Our interest lies especially in the construction of wavelet filters for which the usual spectral factorization approach (used for example to construct the well-known Daubechies filters) is not applicable. In these problems, we show how the design equations can be written as multivariate polynomial systems of equations and accordingly how Gröbner algorithms offer an effective way to obtain solutions in some of these cases

Quaternion Matrices : Statistical Properties and Applications to Signal Processing and Wavelets

Similarly to how complex numbers provide a possible framework for extending scalar signal processing techniques to 2-channel signals, the 4-dimensional hypercomplex algebra of quaternions can be used to represent signals with 3 or 4 components. For a quaternion random vector to be suited for quaternion linear processing, it must be (second-order) proper. We consider the likelihood ratio test (LRT) for propriety, and compute the exact distribution for statistics of Box type, which include this LRT. Various approximate distributions are compared. The Wishart distribution of a quaternion sample covariance matrix is derived from first principles. Quaternions are isomorphic to an algebra of structured 4x4 real matrices. This mapping is our main tool, and suggests considering more general real matrix problems as a way of investigating quaternion linear algorithms. A quaternion vector autoregressive (VAR) time-series model is equivalent to a structured real VAR model. We show that generalised least squares (and Gaussian maximum likelihood) estimation of the parameters reduces to ordinary least squares, but only if the innovations are proper. A LRT is suggested to simultaneously test for quaternion structure in the regression coefficients and innovation covariance. Matrix-valued wavelets (MVWs) are generalised (multi)wavelets for vector-valued signals. Quaternion wavelets are equivalent to structured MVWs. Taking into account orthogonal similarity, all MVWs can be constructed from non-trivial MVWs. We show that there are no non-scalar non-trivial MVWs with short support [0,3]. Through symbolic computation we construct the families of shortest non-trivial 2x2 Daubechies MVWs and quaternion Daubechies wavelets.Open Acces

Wavelet Shrinkage Based Image Denoising using Soft Computing

Noise reduction is an open problem and has received considerable attention in the literature for several decades. Over the last two decades, wavelet based methods have been applied to the problem of noise reduction and have been shown to outperform the traditional Wiener filter, Median filter, and modified Lee filter in terms of root mean squared error (MSE), peak signal noise ratio (PSNR) and other evaluation methods. In this research, two approaches for the development of high performance algorithms for de-noising are proposed, both based on soft computing tools, such as fuzzy logic, neural networks, and genetic algorithms. First, an improved additive noise reduction method for digital grey scale nature images, which uses an interval type-2 fuzzy logic system to shrink wavelet coefficients, is proposed. This method is an extension of a recently published approach for additive noise reduction using a type-1 fuzzy logic system based wavelet shrinkage. Unlike the type-1 fuzzy logic system based wavelet shrinkage method, the proposed approach employs a thresholding filter to adjust the wavelet coefficients according to the linguistic uncertainty in neighborhood values, inter-scale dependencies and intra-scale correlations of wavelet coefficients at different resolutions by exploiting the interval type-2 fuzzy set theory. Experimental results show that the proposed approach can efficiently and rapidly remove additive noise from digital grey scale images. Objective analysis and visual observations show that the proposed approach outperforms current fuzzy non-wavelet methods and fuzzy wavelet based methods, and is comparable with some recent but more complex wavelet methods, such as Hidden Markov Model based additive noise de-noising method. The main differences between the proposed approach and other wavelet shrinkage based approaches and the main improvements of the proposed approach are also illustrated in this thesis. Second, another improved method of additive noise reduction is also proposed. The method is based on fusing the results of different filters using a Fuzzy Neural Network (FNN). The proposed method combines the advantages of these filters and has outstanding ability of smoothing out additive noise while preserving details of an image (e.g. edges and lines) effectively. A Genetic Algorithm (GA) is applied to choose the optimal parameters of the FNN. The experimental results show that the proposed method is powerful for removing noise from natural images, and the MSE of this approach is less, and the PSNR of is higher, than that of any individual filters which are used for fusion. Finally, the two proposed approaches are compared with each other from different point of views, such as objective analysis in terms of mean squared error(MSE), peak signal to noise ratio (PSNR), image quality index (IQI) based on quality assessment of distorted images, and Information Theoretic Criterion (ITC) based on a human vision model, computational cost, universality, and human observation. The results show that the proposed FNN based algorithm optimized by GA has the best performance among all testing approaches. Important considerations for these proposed approaches and future work are discussed