一种基于Tabu搜索的模糊学习矢量量化图象编码算法

模糊学习矢量量化算法 (FL VQ)虽然解决了硬的竞争学习对初始码本的依赖性问题 ,但收敛速度变慢 ,且仍无法克服陷入局部最小 .为此在分析模糊学习矢量量化图象编码原理的基础上 ,探讨了 FL VQ算法的几种优化途径 ,进而提出了一种基于 Tabu搜索 (TS)的模糊学习矢量量化的新算法 (TS- FL VQ) ,并给出了该算法的具体实现方法及步骤 .该算法首先利用 TS技术产生一个面向全局搜索的寻优列表 ,然后再进行模糊学习以得到最优解 .实验结果表明 ,该算法在收敛速度及编码效果上均较 FL VQ有较大的提高 .     

基于模糊矢量量化图象编码的研究

分析了模糊矢量量化（ＦＶＱ）图象编码的原理，给出了ＦＶＱ设计三要素。提出了用于图象编码的指数型模糊矢量量化算法（ＦＶＱＥ）。实验结果表明，ＦＶＱＥ的图象编码性能与ＦＶＱ相当，但收敛速度要略快于ＦＶＱ算法。     

基于改进边缘匹配矢量量化的图象编码算法

边缘匹配（Side-Match）矢量量化器（SMVQ）是有限状态矢量量化器（FSVQ）的一个分支。该量化器适合于对图象块间相关性高的图象进行压缩编码,其优点是在比特率相近 的情况下,编码质量高于传统的穷尺搜索矢量量化编码器,但其缺点是计算量大和比特率固定。本文提出了一种改进的边缘匹配矢量量化器。测试结果表明,该算法是变比特率编码算法,它比边缘匹配矢量量化器的比特率低,编码速度快,编码质量有所提高。     

动态模糊矢量量化算法

由于传统的Ｋ－均值算法在用于矢量量化时强烈依赖初始码书的选取,如果初始码书选取不好,则很容易陷入局部最小点;而Ｂｅｚｄｅｋ的模糊Ｋ－均值算法由于计算量很大,也很少用于矢量量化的设计码书,因此人们一直在寻找收敛速度和收敛效果两者性能较好的算法,在研究Ｎｉｃｏｌａｏｓ等人提出的模糊矢量量化（ＦＶＱ）算法基础上,针对ＦＶＱ算法收敛过程存在的总理２,并从收敛结构和收敛策略出发,提出了一种动态的法在收敛速度     

一种结合Tabu搜索的自适应遗传算法研究

针对标准遗传算法（SGA）在全局优化问题中容易出现早熟和收敛速度慢,提出了一种TS-AGA算法。新算法通过将禁忌搜索（TS）和自适应遗传算法（AGA）相结合。以自适应遗传算法（AGA）为基础,用遗传算法进行全局搜索,用禁忌搜索法（TS）作局部搜索,可以加快收敛速度,同时可以抑制早熟现象,避免过早收敛到局部最优。测试函数仿真结果表明,新算法能很好的抑制早熟收敛,同时在计算速度和计算结果方面都有改进,是一种快速有效的优化算法。     

均值与矢量量化复合快速图像编码算法

矢量量化是一种有效的数据压缩技术,由于其算法简单,具有较高的压缩率,因而被广泛应用于数据压缩编码领域。通过对图像块灰度特征的研究,根据图像的平滑与否,提出了对图像进行均值和矢量量化复合编码算法,该算法对平滑图像块采用均值编码,对非平滑块采用矢量量化编码。这不仅节省了平滑码字的存储空间,提高了码书存储效率,并且编码速度大大提高。同时采用码字旋转反色（2R）压缩算法将码书的存储容量减少到1/8,并结合最近邻块扩展搜索算法（EBNNS）对搜索算法进行优化。在保证图像画质的前提下,整个系统的图像编码速度比全搜索的普通矢量量化平均提高约7.7倍。     

神经网络矢量量化技术在语音编码中的应用

讨论了在语音编码中,应用神经网络技术进行矢量量化的算法。神经网络矢量量化算法可以压缩码本维数,提高码本搜索速度,从而优化矢量量化的效果。将这种优化的矢量量化算法应用于语音编码中,能降低运算复杂度,提高编码质量。     

基于快速相关矢量量化的图象编码算法

图象编码已经成为当今计算机世界的重要问题,而矢量量化（ＶＱ）又是近年来有损图象压缩的一种重要技术,它的优点是比特率低以及解码简单,但是其穷尽搜索编码计算量较大,为了降低编码时间,已经有多种快速算法出现在一些文献中,然而这些算法往往不能进一步降低比特率,为了解决这一问题,因此提出了一种新颖快速相关矢量量化（ＣＶＱ）图象编码算法,该算法对图象块的编码采用对角顺序,即在编码过程中根据当前图象块（ＣＶＱ）     

基于多级SMVQ的图象编码算法

边缘匹配矢量量化器(SMVQ)是有限状态矢量量化器(FSVQ)的一个分支。该量化器适合于对图像块间相关性高的图像进行压缩编码,其优点是在比特率相近的情况下,编码质量高于传统的穷尽搜索矢量量化编码器,但其缺点是计算量大和比特率固定。本文提出了一种改进的边缘匹配矢量量化器。测试结果表明,该算法是变比特率编码算法,它比边缘匹配矢量量化器的比特率低,编码速度快,编码质量得到提高。     

