噪声信道中基于进化算法的矢量量化器的设计

本文提出了一个基于进化算法的信道最优矢量量化器（COVQ）设计算法。该算法在给定信道状态模型和存在信道噪声的情况下，可以有效地提高矢量量化器的性能，实现了信道最优矢量量化器的设计。与目前常用的码书设计算法比较，实验结果表明该算法可获得比传统算法更高的性能增益。     

Hamming-distance-based adaptive quantum-inspired evolutionary algorithm for network coding resources optimization

An adaptive quantum-inspired evolutionary algorithm based on Hamming distance(HD-QEA) was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step(RAS) was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA, a basic quantum-inspired evolutionary algorithm(QEA) and an individual’s fitness based adaptive QEA. A solid demonstration was provided that the proposed HD-QEA is better than the other two algorithms in terms of the convergence speed and the global optimization capability when they are employed to optimize the network coding resources in multicast networks.     

演化算法在微带天线优化中的应用

将演化算法和高频电磁仿真软件与矩阵实验室应用程序编程接口(High Frequency Structure Simulator-Matrix Laboratory-Application Programming Interface, HFSS-MATLAB-API)应用到微带天线的优化中,详细叙述了该方案优化微带天线的步骤,讨论了在优化过程中会遇到的一些常见问题,如基因串的定义、遗传算法结合HFSS-MATLAB-API计算个体的适应度值、适应度函数的设计、遗传策略的考虑等.优化出了一副频率可重构微带天线,该天线通过开关的闭合和断开可动态地工作在S波段和X波段.     

求解多输入多输出检测新算法——遗传粒子群优化

设计两种基于粒子群优化算法（PSO）和基于遗传算法（GA）的多输入多输出（MIMO）系统检测算法。提出一种新的融合GA和PSO进化机制的遗传粒子群进化（GPSO）算法,并将其应用于MIMO系统检测问题求解。新算法改善了初始化种群,并将每一代粒子划为精英粒子、次优粒子和糟糕粒子三部分,对这三种粒子分别采用极值扰动、PSO进化和淘汰策略以改善算法的全局和局部搜索能力,从而加快算法的寻优速率和收敛速度。仿真结果表明：与基于PSO和基于GA的检测算法相比,GPSO的检测算法能够很大程度减少种群规模和迭代次数。而与最优的最大似然译码算法相比,GPSO检测算法能够在计算复杂度和误码性能之间获得很好的折中。     

有噪复杂度寻踪的新算法

复杂度寻踪是投影寻踪向时间序列数据,即具有时间结构信号的扩展。该方法是和具有时间依赖特性的源信号的盲分离和独立成分分析紧密联系的。在源信号是具有时间依赖特性和存在高斯噪声的情况下,现有的有噪复杂度寻踪算法没有给出自回归系数的估计方法,影响了算法的实际应用,提出了有噪复杂度寻踪的新算法,该算法给出了自回归系数的估计方法。对自然图像和人工信号的仿真表明了提出算法的有效性,和现有的盲源分离算法相比较,提出算法具有好的信号分离性能。      

Multiobjective placement of electronic components using evolutionary algorithms

The optimal placement of electronic components on a printed circuit board is a well-studied optimization task. However, despite the involvement of multiple conflicting objectives, researchers have mainly used a single objective of minimizing the overall wire length or minimizing the overall heat generation or minimizing the overall time delay in its functioning. In this paper, the problem is treated as a two-objective optimization problem of minimizing the overall wire length and minimizing the failure-rate of the board arising due to uneven local heat accumulation. The proposed strategy uses a novel representation procedure and a multiobjective evolutionary algorithm capable of finding multiple Pareto-optimal solutions simultaneously. Moreover, the flexibility and efficacy of the proposed strategy have been demonstrated by simultaneously optimizing the placement of components and the layout of the board. The convergence and the extent of spread obtained in the solutions reliably by repetitive applications of the proposed procedure should encourage further application of the approach to more complex placement design problems.     

Multiobjective optimization design of Yagi-Uda antenna

An optimization method, such as the steepest gradient methods, could not easily obtain globally optimum solutions for devising antenna design parameters that allow the antenna to simultaneously improve multiple performances such as gain, sidelobe level, and input impedance. The genetic algorithm (GA) is suitable for empirically solving optimization problems and is effective in designing an antenna. In particular, this method can solve the multiobjective optimization problem using various Pareto-optimal solutions in an extremely efficient manner. In this paper, the Pareto GA, by which various Pareto-optimal solutions for each objective function (performance) can be obtained in a single trial of a numerical simulation and which enables the selection of parameters in accordance with the design requirement, is applied to the multiobjective optimization design of the Yagi-Uda antenna. The effectiveness of the Pareto GA was demonstrated by comparing the performances obtained by the Pareto GA with those of the previously reported values, which were obtained by the conventional GA, and with the values of the design benchmark reference.     

