Self-configuration single particle optimizer for DNA sequence compression

This paper presents a novel self-configuration single particle optimizer (SCSPO) for DNA sequence compression. Particularly, SCSPO searches an optimal compression codebook of all unique repeat patterns and then DNA sequences are compressed by replacing the duplicate fragments with the indexes of the corresponding matched code vectors in the codebook. Featured with a crucial self-configuration process, SCSPO optimizes the codebook with no predefined parameter settings required. Experimental results on benchmark numerical functions and real-world DNA sequences demonstrate that SCSPO is capable of attaining better fitness value than many other PSO variants and the proposed DNA sequence compression algorithm based on SCSPO attains encouraging compression performance.     

HEURISTIC PARTICLE SWARM OPTIMIZATION LEARNING-BASED IMAGE COMPRESSION SYSTEM

Traditional LBG algorithm is a pure iterative optimization procedure to achieve the vector quantization (VQ) codebook, where an initial codebook is continually refined at every iteration to reduce the distortion between code-vectors and a given training data set. However, such interactive type learning algorithms will easily direct final results converging toward the local optimization while the high quality of the initial codebook is not available. In this article, an efficient heuristic-based learning method, called novel particle swarm optimization (NPSO), is proposed to design the proper codebook of VQ scheme that can develop the image compression system. To improve the performance of the basic PSO, the centroid updating machine applies the one step-size gradient descent learning step in the heuristic learning procedure. Additionally, the presented NPSO with advantages of the centroid updating machine is proposed to quickly achieve the near-optimal reconstructive image. For demonstrating the proposed NPSO learning scheme, the image with several horizontal grey bars is first applied to present the efficiency of the NPSO learning mechanism. LBG and NPSO learning methods are also applied to test the reconstructing performance in several type images “Lena,” “Airplane,” “Cameraman”, and “peppers.” In our experiments, the NPSO learning algorithm provides the higher performance than conventional LBG methods in the application of building image compression system.     

改进的基于主分量分析的码书设计算法

针对基于主分量分析和遗传算法的码书设计算法中当码书大小超过64时码书性能下降的问题,提出了一种改进的码书设计算法．首先采用主分量分析对训练矢量降维以减少计算复杂度,然后利用遗传算法的全局优化能力计算得到接近全局最优的码书．实验结果表明,与原算法和经典的LBG算法相比,文中算法所生成的码书性能有了明显提高,而且计算时间也少于LBG算法．     

An evolutionary lion optimization algorithm‐based image compression technique for biomedical applications

Recently, medical image compression becomes essential to effectively handle large amounts of medical data for storage and communication purposes. Vector quantization (VQ) is a popular image compression technique, and the commonly used VQ model is Linde–Buzo–Gray (LBG) that constructs a local optimal codebook to compress images. The codebook construction was considered as an optimization problem, and a bioinspired algorithm was employed to solve it. This article proposed a VQ codebook construction approach called the L2‐LBG method utilizing the Lion optimization algorithm (LOA) and Lempel Ziv Markov chain Algorithm (LZMA). Once LOA constructed the codebook, LZMA was applied to compress the index table and further increase the compression performance of the LOA. A set of experimentation has been carried out using the benchmark medical images, and a comparative analysis was conducted with Cuckoo Search‐based LBG (CS‐LBG), Firefly‐based LBG (FF‐LBG) and JPEG2000. The compression efficiency of the presented model was validated in terms of compression ratio (CR), compression factor (CF), bit rate, and peak signal to noise ratio (PSNR). The proposed L2‐LBG method obtained a higher CR of 0.3425375 and PSNR value of 52.62459 compared to CS‐LBG, FA‐LBG, and JPEG2000 methods. The experimental values revealed that the L2‐LBG process yielded effective compression performance with a better‐quality reconstructed image.     

Evolutionary fuzzy particle swarm optimization vector quantization learning scheme in image compression

