基于MMSE的大气激光通信中LDPC码BP译码算法研究

针对大气激光通信中低密度奇偶校验码(LDPC)置信传播(BP)译码算法复杂度高的问题,对几类BP-Based简化译码算法进行了分析,并基于最小均方误差准则(MMSE)对Scaled BP-Based和Offset BP-Based两类改进译码算法的优化设计进行了探讨,得出两类算法的最优校正因子,并给出了数值计算.在不同的湍流强度下,对码长1008的(6,3)比特填充LDPC码进行了仿真实验,结果表明,对于短码长的LDPC码,当译码BER=10-5时,最小和算法(UMP BP-Based)相对于BP算法有0.1～0.15dB的译码性能损失;基于MMSE设计的两类算法相比BP算法大大降低复杂度的同时,译码性能与BP算法相当,甚至优于BP算法,优于UMP BP-Based算法0.075～0.15dB.     

基于MMSE的大气激光通信中LDPC码BP译码算法研究

针对大气激光通信中低密度奇偶校验码(LDPC)置信传播(BP)译码算法复杂度高的问题,对几类BP-Based简化译码算法进行了分析,并基于最小均方误差准则(MMSE)对Scaled BP-Based和Offset BP-Based两类改进译码算法的优化设计进行了探讨,得出两类算法的最优校正因子,并给出了数值计算.在不同的湍流强度下,对码长1008的(6,3)比特填充LDPC码进行了仿真实验,结果表明,对于短码长的LDPC码,当译码BER=10^-5时, 最小和算法(UMP BP-Based)相对于BP算法有0.1~0.15 dB的译码性能损失;基于MMSE设计的两类算法相比BP算法大大降低复杂度的同时,译码性能与BP算法相当,甚至优于BP算法,优于UMP BP-Based算法0.075~0.15 dB.     

Global and local contrast enhancement algorithm for image using wavelet neural network and stationary wavelet transform

A new contrast enhancement algorithm for image is proposed employing wavelet neural network (WNN)and stationary wavelet transform (SWT). Incomplete Beta transform (IBT) is used to enhance the global contrast for image. In order to avoid the expensive time for traditional contrast enhancement algorithms,which search optimal gray transform parameters in the whole gray transform parameter space, a new criterion is proposed with gray level histogram. Contrast type for original image is determined employing the new criterion. Gray transform parameter space is given respectively according to different contrast types,which shrinks the parameter space greatly. Nonlinear transform parameters are searched by simulated annealing algorithm (SA) so as to obtain optimal gray transform parameters. Thus the searching direction and selection of initial values of simulated annealing is guided by the new parameter space. In order to calculate IBT in the whole image, a kind of WNN is proposed to approximate the IBT. Having enhanced the global contrast to input image, discrete SWT is done to the image which has been processed by previous global enhancement method, local contrast enhancement is implemented by a kind of nonlinear operator in the high frequency sub-band images of each decomposition level respectively. Experimental results show that the new algorithm is able to adaptively enhance the global contrast for the original image while it also extrudes the detail of the targets in the original image well. The computation complexity for the new algorithm is O(MN) log(MN), where M and N are width and height of the original image, respectively.     

Magnetic resonance imaging segmentation techniques using batch-type learning vector quantization algorithms

