非高斯冲激干扰下基于Softplus函数的核自适应滤波算法

针对非高斯环境下一般自适应滤波算法性能严重下降问题,本文提出了一种基于Softplus函数的核分式低次幂自适应滤波算法(kernel fractional lower algorithm based on Softplus function,SP-KFLP),该算法将Softplus函数与核分式低次幂准则相结合,利用输...     

Fractional-order TV-L2 model for image denoising

This paper proposes a new fractional order total variation (TV) denoising method, which provides a much more elegant and effective way of treating problems of the algorithm implementation, ill-posed inverse, regularization parameter selection and blocky effect. Two fractional order TV-L² models are constructed for image denoising. The majorization-minimization (MM) algorithm is used to decompose these two complex fractional TV optimization problems into a set of linear optimization problems which can be solved by the conjugate gradient algorithm. The final adaptive numerical procedure is given. Finally, we report experimental results which show that the proposed methodology avoids the blocky effect and achieves state-of-the-art performance. In addition, two medical image processing experiments are presented to demonstrate the validity of the proposed methodology.     

A discrete time method to the first variation of fractional order variational functionals

The fact that the first variation of a variational functional must vanish along an extremizer is the base of most effective solution schemes to solve problems of the calculus of variations. We generalize the method to variational problems involving fractional order derivatives. First order splines are used as variations, for which fractional derivatives are known. The Grünwald-Letnikov definition of fractional derivative is used, because of its intrinsic discrete nature that leads to straightforward approximations.     

Adaptive step-size modified fractional least mean square algorithm for chaotic time series prediction

This paper presents an adaptive step-size modified fractional least mean square （AMFLMS） algorithm to deal with a nonlinear time series prediction. Here we incorporate adaptive gain parameters in the weight adaptation equation of the original MFLMS algorithm and also introduce a mechanism to adjust the order of the fractional derivative adaptively through a gradient-based approach. This approach permits an interesting achievement towards the performance of the filter in terms of handling nonlinear problems and it achieves less computational burden by avoiding the manual selection of adjustable parameters. We call this new algorithm the AMFLMS algorithm. The predictive performance for the nonlinear chaotic Mackey Glass and Lorenz time series was observed and evaluated using the classical LMS, Kernel LMS, MFLMS, and the AMFLMS filters. The simulation results for the Mackey glass time series, both without and with noise, confirm an improvement in terms of mean square error for the proposed algorithm. Its performance is also validated through the prediction of complex Lorenz series.     

On Scientific Data and Image Compression Based on Adaptive Higher-Order FEM

We present a novel compression algorithm for 2D scientific data and images based on exponentially-convergent adaptive higher-order finite element methods (FEM). So far, FEM has been used mainly for the solution of partial differential equations (PDE), but we show that it can be applied to data and image compression easily. The adaptive compression algorithm is trivial compared to adaptive FEM algorithms for PDE since the error estimation step is not present. The method attains extremely high compression rates and is able to compress a data set or an image with any prescribed error tolerance. Compressed data and images are stored in the standard FEM format, which makes it possible to analyze them using standard PDE visualization software. Numerical examples are shown. The method is presented in such a way that it can be understood by readers who may not be experts of the finite element method.     

A modified fractional least mean square algorithm for chaotic and nonstationary time series prediction

A method of modifying the architecture of fractional least mean square （FLMS） algorithm is presented to work with nonlinear time series prediction. Here we incorporate an adjustable gain parameter in the weight adaptation equation of the original FLMS algorithm and absorb the gamma function in the fractional step size parameter. This approach provides an interesting achievement in the performance of the filter in terms of handling the nonlinear problems with less computational burden by avoiding the evaluation of complex gamma function. We call this new algorithm as the modified fractional least mean square （MFLMS） algorithm. The predictive performance for the nonlinear Mackey glass chaotic time series is observed and evaluated using the classical LMS, FLMS, kernel LMS, and proposed MFLMS adaptive filters. The simulation results for the time series with and without noise confirm the superiority and improvement in the prediction capability of the proposed MFLMS predictor over its counterparts.     

