Sensitivity encoding(SENSE)is a parallel magnetic resonance imaging(MRI)reconstruction model by utilizing the sensitivity information of receiver coils to achieve image reconstruction.The existing SENSE-based reconstr...Sensitivity encoding(SENSE)is a parallel magnetic resonance imaging(MRI)reconstruction model by utilizing the sensitivity information of receiver coils to achieve image reconstruction.The existing SENSE-based reconstruction algorithms usually used nonadaptive sparsifying transforms,resulting in a limited reconstruction accuracy.Therefore,we proposed a new model for accurate parallel MRI reconstruction by combining the L0 norm regularization term based on the efficient sum of outer products dictionary learning(SOUPDIL)with the SENSE model,called SOUPDIL-SENSE.The SOUPDIL-SENSE model is mainly solved by utilizing the variable splitting and alternating direction method of multipliers techniques.The experimental results on four human datasets show that the proposed algorithm effectively promotes the image sparsity,eliminates the noise and artifacts of the reconstructed images,and improves the reconstruction accuracy.展开更多
Image segmentation is vital when analyzing medical images,especially magnetic resonance(MR)images of the brain.Recently,several image segmentation techniques based on multilevel thresholding have been proposed for med...Image segmentation is vital when analyzing medical images,especially magnetic resonance(MR)images of the brain.Recently,several image segmentation techniques based on multilevel thresholding have been proposed for medical image segmentation;however,the algorithms become trapped in local minima and have low convergence speeds,particularly as the number of threshold levels increases.Consequently,in this paper,we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm(JSA)(an optimizer).We modify the JSA to prevent descents into local minima,and we accelerate convergence toward optimal solutions.The improvement is achieved by applying two novel strategies:Rankingbased updating and an adaptive method.Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions.We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution;we allow a small amount of exploration to avoid descents into local minima.The two strategies are integrated with the JSA to produce an improved JSA(IJSA)that optimally thresholds brain MR images.To compare the performances of the IJSA and JSA,seven brain MR images were segmented at threshold levels of 3,4,5,6,7,8,10,15,20,25,and 30.IJSA was compared with several other recent image segmentation algorithms,including the improved and standard marine predator algorithms,the modified salp and standard salp swarm algorithms,the equilibrium optimizer,and the standard JSA in terms of fitness,the Structured Similarity Index Metric(SSIM),the peak signal-to-noise ratio(PSNR),the standard deviation(SD),and the Features Similarity Index Metric(FSIM).The experimental outcomes and the Wilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM,the PSNR,the objective values,and the SD;in terms of the SSIM,IJSA was competitive with the others.展开更多
In the current 4th generation(4G)communication network,the base station with the same frequency transmission makes a serious interference among adjacent cells,and information transmission is susceptible to interferenc...In the current 4th generation(4G)communication network,the base station with the same frequency transmission makes a serious interference among adjacent cells,and information transmission is susceptible to interference such as channel multipath fading and occlusion effect.Detecting effectively spectrum signal under low signal-to-noise ratio(SNR),directly affects the whole performance of the wireless communication network system.This paper designs an energy signal detection algorithm based on stochastic resonance technology which transforms noise's signal energy into useful signal energy,and improves output SNR.The energy signal detection algorithm realizes the function of providing effective detection of signal under low SNR,and promotes the performance of the whole communication system.展开更多
Stochastic resonance system is subject to the restriction of small frequency parameter in weak signal detection,in order to solve this problem,a frequency modulated weak signal detection method based on stochastic res...Stochastic resonance system is subject to the restriction of small frequency parameter in weak signal detection,in order to solve this problem,a frequency modulated weak signal detection method based on stochastic resonance and genetic algorithm is presented in this paper. The frequency limit of stochastic resonance is eliminated by introducing carrier signal,which is multiplied with the measured signal to be injected in the stochastic resonance system,meanwhile,using genetic algorithm to optimize the carrier signal frequency,which determine the generated difference-frequency signal in the lowfrequency range,so as to achieve the stochastic resonance weak signal detection. Results showthat the proposed method is feasible and effective,which can significantly improve the output SNR of stochastic resonance,in addition,the system has the better self-adaptability,according to the operation result and output phenomenon,the unknown frequency of the signal to be measured can be obtained,so as to realize the weak signal detection of arbitrary frequency.展开更多
Nano-volt magnetic resonance sounding(MRS) signals are sufficiently weak so that during the actual measurement, they are affected by environmental electromagnetic noise, leading to inaccuracy of the extracted characte...Nano-volt magnetic resonance sounding(MRS) signals are sufficiently weak so that during the actual measurement, they are affected by environmental electromagnetic noise, leading to inaccuracy of the extracted characteristic parameters and hindering effective inverse interpretation. Considering the complexity and non-homogeneous spatial distribution of environmental noise and based on the theory of adaptive noise cancellation, a model system for noise cancellation using multi-reference coils was constructed to receive MRS signals. The feasibility of this system with theoretical calculation and experiments was analyzed and a modified sigmoid variable step size least mean square(SVSLMS) algorithm for noise cancellation was presented. The simulation results show that, the multi-reference coil method performs better than the single one on both signal-to-noise ratio(SNR) improvement and signal waveform optimization after filtering, under the condition of different noise correlations in the reference coils and primary detecting coils and different SNRs. In particular, when the noise correlation is poor and the SNR<0, the SNR can be improved by more than 8 dB after filtering with multi-reference coils. And the average fitting errors for initial amplitude and relaxation time are within 5%. Compared with the normalized least mean square(NLMS) algorithm and multichannel Wiener filter and processing field test data, the effectiveness of the proposed method is verified.展开更多
Objective:The aim of this study was to validate the accuracy of a new automatic method for scar segmentation and compare its performance with that of two other frequently used segmentation algorithms.Methods:Twenty-si...Objective:The aim of this study was to validate the accuracy of a new automatic method for scar segmentation and compare its performance with that of two other frequently used segmentation algorithms.Methods:Twenty-six late gadolinium enhancement cardiovascular magnetic resonance images of diseased hearts were segmented by the full width at half maximum(FWHM)method,the n standard deviations(n SD)method,and our new automatic method.The results of the three methods were compared with the consensus ground truth obtained by manual segmentation of the ventricular boundaries.Results:Our automatic method yielded the highest Dice score and the lowest volume difference compared with the consensus ground truth segmentation.The n SD method produced large variations in the Dice score and the volume difference.The FWHM method yielded the lowest Dice score and the greatest volume difference compared with the automatic,6SD,and 8SD methods,but resulted in less variation when different observers segmented the images.Conclusion:The automatic method introduced in this study is highly reproducible and objective.Because it requires no manual intervention,it may be useful for processing large datasets produced in clinical applications.展开更多
Image recognition is considered to be the pre-eminent paradigm for the automatic detection of tumor diseases in this era.Among various cancers identified so far,glioma,a type of brain tumor,is one of the deadliest can...Image recognition is considered to be the pre-eminent paradigm for the automatic detection of tumor diseases in this era.Among various cancers identified so far,glioma,a type of brain tumor,is one of the deadliest cancers,and it remains challenging to the medicinal world.The only consoling factor is that the survival rate of the patient is increased by remarkable percentage with the early diagnosis of the disease.Early diagnosis is attempted to be accomplished with the changes observed in the images of suspected parts of the brain captured in specific interval of time.From the captured image,the affected part of the brain is analyzed using magnetic resonance imaging(MRI)technique.Existence of different modalities in the captured MRI image demands the best automated model for the easy identification of malignant cells.Number of image processing techniques are available for processing the images to identify the affected area.This study concentrates and proposes to improve early diagnosis of glioma using a preprocessing boosted teaching and learning optimization(P-BTLBO)algorithm that automatically segments a brain tumor in an given MRI image.Preprocessing involves contrast enhancement and skull stripping procedures through contrast limited adaptive histogram equalization technique.The traditional TLBO algorithm that works with the perspective of teacher and the student is here improved by using a boosting mechanism.The results obtained using this P-BTLBO algorithm is compared on different benchmark images for the validation of its standard.The experimental findings show that P-BTLBO algorithm approach outperforms other existing algorithms of its kind.展开更多
In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic r...In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic resonance imaging(MRI)reconstruction is proposed,which reconstructs the image from highly under-sampled k-space data.In the algorithm,the nonconvex surrogate function replacing the conventional nuclear norm is utilized to enhance the low-rank property inherent in the reconstructed image.An alternative direction multiplier method(ADMM) is applied to solving the resulting non-convex model.Extensive experimental results have demonstrated that the proposed method can consistently recover MRIs efficiently,and outperforms the current state-of-the-art approaches in terms of higher peak signal-to-noise ratio(PSNR) and lower high-frequency error norm(HFEN) values.展开更多
In this paper,elitist reconstruction genetic algorithm(ERGA)based on Markov random field(MRF)is introduced for image segmentation.In this algorithm,a population of possible solutions is maintained at every generation,...In this paper,elitist reconstruction genetic algorithm(ERGA)based on Markov random field(MRF)is introduced for image segmentation.In this algorithm,a population of possible solutions is maintained at every generation,and for each solution a fitness value is calculated according to a fitness function,which is constructed based on the MRF potential function according to Metropolis function and Bayesian framework.After the improved selection,crossover and mutation,an elitist individual is restructured based on the strategy of restructuring elitist.This procedure is processed to select the location that denotes the largest MRF potential function value in the same location of all individuals.The algorithm is stopped when the change of fitness functions between two sequent generations is less than a specified value.Experiments show that the performance of the hybrid algorithm is better than that of some traditional algorithms.展开更多
Knee osteoarthritis(OA)is a common disease that impairs knee function and causes pain.Currently,studies on the detection of knee OA mainly focus on X-ray images,but X-ray images are insensitive to the changes in knee ...Knee osteoarthritis(OA)is a common disease that impairs knee function and causes pain.Currently,studies on the detection of knee OA mainly focus on X-ray images,but X-ray images are insensitive to the changes in knee OA in the early stage.Since magnetic resonance(MR)imaging can observe the early features of knee OA,the knee OA detection algorithm based on MR image is innovatively proposed to judge whether knee OA is suffered.Firstly,the knee MR images are preprocessed before training,including a region of interest clipping,slice selection,and data augmentation.Then the data set was divided by patient-level and the knee OA was classified by the deep transfer learning method based on the DenseNet201 model.The method divides the training process into two stages.The first stage freezes all the base layers and only trains the weights of the embedding neural networks.The second stage unfreezes part of the base layers and trains the unfrozen base layers and the weights of the embedding neural network.In this step,we design a block-by-block fine-tuning strategy for training based on the dense blocks,which improves detection accuracy.We have conducted training experiments with different depth modules,and the experimental results show that gradually adding more dense blocks in the fine-tuning can make the model obtain better detection performance than only training the embedded neural network layer.We achieve an accuracy of 0.921,a sensitivity of 0.960,a precision of 0.885,a specificity of 0.891,an F1-Score of 0.912,and an MCC of 0.836.The comparative experimental results on the OAI-ZIB dataset show that the proposed method outperforms the other detection methods with the accuracy of 92.1%.展开更多
NMR logging can provide the permeability parameter and abundant stratigraphical information such as total porosity,oil,gas and water saturation,oil viscosity,etc. And these physical parameters can be obtained by T2 sp...NMR logging can provide the permeability parameter and abundant stratigraphical information such as total porosity,oil,gas and water saturation,oil viscosity,etc. And these physical parameters can be obtained by T2 spectrum inversion. NMR inversion is an important part in logging interpretation. The authors describe a multi-exponential inversion algorithm,solid iteration redress technique( SIRT),and apply the algorithm in real data and compare the results with those based on singular value decomposition( SVD). It shows that SIRT algorithm is easier to be understood and implemented,and the time spent in SIRT is much shorter than that of SVD algorithm. And the non-negative property of T2 spectrum is much easier to be implemented. It can match the results based on SVD very well. SIRT algorithm can be used in T2 spectrum inversion for NMR analysis.展开更多
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion...Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.展开更多
We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theor...We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theorem for the first and a strong convergence theorem for the second.展开更多
This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japo...This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm.展开更多
The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,convention...The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications.展开更多
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h...In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.展开更多
To address the issue of abnormal energy consumption fluctuations in the converter steelmaking process,an integrated diagnostic method combining the gray wolf optimization(GWO)algorithm,support vector machine(SVM),and ...To address the issue of abnormal energy consumption fluctuations in the converter steelmaking process,an integrated diagnostic method combining the gray wolf optimization(GWO)algorithm,support vector machine(SVM),and K-means clustering was proposed.Eight input parameters—derived from molten iron conditions and external factors—were selected as feature variables.A GWO-SVM model was developed to accurately predict the energy consumption of individual heats.Based on the prediction results,the mean absolute percentage error and maximum relative error of the test set were employed as criteria to identify heats with abnormal energy usage.For these heats,the K-means clustering algorithm was used to determine benchmark values of influencing factors from similar steel grades,enabling root-cause diagnosis of excessive energy consumption.The proposed method was applied to real production data from a converter in a steel plant.The analysis reveals that heat sample No.44 exhibits abnormal energy consumption,due to gas recovery being 1430.28 kg of standard coal below the benchmark level.A secondary contributing factor is a steam recovery shortfall of 237.99 kg of standard coal.This integrated approach offers a scientifically grounded tool for energy management in converter operations and provides valuable guidance for optimizing process parameters and enhancing energy efficiency.展开更多
ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the ...ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the algorithmhas attracted considerable academic and industrial interest owing to its effective balance between exploration and exploitation,coupled with advantages in real-time performance and robustness.Nevertheless,as applications have diversified,limitations in convergence precision and a tendency toward premature convergence have become increasingly evident,highlighting a need for improvement.This reviewsystematically outlines the developmental trajectory of the PIO algorithm,with a particular focus on its core applications in UAV navigation,multi-objective formulations,and a spectrum of variantmodels that have emerged in recent years.It offers a structured analysis of the foundational principles underlying the PIO.It conducts a comparative assessment of various performance-enhanced versions,including hybrid models that integrate mechanisms from other optimization paradigms.Additionally,the strengths andweaknesses of distinct PIOvariants are critically examined frommultiple perspectives,including intrinsic algorithmic characteristics,suitability for specific application scenarios,objective function design,and the rigor of the statistical evaluation methodologies employed in empirical studies.Finally,this paper identifies principal challenges within current PIO research and proposes several prospective research directions.Future work should focus on mitigating premature convergence by refining the two-phase search structure and adjusting the exponential decrease of individual numbers during the landmark operator.Enhancing parameter adaptation strategies,potentially using reinforcement learning for dynamic tuning,and advancing theoretical analyses on convergence and complexity are also critical.Further applications should be explored in constrained path planning,Neural Architecture Search(NAS),and other real-worldmulti-objective problems.For Multi-objective PIO(MPIO),key improvements include controlling the growth of the external archive and designing more effective selection mechanisms to maintain convergence efficiency.These efforts are expected to strengthen both the theoretical foundation and practical versatility of PIO and its variants.展开更多
In recent years,Blockchain Technology has become a paradigm shift,providing Transparent,Secure,and Decentralized platforms for diverse applications,ranging from Cryptocurrency to supply chain management.Nevertheless,t...In recent years,Blockchain Technology has become a paradigm shift,providing Transparent,Secure,and Decentralized platforms for diverse applications,ranging from Cryptocurrency to supply chain management.Nevertheless,the optimization of blockchain networks remains a critical challenge due to persistent issues such as latency,scalability,and energy consumption.This study proposes an innovative approach to Blockchain network optimization,drawing inspiration from principles of biological evolution and natural selection through evolutionary algorithms.Specifically,we explore the application of genetic algorithms,particle swarm optimization,and related evolutionary techniques to enhance the performance of blockchain networks.The proposed methodologies aim to optimize consensus mechanisms,improve transaction throughput,and reduce resource consumption.Through extensive simulations and real-world experiments,our findings demonstrate significant improvements in network efficiency,scalability,and stability.This research offers a thorough analysis of existing optimization techniques,introduces novel strategies,and assesses their efficacy based on empirical outputs.展开更多
基金the National Natural Science Foundation of China(No.61861023)the Yunnan Fundamental Research Project(No.202301AT070452)。
文摘Sensitivity encoding(SENSE)is a parallel magnetic resonance imaging(MRI)reconstruction model by utilizing the sensitivity information of receiver coils to achieve image reconstruction.The existing SENSE-based reconstruction algorithms usually used nonadaptive sparsifying transforms,resulting in a limited reconstruction accuracy.Therefore,we proposed a new model for accurate parallel MRI reconstruction by combining the L0 norm regularization term based on the efficient sum of outer products dictionary learning(SOUPDIL)with the SENSE model,called SOUPDIL-SENSE.The SOUPDIL-SENSE model is mainly solved by utilizing the variable splitting and alternating direction method of multipliers techniques.The experimental results on four human datasets show that the proposed algorithm effectively promotes the image sparsity,eliminates the noise and artifacts of the reconstructed images,and improves the reconstruction accuracy.
基金This research was supported by the Korea Institute for Advancement of Technology(KIAT)grant funded by the Korea Government(MOTIE)(P0012724,The Competency Development Program for Industry Specialist)and the Soonchunhyang University Research Fund.
文摘Image segmentation is vital when analyzing medical images,especially magnetic resonance(MR)images of the brain.Recently,several image segmentation techniques based on multilevel thresholding have been proposed for medical image segmentation;however,the algorithms become trapped in local minima and have low convergence speeds,particularly as the number of threshold levels increases.Consequently,in this paper,we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm(JSA)(an optimizer).We modify the JSA to prevent descents into local minima,and we accelerate convergence toward optimal solutions.The improvement is achieved by applying two novel strategies:Rankingbased updating and an adaptive method.Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions.We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution;we allow a small amount of exploration to avoid descents into local minima.The two strategies are integrated with the JSA to produce an improved JSA(IJSA)that optimally thresholds brain MR images.To compare the performances of the IJSA and JSA,seven brain MR images were segmented at threshold levels of 3,4,5,6,7,8,10,15,20,25,and 30.IJSA was compared with several other recent image segmentation algorithms,including the improved and standard marine predator algorithms,the modified salp and standard salp swarm algorithms,the equilibrium optimizer,and the standard JSA in terms of fitness,the Structured Similarity Index Metric(SSIM),the peak signal-to-noise ratio(PSNR),the standard deviation(SD),and the Features Similarity Index Metric(FSIM).The experimental outcomes and the Wilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM,the PSNR,the objective values,and the SD;in terms of the SSIM,IJSA was competitive with the others.
基金the Natural Science Foundation of Heilongjiang Province(No.F2015019)the Postdoctoral Foundation of Heilongjiang Province(No.LBHZ16054)the Undergraduate Basic Scientific Research Service Fee Project of Heilongjiang Province(No.Hkdqg201806)
文摘In the current 4th generation(4G)communication network,the base station with the same frequency transmission makes a serious interference among adjacent cells,and information transmission is susceptible to interference such as channel multipath fading and occlusion effect.Detecting effectively spectrum signal under low signal-to-noise ratio(SNR),directly affects the whole performance of the wireless communication network system.This paper designs an energy signal detection algorithm based on stochastic resonance technology which transforms noise's signal energy into useful signal energy,and improves output SNR.The energy signal detection algorithm realizes the function of providing effective detection of signal under low SNR,and promotes the performance of the whole communication system.
基金supported by the National Natural Science Foundation of China (Grant No. 61072133)the Production,Learning and Research Joint Innovation Program of Jiangsu Province,China (Grant Nos. BY2013007-02,SBY201120033)+2 种基金the Industrialization of Research Findings Promotion Program of Institution of Higher Education of Jiangsu Province,China (Grant No. JHB2011-15)the advantage discipline platform "information and Communication Engineering" of Jiangsu Province,Chinathe "Summit of the Six Top Talents" Program of Jiangsu Province,China
文摘Stochastic resonance system is subject to the restriction of small frequency parameter in weak signal detection,in order to solve this problem,a frequency modulated weak signal detection method based on stochastic resonance and genetic algorithm is presented in this paper. The frequency limit of stochastic resonance is eliminated by introducing carrier signal,which is multiplied with the measured signal to be injected in the stochastic resonance system,meanwhile,using genetic algorithm to optimize the carrier signal frequency,which determine the generated difference-frequency signal in the lowfrequency range,so as to achieve the stochastic resonance weak signal detection. Results showthat the proposed method is feasible and effective,which can significantly improve the output SNR of stochastic resonance,in addition,the system has the better self-adaptability,according to the operation result and output phenomenon,the unknown frequency of the signal to be measured can be obtained,so as to realize the weak signal detection of arbitrary frequency.
基金Projects(41204079,41504086)supported by the National Natural Science Foundation of ChinaProject(20160101281JC)supported by the Natural Science Foundation of Jilin Province,ChinaProjects(2016M590258,2015T80301)supported by the Postdoctoral Science Foundation of China
文摘Nano-volt magnetic resonance sounding(MRS) signals are sufficiently weak so that during the actual measurement, they are affected by environmental electromagnetic noise, leading to inaccuracy of the extracted characteristic parameters and hindering effective inverse interpretation. Considering the complexity and non-homogeneous spatial distribution of environmental noise and based on the theory of adaptive noise cancellation, a model system for noise cancellation using multi-reference coils was constructed to receive MRS signals. The feasibility of this system with theoretical calculation and experiments was analyzed and a modified sigmoid variable step size least mean square(SVSLMS) algorithm for noise cancellation was presented. The simulation results show that, the multi-reference coil method performs better than the single one on both signal-to-noise ratio(SNR) improvement and signal waveform optimization after filtering, under the condition of different noise correlations in the reference coils and primary detecting coils and different SNRs. In particular, when the noise correlation is poor and the SNR<0, the SNR can be improved by more than 8 dB after filtering with multi-reference coils. And the average fitting errors for initial amplitude and relaxation time are within 5%. Compared with the normalized least mean square(NLMS) algorithm and multichannel Wiener filter and processing field test data, the effectiveness of the proposed method is verified.
基金This work was supported by grants from the National Key Research and Development Program of China(2016YFC1301002 to Jianzeng Dong)the National Natural Science Foundation of China(81901841 to Dongdong Deng,81671650 and 81971569 to Yi He)Dongdong Deng also acknowledges support from Dalian University of Technology(DUT18RC(3)068).
文摘Objective:The aim of this study was to validate the accuracy of a new automatic method for scar segmentation and compare its performance with that of two other frequently used segmentation algorithms.Methods:Twenty-six late gadolinium enhancement cardiovascular magnetic resonance images of diseased hearts were segmented by the full width at half maximum(FWHM)method,the n standard deviations(n SD)method,and our new automatic method.The results of the three methods were compared with the consensus ground truth obtained by manual segmentation of the ventricular boundaries.Results:Our automatic method yielded the highest Dice score and the lowest volume difference compared with the consensus ground truth segmentation.The n SD method produced large variations in the Dice score and the volume difference.The FWHM method yielded the lowest Dice score and the greatest volume difference compared with the automatic,6SD,and 8SD methods,but resulted in less variation when different observers segmented the images.Conclusion:The automatic method introduced in this study is highly reproducible and objective.Because it requires no manual intervention,it may be useful for processing large datasets produced in clinical applications.
文摘Image recognition is considered to be the pre-eminent paradigm for the automatic detection of tumor diseases in this era.Among various cancers identified so far,glioma,a type of brain tumor,is one of the deadliest cancers,and it remains challenging to the medicinal world.The only consoling factor is that the survival rate of the patient is increased by remarkable percentage with the early diagnosis of the disease.Early diagnosis is attempted to be accomplished with the changes observed in the images of suspected parts of the brain captured in specific interval of time.From the captured image,the affected part of the brain is analyzed using magnetic resonance imaging(MRI)technique.Existence of different modalities in the captured MRI image demands the best automated model for the easy identification of malignant cells.Number of image processing techniques are available for processing the images to identify the affected area.This study concentrates and proposes to improve early diagnosis of glioma using a preprocessing boosted teaching and learning optimization(P-BTLBO)algorithm that automatically segments a brain tumor in an given MRI image.Preprocessing involves contrast enhancement and skull stripping procedures through contrast limited adaptive histogram equalization technique.The traditional TLBO algorithm that works with the perspective of teacher and the student is here improved by using a boosting mechanism.The results obtained using this P-BTLBO algorithm is compared on different benchmark images for the validation of its standard.The experimental findings show that P-BTLBO algorithm approach outperforms other existing algorithms of its kind.
基金National Natural Science Foundations of China(Nos.61362001,61365013,51165033)the Science and Technology Department of Jiangxi Province of China(Nos.20132BAB211030,20122BAB211015)+1 种基金the Jiangxi Advanced Projects for Postdoctoral Research Funds,China(o.2014KY02)the Innovation Special Fund Project of Nanchang University,China(o.cx2015136)
文摘In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic resonance imaging(MRI)reconstruction is proposed,which reconstructs the image from highly under-sampled k-space data.In the algorithm,the nonconvex surrogate function replacing the conventional nuclear norm is utilized to enhance the low-rank property inherent in the reconstructed image.An alternative direction multiplier method(ADMM) is applied to solving the resulting non-convex model.Extensive experimental results have demonstrated that the proposed method can consistently recover MRIs efficiently,and outperforms the current state-of-the-art approaches in terms of higher peak signal-to-noise ratio(PSNR) and lower high-frequency error norm(HFEN) values.
文摘In this paper,elitist reconstruction genetic algorithm(ERGA)based on Markov random field(MRF)is introduced for image segmentation.In this algorithm,a population of possible solutions is maintained at every generation,and for each solution a fitness value is calculated according to a fitness function,which is constructed based on the MRF potential function according to Metropolis function and Bayesian framework.After the improved selection,crossover and mutation,an elitist individual is restructured based on the strategy of restructuring elitist.This procedure is processed to select the location that denotes the largest MRF potential function value in the same location of all individuals.The algorithm is stopped when the change of fitness functions between two sequent generations is less than a specified value.Experiments show that the performance of the hybrid algorithm is better than that of some traditional algorithms.
基金The authors extend their appreciation to the Jilin Provincial Natural Science Foundation for funding this research work through Project Number(20220101128JC).
文摘Knee osteoarthritis(OA)is a common disease that impairs knee function and causes pain.Currently,studies on the detection of knee OA mainly focus on X-ray images,but X-ray images are insensitive to the changes in knee OA in the early stage.Since magnetic resonance(MR)imaging can observe the early features of knee OA,the knee OA detection algorithm based on MR image is innovatively proposed to judge whether knee OA is suffered.Firstly,the knee MR images are preprocessed before training,including a region of interest clipping,slice selection,and data augmentation.Then the data set was divided by patient-level and the knee OA was classified by the deep transfer learning method based on the DenseNet201 model.The method divides the training process into two stages.The first stage freezes all the base layers and only trains the weights of the embedding neural networks.The second stage unfreezes part of the base layers and trains the unfrozen base layers and the weights of the embedding neural network.In this step,we design a block-by-block fine-tuning strategy for training based on the dense blocks,which improves detection accuracy.We have conducted training experiments with different depth modules,and the experimental results show that gradually adding more dense blocks in the fine-tuning can make the model obtain better detection performance than only training the embedded neural network layer.We achieve an accuracy of 0.921,a sensitivity of 0.960,a precision of 0.885,a specificity of 0.891,an F1-Score of 0.912,and an MCC of 0.836.The comparative experimental results on the OAI-ZIB dataset show that the proposed method outperforms the other detection methods with the accuracy of 92.1%.
文摘NMR logging can provide the permeability parameter and abundant stratigraphical information such as total porosity,oil,gas and water saturation,oil viscosity,etc. And these physical parameters can be obtained by T2 spectrum inversion. NMR inversion is an important part in logging interpretation. The authors describe a multi-exponential inversion algorithm,solid iteration redress technique( SIRT),and apply the algorithm in real data and compare the results with those based on singular value decomposition( SVD). It shows that SIRT algorithm is easier to be understood and implemented,and the time spent in SIRT is much shorter than that of SVD algorithm. And the non-negative property of T2 spectrum is much easier to be implemented. It can match the results based on SVD very well. SIRT algorithm can be used in T2 spectrum inversion for NMR analysis.
文摘Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.
基金supported by the Science and Technology Fund of TNU-Thai Nguyen University of Science.
文摘We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theorem for the first and a strong convergence theorem for the second.
基金CHINA POSTDOCTORAL SCIENCE FOUNDATION(Grant No.2025M771925)Young Scientists Fund(C Class)(Grant No.32501636)Special Fund of Fundamental Scientific Research Business Expense for Higher School of Central Government(Grant No.2572025JT04).
文摘This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm.
基金supported by the NSFC(Grant Nos.62176273,62271070,62441212)The Open Foundation of State Key Laboratory of Networking and Switching Technology(Beijing University of Posts and Telecommunications)under Grant SKLNST-2024-1-062025Major Project of the Natural Science Foundation of Inner Mongolia(2025ZD008).
文摘The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications.
基金funding from the European Commission by the Ruralities project(grant agreement no.101060876).
文摘In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.
基金support from the National Key R&D Program of China(Grant No.2020YFB1711100).
文摘To address the issue of abnormal energy consumption fluctuations in the converter steelmaking process,an integrated diagnostic method combining the gray wolf optimization(GWO)algorithm,support vector machine(SVM),and K-means clustering was proposed.Eight input parameters—derived from molten iron conditions and external factors—were selected as feature variables.A GWO-SVM model was developed to accurately predict the energy consumption of individual heats.Based on the prediction results,the mean absolute percentage error and maximum relative error of the test set were employed as criteria to identify heats with abnormal energy usage.For these heats,the K-means clustering algorithm was used to determine benchmark values of influencing factors from similar steel grades,enabling root-cause diagnosis of excessive energy consumption.The proposed method was applied to real production data from a converter in a steel plant.The analysis reveals that heat sample No.44 exhibits abnormal energy consumption,due to gas recovery being 1430.28 kg of standard coal below the benchmark level.A secondary contributing factor is a steam recovery shortfall of 237.99 kg of standard coal.This integrated approach offers a scientifically grounded tool for energy management in converter operations and provides valuable guidance for optimizing process parameters and enhancing energy efficiency.
基金supported by the National Natural Science Foundation of China under grant number 62066016the Natural Science Foundation of Hunan Province of China under grant number 2024JJ7395+2 种基金International and Regional Science and Technology Cooperation and Exchange Program of the Hunan Association for Science and Technology under grant number 025SKX-KJ-04Hunan Provincial Postgraduate Research Innovation Project under grant numberCX20251611Liye Qin Bamboo Slips Research Special Project of JishouUniversity 25LYY03.
文摘ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the algorithmhas attracted considerable academic and industrial interest owing to its effective balance between exploration and exploitation,coupled with advantages in real-time performance and robustness.Nevertheless,as applications have diversified,limitations in convergence precision and a tendency toward premature convergence have become increasingly evident,highlighting a need for improvement.This reviewsystematically outlines the developmental trajectory of the PIO algorithm,with a particular focus on its core applications in UAV navigation,multi-objective formulations,and a spectrum of variantmodels that have emerged in recent years.It offers a structured analysis of the foundational principles underlying the PIO.It conducts a comparative assessment of various performance-enhanced versions,including hybrid models that integrate mechanisms from other optimization paradigms.Additionally,the strengths andweaknesses of distinct PIOvariants are critically examined frommultiple perspectives,including intrinsic algorithmic characteristics,suitability for specific application scenarios,objective function design,and the rigor of the statistical evaluation methodologies employed in empirical studies.Finally,this paper identifies principal challenges within current PIO research and proposes several prospective research directions.Future work should focus on mitigating premature convergence by refining the two-phase search structure and adjusting the exponential decrease of individual numbers during the landmark operator.Enhancing parameter adaptation strategies,potentially using reinforcement learning for dynamic tuning,and advancing theoretical analyses on convergence and complexity are also critical.Further applications should be explored in constrained path planning,Neural Architecture Search(NAS),and other real-worldmulti-objective problems.For Multi-objective PIO(MPIO),key improvements include controlling the growth of the external archive and designing more effective selection mechanisms to maintain convergence efficiency.These efforts are expected to strengthen both the theoretical foundation and practical versatility of PIO and its variants.
文摘In recent years,Blockchain Technology has become a paradigm shift,providing Transparent,Secure,and Decentralized platforms for diverse applications,ranging from Cryptocurrency to supply chain management.Nevertheless,the optimization of blockchain networks remains a critical challenge due to persistent issues such as latency,scalability,and energy consumption.This study proposes an innovative approach to Blockchain network optimization,drawing inspiration from principles of biological evolution and natural selection through evolutionary algorithms.Specifically,we explore the application of genetic algorithms,particle swarm optimization,and related evolutionary techniques to enhance the performance of blockchain networks.The proposed methodologies aim to optimize consensus mechanisms,improve transaction throughput,and reduce resource consumption.Through extensive simulations and real-world experiments,our findings demonstrate significant improvements in network efficiency,scalability,and stability.This research offers a thorough analysis of existing optimization techniques,introduces novel strategies,and assesses their efficacy based on empirical outputs.
