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.     

遗传选择机制在矢量量化中的应用

提出误差选择竞争学习算法,它把遗传算法中的选择机制引入到矢量量化设计中,在使用竞争学习算法减小期望误差的前提下,利用选择机制调整各个区域的子误差从而进一步改善期望误差,实验结果表明,该算法较好地调整了各区域的子误差,克服局部最优     

A Novel Self-Creating Neural Network for Learning Vector Quantization

This paper presents a novel self-creating neural network scheme which employs two resource counters to record network learning activity. The proposed scheme not only achieves the biologically plausible learning property, but it also harmonizes equi-error and equi-probable criteria. The training process is smooth and incremental: it not only avoids the stability-and-plasticity dilemma, but also overcomes the dead-node problem and the deficiency of local minimum. Comparison studies on learning vector quantization involving stationary and non-stationary, structured and non-structured inputs demonstrate that the proposed scheme outperforms other competitive networks in terms of quantization error, learning speed, and codeword search efficiency.     

矢量量化的误差竞争学习算法

提出了误差竞争学习（Ｄｉｓｔｏｒｔｉｏｎ ｃｏｐｍｐｅｔｉｔｉｖｅ ｌｅａｒｎｉｎｇ,ＤＣＬ）算法。该算法基于Ｇｅｒｓｈｏ的矢量量化误差渐近理论的等误差原则,即当码本数趋于无穷大时,各区域子误差相等,使用这个原则作为最优码书设计的一个必要条件,并结合传统最优码书设计的两个必要条件,然后根据这３个必要条件：（１）最近邻规则;（２）中心准则;（３）各区域了误差近似相等设计最优码书,而在算法的实现中引入     

矢量量化与神经网络相结合的说话人识别系统

介绍了说话人识别系统的基本概念,在分析了传统VQ模型与神经网络模型的基础上,提出了一种VQ与神经网络相结合的说话人识别系统模型。通过提取出的特征参数(MFFC),建立系统模型,实验证明了该模型性能随着时间的变化有较好的稳定性。     

The LBG-U Method for Vector Quantization – an Improvement over LBG Inspired from Neural Networks

A new vector quantization method (LBG-U) closely related to a particular class of neural network models (growing self-organizing networks) is presented. LBG-U consists mainly of repeated runs of the well-known LBG algorithm. Each time LBG converges, however, a novel measure of utility is assigned to each codebook vector. Thereafter, the vector with minimum utility is moved to a new location, LBG is run on the resulting modified codebook until convergence, another vector is moved, and so on. Since a strictly monotonous improvement of the LBG-generated codebooks is enforced, it can be proved that LBG-U terminates in a finite number of steps. Experiments with artificial data demonstrate significant improvements in terms of RMSE over LBG combined with only modestly higher computational costs.     

基于主分量分析的相关矢量量化编码算法

在编码前,首先计算码书中所有码字在主轴上的投影值,然后按照这些投影值从小到大对码字进行排序;在编码过程中,利用邻近图像块的高度相关性和当前输人矢量在主轴上的投影值共同确定相应的码字搜索范围．实验结果表明,与传统穷尽搜索矢量量化编码法相比,虽然文中算法的编码质量略有下降,但编码速度和压缩效率都有了显著的提高．     

基于改进CPN的快速矢量量化

对向传播神经网络(CPN)可以作为矢量量化器用于图像压缩,但CPN学习算法在进行码书设计时存在两个明显的缺陷。本文对CPN学习算法进行改进,提出了一种新的码书设计算法——快速竞争学习及误差修正算法(FCLECA)和一个基于改进CPN的快速矢量量化器模型,并讨论了FCLECA中的重要步骤和重要参数。仿真实验结果表明,FCLECA在生成高质量码书的同时大幅减少了训练时间,可以有效地实现快速矢量量化。     

基于自组织特征映射的图象矢量量化

本文就基于自组织特征映射的图象矢量量化编码做了初步的探讨,得出一些结论。在矢量量化中,码本性能的好坏对重建的图像有直接的影响。我们利用自组织特征映射(SOFM)网络进行聚类,实现了图像矢量码本的生成,然后再根据矢量量化(VQ)编码原理将图像重建。该方法可以达到较高的压缩比,实现了图像压缩。并且,就不同条件下的图像作了对比。     

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

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

非线性空间几何收缩的分形图象压缩编码

在经典的空间几何线性均值收缩算法的基础上，提出了一种非线性空间几何收缩算法。由实验表明，该算法不仅能提高压缩比，而且对信噪比也有一定的改善。     

Self-Organizing Maps and Learning Vector Quantization for Feature Sequences

The Self-Organizing Map (SOM) and Learning Vector Quantization (LVQ) algorithms are constructed in this work for variable-length and warped feature sequences. The novelty is to associate an entire feature vector sequence, instead of a single feature vector, as a model with each SOM node. Dynamic time warping is used to obtain time-normalized distances between sequences with different lengths. Starting with random initialization, ordered feature sequence maps then ensue, and Learning Vector Quantization can be used to fine tune the prototype sequences for optimal class separation. The resulting SOM models, the prototype sequences, can then be used for the recognition as well as synthesis of patterns. Good results have been obtained in speaker-independent speech recognition.     

矢量量化高光谱数据压缩性能评估

