粒子对算法在图像矢量量化中的应用

本文给出了一种新的图像矢量量化码书的优化设计方法——粒子对算法.在传统粒子群优化(Particle Swarm Optimization,PSO)算法的基础上,用两个粒子构成了群体规模较小的粒子对,在码书空间中搜索最佳码书.在每次迭代运算中,粒子对按先后顺序执行PSO算法中的速度更新、位置更新操作和标准LBG算法,并用误差较大的训练矢量代替越界的码字.此算法避免粒子陷入局部最优码书,较准确地记录和估计每个码字的最佳移动方向和历史路径,在训练矢量密集区域和稀疏区域合理地分配码字,从而使整体码书向全局最优解靠近.实验结果表明,本算法始终稳定地取得显著优于FKM、FRLVQ、FRLVQ-FVQ算法的性能,较好地解决了矢量量化中初始码书影响优化结果的问题,且在计算时间和收敛速度方面有相当的优势.     

一种快速模糊矢量量化图像编码算法

本文在学习矢量量化和模糊矢量量化算法的基础上,设计了一种新的训练矢量超球体收缩方案和码书学习公式,提出了一种快速模糊矢量量化算法。该算法具有对初始码书选取信赖性小,不会陷入局部最小和运算最小的优点。实验表明,ＦＦＶＱ设计的图像码书性能与ＦＶＡ算法相比,训练时间大大缩短,峰值信噪比也有改善。     

高效的模糊聚类初始码书生成算法

码书设计在矢量量化中至关重要,而多数码书设计算法都是基于初始码书的.从经典的LBG算法的缺陷出发,提出一种基于模糊聚类的高效初始码书生成算法,通过将初始码书的码矢在输入矢量空间中很好地散开,并尽可能占据输入概率密度较大的区域,从而使之后的LBG算法避免陷入局部最优,设计出的码书性能更好,更加接近全局最优,同时加快了收敛速度,减少了迭代次数.将该算法应用于图像编码的实验中,结果表明:该算法能够从效率和质量两方面有效地提高矢量量化的性能.     

基于量子粒子群优化算法的图像矢量量化码书设计

鉴于经典的LBG码书设计算法易陷入局部最优解,将量子粒子群优化算法应用到图像矢量量化码书设计中,提出一种基于量子粒子群的矢量量化码书设计算法(QPSO-VQ)。在该算法中,用粒子表示码书,用峰值信噪比(PSNR)作为算法的适应度函数,通过量子粒子群算法的更新公式来更新码书。实验结果表明,与经典的LBG码书设计算法和粒子群矢量量化码书设计算法相比,QPSO-VQ在解码图像的PSNR值和算法的稳定度等方面有比较明显的优势,可以获得性能较好的码书。     

基于粒子群算法的码书设计研究

由于应用基本粒子群进行码书设计时容易出现陷入局部最优解的问题,故引进模拟退火算法对全局极值的更新条件做了改进,提出了一种新的码书设计方法.改进算法的全局极值更新条件采用了随机概率扰动接受的方式,既接收优化解,也可以接受恶化解,从而增加全局最优区域的搜索能力,避免了粒子过早的"趋同性".采用提出的码书设计方法进行于语音矢量量化表明新提出的算法所重构的语音无论是从清晰度、自然度还是理解性上都要好于基本粒子群算法所重构的语音.增大全局搜索范围.     

一种随机竞争学习矢量量化图像编码算法

本文分析了确定性模拟退火技术、竞争学习算法在图像编码中的压缩机理,提出了一种新的随机竞争学习矢量量化算法.该算法将竞争过程与代价函数最小化结合起来,在学习过程中引入模拟退火,并针对矢量量化图像编码的特点,提出了新的参数选取策略,具有对初始码书依赖性小,不会局部最小,收敛速度快,码书性能好等优点.文中还通过计算机实践对该方法进行了性能分析,验证了算法的有效性和鲁棒性.     

矢量的线上投影表示法

本文提出一种矢量压缩编码新方法—线上投影法.它将输入矢量用它在某条空间直线上的投影近似表示,而用决定这条直线的两个参考点的序号和一个反映该投影点相对于两参考点位置的比例因子作为编码.由于一个大小为N的矢量量化码书中的码字可以确定N(N-1)/2条直线,因此这种方法可用较小的码书获得很高的编码精度.理论分析和实验结果表明:码书大小为N的线上投影法的编码精度与码书大小为N²的矢量量化法相当,并且明显优于用两个大小为N的码书构成的两级矢量量化法,而其码书生成和编码过程的计算复杂度均远远低于后者.它将是矢量信号高精度压缩编码的一种强有力的手段.     