This article develops an evolutional fuzzy particle swarm optimization (FPSO) learning algorithm to self extract the near optimum codebook of vector quantization (VQ) for carrying on image compression. The fuzzy particle swarm optimization vector quantization (FPSOVQ) learning schemes, combined advantages of the adaptive fuzzy inference method (FIM), the simple VQ concept and the efficient particle swarm optimization (PSO), are considered at the same time to automatically create near optimum codebook to achieve the application of image compression. The FIM is known as a soft decision to measure the relational grade for a given sequence. In our research, the FIM is applied to determine the similar grade between the codebook and the original image patterns. In spite of popular usage of Linde–Buzo–Grey (LBG) algorithm, the powerful evolutional PSO learning algorithm is taken to optimize the fuzzy inference system, which is used to extract appropriate codebooks for compressing several input testing grey-level images. The proposed FPSOVQ learning scheme compared with LBG based VQ learning method is presented to demonstrate its great result in several real image compression examples.     

基于遗传LBG的图像矢量量化改进算法

矢量量化在图像压缩中有着举足轻重的地位。码书的设计是算法的关键,经典的LBG聚类算法由于对初始码书的选择非常敏感会导致不同的量化效果。把遗传算法和LBG算法相结合,充分利用LBG算法的局部搜索能力和遗传算法的全局寻优能力,能够在大大改善码本质量的同时加快算法的收敛速度。     

基于h-距离的DNA编码序列设计

针对DNA编码序列设计问题,将其转换为带约束的多目标优化问题,在单链DNA集合中引入h-距离,构造了DNA序列间的共享函数,应用小种群遗传算法,对DNA编码序列设计问题进行求解。与已有结果比较,算法可以得到更好的DNA序列且计算效率较高。算法可用于DNA计算中编码序列的具体设计。     

Truss structure optimization using adaptive multi-population differential evolution

This paper applies multi-population differential evolution (MPDE) with a penalty-based, self-adaptive strategy—the adaptive multi-population differential evolution (AMPDE)—to solve truss optimization problems with design constraints. The self-adaptive strategy developed in this study is a new adaptive approach that adjusts the control parameters of MPDE by monitoring the number of infeasible solutions generated during the evolution process. Multiple different minimum weight optimization problems of the truss structure subjected to allowable stress, deflection, and kinematic stability constraints are used to demonstrate that the proposed algorithm is an efficient approach to finding the best solution for truss optimization problems. The optimum designs obtained by AMPDE are better than those found in the current literature for problems that do not violate the design constraints. We also show that self-adaptive strategy can improve the performance of MPDE in constrained truss optimization problems, especially in the case of simultaneous optimization of the size, topology, and shape of truss structures.     

说话人识别中采用混合免疫算法的VQ码本设计

矢量量化(VQ)方法是文本无关说话人识别中广泛应用的建模方法之一,它的主要问题是码本设计问题。语音特征参数是高维数据,样本分布复杂,因此码本设计的难度也很大,传统的LBG算法只能获得局部最优的码本。提出一种VQ码本设计的新方法,将小生境技术与K-均值算法融入到免疫算法训练过程中,形成混合免疫算法,采用针对高维数据聚类的改进变异算子,降低了随机变异的盲目性,增强群体的全局及局部搜索能力,同时通过接种疫苗提高算法的收敛速度。说话人识别实验表明,与传统LBG和基于混合遗传算法的VQ码本设计方法相比,该方法可以得到更优的模型参数,使得系统的识别率进一步提高。     

Image vector quantization algorithm via honey bee mating optimization

The vector quantization (VQ) was a powerful technique in the applications of digital image compression. The traditionally widely used method such as the Linde–Buzo–Gray (LBG) algorithm always generated local optimal codebook. Recently, particle swarm optimization (PSO) is adapted to obtain the near-global optimal codebook of vector quantization. An alternative method, called the quantum particle swarm optimization (QPSO) had been developed to improve the results of original PSO algorithm. In this paper, we applied a new swarm algorithm, honey bee mating optimization, to construct the codebook of vector quantization. The results were compared with the other three methods that are LBG, PSO–LBG and QPSO–LBG algorithms. Experimental results showed that the proposed HBMO–LBG algorithm is more reliable and the reconstructed images get higher quality than those generated from the other three methods.     