In this article, we propose batch-type learning vector quantization (LVQ) segmentation techniques for the magnetic resonance (MR) images. Magnetic resonance imaging (MRI) segmentation is an important technique to differentiate abnormal and normal tissues in MR image data. The proposed LVQ segmentation techniques are compared with the generalized Kohonen's competitive learning (GKCL) methods, which were proposed by Lin et al. [Magn Reson Imaging 21 (2003) 863-870]. Three MRI data sets of real cases are used in this article. The first case is from a 2-year-old girl who was diagnosed with retinoblastoma in her left eye. The second case is from a 55-year-old woman who developed complete left side oculomotor palsy immediately after a motor vehicle accident. The third case is from an 84-year-old man who was diagnosed with Alzheimer disease (AD). Our comparisons are based on sensitivity of algorithm parameters, the quality of MRI segmentation with the contrast-to-noise ratio and the accuracy of the region of interest tissue. Overall, the segmentation results from batch-type LVQ algorithms present good accuracy and quality of the segmentation images, and also flexibility of algorithm parameters in all the comparison consequences. The results support that the proposed batch-type LVQ algorithms are better than the previous GKCL algorithms. Specifically, the proposed fuzzy-soft LVQ algorithm works well in segmenting AD MRI data set to accurately measure the hippocampus volume in AD MR images.     

基于粒子群优化算法的自适应图像分割方法

提出了一种基于粒子群优化算法的图像分割新方法。粒子群优化(PSO)算法是一类随机全局优化技术,它通过粒子间的相互作用发现复杂搜索空间中的最优区域缩短了寻找阈值的时间。将PSO用于基于改进的最佳加权熵阈值法的图像分割中,试验结果表明,该方法不仅能够避免陷入局部极值,而且其速度得到了明显的改善,是一种有效的图像分割新方法。     

基于局部和全局信息的自适应水平集图像分割

针对仅采用局部或全局信息无法快速准确分割灰度不均匀图像的问题,提出了一种基于局部和全局信息的自适应水平集图像分割模型。首先,利用图像局部信息和全局信息建立局部能量项和全局能量项,并且利用演化曲线轮廓内外小邻域的灰度均值差作为自变量,建立了权重函数模型,实现了局部能量项和全局能量项之间权重的自适应调整,提高了模型分割灰度不均匀图像的效率和准确性。其次,提出了一种新的能量惩罚项,避免了水平集函数的重新初始化,增强了数值计算的稳定性。最后,为验证模型的优越性,将模型与CV模型、LBF模型和LGIF模型进行了对比,并通过分割时间、迭代次数以及相似度等指标对分割结果进行了客观、定量分析。最终结果表明:该模型不但对初始轮廓具有较高鲁棒性,而且对灰度不均匀图像具有较高的分割准确性与分割效率。     

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.     

融合改进直方图PDE和二维Tsallis熵多阈值SAR分割

针对合成孔径雷达(SAR)图像中存在大量的相干斑噪声,对SAR图像进行分割易出现分割不精、边缘模糊等问题,融合改进的直方图PDE和二维Tsallis熵多阈值,提出了一种SAR图像分割算法。根据PDE直方图均衡化方法,将图像去噪与图像增强加权融合,利用各自权值调整去噪项与图像增强项;同时将二维Tsallis熵单阈值分割方法扩展到多阈值分割, 建立基于多阈值的选取方法,并引入萤火虫算法来求解最优阈值对,实现了二维Tsallis熵多阈值对去噪增强SAR图像的有效分割。仿真结果表明:与其他3种分割算法相比,该文算法在处理噪声大、灰度差值小的图像时具有较高的分割精度,PRI至少提升2.53%、VOI降低8.48%、GCE降低11.14%。     

基于改进U-Net的量子点STM图像分割

为提升量子点图像分割精度,降低特征识别误差,提出一种基于改进U-Net的量子点图像分割方法.首先,在预处理阶段,设计了以色彩通道为权值的灰度化算法,以提升后续分割效果.其次,在STM图像分割部分,在原始U-Net结构上引入中间过渡层以均衡网络各层特征.而后,建立数据集,并通过实验对比不同分割算法的精确度、召回率、F-measure.最后,将分割算法应用于量子点的特征识别,并测试了不同分割方式对应用的影响.实验结果显示,改进灰度化方法保留细节信息丰富,明显提升了量子点分割精度;改进U-Net的平均精确率、召回率、F-measure相较原始网络分别提升了13.83%、2.16%、8.13%.同时,实验数据表明由于分割精度的提升,量子点数量、纵横比等特征参数的识别更加精确.     

