A Grouping Differential Evolution Algorithm Boosted by Attraction and Repulsion Strategies for Masi Entropy-Based Multi-Level Image Segmentation

Masi entropy is a popular criterion employed for identifying appropriate threshold values in image thresholding. However, with an increasing number of thresholds, the efficiency of Masi entropy-based multi-level thresholding algorithms becomes problematic. To overcome this, we propose a novel differential evolution (DE) algorithm as an effective population-based metaheuristic for Masi entropy-based multi-level image thresholding. Our ME-GDEAR algorithm benefits from a grouping strategy to enhance the efficacy of the algorithm for which a clustering algorithm is used to partition the current population. Then, an updating strategy is introduced to include the obtained clusters in the current population. We further improve the algorithm using attraction (towards the best individual) and repulsion (from random individuals) strategies. Extensive experiments on a set of benchmark images convincingly show ME-GDEAR to give excellent image thresholding performance, outperforming other metaheuristics in 37 out of 48 cases based on cost function evaluation, 26 of 48 cases based on feature similarity index, and 20 of 32 cases based on Dice similarity. The obtained results demonstrate that population-based metaheuristics can be successfully applied to entropy-based image thresholding and that strengthening both exploitation and exploration strategies, as performed in ME-GDEAR, is crucial for designing such an algorithm.     

A Hybrid Preaching Optimization Algorithm Based on Kapur Entropy for Multilevel Thresholding Color Image Segmentation

Multilevel thresholding segmentation of color images plays an important role in many fields. The pivotal procedure of this technique is determining the specific threshold of the images. In this paper, a hybrid preaching optimization algorithm (HPOA) for color image segmentation is proposed. Firstly, the evolutionary state strategy is adopted to evaluate the evolutionary factors in each iteration. With the introduction of the evolutionary state, the proposed algorithm has more balanced exploration-exploitation compared with the original POA. Secondly, in order to prevent premature convergence, a randomly occurring time-delay is introduced into HPOA in a distributed manner. The expression of the time-delay is inspired by particle swarm optimization and reflects the history of previous personal optimum and global optimum. To better verify the effectiveness of the proposed method, eight well-known benchmark functions are employed to evaluate HPOA. In the interim, seven state-of-the-art algorithms are utilized to compare with HPOA in the terms of accuracy, convergence, and statistical analysis. On this basis, an excellent multilevel thresholding image segmentation method is proposed in this paper. Finally, to further illustrate the potential, experiments are respectively conducted on three different groups of Berkeley images. The quality of a segmented image is evaluated by an array of metrics including feature similarity index (FSIM), peak signal-to-noise ratio (PSNR), structural similarity index (SSIM), and Kapur entropy values. The experimental results reveal that the proposed method significantly outperforms other algorithms and has remarkable and promising performance for multilevel thresholding color image segmentation.     

中药光谱成像图像自适应区域增长分割方法

为了消除背景噪声对药材光谱图像检测结果的干扰,根据中药材光谱图像的特点,设计一种能够自适应对中药材光谱图像进行有效区域(ROI)分割的区域增长算法。该区域增长算法根据药材光谱图像的灰度直方图分布来自动选取种子点和分割阈值,在生长的同时进行连通性分析,生长结束后通过区域填充技术来消除图像中出现的孔洞。实验表明:该方法能够自动、准确地进行ROI分割,分割偏差小于8%,并且能较好地消除噪声的干扰,没有产生无意义的生长区域。     

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.     

A categorization method of infrared polarization and intensity image fusion algorithm based on the transfer ability of difference features

The fusion of infrared polarization and intensity image can significantly improve the detection performance of target, and the fused image is more suitable for human visual perception and further image-processing tasks. In this paper, a new categorization method of infrared polarization and intensity image fusion algorithm based on the transfer ability of difference feature is proposed. Firstly, the difference feature between two kinds of image and the characteristics of different fusion algorithms are analyzed and summarized. Second, an evaluation vector of fusion algorithm for difference feature transform ability is constructed. Thirdly, the transfer ability of fusion algorithm for difference feature is estimated by the evaluation vector, and the degree of transfer ability of fusion algorithm for difference feature is analyzed. Finally the fusion algorithms are classified by the degree of transfer ability of fusion algorithm for difference feature. The results shows that the proposed fusion algorithm categorization method helps select fusion algorithms in actual scene.     

多信息融合的模糊边缘检测技术