基于主分量分析和遗传算法的码书设计算法

提出了一种高效的矢量量化码书设计算法．首先采用主分量分析对训练矢量排序以减少计算复杂度，然后充分利用遗传算法的全局优化能力计算得到接近全局最优的矢量量化码书．实验结果表明：该算法的计算时间少于经典的LBG算法，而且当码书大小不超过64时，所生成的码书性能比LBG算法有明显提高．     

Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing

DNA computing relies on biochemical reactions of DNA molecules and may result in incorrect or undesirable computations. Therefore, much work has focused on designing the DNA sequences to make the molecular computation more reliable. Sequence design involves with a number of heterogeneous and conflicting design criteria and traditional optimization methods may face difficulties. In this paper, we formulate the DNA sequence design as a multiobjective optimization problem and solve it using a constrained multiobjective evolutionary algorithm (EA). The method is implemented into the DNA sequence design system, NACST/Seq, with a suite of sequence-analysis tools to help choose the best solutions among many alternatives. The performance of NACST/Seq is compared with other sequence design methods, and analyzed on a traveling salesman problem solved by bio-lab experiments. Our experimental results show that the evolutionary sequence design by NACST/Seq outperforms in its reliability the existing sequence design techniques such as conventional EAs, simulated annealing, and specialized heuristic methods.     

Efficient parallel processing of competitive learning algorithms

Vector quantization (VQ) is an attractive technique for lossy data compression, which has been a key technology for data storage and/or transfer. So far, various competitive learning (CL) algorithms have been proposed to design optimal codebooks presenting quantization with minimized errors. Although algorithmic improvements of these CL algorithms have achieved faster codebook design than conventional ones, limitations of speedup still exist when large data sets are processed on a single processor. Considering a variety of CL algorithms, parallel processing on flexible computing environment, like general-purpose parallel computers is in demand for a large-scale codebook design. This paper presents a formulation for efficiently parallelizing CL algorithms, suitable for distributed-memory parallel computers with a message-passing mechanism. Based on this formulation, we parallelize three CL algorithms: the Kohonen learning algorithm, the MMPDCL algorithm and the LOJ algorithm. Experimental results indicate a high scalability of the parallel algorithms on three different types of commercially available parallel computers: IBM SP2, NEC AzusA and PC cluster.     

基于神经网络的多光谱遥感图像无损压缩

分析并改进了利用自组织特征映射(SOFM)神经网络设计码书的方法,提出了一种基于改进SOFM算法设计码书的矢量量化和分类谱间预测相结合的多光谱图像无损压缩方法。该方法对光谱信息进行矢量量化,根据分类信息生成残差图像以去除数据的空间相关性,构造分类谱间预测器去除数据的谱间结构和统计相关性。对机载64波段多光谱遥感图像的试验结果表明,该方法无论是对训练集内图像还是训练集外图像,均取得了较好的压缩效果,平均无损压缩比达到3.2以上。     

An optimized non-unitary linear precoding design for OSTBCs

This paper tackles the optimization of non-unitary linear precoding design for orthogonal spacetime block codes (OSTBCs). We dig out the transmission potentials by the analysis from eigen-space point of view according to the unique structure of OSTBCs. The proposed precoding form is proven to be theoretically optimized. Compared with the classical unitary Grassmannian codebook design, the non-unitary codebook further improves the overall performance of practical systems. The constraint on codebook size to g...     

A multiobjective swarm intelligence approach based on artificial bee colony for reliable DNA sequence design

