A chaotic quantum-behaved particle swarm optimization based on lateral inhibition for image matching

A novel Chaotic Quantum-behaved Particle Swarm Optimization Based on Lateral Inhibition (LI-CQPSO) is proposed in this paper, which is used to solve complicated image matching problems. As one of the meta-heuristic algorithms inspired by biological behaviors, Particle Swarm Optimization (PSO) has been successfully applied to image matching. However, high computational complexity and premature convergence of PSO are the main drawbacks that limit its further application. In this work, the proposed LI-CQPSO which combines advantages of chaos theory, quantum and lateral inhibition could have better performance. Chaos can guarantee the PSO escaping from local best, quantum can make the traditional PSO with better searching performance as well as having fewer parameters to control, and lateral inhibition is applied to extract the edge of the images by sharpening the spatial profile of excitation in response to a localized stimulus. The detailed process of LI-CQPSO is also given. The effectiveness and feasibility of the proposed algorithm are illustrated in solving image matching problems by series of comparative experiments with PSO, QPSO, and LI-PSO.     

A hybrid Particle Chemical Reaction Optimization for biological image matching based on lateral inhibition

In this paper, a hybrid Particle Chemical Reaction Optimization (PCRO) algorithm and lateral inhibition is proposed to solve the image matching problem. Lateral inhibition has the ability to enhance the characters of image, which can help to improve the accuracy of image matching. In order to overcome the shortcomings of basic Chemical Reaction Optimization (CRO) algorithm, we improve CRO by proposing PCRO which inspired from the thought of Particle Swarm Optimization (PSO). Comparative experimental results in image matching show that our proposed hybrid method performs much better than other bio-inspired algorithms.     

Cauchy Biogeography-Based Optimization based on lateral inhibition for image matching

In this paper, a hybrid method of Cauchy Biogeography-Based Optimization (CBBO) and Lateral Inhibition (LI) is proposed to complete the task of complicated image matching. Lateral inhibition mechanism is adopted for image pre-process to make the intensity gradient in the image contrastively strengthened. Biogeography-Based Optimization (BBO) is a bio-inspired algorithm for global optimization which is based on the science of biogeography, searching for the global optimum mainly through two steps: migration and mutation. To promote the optimization performance, an improved version of the BBO method using Cauchy mutation operator is proposed. Cauchy mutation operator enhances the exploration ability of the algorithm and improves the diversity of population. The proposed LI-CBBO method for image matching inherits both the advantages of CBBO and lateral inhibition mechanism. Series of comparative experiments using Particle Swarm Optimization (PSO), LI-PSO, BBO and LI-BBO have been conducted to demonstrate the feasibility and effectiveness of the proposed LI-CBBO.     

A Hybrid Rao-NM Algorithm for Image Template Matching

This paper proposes a hybrid Rao-Nelder–Mead (Rao-NM) algorithm for image template matching is proposed. The developed algorithm incorporates the Rao-1 algorithm and NM algorithm serially. Thus, the powerful global search capability of the Rao-1 algorithm and local search capability of NM algorithm is fully exploited. It can quickly and accurately search for the high-quality optimal solution on the basis of ensuring global convergence. The computing time is highly reduced, while the matching accuracy is significantly improved. Four commonly applied optimization problems and three image datasets are employed to assess the performance of the proposed method. Meanwhile, three commonly used algorithms, including generic Rao-1 algorithm, particle swarm optimization (PSO), genetic algorithm (GA), are considered as benchmarking algorithms. The experiment results demonstrate that the proposed method is effective and efficient in solving image matching problems.     

Biological image processing via Chaotic Differential Search and lateral inhibition

In this paper, we propose a hybrid biological image processing approach, which is based on Chaotic Differential Search (CDS) algorithm and lateral inhibition (LI) mechanism. We named this hybrid biological image processing approach as LI-CDS. Differential Search (DS) algorithm is a new bio-inspired optimization algorithm mimicking the migration behavior of an organism, and has been successfully used for solution of coordinate system transformation. The property of chaotic variable is integrated into DS to improve its search strategy so that it can escape from the local optimum. Furthermore, lateral inhibition mechanism, which is verified to have good effects on image edge extraction and image enhancement, is employed to pre-process images involved. In this hybrid biological image processing mechanism, our proposed LI-CDS method incorporates both advantages of chaos theory and lateral inhibition mechanism. Series of comparative experimental results by using LI-CDS, DS, CDS and Particle Swarm Optimization (PSO) demonstrate that the proposed LI-CDS performs better than the other three methods.     

Chaotic biogeography-based optimization approach to target detection in UAV surveillance