ISG-FHEV等效燃油消耗最小控制策略

针对室内复杂环境下火灾识别准确率会降低的问题,提出了一种改进的粒子群算法优化支持向量机参数进行火灾火焰识别的方法。首先在 颜色空间进行火焰图像分割,对获得的火焰图像进行预处理并提取相关特征量;其次采用PSO算法搜索SVM的最优核参数和惩罚因子,并在PSO算法中加入变异操作和非线性动态调整惯性权值的方法,加快了搜索SVM最优参数的精度和速度;然后将提取的火焰各个特征量作为训练样本输入SVM模型进行训练,并建立参数优化后的SVM分类器模型;最后将待测试样本输入SVM模型进行分类识别。算法的火灾识别准确率达到94.09%,分类效果明显优于其他分类算法。仿真结果表明,改进的PSO优化SVM算法提高了火焰识别的准确率和实时性,算法的自适应性更强,误判率更低。     

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.     

一种改进的稀疏近似最小方差DOA估计算法研究

针对稀疏信号的超分辨方位估计问题,提出一种可变因子的稀疏近似最小方差算法(α-Sparse Asymptotic Minimum Variance,简记为SAMV-α)。该算法利用一个折衷参数进行最大似然估计值和稀疏性能的折衷处理,在迭代过程中改变稀疏近似最小方差算法(Sparse Asymptotic Minimum Variance,SAMV)的指数因子,得到强稀疏性能和超低旁瓣的方位谱图,实现邻近目标的超分辨方位估计和相干处理性能,且无需预估角度和信源数目等先验信息,并且折衷参数的取值为0到1之间,取值区间明确,避免了稀疏信号处理算法中正则因子选取困难的弊端。计算机仿真表明SAMV-α算法方位估计性能明显优于波束扫描类算法和子空间类算法,与同类型稀疏信号处理类算法相比仍具有较高的方位估计精度,同时对于邻近声源分辨能力,SAMV-α算法较SAMV-1算法性能提高约3dB。海上试验数据处理给出了分辨率更高的方位时间历程(Bering-Time Recording,BTR)图,有效验证了SAMV-α算法的性能。      

Vessel boundary extraction based on a global and local deformable physical model with variable stiffness

Reliable and efficient vessel cross-sectional boundary extraction is very important for many medical magnetic resonance (MR) image studies. General purpose edge detection algorithms often fail for medical MR images processing due to fuzzy boundaries, inconsistent image contrast, missing edge features, and the complicated background of MR images. In this regard, we present a vessel cross-sectional boundary extraction algorithm based on a global and local deformable model with variable stiffness. With the global model, the algorithm can handle relatively large vessel position shifts and size changes. The local deformation with variable stiffness parameters enable the model to stay right on edge points at the location where edge features are strong and at the same time, fit a smooth contour at the location where edge features are missing. Directional gradient information is used to help the model to pick correct edge segments. The algorithm was used to process MR cine phase-contrast images of the aorta from 20 volunteers (over 500 images) with excellent results.     

Magnetic-resonance image segmentation based on improved variable weight multi-resolution Markov random field in undecimated complex wavelet domain

To solve the problem that the magnetic resonance (MR) image has weak boundaries, large amount of information, and low signal-to-noise ratio, we propose an image segmentation method based on the multi-resolution Markov random field (MRMRF) model. The algorithm uses undecimated dual-tree complex wavelet transformation to transform the image into multiple scales. The transformed low-frequency scale histogram is used to improve the initial clustering center of the K-means algorithm, and then other cluster centers are selected according to the maximum distance rule to obtain the coarse-scale segmentation. The results are then segmented by the improved MRMRF model. In order to solve the problem of fuzzy edge segmentation caused by the gray level inhomogeneity of MR image segmentation under the MRMRF model, it is proposed to introduce variable weight parameters in the segmentation process of each scale. Furthermore, the final segmentation results are optimized. We name this algorithm the variable-weight multi-resolution Markov random field (VWMRMRF). The simulation and clinical MR image segmentation verification show that the VWMRMRF algorithm has high segmentation accuracy and robustness, and can accurately and stably achieve low signal-to-noise ratio, weak boundary MR image segmentation.     

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.     