The design of reliable DNA sequences is crucial in many engineering applications which depend on DNA-based technologies, such as nanotechnology or DNA computing. In these cases, two of the most important properties that must be controlled to obtain reliable sequences are self-assembly and self-complementary hybridization. These processes have to be restricted to avoid undesirable reactions, because in the specific case of DNA computing, undesirable reactions usually lead to incorrect computations. Therefore, it is important to design robust sets of sequences which provide efficient and reliable computations. The design of reliable DNA sequences involves heterogeneous and conflicting design criteria that do not fit traditional optimization methods. In this paper, DNA sequence design has been formulated as a multiobjective optimization problem and a novel multiobjective approach based on swarm intelligence has been proposed to solve it. Specifically, a multiobjective version of the Artificial Bee Colony metaheuristics (MO-ABC) is developed to tackle the problem. MO-ABC takes in consideration six different conflicting design criteria to generate reliable DNA sequences that can be used for bio-molecular computing. Moreover, in order to verify the effectiveness of the novel multiobjective proposal, formal comparisons with the well-known multiobjective standard NSGA-II (fast non-dominated sorting genetic algorithm) were performed. After a detailed study, results indicate that our artificial swarm intelligence approach obtains satisfactory reliable DNA sequences. Two multiobjective indicators were used in order to compare the developed algorithms: hypervolume and set coverage. Finally, other relevant works published in the literature were also studied to validate our results. To this respect the conclusion that can be drawn is that the novel approach proposed in this paper obtains very promising DNA sequences that significantly surpass other results previously published.     

一种求解车间调度问题的混沌遗传规划方法

作业车间调度问题是制造业的一个经典NP-hard组合优化难题。提出一种基于混沌遗传规划的调度算法,利用遗传规划进行染色体的结构设计,采用混沌序列改善初始种群质量,利用混沌扰动来维持进化群体的多样性,并自适应调整个体权重,使算法具有优良的综合求解性能。实验表明,算法对典型的标准调度测试问题具有较强的全局搜索能力,甘特图表明其获得的最优解优于当前已知的最优解历史记录,对比结果表明了该方法的有效性。     

基于稳健统计的矢量量化器设计算法

L BG算法作为矢量量化的基本算法具有经典意义 ,但由于在训练图象中 ,总存在少量的离群矢量 ,使得在训练码书时 ,码字的分布受到影响 ,进而使得压缩性能下降 ,因而不能充分体现出矢量量化的优越性能 .而运用基于稳健统计的方法来设计矢量量化器 ,由于减少了码书中的离群矢量 ,同时加强了中心矢量在码书中的权重 ,因而不仅能够尽量减少码书的冗余 ,而且能大幅度提高压缩性能 .实验结果显示 ,用基于稳健统计的设计方法设计的码书 ,其压缩性能比传统的 L BG算法有了较大的改善 ,且恢复图象的主观、客观效果都是令人满意的 .     

人工蜂群算法改进DHMM的语音识别方法

针对离散隐马尔可夫(Discrete Hidden Markov Model,DHMM)语音识别系统中LBG算法对初始码书的依赖性和易陷入局部最优解的问题,采用人工蜂群(Artificial Bee Colony,ABC)算法对语音特征参数进行矢量量化,从而得到最优码书,提出了ABC改进DHMM的孤立词语音识别方法。先提取语音信号的特征参数,然后用ABC算法中每个食物源表示一个码书,以人工蜂群进化的方式对初始码书进行迭代而获得最优码书,最后把最优码书的码矢标号代入DHMM模型进行训练和识别。实验结果表明,ABC改进的DHMM语音识别方法与传统的LBG及粒子群优化初始码书的LBG的DHMM语音识别方法相比具有较高的识别率和较好的鲁棒性。     

基于自组织特征映射神经网络的图像压缩

简要介绍了基于自组织特征映射(SOFM)神经网络的图像压缩的传统算法。通过对传统方法的优缺点分析，提出了一种新的简单的矢量量化压缩方法。新算法采用分类码书设计和残留编码，大大提高了图像的客观指标和主观视觉效果。实验表明此方法明显优于传统的SOFM算法，而且易于硬件实现。