This paper describes a novel chaotic biogeography-based optimization (CBBO) algorithm for target detection by means of template matching to meet the request of unmanned aerial vehicle (UAV) surveillance. Template matching has been widely applied in movement tracking and other fields and makes excellent performances in visual navigation. Biogeography-based optimization (BBO) algorithm emerges as a new kind of optimization method on the basis of biogeography concept. The idea of migration and mutation strategy of species in BBO contributes to solving optimization problems. Our work adds chaotic searching strategy into BBO and applies CBBO in template matching. By utilizing chaotic strategy, the population ergodicity and global searching ability are improved, thus avoiding local optimal solutions during evolution. Applying the algorithm to resolving template matching problem overcomes the defects of common image matching. Series of experimental results demonstrate the feasibility and effectiveness of our modified approach over other algorithms in solving template matching problems. Our modified BBO algorithm performs better in terms of convergence property and robustness when compared with basic BBO.     

中医按摩机器人专家控制系统的研究

为改进传统模糊C均值聚类(FCM)算法对初始聚类中心敏感、易陷入局部收敛、抗噪性差、计算量大的问题,提出一种新的基于改进粒子群算法的快速模糊聚类图像分割方法(PSOFFCM)。方法首先利用自适应中值滤波对图像进行滤波处理,增强算法的鲁棒性;然后,将图像像素灰度值映射到二维直方图特征空间,作为聚类样本,优化FCM的目标函数,减少图像分割的计算量;最后,利用PSO算法代替FCM的梯度迭代过程,减弱了算法对初始聚类中心的依赖,同时增强全局搜索能力。实验结果表明,该方法不仅克服了FCM算法对初始聚类中心的依赖,而且抗噪能力强,收敛速度快,分割精度明显优于传统FCM。     

一种基于Kalman滤波的环形模板匹配相关跟踪算法(英文)

为了解决在目标跟踪系统中,传统相关算法在目标发生目标局部遮挡或旋转等姿态变化较大的情况时容易跟踪丢失的问题,提出一种改进的基于卡尔曼预测器的环形模板匹配相关跟踪的算法.利用卡尔曼预测器来预测下一帧目标可能出现的区域,然后在较小的预测区域中进行环形相关匹配运算,找到最佳相关匹配点,使跟踪更具主动性。环形匹配还可以克服由于姿态变化而引起的横向匹配点丢失,从而可以跟踪各种姿态运动的机动目标.实验中,利用改进算法对出现局部遮挡情况的姿态变化大的运动目标进行跟踪,传统算法处理此类情况容易跑飞,而本文算法不受这两种跟踪局限性的干扰,始终稳定跟踪机动目标且耗时大幅减少.     

一种多视点视频自动颜色校正系统

针对多视点视频系统中视点间图像颜色不一致的问题,提出了一种多视点视频自动颜色校正系统。通过求取目标图像和源图像间的颜色校正矩阵,判断其是否满足全局校正的要求;对不满足要求的图像,通过图像分割和K-L变换(Karhunen-Loeve transform),建立起目标图像和源图像中各分割区域间的局部映射关系,并通过感兴趣区域匹配,来实现对源图像的校正,最后通过视频跟踪技术实现对视频图像的校正。以标准的多视点测试图像集为例,通过将新方法与直方图匹配、全局一维线性校正算法等进行比较,表明新方法能消除匹配失真的影响,且具有较好的颜色校正效果。研究结果表明该系统可以很好地揭示图像间的颜色变化关系,并且具有很好的内容自适应性,是一种有效的多视点视频图像系统颜色校正方法。     

Regularization,Bayesian Inference,and Machine Learning Methods for Inverse Problems

Classical methods for inverse problems are mainly based on regularization theory, in particular those, that are based on optimization of a criterion with two parts: a data-model matching and a regularization term. Different choices for these two terms and a great number of optimization algorithms have been proposed. When these two terms are distance or divergence measures, they can have a Bayesian Maximum A Posteriori (MAP) interpretation where these two terms correspond to the likelihood and prior-probability models, respectively. The Bayesian approach gives more flexibility in choosing these terms and, in particular, the prior term via hierarchical models and hidden variables. However, the Bayesian computations can become very heavy computationally. The machine learning (ML) methods such as classification, clustering, segmentation, and regression, based on neural networks (NN) and particularly convolutional NN, deep NN, physics-informed neural networks, etc. can become helpful to obtain approximate practical solutions to inverse problems. In this tutorial article, particular examples of image denoising, image restoration, and computed-tomography (CT) image reconstruction will illustrate this cooperation between ML and inversion.     

