...
首页> 外文期刊>Engineering Applications of Artificial Intelligence >Fuzzy vector quantization for image compression based on competitive agglomeration and a novel codeword migration strategy
【24h】

Fuzzy vector quantization for image compression based on competitive agglomeration and a novel codeword migration strategy

机译:基于竞争集聚和新型码字迁移策略的图像压缩模糊矢量量化

获取原文
获取原文并翻译 | 示例

摘要

The implementation of fuzzy clustering in the design process of vector quantizers faces three challenges. The first is the high computational cost. The second challenge arises because a vector quantizer is required to assign each training sample to only one cluster. However, such an aggressive interpretation of fuzzy clustering results to a crisp partition of inferior quality. The third one is the dependence on initialization. In this paper we develop a fuzzy clustering-based vector quantization algorithm that deals with the aforementioned problems. The algorithm utilizes a specialized objective function, which involves the c-means and the fuzzy c-means along with a competitive agglomeration term. The joint effect is a learning process where the number of codewords (i.e. cluster centers) affected by a specific training sample is gradually reducing and therefore, the number of distance calculations is also reducing. Thus, the computational cost becomes smaller. In addition, the partition is smoothly transferred from fuzzy to crisp conditions and there is no need to employ any aggressive interpretation of fuzzy clustering. The competitive agglomeration term refines large clusters from small and spurious ones. Then, contrary to the classical competitive agglomeration method, we do not discard the small clusters but instead migrate them close to large clusters, rendering more competitive. Thus, the codeword migration process uses the net effect of the competitive agglomeration and acts to further reduce the dependence on initialization in order to obtain a better local minimum. The algorithm is applied to grayscale image compression. The main simulation findings can be summarized as follows: (a) a comparison between the proposed method and other related approaches shows its statistically significant superiority, (b) the algorithm is a fast process, (c) the algorithm is insensitive with respect to its design parameters, and (d) the reconstructed images maintain high quality, which is quantified in terms of the distortion measure.
机译:矢量量化器设计过程中模糊聚类的实现面临三个挑战。首先是高计算成本。出现第二个挑战是因为需要向量量化器才能将每个训练样本分配给一个群集。但是,对模糊聚类的这种激进解释导致质量较差的清晰划分。第三个是对初始化的依赖。在本文中,我们开发了一种基于模糊聚类的矢量量化算法来解决上述问题。该算法利用了专门的目标函数,该函数涉及c均值和模糊c均值以及竞争性聚集项。联合效应是一种学习过程,其中受特定训练样本影响的代码字(即聚类中心)的数量逐渐减少,因此距离计算的数量也减少了。因此,计算成本变小。此外,该分区可以顺利地从模糊状态转移到清晰状态,并且无需对模糊聚类进行任何积极的解释。竞争性集聚术语从小的和虚假的集群中提炼出大型集群。然后,与传统的竞争集聚方法相反,我们不丢弃小集群,而是将它们迁移到大集群附近,从而提高了竞争力。因此,码字迁移过程利用竞争性集聚的净效应,并采取措施进一步减少对初始化的依赖,以获得更好的局部最小值。该算法应用于灰度图像压缩。主要的仿真发现可以归纳如下:(a)所提方法与其他相关方法的比较显示出其统计学上的显着优势,(b)该算法是一个快速过程,(c)该算法对其不敏感设计参数,以及(d)重建的图像保持高质量,这可以通过失真度量进行量化。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号