提出了一种有效的模糊边缘检测算法，与传统的单纯基于图像增强技术的模糊边缘检测算法不同，此算法采用像素点的多种信息作为边缘检测的特征信息，利用模糊逻辑对这些信息进行综合，使边缘检测器输出的边缘信息更加完善且有效.实验表明，对于处理实际工作环境中的高噪图像的边缘检测问题，此算法是一种实用而有效的方法. 关键词： 边缘检测 模糊算法 融合     

Context dependent graph-based method for laser cladding image thresholding

For segmentation method to be useful it must be fast, easy to use, and produce high quality segmentations, but few algorithms can offer this in various conditions and applications. In this paper, we propose a context dependent graph-based method for transition region extraction and thresholding. The graph-based approach is introduced into image thresholding, and context dependent graph is constructed from a given image, which can adaptively extract the pixel context and shape information because of the scalable neighborhood. Then an edge weight function is defined as the measure of possible transition pixels, and a robust fully automatic scheme for the optimal threshold is also presented. The proposed approach is validated both quantitatively and qualitatively. Compared with the traditional state-of-art algorithms on synthetic and real images, as well as laser cladding images, the experimental results suggest that the new proposal is efficient and effective.     

Edge linking and image segmentation by combining optical and digital methods

We present a hybrid method for segmentation of intensity images, which combines an optical contouring technique and digital algorithms for linking edge points or image segmentation. In a first stage, the digital image to be processed is displayed in a twisted-nematic liquid-crystal display (LCD), which is placed between a polarizer–analyzer pair at 45 deg (instead of 90 deg as occurs in standard LCDs). It is not difficult to demonstrate that the proposed setup produces a resultant image with very pronounced dark contours at middle intensity. After the optical preprocessing, two different digital algorithms are applied: an edge linking algorithm (modified chain code) and a simple thresholding technique for image segmentation. The proposed procedure works well with monochromatic and color images. The method could be useful as a robust technique for segmentation of large images in real-time, which presents potential applications in medical and biological imaging.     

红外气动退化图像复原校正的复合算法研究

鉴于气动效应图像退化因素的复杂性和随机性,单一复原算法难以满足要求,提出构造复合算法来提高湍流退化图像复原质量的思路,综合各种基于不同理论模型和应用对象的实用算法,实现优势互补。给出了现有算法结合的主要途径,主要探讨了基于统计理论的MAP复原算法与基于正则化理论的总变分算法复合后各算法结构的自适应调整和改造以及各种参数的自适应性选择问题。充分利用各算法的优势,完成基于算法结构相对稳定的智能化组合。在微机上进行了一系列的复原对比实验。实验结果表明：复合算法提高了图像的总体复原质量。     

图像增强算法综述

图像增强算法能够提高图像整体和局部的对比度,突出图像的细节信息,使增强后的图像更符合人眼的视觉特性且易于机器识别,在军事和民用领域具有广泛的应用。本文从图像增强算法的原理出发,归纳总结了近年来应用比较广泛的4类图像增强算法及其改进算法,包括直方图均衡图像增强算法、小波变换图像增强算法、偏微分方程图像增强算法和基于Retinex理论的图像增强算法。结合人眼视觉特性、噪声抑制、亮度保持和信息熵最大化等图像增强的改进算法,在保证增强图像具有较高对比度的前提下,可进一步提升图像的质量。实现了9种较为典型的图像增强算法,采用主观和客观的评价方法对增强效果进行了对比,分析了不同增强算法的优缺点,并给出了这些算法的计算时间。对这些算法的深入研究能够推动图像增强技术向更高水平发展,从而使图像增强技术在多个学科领域发挥重要作用。     

Development of High Performance Quantum Image Algorithm on Constrained Least Squares Filtering Computation

Recent development of computer technology may lead to the quantum image algorithms becoming a hotspot. Quantum information and computation give some advantages to our quantum image algorithms, which deal with the limited problems that cannot be solved by the original classical image algorithm. Image processing cry out for applications of quantum image. Most works on quantum images are theoretical or sometimes even unpolished, although real-world experiments in quantum computer have begun and are multiplying. However, just as the development of computer technology helped to drive the Technology Revolution, a new quantum image algorithm on constrained least squares filtering computation was proposed from quantum mechanics, quantum information, and extremely powerful computer. A quantum image representation model is introduced to construct an image model, which is then used for image processing. Prior knowledge is employed in order to reconstruct or estimate the point spread function, and a non-degenerate estimate is obtained based on the opposite processing. The fuzzy function against noises is solved using the optimal measure of smoothness. On the constraint condition, determine the minimum criterion function and estimate the original image function. For some motion blurs and some kinds of noise pollutions, such as Gaussian noises, the proposed algorithm is able to yield better recovery results. Additionally, it should be noted that, when there is a noise attack with very low noise intensity, the model based on the constrained least squares filtering can still deliver good recovery results, with strong robustness. Subsequently, discuss the simulation analysis of the complexity of implementing quantum circuits and image filtering, and demonstrate that the algorithm has a good effect on fuzzy recovery, when the noise density is small.     