An improved quantum-inspired evolutionary algorithm for coding resource optimization based network coding multicast scheme

This paper investigates how to minimize the required coding resources in network-coding-based multicast scenarios. An evolutionary algorithm (MEQEA) is proposed to address the above problem. Based on quantum-inspired evolutionary algorithm (QEA), MEQEA introduces multi-granularity evolution mechanism which allows different chromosomes, at each generation, to have different rotation angle step values for update. In virtue of this mechanism, MEQEA significantly improves its capability of exploration and exploitation, since its optimization performance is no longer overly dependant upon the single rotation angle step scheme shared by all chromosomes. MEQEA also presents an adaptive quantum mutation operation which is able to prevent local search efficiently. Simulations are carried out over a number of network topologies. The results show that MEQEA outperforms other heuristic algorithms and is characterized by high success ratio, fast convergence, and excellent global-search capability.     

Bayesian deconvolution of noisy filtered point processes

The detection and estimation of filtered point processes using noisy data is an essential requirement in many seismic, ultrasonic, and nuclear applications. We address this joint detection/estimation problem using a Bayesian approach, which allows us to easily include any relevant prior information. Performing Bayesian inference for such a complex model is a challenging computational problem as it requires the evaluation of intricate high-dimensional integrals. We develop here an efficient stochastic procedure based on a reversible jump Markov chain Monte Carlo method to solve this problem and prove the geometric convergence of the algorithm. The proposed model and algorithm are demonstrated on an application arising in nuclear science     

Extending the BACIC algorithm for robust transmission over a noisy channel

This study introduces error control to the block arithmetic coding for image compression (BACIC): a new method for lossless bilevel image compression. BACIC can successfully transmit bilevel images when channel bit error rates are as high as 10/sup -3/ while providing compression ratios twice that of G3, the only facsimile standard which incorporates error control into its algorithm.     

分区均值的自适应噪声图像边缘检测算法

针对边缘检测算法存在的检测精度与抑噪的矛盾,提出一种基于新的图像边缘检测算法。算法将检测窗口按照0o,45o,90o和135o四个不同方向分别划分为两个子区域,先统计每个检测窗口(3×3)内脉冲噪声点的个数,如果超过3个,则扩大检测窗口至5×5。对于检测窗口每个方向划分的两个子区域,分别计算区域内的非噪声点的平均灰度值,利用平均值差的绝对值作为窗口的方向梯度值,进而求得中心点的梯度。然后,对梯度图像采用改进的非极大值抑制方法进行细化,并提取边缘。实验结果表明,该算法检测的图像边缘方向性较强,边缘较细,不仅对不同程度脉冲噪声干扰图像具有较强的抑噪能力,而且对高斯噪声也具有一定程度的抑制效果,算法具有较强的适应性。     

含噪语音压缩感知自适应快速重构算法

本文针对含噪语音压缩感知在低信噪比时重构性能差的问题,提出了一种自适应快速重构算法。该算法将行阶梯观测矩阵与一种新型的快速重构算法结合,并根据含噪语音信号的信噪比自适应选择最佳重构参数,使得在重构语音的同时提高了重构信噪比。算法实现简单快速,且不需要预先计算信号的稀疏度。实验结果表明,自适应快速重构算法重构性能优于基追踪算法和自适应共轭梯度投影算法以及快速重构算法,重构速度略慢于快速重构算法,但快于基追踪算法和自适应共轭梯度投影算法。      

Multiobjective optimization of fractional frequency reuse for irregular OFDMA macrocellular deployments

Interference mitigation has been identified as a key challenge for emerging cellular technologies based on Orthogonal Frequency Division Multiple Access, such as Long Term Evolution. In this context, static intercell interference coordination including Fractional Frequency Reuse (FFR) have been adopted by mobile operators as a good alternative to improve the quality of service at cell edges. Nevertheless, recent results made evident the need for additional research efforts as default FFR configurations only offer tradeoffs in which spectral efficiency is severely penalized. Moreover, the performance of such baseline designs has been showed to be poor in realistic cellular deployments featuring irregular cell patterns. This paper solves this problematic by introducing a novel multiobjective optimization framework based on evolutionary algorithms that jointly takes into account system capacity, cell edge performance, and energy consumption. With respect to important reference schemes, the proposed algorithm succeeds in finding FFR configurations achieving gains between 10 and 40 % in terms of system capacity while simultaneously improving cell edge performance up to 70 %.     

Multiobjective genetic optimization of diagnostic classifiers withimplications for generating receiver operating characteristiccurves