一种新的语音LSF矢量量化码书优化算法

LSF(线谱频率)码书的性能对合成语音质量有着重要影响.经典的LBG算法容易陷入局部最优,而目前的一些码书进化算法搜索空间较大、搜索效率不明显.本文提出了一种新型的基于对LSF矢量空间进行拉伸变化的混合进化码书优化算法.该算法编码空间与矢量同维,相对较小,便于优化操作.算法中引入EP中的变异操作对PSO位置、速度矢量进行控制,以提高优化搜索算法的效率.实验结果表明,本文算法有效地改善了码书性能.     

基于FPGA的EBNNS矢量量化码字搜索算法的电路设计

等和值块扩展最近邻搜索算法(EBNNS)是一种快速矢量量化码字搜索算法,该算法首先将码书按和值大小排序分块,编码时查找与输入矢量和值距离最近的码书块中间码字,并将它作为初始匹配码字.然后在该码字附近上下扩展搜索相邻码字中距输入矢量最近的码字,最后将搜索到的最匹配码字在码书中的地址输出.同时本文对该算法进行了FPGA设计.设计时采用串并结合和流水线结构,折中考虑了硬件面积和速度.结果表明针对所用FPGA器件Xilinx xc2v1000,整个系统最大时钟频率可达88.36MHz,图像处理速度约为2.2 MPixel/s.     

模糊增强学习码书设计算法及其在图像编码中的应用

本文提出一种用于图像压缩编码的模糊增强学习码书设计算法。该算法是在模糊竞争学习矢量量化的基础上引入增强学习,并用输入训练模式的监督信号与类别模式之间的隶属度控制增强信号。实验结果表明,该算法对初始码本依赖性小,与模糊竞争学习矢量量化和微分竞争学习算法相比,收敛速度更快,性能更好。     

Novel fuzzy reinforced learning vector quantisation algorithm and its application in image compression

A new approach to the design of optimised codebooks using vector quantisation (VQ) is presented. A strategy of reinforced learning (RL) is proposed which exploits the advantages offered by fuzzy clustering algorithms, competitive learning and knowledge of training vector and codevector configurations. Results are compared with the performance of the generalised Lloyd algorithm (GLA) and the fuzzy K-means (FKM) algorithm. It has been found that the proposed algorithm, fuzzy reinforced learning vector quantisation (FRLVQ), yields an improved quality of codebook design in an image compression application when FRLVQ is used as a pre-process. The investigations have also indicated that RL is insensitive to the selection of both the initial codebook and a learning rate control parameter, which is the only additional parameter introduced by RL from the standard FKM     

Comments on “modified K-means algorithm for vector quantizerdesign”

Previously a modified K-means algorithm for vector quantization design has been proposed where the codevector updating step is as follows: new codevector=current codevector+scale factor (new centroid-current codevector). This algorithm uses a fixed value for the scale factor. In this paper, we propose the use of a variable scale factor which is a function of the iteration number. For the vector quantization of image data, we show that it offers faster convergence than the modified K-means algorithm with a fixed scale factor, without affecting the optimality of the codebook.     

Two fast nearest neighbor searching algorithms for image vectorquantization

In this paper, two efficient codebook searching algorithms for vector quantization (VQ) are presented. The first fast search algorithm utilizes the compactness property of signal energy on transform domain and the geometrical relations between the input vector and every codevector to eliminate those codevectors that have no chance to be the closest codeword of the input vector. It achieves a full search equivalent performance. As compared with other fast methods of the same kind, this algorithm requires the fewest multiplications and the least total times of distortion measurements. Then, a suboptimal searching method, which sacrifices the reconstructed signal quality to speed up the search of nearest neighbor, is presented. This algorithm performs the search process on predefined small subcodebooks instead of the whole codebook for the closest codevector. Experimental results show that this method not only needs less CPU time to encode an image but also encounters less loss of reconstructed signal quality than tree-structured VQ does     

Dynamic finite-state vector quantization of digital images

