Detection Algorithm of Knee Osteoarthritis Based on Magnetic Resonance Images

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%.

An Improved Jellyfish Algorithm for Multilevel Thresholding of Magnetic Resonance Brain Image Segmentations

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.

Frequency modulated weak signal detection based on stochastic resonance and genetic algorithm

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.

Noise cancellation of a multi-reference full-wave magnetic resonance sounding signal based on a modified sigmoid variable step size least mean square algorithm

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.

Comparison of Segmentation Algorithms for Detecting Myocardial Infarction Using Late Gadolinium Enhancement Magnetic Resonance Imaging

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.

Segmentation of Brain Tumor Magnetic Resonance Images Using a Teaching-Learning Optimization Algorithm

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.

A Review of Image Steganography Based on Multiple Hashing Algorithm

Steganography is a technique for hiding secret messages while sending and receiving communications through a cover item.From ancient times to the present,the security of secret or vital information has always been a significant problem.The development of secure communication methods that keep recipient-only data transmissions secret has always been an area of interest.Therefore,several approaches,including steganography,have been developed by researchers over time to enable safe data transit.In this review,we have discussed image steganography based on Discrete Cosine Transform(DCT)algorithm,etc.We have also discussed image steganography based on multiple hashing algorithms like the Rivest–Shamir–Adleman(RSA)method,the Blowfish technique,and the hash-least significant bit(LSB)approach.In this review,a novel method of hiding information in images has been developed with minimal variance in image bits,making our method secure and effective.A cryptography mechanism was also used in this strategy.Before encoding the data and embedding it into a carry image,this review verifies that it has been encrypted.Usually,embedded text in photos conveys crucial signals about the content.This review employs hash table encryption on the message before hiding it within the picture to provide a more secure method of data transport.If the message is ever intercepted by a third party,there are several ways to stop this operation.A second level of security process implementation involves encrypting and decrypting steganography images using different hashing algorithms.

Hybrid Optimization Algorithm for Handwritten Document Enhancement

The Gannet Optimization Algorithm (GOA) and the Whale Optimization Algorithm (WOA) demonstrate strong performance;however, there remains room for improvement in convergence and practical applications. This study introduces a hybrid optimization algorithm, named the adaptive inertia weight whale optimization algorithm and gannet optimization algorithm (AIWGOA), which addresses challenges in enhancing handwritten documents. The hybrid strategy integrates the strengths of both algorithms, significantly enhancing their capabilities, whereas the adaptive parameter strategy mitigates the need for manual parameter setting. By amalgamating the hybrid strategy and parameter-adaptive approach, the Gannet Optimization Algorithm was refined to yield the AIWGOA. Through a performance analysis of the CEC2013 benchmark, the AIWGOA demonstrates notable advantages across various metrics. Subsequently, an evaluation index was employed to assess the enhanced handwritten documents and images, affirming the superior practical application of the AIWGOA compared with other algorithms.

Elitist Reconstruction Genetic Algorithm Based on Markov Random Field for Magnetic Resonance Image Segmentation

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.

Generalized Nonconvex Low-Rank Algorithm for Magnetic Resonance Imaging (MRI) Reconstruction

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.

Hybrid Prairie Dog and Beluga Whale Optimization Algorithm for Multi-Objective Load Balanced-Task Scheduling in Cloud Computing Environments

The cloud computing technology is utilized for achieving resource utilization of remotebased virtual computer to facilitate the consumers with rapid and accurate massive data services.It utilizes on-demand resource provisioning,but the necessitated constraints of rapid turnaround time,minimal execution cost,high rate of resource utilization and limited makespan transforms the Load Balancing(LB)process-based Task Scheduling(TS)problem into an NP-hard optimization issue.In this paper,Hybrid Prairie Dog and Beluga Whale Optimization Algorithm(HPDBWOA)is propounded for precise mapping of tasks to virtual machines with the due objective of addressing the dynamic nature of cloud environment.This capability of HPDBWOA helps in decreasing the SLA violations and Makespan with optimal resource management.It is modelled as a scheduling strategy which utilizes the merits of PDOA and BWOA for attaining reactive decisions making with respect to the process of assigning the tasks to virtual resources by considering their priorities into account.It addresses the problem of pre-convergence with wellbalanced exploration and exploitation to attain necessitated Quality of Service(QoS)for minimizing the waiting time incurred during TS process.It further balanced exploration and exploitation rates for reducing the makespan during the task allocation with complete awareness of VM state.The results of the proposed HPDBWOA confirmed minimized energy utilization of 32.18% and reduced cost of 28.94% better than approaches used for investigation.The statistical investigation of the proposed HPDBWOA conducted using ANOVA confirmed its efficacy over the benchmarked systems in terms of throughput,system,and response time.

Parametric resonance of axially functionally graded pipes conveying pulsating fluid

