A corroborative study on improving pitch determination by time-frequency cepstrum decomposition using wavelets.

A new wavelet-based method is presented in this work for estimating and tracking the pitch period. The main idea of the proposed new approach consists in extracting the cepstrum excitation signal and applying on it a wavelet transform whose resulting approximation coefficients are smoothed, for a better pitch determination. Although the principle of the algorithms proposed has already been considered previously, the novelty of our methods relies in the use of powerful wavelet transforms well adapted to pitch determination. The wavelet transforms considered in this article are the discrete wavelet transform and the dual tree complex wavelet transform. This article, by all the provided experimental results, corroborates the idea of decomposing the cepstrum excitation by using wavelet transforms for improving pitch detection. Another interesting point of this article relies in using a simple but efficient voicing decision (which actually improves a similar voicing criterion we proposed in a preceding published study) which on one hand respects the real-time process with low latency and on the other hand allows obtaining low classifications errors. The accuracy of the proposed pitch tracking algorithms has been evaluated using the international Bagshaw and the Keele databases which include male and female speakers. Our various experimental results demonstrate that the proposed methods provide important performance improvements when compared with previously published pitch determination algorithms.

Low-Rankness Transfer for Realistic Denoising.

Current state-of-the-art denoising methods, such as non-local low-rank approaches, have shown to give impressive results. They are, however, mainly tuned to work with uniform Gaussian noise corruption and known variance, which is far from the real noise scenario. In fact, noise level estimation is already a challenging problem and denoising methods are quite sensitive to this parameter. Moreover, these methods are based on shrinkage models that are too simple to reflect reality, which results in over-smoothing of important structures, such as small-scale text and textures. We propose in this paper a new approach for more realistic image restoration based on the concept of low-rankness transfer. Given a training clean/noisy image pair, our method learns a mapping between the non-local noisy singular values and the optimal values for denoising to be transfered to a new noisy input. One single image is enough for training the model and can be adapted to the noisy input by taking a correlated image. Experiments conducted on synthetic and real camera noise show that the proposed method leads to an important improvement both visually and in terms of PSNR/SSIM.

Fast Edge-Aware Processing via First Order Proximal Approximation.

We present a new framework for fast edge-aware processing of images and videos. The proposed smoothing method is based on an optimization formulation with a non-convex sparse regularization for a better smoothing behavior near strong edges. We develop mathematical tools based on first order approximation of proximal operators to accelerate the proposed method while maintaining high-quality smoothing. The first order approximation is used to estimate a solution of the proximal form in a half-quadratic solver, and also to derive a warm-start solution that can be calculated quickly when the image is loaded by the user. We extend the method to large-scale processing by estimating the smoothing operation with independent 1D convolution operations. This approach linearly scales to the size of the image and can fully take advantage of parallel processing. The method supports full color filtering and turns out to be temporally coherent for fast video processing. We demonstrate the performance of the proposed method on various applications including image smoothing, detail manipulation, HDR tone-mapping, fast edge simplification and video edge-aware processing.

Unsupervised approach data analysis based on fuzzy possibilistic clustering: application to medical image MRI.

The analysis and processing of large data are a challenge for researchers. Several approaches have been used to model these complex data, and they are based on some mathematical theories: fuzzy, probabilistic, possibilistic, and evidence theories. In this work, we propose a new unsupervised classification approach that combines the fuzzy and possibilistic theories; our purpose is to overcome the problems of uncertain data in complex systems. We used the membership function of fuzzy c-means (FCM) to initialize the parameters of possibilistic c-means (PCM), in order to solve the problem of coinciding clusters that are generated by PCM and also overcome the weakness of FCM to noise. To validate our approach, we used several validity indexes and we compared them with other conventional classification algorithms: fuzzy c-means, possibilistic c-means, and possibilistic fuzzy c-means. The experiments were realized on different synthetics data sets and real brain MR images.

Fast frequency template matching using higher order statistics.

This correspondence proposes a novel template matching technique using a fourth central moment. The fourth central moment is an established estimator which uses higher order statistics theory, important in the presence of an additive Gaussian noise. By use of some substitutions and complex arithmetic, computation of the fourth central moment is derived from correlation functions of substituting functions. The fourth central moment can be computed using the fast Fourier transform (FFT) approach. Simulation results show that the proposed algorithm performs better than the classical estimators in terms of robustness, while the extra computational cost is negligible.

HOS-based image sequence noise removal.

In this paper, a new spatiotemporal filtering scheme is described for noise reduction in video sequences. For this purpose, the scheme processes each group of three consecutive sequence frames in two steps: 1) estimate motion between frames and 2) use motion vectors to get the final denoised current frame. A family of adaptive spatiotemporal L-filters is applied. A recursive implementation of these filters is used and compared with its nonrecursive counterpart. The motion trajectories are obtained recursively by a region-recursive estimation method. Both motion parameters and filter weights are computed by minimizing the kurtosis of error instead of mean squared error. Using the kurtosis in the algorithms adaptation is appropriate in the presence of mixed and impulsive noises. The filter performance is evaluated by considering different types of video sequences. Simulations show marked improvement in visual quality and SNRI measures cost as well as compared to those reported in literature.