一种快速的矢量量化编码

研究了一种基于均方误差（MSE）测度的矢量量化快速编码算法。算法利用小波变换的特点,合理地构造矢量,便于非线性插补矢量量化技术的使用,也使部分失真排除法的效率大大提高。使用矢量的二范数和距离测度关系的码字排除方法,再结合非线性插补矢量量化技术和部分失真排除法,在搜索编码过程中,有效排除部分候选码字。实验结果表明,相对于穷尽搜索方法,计算量有明显降低,计算时间显著减少。     

Co-adaptation of self-organizing maps by evolution and learning

This paper proposes two co-adaptation schemes of self-organizing maps that incorporate the Kohonen's learning into the GA evolution in an attempt to find an optimal vector quantization codebook of images. The Kohonen's learning rule used for vector quantization of images is sensitive to the choice of its initial parameters and the resultant codebook does not guarantee a minimum distortion. To tackle these problems, we co-adapt the codebooks by evolution and learning in a way that the evolution performs the global search and makes inter-codebook adjustments by altering the codebook structures while the learning performs the local search and makes intra-codebook adjustments by making each codebook's distortion small. Two kinds of co-adaptation schemes such as Lamarckian and Baldwin co-adaptation are considered in our work. Simulation results show that the evolution guided by a local learning provides the fast convergence, the co-adapted codebook produces better reconstruction image quality than the non-learned equivalent, and Lamarckian co-adaptation turns out more appropriate for the VQ problem.     

Expansive and Competitive Learning for Vector Quantization

In this paper, we develop a necessary and sufficient condition for a local minimum to be a global minimum to the vector quantization problem and present a competitive learning algorithm based on this condition which has two learning terms; the first term regulates the force of attraction between the synaptic weight vectors and the input patterns in order to reach a local minimum while the second term regulates the repulsion between the synaptic weight vectors and the input's gravity center to favor convergence to the global minimum This algorithm leads to optimal or near optimal solutions and it allows the network to escape from local minima during training. Experimental results in image compression demonstrate that it outperforms the simple competitive learning algorithm, giving better codebooks.     

Wavelet fuzzy LVQ based speaker verification system

This work evaluates the performance of speaker verification system based on Wavelet based Fuzzy Learning Vector Quantization (WLVQ) algorithm. The parameters of Gaussian mixture model (GMM) are designed using this proposed algorithm. Mel Frequency Cepstral Coefficients (MFCC) are extracted from the speech data and vector quantized through Wavelet based FLVQ algorithm. This algorithm develops a multi resolution codebook by updating both winning and nonwinning prototypes through an unsupervised learning process. This codebook is used as mean vector of GMM. The other two parameters, weight and covariance are determined from the clusters formed by the WLVQ algorithm. The multi resolution property of wavelet transform and ability of FLVQ in regulating the competition between prototypes during learning are combined in this algorithm to develop an efficient codebook for GMM. Because of iterative nature of Expectation Maximization (EM) algorithm, the applicability of alternative training algorithms is worth investigation. In this work, the performance of speaker verification system using GMM trained by LVQ, FLVQ and WLVQ algorithms are evaluated and compared with EM algorithm. FLVQ and WLVQ based training algorithms for modeling speakers using GMM yields better performance than EM based GMM.     

A tabu search-based algorithm for the fuzzy clustering problem

The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. In this paper, we propose a new approach to this problem which is based on tabu search technique, and aims at finding a global solution of FCP. We compare the performance of the algorithm with the fuzzy C-means algorithm.     

模糊聚类在自适应矢量量化码本训练中的应用

自适应矢量量化在语音处理中有广泛的应用,提出了一种基于ＳＦＣＭ算法的自适应矢量量化码本的训练方法,其特点是通过模糊聚类方法,重新调整训练样本与码字之间的隶属度,达到最小编码失真,使码本更适合新说话人,且计算简单,方法的实验结果表明,可以使编码平均失真下降。     

说话人识别中随机局部搜索算法的研究

目前在矢量量化的码本训练中经典的聚类方法是LBG算法,但该算法的主要缺陷是对初始码书的依赖性较大,容易过早地陷入局部极小.本文在基于矢量量化的说话人识别中研究了一种随机局部搜索的聚类算法.该算法不依赖初始条件,结构规则,容易实现,效果好,具有很优越的全局优化搜索能力,在语音参数聚类实验中表现出了很好的性能,得到的码书质量也优于经典的LBG-算法,从而为在基于矢量量化的说话人识别中设计准全局最优码书提供了一种新思路.     

基于改进人工蜂群的图像矢量量化码书设计算法

为了进一步提高图像矢量量化的码书质量,提出了一种新的图像压缩矢量量化码书设计算法。该算法采用均方误差(MSE)作为码书设计的适应度函数,利用改进的人工蜂群算法进行适应度函数的优化求解,增强了算法的自组织性和收敛性,大大减少了陷入局部收敛的可能性。将一种基于和值特性的快速码字搜索思想引入到码书设计算法中,使算法计算量明显降低。仿真结果表明,该算法具有计算时间短、收敛速度快的优点,并且生成的码书质量好、稳定性强。