Based on the generalized Hamilton's principle,the nonlinear governing equation of an axially functionally graded(AFG)pipe is established.The non-trivial equilibrium configuration is superposed by the modal functions of a simply supported beam.Via the direct multi-scale method,the response and stability boundary to the pulsating fluid velocity are solved analytically and verified by the differential quadrature element method(DQEM).The influence of Young's modulus gradient on the parametric resonance is investigated in the subcritical and supercritical regions.In general,the pipe in the supercritical region is more sensitive to the pulsating excitation.The nonlinearity changes from hard to soft,and the non-trivial equilibrium configuration introduces more frequency components to the vibration.Besides,the increasing Young's modulus gradient improves the critical pulsating flow velocity of the parametric resonance,and further enhances the stability of the system.In addition,when the temperature increases along the axial direction,reducing the gradient parameter can enhance the response asymmetry.This work further complements the theoretical analysis of pipes conveying pulsating fluid.

Enhanced resonance frequency in Co2FeAl thin film with different thicknesses grown on flexible graphene substrate

The flexible materials exhibit more favorable properties than most rigid substrates in flexibility,weight saving,mechanical reliability,and excellent environmental toughness.Particularly,flexible graphene film with unique mechanical properties was extensively explored in high frequency devices.Herein,we report the characteristics of structure and magnetic properties at high frequency of Co2FeAl thin film with different thicknesses grown on flexible graphene substrate at room temperature.The exciting finding for the columnar structure of Co2FeAl thin film lays the foundation for excellent high frequency property of Co2FeAl/flexible graphene structure.In-plane magnetic anisotropy field varying with increasing thickness of Co2FeAl thin film can be obtained by measurement of ferromagnetic resonance,which can be ascribed to the enhancement of crystallinity and the increase of grain size.Meanwhile,the resonance frequency which can be achieved by the measurement of vector network analyzer with the microstrip method increases with increasing thickness of Co2FeAl thin film.Moreover,in our case with graphene film,the resonance magnetic field is quite stable though folded for twenty cycles,which demonstrates that good flexibility of graphene film and the stability of high frequency magnetic property of Co2FeAl thin film grown on flexible graphene substrate.These results are promising for the design of microwave devices and wireless communication equipment.

RRT Autonomous Detection Algorithm Based on Multiple Pilot Point Bias Strategy and Karto SLAM Algorithm

A Rapid-exploration Random Tree(RRT)autonomous detection algorithm based on the multi-guide-node deflection strategy and Karto Simultaneous Localization and Mapping(SLAM)algorithm was proposed to solve the problems of low efficiency of detecting frontier boundary points and drift distortion in the process of map building in the traditional RRT algorithm in the autonomous detection strategy of mobile robot.Firstly,an RRT global frontier boundary point detection algorithm based on the multi-guide-node deflection strategy was put forward,which introduces the reference value of guide nodes’deflection probability into the random sampling function so that the global search tree can detect frontier boundary points towards the guide nodes according to random probability.After that,a new autonomous detection algorithm for mobile robots was proposed by combining the graph optimization-based Karto SLAM algorithm with the previously improved RRT algorithm.The algorithm simulation platform based on the Gazebo platform was built.The simulation results show that compared with the traditional RRT algorithm,the proposed RRT autonomous detection algorithm can effectively reduce the time of autonomous detection,plan the length of detection trajectory under the condition of high average detection coverage,and complete the task of autonomous detection mapping more efficiently.Finally,with the help of the ROS-based mobile robot experimental platform,the performance of the proposed algorithm was verified in the real environment of different obstacles.The experimental results show that in the actual environment of simple and complex obstacles,the proposed RRT autonomous detection algorithm was superior to the traditional RRT autonomous detection algorithm in the time of detection,length of detection trajectory,and average coverage,thus improving the efficiency and accuracy of autonomous detection.

Staging liver fibrosis with various diffusion-weighted magnetic resonance imaging models

BACKGROUND Diffusion-weighted imaging(DWI)has been developed to stage liver fibrosis.However,its diagnostic performance is inconsistent among studies.Therefore,it is worth studying the diagnostic value of various diffusion models for liver fibrosis in one cohort.AIM To evaluate the clinical potential of six diffusion-weighted models in liver fibrosis staging and compare their diagnostic performances.METHODS This prospective study enrolled 59 patients suspected of liver disease and scheduled for liver biopsy and 17 healthy participants.All participants underwent multi-b value DWI.The main DWI-derived parameters included Mono-apparent diffusion coefficient(ADC)from mono-exponential DWI,intravoxel incoherent motion model-derived true diffusion coefficient(IVIM-D),diffusion kurtosis imaging-derived apparent diffusivity(DKI-MD),stretched exponential model-derived distributed diffusion coefficient(SEM-DDC),fractional order calculus(FROC)model-derived diffusion coefficient(FROC-D)and FROC model-derived microstructural quantity(FROC-μ),and continuous-time random-walk(CTRW)model-derived anomalous diffusion coefficient(CTRW-D)and CTRW model-derived temporal diffusion heterogeneity index(CTRW-α).The correlations between DWI-derived parameters and fibrosis stages and the parameters’diagnostic efficacy in detecting significant fibrosis(SF)were assessed and compared.RESULTS CTRW-D(r=-0.356),CTRW-α(r=-0.297),DKI-MD(r=-0.297),FROC-D(r=-0.350),FROC-μ(r=-0.321),IVIM-D(r=-0.251),Mono-ADC(r=-0.362),and SEM-DDC(r=-0.263)were significantly correlated with fibrosis stages.The areas under the ROC curves(AUCs)of the combined index of the six models for distinguishing SF(0.697-0.747)were higher than each of the parameters alone(0.524-0.719).The DWI models’ability to detect SF was similar.The combined index of CTRW model parameters had the highest AUC(0.747).CONCLUSION The DWI models were similarly valuable in distinguishing SF in patients with liver disease.The combined index of CTRW parameters had the highest AUC.