An Improved Moth-Flame Optimization Algorithm with Adaptation Mechanism to Solve Numerical and Mechanical Engineering Problems

Moth-flame optimization (MFO) algorithm inspired by the transverse orientation of moths toward the light source is an effective approach to solve global optimization problems. However, the MFO algorithm suffers from issues such as premature convergence, low population diversity, local optima entrapment, and imbalance between exploration and exploitation. In this study, therefore, an improved moth-flame optimization (I-MFO) algorithm is proposed to cope with canonical MFO’s issues by locating trapped moths in local optimum via defining memory for each moth. The trapped moths tend to escape from the local optima by taking advantage of the adapted wandering around search (AWAS) strategy. The efficiency of the proposed I-MFO is evaluated by CEC 2018 benchmark functions and compared against other well-known metaheuristic algorithms. Moreover, the obtained results are statistically analyzed by the Friedman test on 30, 50, and 100 dimensions. Finally, the ability of the I-MFO algorithm to find the best optimal solutions for mechanical engineering problems is evaluated with three problems from the latest test-suite CEC 2020. The experimental and statistical results demonstrate that the proposed I-MFO is significantly superior to the contender algorithms and it successfully upgrades the shortcomings of the canonical MFO.     

基于FOA-LM算法的超声回波信号参数估计

在超声回波参数估计中,搜索莱文伯格一马夸特(Levenberg-Marquard,LM)算法的最优解会受到迭代初值与参数向量真实解接近程度的影响。针对LM算法对迭代初值敏感的问题,提出了果蝇优化算法(Fruit fly optimization algorithm,FOA)算法和LM算法结合的参数估计方法。该方法充分利用FOA算法善于进行全局搜索和LM算法善于进行局部快速搜索的优点,首先使用FOA算法求出超声回波信号的参数初值,然后利用这组初值进行LM法迭代搜索。仿真结果表明,基于FOA和LM算法相结合的方法,具有收敛速度快,精度高的特点。     

基于ICA的X射线医学图像目标提取

X射线医学成像能观察到患者体内病变组织,对医学诊断有重要参考价值。针对传统医学X射线图像噪声强、层次感差和器官组织重叠的问题,提出利用多能谱X射线成像结合独立成分分析(independent component analysis, ICA)进行图像去噪和目标提取。首先ICA结合稀疏编码收缩法对图像降噪预处理以保证目标提取精度;然后根据图像中各目标组成特性,分离图像中每个像素对应的目标厚度矩阵;最后ICA以盲分离理论获得收敛矩阵重建出目标对象。在ICA算法中,借助于主观评价标准,发现当收敛次数大于40时目标分离成功;当幅值尺度在[25, 45]区间内,目标图像对比度高且失真较小。同时,通过观测实验得到的三维峰值信噪比图表明：ICA算法中收敛次数和幅值对图像质量有较大影响,当重建图像的对比度和边缘信息均达到较好效果时,收敛次数与幅值为85和35。     

Image enhancement algorithm based on improved lateral inhibition network

There is often substantial noise and blurred details in the images captured by cameras. To solve this problem, we propose a novel image enhancement algorithm combined with an improved lateral inhibition network. Firstly, we built a mathematical model of a lateral inhibition network in conjunction with biological visual perception; this model helped to realize enhanced contrast and improved edge definition in images. Secondly, we proposed that the adaptive lateral inhibition coefficient adhere to an exponential distribution thus making the model more flexible and more universal. Finally, we added median filtering and a compensation measure factor to build the framework with high pass filtering functionality thus eliminating image noise and improving edge contrast, addressing problems with blurred image edges. Our experimental results show that our algorithm is able to eliminate noise and the blurring phenomena, and enhance the details of visible and infrared images.     

基于深度约束的水下稠密立体匹配

针对双目水下图像匹配不满足空气中常规极线约束的问题,提出一种基于深度约束的半全局算法以实现水下稠密立体匹配.首先采用深度约束确定匹配过程的深度约束搜索区域.然后,基于深度约束区域将绝对差值和梯度计算推广到二维区域并进行加权融合.在深度约束区域内的搜索过程中,采用胜者为王的策略确定某一视差值下的最佳行差及最佳行差下的匹配代价,并将其作为能量函数的数据项应用于半全局算法中,进行匹配代价的聚合.最后采用抛物线拟合法得到亚像素级的稠密视差图.在水下图片上进行的稠密立体匹配结果表明:相较于其他半全局匹配算法,本文算法在极大提高运行速度的前提下,可以获得良好的水下稠密立体匹配效果.     

自适应变异的蝙蝠算法