Two-dimensional Otsu's thresholding segmentation method based on grid box filter

Otsu algorithm, an automatic thresholding method, is widely used in classic image segmentation applications. In this paper, a novel two-dimensional (2D) Otsu thresholding algorithm based on local grid box filter is proposed. In our method, firstly by utilizing the coarse-to-fine idea, the 2D histogram is divided into regions by grid technique, and each region is used as a point to form a new 2D histogram, to which 2D Otsu thresholding algorithm and an improved particle swarm optimization (PSO) algorithm are applied to get the region number of the new 2D histogram threshold. Then on the result region, the mean of the 2D histogram is computed base on box filter, and the two algorithms are applied again to obtain the final threshold for the original image. Experimental results on real data show that the proposed algorithm gets better segmentation results than the traditional recursion Otsu algorithm. It significantly reduces the time of segmentation process and simultaneously has the higher segmentation accuracy.     

Super-resolution image restoration algorithm based on orthogonal discrete wavelet transform

By using orthogonal discrete wavelet transform(ODWT)and generalized cross validation(GCV),and combining with Luck-Richardson algorithm based on Poisson-Markovmodel (MPML),several new superresolution image restoration algorithms are proposed.According to simulation experiments for practical images,all the proposed algor ithms could retain image details better than MPML,and be more suitable to low signal-to-noise ratio(SNR)images.The single operation wavelet MPML(SW-MPML)algorithm and MPML algorithm based on single operation wavelet transform(MPML-SW)avoid the iterative operation of self-adaptive parameter in MPML particularly,and improve operating speed and precision.They are instantaneous to super-resolution image restoration process and have extensive application foreground.     

Deep Learning and Entropy-Based Texture Features for Color Image Classification

In the domain of computer vision, entropy—defined as a measure of irregularity—has been proposed as an effective method for analyzing the texture of images. Several studies have shown that, with specific parameter tuning, entropy-based approaches achieve high accuracy in terms of classification results for texture images, when associated with machine learning classifiers. However, few entropy measures have been extended to studying color images. Moreover, the literature is missing comparative analyses of entropy-based and modern deep learning-based classification methods for RGB color images. In order to address this matter, we first propose a new entropy-based measure for RGB images based on a multivariate approach. This multivariate approach is a bi-dimensional extension of the methods that have been successfully applied to multivariate signals (unidimensional data). Then, we compare the classification results of this new approach with those obtained from several deep learning methods. The entropy-based method for RGB image classification that we propose leads to promising results. In future studies, the measure could be extended to study other color spaces as well.     

A non-rigid cardiac image registration method based on an optical flow model

According to non-rigid medical image registration, new method of classification registration is proposed. First, Feature points are extracted based on SIFT (Scale Invariant Feature Transform) from reference images and floating images to match feature points. And the coarse registration is performed using the least square method. Then the precise registration is achieved using the optical flow model algorithm. SIFT algorithm is based on local image features that are with good scale, rotation and illumination invariance. Optical flow algorithm does not extract features and use the image gray information directly, and its registration speed is faster. The both algorithms are complementary. SIFT algorithm is used for improving the convergence speed of optical flow algorithm, and optical flow algorithm makes the registration result more accurate. The experimental results prove that the algorithm can improve the accuracy of the non-rigid medical image registration and enhance the convergence speed. Therefore, the algorithm has some advantages in the image registration.     

Image contrast enhancement using adjacent-blocks-based modification for local histogram equalization