Adaptive window iteration algorithm for enhancing 3D shape recovery from image focus

Depth from focus(DFF) is a technique for estimating the depth and three-dimensional(3D) shape of an object from a multi-focus image sequence. At present, focus evaluation algorithms based on DFF technology will always cause inaccuracies in deep map recovery from image focus. There are two main reasons behind this issue. The first is that the window size of the focus evaluation operator has been fixed. Therefore, for some pixels, enough neighbor information cannot be covered in a fixed window and is easily disturbed by noise, which results in distortion of the model. For other pixels, the fixed window is too large, which increases the computational burden. The second is the level of difficulty to get the full focus pixels, even though the focus evaluation calculation in the actual calculation process has been completed. In order to overcome these problems, an adaptive window iteration algorithm is proposed to enhance image focus for accurate depth estimation. This algorithm will automatically adjust the window size based on gray differences in a window that aims to solve the fixed window problem.Besides that, it will also iterate evaluation values to enhance the focus evaluation of each pixel. Comparative analysis of the evaluation indicators and model quality has shown the effectiveness of the proposed adaptive window iteration algorithm.     

Logistic型混合自适应分数阶达尔文粒子群优化算法

针对分数阶达尔文微粒群优化(FDPSO)算法收敛速度慢,收敛精度不高的问题,改进其算法中分数阶速度更新策略,同时引入Logistic型混合分数阶自适应动态调整策略,得到一种改进的自适应分数阶达尔文粒子群优化(LFDPSO)算法,通过理论分析,证明了该算法在给定条件下的收敛性,并由数值实验表明,Logistic型混合自适应分数阶达尔文粒子群(LFDPSO)算法在收敛精度和收敛速度上得到了有效改善与提高,粒子在局部最优时的逃逸能力、全局寻优及智能搜索能力显著增强。     

有限深水域中三维频域自由面格林函数及其导数的计算方法

三维频域自由面格林函数及其偏导数的数值计算是海洋结构物水动力分析的难点.本文对有限水深格林函数及其偏导数的数值算法作出两点改进:①对原函数的级数表达式进行变形,提出适用于数值计算的形式,解决高频率情况下级数解的计算失真问题;②对Gauss-Laguerre积分法作出改进,解决高频率大水深情况下积分解的数值溢出问题.计算...     

A Device-to-Device direct discovery algorithm to mitigate the collision caused by hidden users

Device-to-Device (D2D) discovery is an essential constituent in D2D communications as a future generation of wireless communication networks. Direct discovery enables users to discover their neighbors to exchange traffic without the cellular-networks assistance in order to enhance spectral efficiency and throughput. Despite its role to reduce signaling load, few works pay sufficient attention to direct discovery. According to the latest density of users detected by User Equipments (UEs) and their neighbors, this study suggests an adaptable, neighborhood-aware D2D direct discovery technique. To distinguish concealed UEs from other UEs, this technique employs a novel classification method. It also uses its neighborhood-aware capability to avoid severe collisions among all users, including hidden users. The performance of the proposed algorithm is compared with the recent adaptive algorithms and the algorithm recommended by the 3GPP standard. We evaluate algorithms in metrics such as discovery delay and the number of beacons required to terminate the discovery process. The simulation results show that the number of beacons, collision, and discovery delay considerably decrease via the proposed algorithm.     

Fractional calculus of variations of several independent variables

We prove multidimensional integration by parts formulas for generalized fractional derivatives and integrals. The new results allow us to obtain optimality conditions for multidimensional fractional variational problems with Lagrangians depending on generalized partial integrals and derivatives. A generalized fractional Noether’s theorem, a formulation of Dirichlet’s principle and an uniqueness result are given.     

基于分数阶最大相关熵算法的混沌时间序列预测