针对基本蝙蝠算法(BA)寻优精度不高、收敛速度慢和易早熟收敛的问题,提出一种改进的具有自适应变异机制的蝙蝠算法,用以求解复杂函数问题。利用K-means聚类对蝙蝠种群进行初始化,使种群在搜索空间分布更为均匀;采用根据迭代次数自适应变化的控制概率Pt判断算法是否进行高斯变异,增强种群多样性,促使蝙蝠个体跳出局部极值点;将自然选择思想引入BA,提高算法搜索速度,避免早熟收敛。选取几个典型函数进行测试,结果表明改进算法优化性能有了显著提高,具有较快的收敛速度,较高的寻优精度、收敛稳定性和收敛可靠性,验证了改进蝙蝠算法(IBA)的有效性及优越性。     

An Electric Fish-Based Arithmetic Optimization Algorithm for Feature Selection

With the widespread use of intelligent information systems, a massive amount of data with lots of irrelevant, noisy, and redundant features are collected; moreover, many features should be handled. Therefore, introducing an efficient feature selection (FS) approach becomes a challenging aim. In the recent decade, various artificial methods and swarm models inspired by biological and social systems have been proposed to solve different problems, including FS. Thus, in this paper, an innovative approach is proposed based on a hybrid integration between two intelligent algorithms, Electric fish optimization (EFO) and the arithmetic optimization algorithm (AOA), to boost the exploration stage of EFO to process the high dimensional FS problems with a remarkable convergence speed. The proposed EFOAOA is examined with eighteen datasets for different real-life applications. The EFOAOA results are compared with a set of recent state-of-the-art optimizers using a set of statistical metrics and the Friedman test. The comparisons show the positive impact of integrating the AOA operator in the EFO, as the proposed EFOAOA can identify the most important features with high accuracy and efficiency. Compared to the other FS methods whereas, it got the lowest features number and the highest accuracy in 50% and 67% of the datasets, respectively.     

基于Gabor小波变换的ICA火灾图像纹理识别算法

针对火灾图像纹理识别问题,提出了基于Gabor小波变换的ICA火灾图像纹理识别算法,并根据火灾图像纹理识别特点进行了优化。首先用不同尺度和方向的Gabor滤波器对待识别图像滤波,得到其特征图像,然后将特征图像转化成特征向量作为ICA的输入,得到基矢量子空间,再将测试图像经过Gabor滤波器的特征向量投影到ICA子空间中得到系数向量作为目标识别特征,最后用支持向量机进行识别。通过与Gabor滤波器法和ICA方法的对比实验,表明该算法可以在火灾纹理图像的识别率上比传统方法提高5%以上,为火灾图像识别提供了一种新思路。     

人脸图像光照预处理的一种新方法

人脸识别是图像分析和理解领域中最成功的应用之一,近年来得到了迅速的发展,但是阻碍人脸识别技术应用到实际中的瓶颈之一——光照问题,一直没能得到很好的解决。局部二值模式是最近发展起来的一种理论简单但功能强大的纹理分析算法,在计算机视觉等领域表现出良好的性能。将该纹理提取算法应用到图像预处理中并并利用大规模中国人脸图像数据库CAS-PEAL-R1来检验这种方法的有效性。实验结果表明:加入LBP纹理后,该方法能较好解决光照变化问题,提高识别性能。     

Enhanced Slime Mould Algorithm for Multilevel Thresholding Image Segmentation Using Entropy Measures

Image segmentation is a fundamental but essential step in image processing because it dramatically influences posterior image analysis. Multilevel thresholding image segmentation is one of the most popular image segmentation techniques, and many researchers have used meta-heuristic optimization algorithms (MAs) to determine the threshold values. However, MAs have some defects; for example, they are prone to stagnate in local optimal and slow convergence speed. This paper proposes an enhanced slime mould algorithm for global optimization and multilevel thresholding image segmentation, namely ESMA. First, the Levy flight method is used to improve the exploration ability of SMA. Second, quasi opposition-based learning is introduced to enhance the exploitation ability and balance the exploration and exploitation. Then, the superiority of the proposed work ESMA is confirmed concerning the 23 benchmark functions. Afterward, the ESMA is applied in multilevel thresholding image segmentation using minimum cross-entropy as the fitness function. We select eight greyscale images as the benchmark images for testing and compare them with the other classical and state-of-the-art algorithms. Meanwhile, the experimental metrics include the average fitness (mean), standard deviation (Std), peak signal to noise ratio (PSNR), structure similarity index (SSIM), feature similarity index (FSIM), and Wilcoxon rank-sum test, which is utilized to evaluate the quality of segmentation. Experimental results demonstrated that ESMA is superior to other algorithms and can provide higher segmentation accuracy.