性能评估是高光谱数据有损压缩研究的一个关键问题。本文在分析三种典型的基于矢量量化压缩方案的基础上,以K-means聚类准确率的仿真统计比较了三种方案的性能优劣;提出一种失真标准抽取的性能评估框架,在缺乏背景资料的情况下,该框架可以对压缩方案性能给出直观评价,方便了压缩方案的选择及应用。     

基于LVQ的软件项目风险评估模型的研究

以16种风险为基础,建立了一个新的软件项目风险评估模型,把以往每个软件项目的16种风险看做一个16×1维列矢量,并做为LVQ神经网络的训练矢量,对其进行聚类分析,最终把项目风险水平分为:风险水平很低、风险水平中等、风险水平很高等三个类别,并对项目风险水平做出预测。     

基于改进的SOFM神经网络的矢量量化方法

基于Kohonen自组织特征映射(SOFM)神经网络的矢量量化图像压缩编码是一种非常高效的方法,但其码字利用不均匀,某些神经元永远无法获胜而产生"死神经元"的问题仍然十分明显。在追求为使各个神经元能以较为均衡的几率获胜,尽量避免"死神经元"过程中,Kohonen SOFM-C很具代表性,它既能保持拓扑不变性映射又能最有效地避免"死神经元",是一种带"良心"的竞争学习方法。本文利用Kohonen SOFM-C码字利用更为均衡的优点,并针对SOFM在胜出神经元的邻域内神经元修改权值方法的不足,提出基于SOFM-C的辅助神经元自组织映射算法,此方法具有开放性,可随时添加入新的有效算法模块以达到更好的效果。并把该矢量量化算法应用于小波变换域,以获得更好的码书。仿真结果表明,该方法优于已有的SOFM方法。     

Merging Strategy for Cross-Lingual Information Retrieval Systems based on Learning Vector Quantization

We present a new approach based on neural networks to solve the merging strategy problem for Cross-Lingual Information Retrieval (CLIR). In addition to language barrier issues in CLIR systems, how to merge a ranked list that contains documents in different languages from several text collections is also critical. We propose a merging strategy based on competitive learning to obtain a single ranking of documents merging the individual lists from the separate retrieved documents. The main contribution of the paper is to show the effectiveness of the Learning Vector Quantization (LVQ) algorithm in solving the merging problem. In order to investigate the effects of varying the number of codebook vectors, we have carried out several experiments with different values for this parameter. The results demonstrate that the LVQ algorithm is a good alternative merging strategy.     

基于矢量量化的快速图像检索

传统索引方法对高维数据存在"维数灾难"的困难.而对数据分布的精确描述及对数据空间的有效划分是高维索引机制中的关键问题.提出一种基于矢量量化的索引方法.该方法使用高斯混合模型描述数据的整体分布,并训练优化的矢量量化器划分数据空间.高斯混合模型能更好地描述真实图像库的数据分布;而矢量量化的划分方法可以充分利用维之间的统计相关性,能够对数据向量构造出更加精确的近似表示,从而提高索引结构的过滤效率并减少需要访问的数据向量.在大容量真实图像库上的实验表明,该方法显著减少了支配检索时间的I/O开销,提高了索引性能.     

图像块动态划分矢量量化

提出一种可以自动调节子图像块尺寸的矢量量化算法———图像块动态划分矢量量化 该算法在进行编码前 ,首先对待编码子图像块及其相邻块进行相关度分析 ,通过预设的阈值 (最大相关度 )进行分类编码 :如果相关度小于阈值 ,则对 8× 8图像块进行编码 ;否则 ,对 4× 4的图像块进行编码 实验结果表明 ,相对于普通矢量量化 ,文中算法不但可以提高压缩率和编码速度 ,而且不会影响重建图像的质量     

竞争聚类耦合码字定向移动的图像重构矢量量化算法设计

为了解决模糊聚类-矢量量化算法都是强迫模糊分区转变为Crisp集合,降低码本质量,使重构图像丢失了丰富的边缘纹理信息;且其计算代价较高,以及严重依赖初始化等不足.提出了竞争聚类耦合码字定向移动的图像重构模糊矢量量化算法.引入竞争聚类,基于C均值和模糊C均值,设计最优目标函数;结合拉格朗日乘子,推导出最优目标函数的聚类中心和隶属度的求解模型;定义迁移规则,构造了码字定向移动机制,使得小簇群向大簇群移动,形成更大的簇群;以失真度和相似度为评估准则,构造量化反馈机制,优化重构图像.仿真结果显示:与其他矢量量化机制相比,本文算法的编码图像相似度更高,PSNR(peak signal to noise ratio)最高,得到的重构图像质量最佳;且本文算法的时间成本最低.     

The Softmap Algorithm

A new unsupervised competitive learning rule is introduced, called the Self-organizing free-topology map (Softmap) algorithm, for nonparametric density estimation. The receptive fields of the formal neurons are overlapping, radially-symmetric kernels, the radii of which are adapted to the local input density together with the weight vectors which define the kernel centers. A fuzzy code membership function is introduced in order to encompass, in a novel way, the presence of overlapping receptive fields in the competitive learning scheme. Furthermore, a computationally simple heuristic is introduced for determining the overall degree of smoothness of the resulting density estimate. Finally, the density estimation performance is compared to that of the variable kernel method, VBAR and Kohonen's SOM algorithm.