A vector quantization (VQ) scheme with finite memory called dynamic finite-state vector quantization (DFSVQ) is presented. The encoder consists of a large codebook, so called super-codebook, where for each input vector a fixed number of its codevectors are chosen to generate a much smaller codebook (sub-codebook). This sub-codebook represents the best matching codevectors that could be found in the super-codebook for encoding the current input vector. The choice for the codevectors in the sub-codebook is based on the information obtained from the previously encoded blocks where directional conditional block probability (histogram) matrices are used in the selection of the codevectors. The index of the best matching codevector in the sub-codebook is transmitted to the receiver. An adaptive DFSVQ scheme is also proposed in which, when encoding an input vector, first the sub-codebook is searched for a matching codevector to satisfy a pre-specified waveform distortion. If such a codevector is not found in tile current sub-codebook then the whole super-codebook is checked for a better match. If a better match is found then a signaling flag along with the corresponding index of the codevector is transmitted to the receiver. Both the DFSVQ encoder and its adaptive version are implemented. Experimental results for several monochrome images with a super-codebook size of 256 or 512 and different sub-codebook sizes are presented     

A complexity reduction technique for image vector quantization

A technique for reducing the complexity of spatial-domain image vector quantization (VQ) is proposed. The conventional spatial domain distortion measure is replaced by a transform domain subspace distortion measure. Due to the energy compaction properties of image transforms, the dimensionality of the subspace distortion measure can be reduced drastically without significantly affecting the performance of the new quantizer. A modified LBG algorithm incorporating the new distortion measure is proposed. Unlike conventional transform domain VQ, the codevector dimension is not reduced and a better image quality is guaranteed. The performance and design considerations of a real-time image encoder using the techniques are investigated. Compared with spatial domain a speed up in both codebook design time and search time is obtained for mean residual VQ, and the size of fast RAM is reduced by a factor of four. Degradation of image quality is less than 0.4 dB in PSNR.     

A new dynamic finite-state vector quantization algorithm for imagecompression

The picture quality of conventional memory vector quantization techniques is limited by their supercodebooks. This paper presents a new dynamic finite-state vector quantization (DFSVQ) algorithm which provides better quality than the best quality that the supercodebook can offer. The new DFSVQ exploits the global interblock correlation of image blocks instead of local correlation in conventional DFSVQs. For an input block, we search the closest block from the previously encoded data using the side-match technique. The closest block is then used as the prediction of the input block, or used to generate a dynamic codebook. The input block is encoded by the closest block, dynamic codebook or supercodebook. Searching for the closest block from the previously encoded data is equivalent to expand the codevector space; thus the picture quality achieved is not limited by the supercodebook. Experimental results reveal that the new DFSVQ reduces bit rate significantly and provides better visual quality, as compared to the basic VQ and other DFSVQs.     

基于遗传算法的矢量量化

本文提出了一种基于遗传算法的矢量化方法。矢量量化码书设计本质是搜索训练矢量的最佳分类。遗传算法有卓越的全局优化搜索能力,易搜索到全局最优的矢量分类,形成高度优化的码书,可克服传统方法局部优化的缺陷。该算法不依赖初始条件、鲁棒性好、结构规则、并行性高。     

Sequential scalar quantization of vectors: an analysis

Proposes an efficient vector quantization (VQ) technique called sequential scalar quantization (SSQ). The scalar components of the vector are individually quantized in a sequence, with the quantization of each component utilizing conditional information from the quantization of previous components. Unlike conventional independent scalar quantization (ISQ), SSQ has the ability to exploit intercomponent correlation. At the same time, since quantization is performed on scalar rather than vector variables, SSQ offers a significant computational advantage over conventional VQ techniques and is easily amenable to a hardware implementation. In order to analyze the performance of SSQ, the authors appeal to asymptotic quantization theory, where the codebook size is assumed to be large. Closed-form expressions are derived for the quantizer mean squared error (MSE). These expressions are used to compare the asymptotic performance of SSQ with other VQ techniques. The authors also demonstrate the use of asymptotic theory in designing SSQ for a practical application (color image quantization), where the codebook size is typically small. Theoretical and experimental results show that SSQ far outperforms ISQ with respect to MSE while offering a considerable reduction in computation over conventional VQ at the expense of a moderate increase in MSE.