为提高最大相关熵算法对混沌时间序列的预测速度和精度,提出了一种新的分数阶最大相关熵算法.在采用最大相关熵准则的基础上,利用分数阶微分设计了一种新的权重更新方法.在alpha噪声环境下,采用新的分数阶最大相关熵算法对Mackey-Glass和Lorenz两类具有代表性的混沌时间序列进行预测,并分析了分数阶的阶数对混沌时间序列预测性能的影响.仿真结果表明:与最小均方算法、最大相关熵算法以及分数阶最小均方算法三类自适应滤波算法相比,所提分数阶最大相关熵算法在混沌时间序列预测中能够有效地抑制非高斯脉冲噪声干扰的影响,具有较快收的敛速度和较低的稳态误差.     

3D卷积自动编码网络的高光谱异常检测

高光谱图像包含丰富的地物光谱信息,在遥感图像领域有着巨大的发展前景.高光谱图像异常检测无需任何先验光谱信息,便可检测出图像中的异常目标.因此,在国防军事和民用领域都有广泛的应用,是现阶段高光谱图像处理领域的研究热点.然而,高光谱图像存在数据复杂、冗余性强、未标记以及样本数量少等特点,这给高光谱图像异常检测带来了很大的挑...     

D-leaping: Accelerating stochastic simulation algorithms for reactions with delays

We propose a novel, accelerated algorithm for the approximate stochastic simulation of biochemical systems with delays. The present work extends existing accelerated algorithms by distributing, in a time adaptive fashion, the delayed reactions so as to minimize the computational effort while preserving their accuracy. The accuracy of the present algorithm is assessed by comparing its results to those of the corresponding delay differential equations for a representative biochemical system. In addition, the fluctuations produced from the present algorithm are comparable to those from an exact stochastic simulation with delays. The algorithm is used to simulate biochemical systems that model oscillatory gene expression. The results indicate that the present algorithm is competitive with existing works for several benchmark problems while it is orders of magnitude faster for certain systems of biochemical reactions.     

A novel algorithm for underwater moving-target dynamic line enhancement

When we use a traditional adaptive line enhancer (ALE) algorithm to detect an underwater moving target, there are two disadvantages: the ability to suppress colored Gaussian noise is low and the lower the SNR is, the worse the performance of the ALE algorithm. In order to greatly overcome these disadvantages, we take full advantage of the capability of higher order cumulants to alleviate the effect of colored Gaussian noise and develop a fourth order cumulant non-diagonal slice-based adaptive dynamic line enhancer (FOCNDSBADLE) algorithm and fourth order cumulant diagonal slice-based adaptive dynamic line enhancer (FOCDSBADLE) algorithm. The adaptive filtering coefficients of these algorithms are indirectly updated by the instantaneous fourth order cumulant slices. It is shown that these slices are comprised of noiseless sinusoids if the input signals are comprised of sinusoids corrupted by Gaussian noise. Therefore these algorithms are fit to handle highly colored Gaussian noise. Simulation tests are carried out using the measured data radiated by the underwater moving target. Simulation results have shown that the FOCNDSBADLE algorithm and FOCDSBADLE algorithm outperform the ALE algorithm and that the FOCNDSBADLE algorithm outperforms the FOCDSBADLE algorithm in the case of Gaussian noise.     

基于改进雁群PSO算法的模糊自适应扩展卡尔曼滤波的SLAM算法

针对扩展卡尔曼滤波同时定位与地图创建算法中难以建立准确的先验噪声模型的问题, 提出一种基于改进雁群粒子群算法的模糊自适应卡尔曼滤波算法. 利用分数阶微积分改进粒子进化速度, 利用混沌来改进粒子的初始化和发生早熟时的处理. 改进后的雁群粒子群算法在收敛速度与避免早熟方面有了很大改进, 并将改进的雁群粒子群算法用于模糊自适应扩展卡尔曼滤波同时定位与地图创建算法的训练, 并与用雁群粒子群算法训练的模糊自适应扩展卡尔曼滤波同时定位与地图创建算法进行对比, 其在定位与构图方面有很大的提高. 关键词： 同时定位与地图创建 雁群粒子群算法 分数阶微积分 混沌     

