The aim of speech scrambling algorithms is to transform clear speech into an unintelligible signal so that it is difficult to decrypt it in the absence of the key. Most of the existing speech scrambling algorithms tend to retain considerable residual intelligibility in the scrambled speech and are easy to break. Typically, a speech scrambling algorithm involves permutation of speech segments in...

This paper is devoted to the theoretical analysis of the tness function in genetic algorithms using wavelet packet (WP) transforms. More speci cally, WP transforms are used to calculate the average tness value of a schema. Based on this one can decide whether a certain function is easy or hard for a genetic algorithm. The result is an extension of Bethke's work who discovered an e cient method ...

We show in this paper two ways to combine wavelet packets and total variation based deblurring methods. For this purpose, we first recall that it is possible to approximate a convolution by mean of an operator diagonal in a wavelet packet basis. Then, we show two possibilities, which uses this property, for combining wavelet packets and total variation approaches. We then show on experiments th...