Synergistic Swarm Optimization Algorithm

This research paper presents a novel optimization method called the Synergistic Swarm Optimization Algorithm(SSOA).The SSOA combines the principles of swarmintelligence and synergistic cooperation to search for optimal solutions efficiently.A synergistic cooperation mechanism is employed,where particles exchange information and learn from each other to improve their search behaviors.This cooperation enhances the exploitation of promising regions in the search space while maintaining exploration capabilities.Furthermore,adaptive mechanisms,such as dynamic parameter adjustment and diversification strategies,are incorporated to balance exploration and exploitation.By leveraging the collaborative nature of swarm intelligence and integrating synergistic cooperation,the SSOAmethod aims to achieve superior convergence speed and solution quality performance compared to other optimization algorithms.The effectiveness of the proposed SSOA is investigated in solving the 23 benchmark functions and various engineering design problems.The experimental results highlight the effectiveness and potential of the SSOA method in addressing challenging optimization problems,making it a promising tool for a wide range of applications in engineering and beyond.Matlab codes of SSOA are available at:https://www.mathworks.com/matlabcentral/fileexchange/153466-synergistic-swarm-optimization-algorithm.

MCWOA Scheduler:Modified Chimp-Whale Optimization Algorithm for Task Scheduling in Cloud Computing

Cloud computing provides a diverse and adaptable resource pool over the internet,allowing users to tap into various resources as needed.It has been seen as a robust solution to relevant challenges.A significant delay can hamper the performance of IoT-enabled cloud platforms.However,efficient task scheduling can lower the cloud infrastructure’s energy consumption,thus maximizing the service provider’s revenue by decreasing user job processing times.The proposed Modified Chimp-Whale Optimization Algorithm called Modified Chimp-Whale Optimization Algorithm(MCWOA),combines elements of the Chimp Optimization Algorithm(COA)and the Whale Optimization Algorithm(WOA).To enhance MCWOA’s identification precision,the Sobol sequence is used in the population initialization phase,ensuring an even distribution of the population across the solution space.Moreover,the traditional MCWOA’s local search capabilities are augmented by incorporating the whale optimization algorithm’s bubble-net hunting and random search mechanisms into MCWOA’s position-updating process.This study demonstrates the effectiveness of the proposed approach using a two-story rigid frame and a simply supported beam model.Simulated outcomes reveal that the new method outperforms the original MCWOA,especially in multi-damage detection scenarios.MCWOA excels in avoiding false positives and enhancing computational speed,making it an optimal choice for structural damage detection.The efficiency of the proposed MCWOA is assessed against metrics such as energy usage,computational expense,task duration,and delay.The simulated data indicates that the new MCWOA outpaces other methods across all metrics.The study also references the Whale Optimization Algorithm(WOA),Chimp Algorithm(CA),Ant Lion Optimizer(ALO),Genetic Algorithm(GA)and Grey Wolf Optimizer(GWO).

Maximizing Resource Efficiency in Cloud Data Centers through Knowledge-Based Flower Pollination Algorithm (KB-FPA)

Cloud computing is a dynamic and rapidly evolving field,where the demand for resources fluctuates continuously.This paper delves into the imperative need for adaptability in the allocation of resources to applications and services within cloud computing environments.The motivation stems from the pressing issue of accommodating fluctuating levels of user demand efficiently.By adhering to the proposed resource allocation method,we aim to achieve a substantial reduction in energy consumption.This reduction hinges on the precise and efficient allocation of resources to the tasks that require those most,aligning with the broader goal of sustainable and eco-friendly cloud computing systems.To enhance the resource allocation process,we introduce a novel knowledge-based optimization algorithm.In this study,we rigorously evaluate its efficacy by comparing it to existing algorithms,including the Flower Pollination Algorithm(FPA),Spark Lion Whale Optimization(SLWO),and Firefly Algo-rithm.Our findings reveal that our proposed algorithm,Knowledge Based Flower Pollination Algorithm(KB-FPA),consistently outperforms these conventional methods in both resource allocation efficiency and energy consumption reduction.This paper underscores the profound significance of resource allocation in the realm of cloud computing.By addressing the critical issue of adaptability and energy efficiency,it lays the groundwork for a more sustainable future in cloud computing systems.Our contribution to the field lies in the introduction of a new resource allocation strategy,offering the potential for significantly improved efficiency and sustainability within cloud computing infrastructures.

An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.