基于稀疏表示和学习图正则的高光谱图像特征提取

针对传统局部特征提取算法难以确定邻域参数,以及仅考虑数据间的单一结构而漏掉重要信息的问题,提出一种基于稀疏表示和学习图正则的局部判别与全局稀疏保持投影算法。该算法首先对稀疏表示模型施加基于学习的图正则器,用该改进的稀疏表示模型自适应揭示样本数据间的局部线性结构,通过局部判别模型全局集成算法来提取局部线性结构中的判别信息;利用基于学习图正则稀疏表示模型构建的新型稀疏图来揭示数据间的全局稀疏结构;使得数据的局部判别结构和全局稀疏结构在低维特征空间得以保持。通过1-近邻和支持向量机分类器对实验结果进行评估,在PaviaU和Indian Pines两个高光谱公共数据集上的实验显示,提出的局部判别与全局稀疏保持投影算法较对比算法取得了最好的性能,由于提取了全局和局部的判别信息,有效提升了高光谱图像的地物分类精度。     

AGA-BP模型在遥感影像分类中的应用研究

作为遥感研究的关键技术,遥感影像分类一直是遥感研究热点;针对目前采用BP神经网络模型进行遥感影像分类时存在的对初始权阈值敏感、易陷入局部极值和收敛速度慢的问题,为了提高BP模型遥感影像分类精度,将自适应遗传算法引入到BP网络模型参数选择中;首先运用自适应遗传算法对BP模型权阈值参数进行初始寻优,再用改进BP算法对优化的网络模型权阈值进一步精确优化,随后建立基于自适应遗传算法的BP网络分类模型,并将其应用到遥感影像数据分类研究中;仿真结果表明,新模型有效提高了遥感影像分类准确性,为遥感影像分类提出了一种新的方法,具有广泛研究价值。     

Monte-Carlo analysis of centroid detected accuracy for wavefront sensor

By utilizing Monte-Carlo simulation technology, the centroid algorithms have been compared in detail. The factors such as the detected window size, threshold and weighting power factor, which affect the detected accuracy of the wavefront sensor, have been studied and the optimal parameters for each algorithm have been found. The numerical results will be helpful for further improving the measurement accuracy of the wavefront sensor.     

一种用于前列腺区域分割的改进水平集算法

前列腺区域的精确分割是提高计算机辅助前列腺癌诊断准确率的重要前提.本文提出了一种新的精确的前列腺区域分割模型,分为4个步骤：首先,读取T₂加权磁共振（MR）图像;其次,利用半径为5个像素的8邻域模板（8x5）的局部二值模式（LBP）特征模板计算前列腺磁共振图像的LBP特征图;然后,利用改进的距离正则化水平集（DRLSE）模型对特征图进行分割,提取前列腺粗轮廓;最后将原始水平集能量函数进行优化,构造一个新的能量函数,提取局部灰度信息和梯度信息,并在此新的能量函数的基础上,将粗轮廓迭代演化为最终的细轮廓.本文将该模型在203组来自于国际光学与光子学学会-美国医学物理学家协会-国家癌症研究所（SPIE-AAPM-NCI）前列腺MR分类挑战数据库的T2W磁共振图像上进行了测试,并与医生手工分割结果进行了比较,结果表明本文提出模型得到的分割结果的Dice系数为0.94±0.01,相对体积差（RVD）为-1.21%±2.44%,95% Hausdorff距离（HD）为6.15±0.66 mm;与文献中现有的分割模型相比,使用本文提出的模型得到的前列腺区域分割结果更接近于手工分割的结果.