MR image-based measurement of rates of change in volumes of brain structures. Part I: method and validation

A detailed analysis procedure is described for evaluating rates of volumetric change in brain structures based on structural magnetic resonance (MR) images. In this procedure, a series of image processing tools have been employed to address the problems encountered in measuring rates of change based on structural MR images. These tools include an algorithm for intensity non-uniformity correction, a robust algorithm for three-dimensional image registration with sub-voxel precision and an algorithm for brain tissue segmentation. However, a unique feature in the procedure is the use of a fractional volume model that has been developed to provide a quantitative measure for the partial volume effect. With this model, the fractional constituent tissue volumes are evaluated for voxels at the tissue boundary that manifest partial volume effect, thus allowing tissue boundaries be defined at a sub-voxel level and in an automated fashion. Validation studies are presented on key algorithms including segmentation and registration. An overall assessment of the method is provided through the evaluation of the rates of brain atrophy in a group of normal elderly subjects for which the rate of brain atrophy due to normal aging is predictably small. An application of the method is given in Part II where the rates of brain atrophy in various brain regions are studied in relation to normal aging and Alzheimer's disease.     

Optical color image hiding scheme by using Gerchberg–Saxton algorithm in fractional Fourier domain

We proposed an optical color image hiding algorithm based on Gerchberg–Saxton retrieval algorithm in fractional Fourier domain. The RGB components of the color image are converted into a scrambled image by using 3D Arnold transform before the hiding operation simultaneously and these changed images are regarded as the amplitude of fractional Fourier spectrum. Subsequently the unknown phase functions in fractional Fourier domain are calculated by the retrieval algorithm, in which the host RBG components are the part of amplitude of the input functions. The 3D Arnold transform is performed with different parameters to enhance the security of the hiding and extracting algorithm. Some numerical simulations are made to test the validity and capability of the proposed color hiding encryption algorithm.     

基于P范数的核最小对数绝对差自适应滤波算法

为了进一步提高在a稳定分布噪声背景下非线性自适应滤波算法的收敛速度,本文提出了一种新的基于p范数的核最小对数绝对差自适应滤波算法(kernel least logarithm absolute difference algorithm based on p-norm, P-KLLAD).该算法结合核最小对数绝对差算法和p范数,一方面利用最小对数绝对差准则保证了算法在a稳定分布噪声环境下良好的鲁棒性,另一方面在误差的绝对值上添加p范数,通过p范数和一个正常数a来控制算法的陡峭程度,从而提高该算法的收敛速度.在非线性系统辨识和Mackey-Glass混沌时间序列预测的仿真结果表明,本文算法在保证鲁棒性能的同时提高了收敛速度,并且在收敛速度和鲁棒性方面优于核最小均方误差算法、核分式低次幂算法、核最小对数绝对差算法和核最小平均p范数算法.     

基于优势特征图像融合的水下光学图像增强

针对水下光学图像颜色失真、非均匀光照、对比度低的问题,提出基于优势特征图像融合的水下光学图像增强算法.首先,提出改进的暗通道先验算法去除退化图像中的不均匀浑浊并均衡色彩;其次,对颜色校正图像分别使用基于加权分布的自适应伽玛校正算法和限制对比度自适应直方图均衡-同态滤波算法,增强颜色校正图像对比度并使其亮度均衡;最后,定义三幅融合图像即颜色校正图像、亮度均衡图像、对比度增强图像的关联权重图,通过多尺度融合算法获得融合图像.与单一预处理算法只能解决对应的退化现象相比,该算法对单幅退化图像进行多算法处理,得到三幅优势特征图像,通过不同权重的组合最大程度地将各优势特征相结合,得到的综合效果远超各单一算法优化效果,不再局限于解决颜色失真等单一问题.将本文算法与现有算法在主观评价和客观评价两方面进行实验对比,结果表明,该算法可以有效平衡水下图像的色度、饱和度及清晰度,视觉效果接近自然场景下的图像.