Infrared images usually have some non-ideal characteristics such as weak target-to-background contrast and strong noise. Because of these characteristics, it is necessary to apply the contrast enhancement algorithm to improve the visual quality of infrared images. Histogram equalization (HE) algorithm is a widely used contrast enhancement algorithm due to its effectiveness and simple implementation. But a drawback of HE algorithm is that the local contrast of an image cannot be equally enhanced. Local histogram equalization algorithms are proved to be the effective techniques for local image contrast enhancement. However, over-enhancement of noise and artifacts can be easily found in the local histogram equalization enhanced images. In this paper, a new contrast enhancement technique based on local histogram equalization algorithm is proposed to overcome the drawbacks mentioned above. The input images are segmented into three kinds of overlapped sub-blocks using the gradients of them. To overcome the over-enhancement effect, the histograms of these sub-blocks are then modified by adjacent sub-blocks. We pay more attention to improve the contrast of detail information while the brightness of the flat region in these sub-blocks is well preserved. It will be shown that the proposed algorithm outperforms other related algorithms by enhancing the local contrast without introducing over-enhancement effects and additional noise.     

非下采样Contourlet变换域混合统计模型图像去噪

提出了一种基于非下采样Contourlet变换(NSCT)域图像去噪算法.首先根据尺度间与尺度内的NSCT系数之间的相关性,用非高斯分布模型对NSCT系数与其邻域系数及父系数进行建模,给出分类准则,把系数分为重要系数和非重要系数,再采用广义高斯分布来模拟重要系数的概率分布,根据贝叶斯理论得到自适应阈值,并求出最佳参量范围.为了克服软、硬阈值函数的缺点,提出一种自适应的新阈值函数,利用新阈值函数估计出不含噪音的变换系数,并通过非下采样Contourlet逆变换得到去噪后的图像.仿真实验表明,本文方法在峰值信噪比、结构相似性与视觉效果上均优于目前许多优秀的去噪算法.     

贴片电阻表面缺陷自动识别方法

提出了一种基于非下采样Contourlet变换(NSCT)域图像去噪算法.首先根据尺度间与尺度内的NSCT系数之间的相关性,用非高斯分布模型对NSCT系数与其邻域系数及父系数进行建模,给出分类准则,把系数分为重要系数和非重要系数,再采用广义高斯分布来模拟重要系数的概率分布,根据贝叶斯理论得到自适应阈值,并求出最佳参量范围.为了克服软、硬阈值函数的缺点,提出一种自适应的新阈值函数,利用新阈值函数估计出不含噪音的变换系数,并通过非下采样Contourlet逆变换得到去噪后的图像.仿真实验表明,本文方法在峰值信噪比、结构相似性与视觉效果上均优于目前许多优秀的去噪算法.     

基于单景遥感影像的去云处理研究

去云处理是遥感图像处理以及大气纠正的重要步骤。常规的去云处理算法会随云的覆盖类型的不同而不同,如同态滤波或时间平均法,这些算法在去除云对影像影响的同时,往往会伴随地物信息的丢失。提出了基于单景遥感影像的去云处理算法———基于遥感影像分类结果及云检测结果的去云处理算法,目的是去除影像中云的散射影响,恢复地物的光谱信息。算法是针对局部有云的单景Landsat7 ETM+影像进行的。根据Landsat7 ETM+波段4,5,7对影像进行聚类分析,确定不同地物的覆盖类型;利用波段1,2,3及波段6划分出影像中的无云区以及不同覆盖厚度的云层;按照相同地物覆盖类型对非云区与不同云区进行平均反射率匹配,以达到去云的效果。结果表明,经过去云处理的影像,在分类运算中能够明显地提高分类精度,能够很好地恢复地物的光谱信息。     

Modified Gerchberg–Saxton (G-S) Algorithm and Its Application

The Gerchberg–Saxton (G-S) algorithm is a phase retrieval algorithm that is widely used in beam shaping and optical information processing. However, the G-S algorithm has difficulty obtaining the exact solution after iterating, and an approximate solution is often obtained. In this paper, we propose a series of modified G-S algorithms based on the Fresnel transform domain, including the single-phase retrieval (SPR) algorithm, the double-phase retrieval (DPR) algorithm, and the multiple-phase retrieval (MPR) algorithm. The analysis results show that the convergence of the SPR algorithm is better than that of the G-S algorithm, but the exact solution is not obtained. The DPR and MPR algorithms have good convergence and can obtain exact solutions; that is, the information is recovered losslessly. We discuss the security advantages and verification reliability of the proposed algorithms in image encryption. A multiple-image encryption scheme is proposed, in which n plaintexts can be recovered from n ciphertexts, which greatly improves the efficiency of the system. Finally, the proposed algorithms are compared with the current phase retrieval algorithms, and future applications are discussed. We hope that our research can provide new ideas for the application of the G-S algorithm.