期刊文献+
共找到10篇文章
< 1 >
每页显示 20 50 100
Shaping the Wavefront of Incident Light with a Strong Robustness Particle Swarm Optimization Algorithm 被引量:3
1
作者 李必奇 张彬 +3 位作者 冯祺 程晓明 丁迎春 柳强 《Chinese Physics Letters》 SCIE CAS CSCD 2018年第12期15-18,共4页
We demonstrate a modified particle swarm optimization(PSO) algorithm to effectively shape the incident light with strong robustness and short optimization time. The performance of the modified PSO algorithm and geneti... We demonstrate a modified particle swarm optimization(PSO) algorithm to effectively shape the incident light with strong robustness and short optimization time. The performance of the modified PSO algorithm and genetic algorithm(GA) is numerically simulated. Then, using a high speed digital micromirror device, we carry out light focusing experiments with the modified PSO algorithm and GA. The experimental results show that the modified PSO algorithm has greater robustness and faster convergence speed than GA. This modified PSO algorithm has great application prospects in optical focusing and imaging inside in vivo biological tissue, which possesses a complicated background. 展开更多
关键词 PSO In Shaping the Wavefront of Incident Light with a Strong robustness Particle Swarm Optimization algorithm GA
下载PDF
Adaptive Fault Estimation for Dynamics of High Speed Train Based on Robust UKF Algorithm 被引量:1
2
作者 Kexin Li Tiantian Liang 《Journal of Harbin Institute of Technology(New Series)》 CAS 2023年第1期61-72,共12页
This paper proposes an adaptive unscented Kalman filter algorithm(ARUKF)to implement fault estimation for the dynamics of high⁃speed train(HST)with measurement uncertainty and time⁃varying noise with unknown statistic... This paper proposes an adaptive unscented Kalman filter algorithm(ARUKF)to implement fault estimation for the dynamics of high⁃speed train(HST)with measurement uncertainty and time⁃varying noise with unknown statistics.Firstly,regarding the actuator and sensor fault as the auxiliary variables of the dynamics of HST,an augmented system is established,and the fault estimation problem for dynamics of HST is formulated as the state estimation of the augmented system.Then,considering the measurement uncertainties,a robust lower bound is proposed to modify the update of the UKF to decrease the influence of measurement uncertainty on the filtering accuracy.Further,considering the unknown time⁃varying noise of the dynamics of HST,an adaptive UKF algorithm based on moving window is proposed to estimate the time⁃varying noise so that accurate concurrent actuator and sensor fault estimations of dynamics of HST is implemented.Finally,a five-car model of HST is given to show the effectiveness of this method. 展开更多
关键词 high speed train Kalman filter adaptive algorithm robust algorithm unknown noise measurement uncertainty
下载PDF
A robust tensor watermarking algorithm for diffusion-tensor images
3
作者 Chengmeng LIU Zhi LI +1 位作者 Guomei WANG Long ZHENG 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2024年第3期384-397,共14页
Watermarking algorithms that use convolution neural networks have exhibited good robustness in studies of deep learning networks.However,after embedding watermark signals by convolution,the feature fusion eficiency of... Watermarking algorithms that use convolution neural networks have exhibited good robustness in studies of deep learning networks.However,after embedding watermark signals by convolution,the feature fusion eficiency of convolution is relatively low;this can easily lead to distortion in the embedded image.When distortion occurs in medical images,especially in diffusion tensor images(DTIs),the clinical value of the DTI is lost.To address this issue,a robust watermarking algorithm for DTIs implemented by fusing convolution with a Transformer is proposed to ensure the robustness of the watermark and the consistency of sampling distance,which enhances the quality of the reconstructed image of the watermarked DTIs after embedding the watermark signals.In the watermark-embedding network,Ti-weighted(Tlw)images are used as prior knowledge.The correlation between T1w images and the original DTI is proposed to calculate the most significant features from the T1w images by using the Transformer mechanism.The maximum of the correlation is used as the most significant feature weight to improve the quality of the reconstructed DTI.In the watermark extraction network,the most significant watermark features from the watermarked DTI are adequately learned by the Transformer to robustly extract the watermark signals from the watermark features.Experimental results show that the average peak signal-to-noise ratio of the watermarked DTI reaches 50.47 dB,the diffusion characteristics such as mean diffusivity and fractional anisotropy remain unchanged,and the main axis deflection angleαAc is close to 1.Our proposed algorithm can effectively protect the copyright of the DTI and barely affects the clinical diagnosis. 展开更多
关键词 Robust watermarking algorithm Transformer Image reconstruction Diffusion tensor images Soft attention Hard attention Tl-weighted images
原文传递
GA-BASED PID NEURAL NETWORK CONTROL FOR MAGNETIC BEARING SYSTEMS 被引量:2
4
作者 LI Guodong ZHANG Qingchun LIANG Yingchun 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2007年第2期56-59,共4页
In order to overcome the system non-linearity and uncertainty inherent in magnetic bearing systems, a GA(genetic algnrithm)-based PID neural network controller is designed and trained tO emulate the operation of a c... In order to overcome the system non-linearity and uncertainty inherent in magnetic bearing systems, a GA(genetic algnrithm)-based PID neural network controller is designed and trained tO emulate the operation of a complete system (magnetic bearing, controller, and power amplifiers). The feasibility of using a neural network to control nonlinear magnetic bearing systems with unknown dynamics is demonstrated. The key concept of the control scheme is to use GA to evaluate the candidate solutions (chromosomes), increase the generalization ability of PID neural network and avoid suffering from the local minima problem in network learning due to the use of gradient descent learning method. The simulation results show that the proposed architecture provides well robust performance and better reinforcement learning capability in controlling magnetic bearing systems. 展开更多
关键词 Magnetic bearing Non-linearity PID neural network Genetic algorithm Local minima Robust performance
下载PDF
A Novel Forgery Detection in Image Frames of the Videos Using Enhanced Convolutional Neural Network in Face Images
5
作者 S.Velliangiri J.Premalatha 《Computer Modeling in Engineering & Sciences》 SCIE EI 2020年第11期625-645,共21页
Different devices in the recent era generated a vast amount of digital video.Generally,it has been seen in recent years that people are forging the video to use it as proof of evidence in the court of justice.Many kin... Different devices in the recent era generated a vast amount of digital video.Generally,it has been seen in recent years that people are forging the video to use it as proof of evidence in the court of justice.Many kinds of researches on forensic detection have been presented,and it provides less accuracy.This paper proposed a novel forgery detection technique in image frames of the videos using enhanced Convolutional Neural Network(CNN).In the initial stage,the input video is taken as of the dataset and then converts the videos into image frames.Next,perform pre-sampling using the Adaptive Rood Pattern Search(ARPS)algorithm intended for reducing the useless frames.In the next stage,perform preprocessing for enhancing the image frames.Then,face detection is done as of the image utilizing the Viola-Jones algorithm.Finally,the improved Crow Search Algorithm(ICSA)has been used to select the extorted features and inputted to the Enhanced Convolutional Neural Network(ECNN)classifier for detecting the forged image frames.The experimental outcome of the proposed system has achieved 97.21%accuracy compared to other existing methods. 展开更多
关键词 Adaptive Rood Pattern Search(ARPS) Improved Crow Search algorithm(ICSA) Enhanced Convolutional Neural Network(ECNN) Viola Jones algorithm Speeded Up Robust Feature(SURF)
下载PDF
Efficient model building in active appearance model for rotated face
6
作者 Jaehyun So Sanghun Han +2 位作者 Youngtak Kim Hwanik Chung Youngjoon Han 《Journal of Measurement Science and Instrumentation》 CAS 2013年第4期346-348,共3页
This paper proposes the efficient model building in active appearance model(AAM) for the rotated face.Finding an exact region of the face is generally difficult due to different shapes and viewpoints.Unlike many paper... This paper proposes the efficient model building in active appearance model(AAM) for the rotated face.Finding an exact region of the face is generally difficult due to different shapes and viewpoints.Unlike many papers about the fitting method of AAM,this paper treats how images are chosen for fitting of the rotated face in modelling process.To solve this problem,databases of facial rotation and expression are selected and models are built using Procrustes method and principal component analysis(PCA).These models are applied in fitting methods like basic AAM fitting,inverse compositional alignment(ICA),project-out ICA,normalization ICA,robust normalization inverse compositional algorithm(RNIC)and efficient robust normalization algorithm(ERN).RNIC and ERN can fit the rotated face in images efficiently.The efficiency of model building is checked using sequence images made by ourselves. 展开更多
关键词 active appearance model(AAM) Procrustes alignment principal component analysis(PCA) inverse compositional alignment(ICA) project-out ICA normalization ICA robust normalization inverse compositional algorithm(RNIC) efficient robust normalization algorithm(ERN)
下载PDF
IMPROVED RESULTS ON THE ROBUSTNESS OF STOCHASTIC APPROXIMATION ALGORITHMS
7
作者 高爱军 陈翰馥 朱允民 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1992年第2期124-130,共7页
This paper is a continuation of the research carried out in [1]-[2], where the robustnessanalysis for stochastic approximation algorithms is given for two cases: 1. The regression functionand the Liapunov function are... This paper is a continuation of the research carried out in [1]-[2], where the robustnessanalysis for stochastic approximation algorithms is given for two cases: 1. The regression functionand the Liapunov function are not zero at the sought-for x~0, 2. lim supnot zero, here {ξ} are the measurement errors and {a} are the weighting coefficients in thealgorithm. Allowing these deviations from zero to occur simultaneously but to remain small, thispaper shows that the estimation error is still small even for a class fo measurement errors moregeneral than that considered in [2]. 展开更多
关键词 IMPROVED RESULTS ON THE robustness OF STOCHASTIC APPROXIMATION algorithmS exp
原文传递
A robust color image watermarking algorithm against rotation attacks
8
作者 韩绍程 杨金锋 +1 位作者 王蕊 贾桂敏 《Optoelectronics Letters》 EI 2018年第1期61-66,共6页
A robust digital watermarking algorithm is proposed based on quaternion wavelet transform(QWT) and discrete cosine transform(DCT) for copyright protection of color images. The luminance component Y of a host color ima... A robust digital watermarking algorithm is proposed based on quaternion wavelet transform(QWT) and discrete cosine transform(DCT) for copyright protection of color images. The luminance component Y of a host color image in YIQ space is decomposed by QWT, and then the coefficients of four low-frequency subbands are transformed by DCT. An original binary watermark scrambled by Arnold map and iterated sine chaotic system is embedded into the mid-frequency DCT coefficients of the subbands. In order to improve the performance of the proposed algorithm against rotation attacks, a rotation detection scheme is implemented before watermark extracting. The experimental results demonstrate that the proposed watermarking scheme shows strong robustness not only against common image processing attacks but also against arbitrary rotation attacks. 展开更多
关键词 QWT DCT A robust color image watermarking algorithm against rotation attacks YIQ
原文传递
Rapid and robust medical image elastic registration using mean shift algorithm
9
作者 杨烜 裴继红 《Chinese Optics Letters》 SCIE EI CAS CSCD 2008年第12期950-952,共3页
In landmark-based image registration, estimating the landmark correspondence plays an important role. In this letter, a novel landmark correspondence estimation technique using mean shift algorithm is proposed. Image ... In landmark-based image registration, estimating the landmark correspondence plays an important role. In this letter, a novel landmark correspondence estimation technique using mean shift algorithm is proposed. Image corner points are detected as landmarks and mean shift iterations are adopted to find the most probable corresponding point positions in two images. Mutual information between intensity of two local regions is computed to eliminate mis-matching points to improve the stability of corresponding estimation correspondence landmarks is exact. The proposed experiments of various mono-modal medical images. Multi-level estimation (MLE) technique is proposed Experiments show that the precision in location of technique is shown to be feasible and rapid in the 展开更多
关键词 Rapid and robust medical image elastic registration using mean shift algorithm MLE Mean
原文传递
Entropy-like distance driven fuzzy clustering with local information constraints for image segmentation
10
作者 Wu Chengmao Cao Zhuo 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2021年第1期24-40,共17页
To improve the anti-noise ability of fuzzy local information C-means clustering, a robust entropy-like distance driven fuzzy clustering with local information is proposed. This paper firstly uses Jensen-Shannon diverg... To improve the anti-noise ability of fuzzy local information C-means clustering, a robust entropy-like distance driven fuzzy clustering with local information is proposed. This paper firstly uses Jensen-Shannon divergence to induce a symmetric entropy-like divergence. Then the root of entropy-like divergence is proved to be a distance measure, and it is applied to existing fuzzy C-means(FCM) clustering to obtain a new entropy-like divergence driven fuzzy clustering, meanwhile its convergence is strictly proved by Zangwill theorem. In the end, a robust fuzzy clustering by combing local information with entropy-like distance is constructed to segment image with noise. Experimental results show that the proposed algorithm has better segmentation accuracy and robustness against noise than existing state-of-the-art fuzzy clustering-related segmentation algorithm in the presence of noise. 展开更多
关键词 fuzzy clustering image segmentation entropy-like divergence robust clustering algorithm
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部