Showing papers by "Jeng-Shyang Pan published in 1996"
TL;DR: A parallel genetic algorithm is applied to assign the codevector indices for noisy channels so as to minimise the distortion caused by bit errors and results confirm this approach.
Abstract: A parallel genetic algorithm is applied to assign the codevector indices for noisy channels so as to minimise the distortion caused by bit errors. The property of multiple global optima and the average distortion of the memoryless binary symmetric channel for any bit error are also introduced. Experimental results confirm this approach.
49 citations
TL;DR: Experimental results in comparison to the conventional vector-quantization (VQ) clustering algorithm with speech data demonstrate that the best approach will save more than 99% in the number of multiplications, as well as considerable saving in thenumber of additions.
34 citations
01 Feb 1996
TL;DR: A bound for a Minkowski metric based on L/sub p/ distortion measure is proposed and evaluated as a means to reduce the computation in vector quantisation.
Abstract: A bound for a Minkowski metric based on L/sub p/ distortion measure is proposed and evaluated as a means to reduce the computation in vector quantisation. This bound provides a better criterion than the absolute error inequality (AEI) elimination rule on the Euclidean distortion measure. For the Minkowski metric of order n, this bound contributes the elimination criterion from the L/sub 1/ metric to L/sub n/ metric. This bound can also be an extended quadratic metric which can be a hidden Markov model (HMM) with a Gaussian mixture probability density function (PDF). In speech recognition, the HMM with the Gaussian mixture VQ codebook PDF has been shown to be a promising method.
20 citations
TL;DR: In this paper, the tabu search approach is applied to codevector index assignment for noisy channels for the purpose of minimising the distortion due to bit errors without introducing any redundancy, and the robustness of this approach compared with the standard parallel genetic algorithm and the binary switching algorithm is demonstrated.
Abstract: The tabu search approach is applied to codevector index assignment for noisy channels for the purpose of minimising the distortion due to bit errors without introducing any redundancy. Experimental results demonstrate the robustness of this approach compared with the standard parallel genetic algorithm and the binary switching algorithm.
12 citations
03 Oct 1996
TL;DR: Experimental results based on the memoryless binary symmetric channel for any bit error demonstrate the robustness of this new approach to parallel genetic algorithms for assigning the codevector indices for noisy channels.
Abstract: The multi-mutation rates, multi-crossover rates and a scheme of reinitialization are applied to parallel genetic algorithms for assigning the codevector indices for noisy channels for the purpose of minimizing the distortion caused by bit errors. Experimental results based on the memoryless binary symmetric channel for any bit error demonstrate the robustness of this new approach compared with the authors' previous work. The property of multiple global optima is also emphasized.
6 citations