It is well understood that binary classifiers have two implicit objective functions (sensitivity and specificity) describing their performance. Traditional methods of classifier training attempt to combine these two objective functions (or two analogous class performance measures) into one so that conventional scalar optimization techniques can be utilized. This involves incorporating a priori information into the aggregation method so that the resulting performance of the classifier is satisfactory for the task at hand. We have investigated the use of a niched Pareto multiobjective genetic algorithm (GA) for classifier optimization. With niched Pareto GA's, an objective vector is optimized instead of a scalar function, eliminating the need to aggregate classification objective functions. The niched Pareto GA returns a set of optimal solutions that are equivalent in the absence of any information regarding the preferences of the objectives. The a priori knowledge that was used for aggregating the objective functions in conventional classifier training can instead be applied post-optimization to select from one of the series of solutions returned from the multiobjective genetic optimization. We have applied this technique to train a linear classifier and an artificial neural network (ANN), using simulated datasets. The performances of the solutions returned from the multiobjective genetic optimization represent a series of optimal (sensitivity, specificity) pairs, which can be thought of as operating points on a receiver operating characteristic (ROC) curve. All possible ROC curves for a given dataset and classifier are less than or equal to the ROC curve generated by the niched Pareto genetic optimization.     

A hybrid evolutionary programming method for circuit optimization

A hybrid evolutionary programming (EP) method is presented for global optimization of complex circuits. The conventional EP is integrated with a clustering algorithm to improve the robustness of the algorithm for complex multimodal circuit optimization problems. The EP generates populations around the regions of the search space which can potentially contain a minimum but may be overlooked. The clustering algorithm is used to identify these regions dynamically. In order to improve the speed of optimization, the EP is combined with a gradient-based search method in an efficient fashion. The local search is performed from the center of each identified cluster in order to find the minimum in the region very fast. The hybrid algorithm can also reduce the search space by avoiding the search in the areas that were previously investigated. This feature greatly improves the speed of optimization and prevents the premature convergence as well. The algorithm performed very well in several benchmark problems including a test function minimization and global optimization of a complex RF diplexer circuit.     

Modifications of the Euclidean algorithm for isolatingperiodicities from a sparse set of noisy measurements

Modifications of the Euclidean algorithm are presented for determining the period from a sparse set of noisy measurements. The elements of the set are the noisy occurrence times of a periodic event with (perhaps very many) missing measurements. This problem arises in radar pulse repetition interval (PRI) analysis, in bit synchronization in communications, and in other scenarios. The proposed algorithms are computationally straightforward and converge quickly. A robust version is developed that is stable despite the presence of arbitrary outliers. The Euclidean algorithm approach is justified by a theorem that shows that, for a set of randomly chosen positive integers, the probability that they do not all share a common prime factor approaches one quickly as the cardinality of the set increases. In the noise-free case, this implies that the algorithm produces the correct answer with only 10 data samples, independent of the percentage of missing measurements. In the case of noisy data, simulation results show, for example, good estimation of the period from 100 data samples with 50% of the measurements missing and 25% of the data samples being arbitrary outliers     

An improved noise loss correction algorithm for learning from noisy labels

Despite excellent performance in image classification researches, the training of the deep neural networks (DNN) needs a large set of clean data with accurate annotations. The collection of a dataset is easy, but annotating the collected data is difficult on the contrary. There are many image data on the websites, which contain inaccurate annotations, but trainings on these datasets may make networks easier to over-fit noisy data and cause performance degradation. In this work, we propose an improved joint optimization framework for noise correction, which uses the Combination of Mix-up entropy and Kullback-Leibler entropy (CMKL) as the loss function. The new loss function can achieve better fine-tuning results after updating all label annotations. The experimental results on publicly available CIFAR-10 dataset and Clothing1M dataset show superior performance of our approach compared with other state-of-the-art methods.     

Multiobjective genetic algorithm approach for a dual-feed circularpolarised patch antenna design

A design procedure for a dual feed network is presented to produce a circular polarised matched antenna involving eight design parameters with associated constraints. Determination of such design parameters has been made possible by utilising a multiobjective genetic algorithm (MGA) approach. The conditions for circular polarisation and impedance matching were the objective functions employed in the MGA. The associated constraints were the lengths and characteristic impedance values of the feed network. The return loss and axial ratio for a 5.8 GHz antenna were investigated and good agreement was obtained between simulated and practical measurements     

A hybrid evolutionary algorithm for multiobjective sparse reconstruction

Sparse reconstruction (SR) algorithms are widely used in acquiring high-quality recovery results in compressed sensing. Existing algorithms solve SR problem by combining two contradictory objectives (measurement error and sparsity) using a regularizing coefficient. However, this coefficient is hard to determine and has a large impact on recovery quality. To address this concern, this paper converts the traditional SR problem to a multiobjective SR problem which tackles the two objectives simultaneously. A hybrid evolutionary paradigm is proposed, in which differential evolution is employed and adaptively configured for exploration and a local search operator is designed for exploitation. Another contribution is that the traditional linearized Bregman method is improved and used as the local search operator to increase the exploitation capability. Numerical simulations validate the effectiveness and competitiveness of the proposed hybrid evolutionary algorithm with LB-based local search in comparison with other algorithms.