期刊文献+
共找到1,492篇文章
< 1 2 75 >
每页显示 20 50 100
Implementing the Deutsch-Jozsa algorithm by using Schrodinger cat states in cavity QED 被引量:1
1
作者 杨榕灿 李洪才 +1 位作者 林秀 陈美香 《Chinese Physics B》 SCIE EI CAS CSCD 2006年第10期2320-2323,共4页
We propose a scheme to implement the Deutsch-Jozsa algorithm by using Schroedinger cat states in cavity quantum electron-dynamics (QED). The scheme is based on the Raman interaction of a degenerate three-level A-typ... We propose a scheme to implement the Deutsch-Jozsa algorithm by using Schroedinger cat states in cavity quantum electron-dynamics (QED). The scheme is based on the Raman interaction of a degenerate three-level A-type atom with a coherent state in a cavity. By using Schroedinger cat states, the atomic spontaneous emission can be minimized and the Hadamard transformation in our scheme is not needed. 展开更多
关键词 cavity QED schrodinger cat states deutsch-Jozsa algorithm
原文传递
Scheme for Implementing Deutsch-Jozsa Algorithm Using Superconducting Quantum Interference Devices
2
作者 MA Chi ZHANG Shi-Jun YE Liu 《Communications in Theoretical Physics》 SCIE CAS CSCD 2008年第2期373-376,共4页
We propose a physical scheme for implementing the Deutsch-Jozsa algorithm with superconducting quantum interference devices (SQUIDs) in cavity-QED. The scheme is based on SQUID coupled to a single-mode microwave cav... We propose a physical scheme for implementing the Deutsch-Jozsa algorithm with superconducting quantum interference devices (SQUIDs) in cavity-QED. The scheme is based on SQUID coupled to a single-mode microwave cavity field or classical microwave pluses. The scheme is very simple and may be realizable experimentally. 展开更多
关键词 cavity QED deutsch Jozsa algorithm quantum information
在线阅读 下载PDF
Fast Mixture Distribution Optimization for Rain-Flow Matrix of a Steel Arch Bridge by REBMIX Algorithm
3
作者 Yuliang He Weihong Lou +1 位作者 Da Hang Youhua Su 《Structural Durability & Health Monitoring》 2025年第4期887-902,共16页
The computational accuracy and efficiency of modeling the stress spectrum derived from bridge monitoring data significantly influence the fatigue life assessment of steel bridges.Therefore,determining the optimal stre... The computational accuracy and efficiency of modeling the stress spectrum derived from bridge monitoring data significantly influence the fatigue life assessment of steel bridges.Therefore,determining the optimal stress spectrum model is crucial for further fatigue reliability analysis.This study investigates the performance of the REBMIX algorithm in modeling both univariate(stress range)and multivariate(stress range and mean stress)distributions of the rain-flowmatrix for a steel arch bridge,usingAkaike’s Information Criterion(AIC)as a performance metric.Four types of finitemixture distributions—Normal,Lognormal,Weibull,and Gamma—are employed tomodel the stress range.Additionally,mixed distributions,including Normal-Normal,Lognormal-Normal,Weibull-Normal,and Gamma-Normal,are utilized to model the joint distribution of stress range and mean stress.The REBMIX algorithm estimates the number of components,component weights,and component parameters for each candidate finite mixture distribution.The results demonstrate that the REBMIX algorithm-based mixture parameter estimation approach effectively identifies the optimal distribution based on AIC values.Furthermore,the algorithm exhibits superior computational efficiency compared to traditional methods,making it highly suitable for practical applications. 展开更多
关键词 steel bridge stress spectrum finite mixture distribution REBMIX algorithm Akaike’s information criterion
在线阅读 下载PDF
Implementation of n-qubit Deutsch-Jozsa algorithm using resonant interaction in cavity QED
4
作者 王洪福 张寿 《Chinese Physics B》 SCIE EI CAS CSCD 2008年第4期1165-1173,共9页
We propose a scheme to implement the n-qubit Deutsch-Jozsa algorithm based on resonant interaction between the atoms and a single-mode cavity. In the scheme, the resonant transitions between two ground states and one ... We propose a scheme to implement the n-qubit Deutsch-Jozsa algorithm based on resonant interaction between the atoms and a single-mode cavity. In the scheme, the resonant transitions between two ground states and one excited state of an atom are changed alternately by adjusting the cavity frequency appropriately, and the operations required to complete the algorithm can be significantly simplified following the increment of the number of qubits. The implementation of the scheme in experiment would show the full power of quantum algorithm and would be significative and important for more complicated quantum algorithm in cavity quantum electrodynamics. 展开更多
关键词 deutsch-Jozsa algorithm cavity quantum electrodynamics resonant interaction CNOT gate operation
原文传递
七量子位Deutsch-Josza量子算法的核磁共振实验实现 被引量:3
5
作者 魏达秀 杨晓冬 +4 位作者 罗军 孙献平 曾锡之 刘买利 丁尚武 《原子核物理评论》 CAS CSCD 北大核心 2002年第2期278-280,共3页
近年来 ,量子计算机的研究有了很大的发展 ,在目前提出的各种量子计算的方案中 ,核磁共振技术对模拟和演示量子算法以及验证量子计算机的优越性做出了巨大的贡献 .Deutsch Jozsa算法是一种研究较为广泛的量子算法 ,它可以用核磁共振实... 近年来 ,量子计算机的研究有了很大的发展 ,在目前提出的各种量子计算的方案中 ,核磁共振技术对模拟和演示量子算法以及验证量子计算机的优越性做出了巨大的贡献 .Deutsch Jozsa算法是一种研究较为广泛的量子算法 ,它可以用核磁共振实验予以验证 ,并可根据Cirac等人提出的方案予以简化 .报道了在核磁共振量子计算机上实验实现七位Deutsch Jozsa算法的过程和结果 . 展开更多
关键词 量子位 实验实现 deutsch-Jozsa量子算法 量子计算机 核磁共振
在线阅读 下载PDF
量子Fourier变换在实现Deutsch-Jozsa算法中的应用 被引量:2
6
作者 张洪涛 熊红梅 +1 位作者 凃玲英 舒军 《华侨大学学报(自然科学版)》 CAS 北大核心 2016年第2期155-159,共5页
提出利用量子Fourier变换解决Deutsch-Jozsa算法问题的观点.结合量子Fourier变换和DeutschJozsa算法的量子电路,找到一种利用量子Fourier变换解决Deutsch-Jozsa算法新的量子电路,并考察该量子电路中各个线路的量子状态,结合算法对该量... 提出利用量子Fourier变换解决Deutsch-Jozsa算法问题的观点.结合量子Fourier变换和DeutschJozsa算法的量子电路,找到一种利用量子Fourier变换解决Deutsch-Jozsa算法新的量子电路,并考察该量子电路中各个线路的量子状态,结合算法对该量子线路的状态进行研究.结果表明:利用量子Fourier变换解决Deutsch问题,能够有效地提高运算速度,节省运算时间. 展开更多
关键词 deutsch-JOZsA算法 量子傅里叶变换 量子电路 量子算法
在线阅读 下载PDF
以混合态为初态实现Deutsch-Josza量子算法 被引量:1
7
作者 李姝丽 《南昌大学学报(理科版)》 CAS 北大核心 2005年第5期472-473,481,共3页
给出了一种以混合态为初态实现Deutsch-Josza(D-J)量子算法的方法。根据这种方法,需要引入一个辅助量子比特,而且不必制备纯态就可以实现D-J算法,并且读出结果时只需对辅助量子比特进行测量,这样其结果的读出过程比一般的D-J量子算法的... 给出了一种以混合态为初态实现Deutsch-Josza(D-J)量子算法的方法。根据这种方法,需要引入一个辅助量子比特,而且不必制备纯态就可以实现D-J算法,并且读出结果时只需对辅助量子比特进行测量,这样其结果的读出过程比一般的D-J量子算法的读出过程简单,因此这种方法更容易在实验上实现。 展开更多
关键词 量子计算 D-J量子算法 混合态
在线阅读 下载PDF
利用腔QED实现Deutsch-Jozsa算法
8
作者 杨榕灿 李洪才 +3 位作者 刘文武 张秀真 郑碧沁 梅金锋 《福建师范大学学报(自然科学版)》 CAS CSCD 北大核心 2008年第3期38-41,63,共5页
提出了利用腔QED来实现两比特Deutsch-Jozsa算法的方案.该方案的主要优点有:(1)在整个过程中,腔场仅处于虚拟激发状态,有效地抑制了腔泄漏和热场对系统的影响;(2)不需要任何Hadamard变换,使得实验装置更为简单.因此,在当前的实验技术条... 提出了利用腔QED来实现两比特Deutsch-Jozsa算法的方案.该方案的主要优点有:(1)在整个过程中,腔场仅处于虚拟激发状态,有效地抑制了腔泄漏和热场对系统的影响;(2)不需要任何Hadamard变换,使得实验装置更为简单.因此,在当前的实验技术条件下,该方案是可行的. 展开更多
关键词 deutsch—Jozsa算法 热场 腔QED
在线阅读 下载PDF
基于原子系统的Deutsch-Jozsa算法实现方案
9
作者 董萍 杨名 曹卓良 《中国科技论文在线》 CAS 2007年第4期271-275,共5页
本文利用原子系统和光学设备设计了一个实现量子Deutsch-Jozsa算法的物理方案。该方案对现实的噪声和原子系统的大规模化可能带来的错误在当前的实验技术范围内具有一定的容错性。我们的方案对于利用原子系统来实现其它复杂量子计算来... 本文利用原子系统和光学设备设计了一个实现量子Deutsch-Jozsa算法的物理方案。该方案对现实的噪声和原子系统的大规模化可能带来的错误在当前的实验技术范围内具有一定的容错性。我们的方案对于利用原子系统来实现其它复杂量子计算来说将是重要的一步。 展开更多
关键词 原子系统 光学设备 deutsch-JOZsA算法 量子计算
在线阅读 下载PDF
利用腔的输入输出过程实现两比特的Deutsch-Jozsa算法(英文)
10
作者 潘国柱 张刚 周军 《淮北师范大学学报(自然科学版)》 CAS 2014年第4期17-21,共5页
文章提出依靠辅助腔和单光子脉冲相互作用来实现两比特Deutsch-Jozsa算法的方案.该方案简单实用,随着腔QED技术的发展,它易被操控.该方案可以推广到多比特Deutsch-Jozsa算法的情况.
关键词 量子控制相位门 deutsch-Jozsa 算法
在线阅读 下载PDF
热腔条件下实现Deutsch-Jozsa算法的简单方案
11
作者 宋明玉 《江汉大学学报(自然科学版)》 2011年第1期36-40,共5页
基于热腔场与双原子相互作用系统,提出一种简单的Deutsch-Jozsa算法的实现方案.通过外加经典场可以消除腔场光子数的依赖,整个过程不需要在真空状态中保留热腔.此外,该方案中也不需要原子和腔场的大失谐,可以大大缩减操作时间.通过精确... 基于热腔场与双原子相互作用系统,提出一种简单的Deutsch-Jozsa算法的实现方案.通过外加经典场可以消除腔场光子数的依赖,整个过程不需要在真空状态中保留热腔.此外,该方案中也不需要原子和腔场的大失谐,可以大大缩减操作时间.通过精确的数值计算,证明方案具有较高的保真度. 展开更多
关键词 量子计算 deutsch-JOZsA算法 热腔
在线阅读 下载PDF
利用仲氢诱导极化技术实现Deutsch算法 被引量:2
12
作者 田佳欣 刘文卿 +4 位作者 宋艳红 轩亚楠 李军方 姚叶锋 魏达秀 《波谱学杂志》 CAS CSCD 北大核心 2015年第4期618-627,共10页
核磁共振系统是实现量子计算的有效物理体系之一.但是随着量子位数的不断增加,运用核磁共振技术实现计算任务存在明显的局限性,原因之一是量子计算的初始态—赝纯态,随着量子位数的增加,信号指数性的衰减,量子位数越多制备赝纯态所需的... 核磁共振系统是实现量子计算的有效物理体系之一.但是随着量子位数的不断增加,运用核磁共振技术实现计算任务存在明显的局限性,原因之一是量子计算的初始态—赝纯态,随着量子位数的增加,信号指数性的衰减,量子位数越多制备赝纯态所需的脉冲序列越复杂,越不容易实现,不利于量子位数的扩展;另外,由于核磁共振中制备的赝纯态实际上也是一种混合态,用于实现量子信息任务时存在一定的争议.该文介绍的利用仲氢诱导极化技术(PHIP)制备出的实验初态,能够解决初态处于混合态的问题,并且信号强度显著增强,作者利用此态实现了ALTADENA条件下的两量子位的Deutsch-Jozsa量子算法和PASADENA条件下的三量子位的Deutsch-Like量子算法. 展开更多
关键词 核磁共振(NMR) 仲氢诱导极化技术(PHIP) ALTADENA PAsADENA deutsch算法
在线阅读 下载PDF
基于IBM Q的Deutsch-Jozsa算法实现 被引量:8
13
作者 戴娟 李志强 +2 位作者 潘苏含 张威 胡佳佳 《量子电子学报》 CAS CSCD 北大核心 2020年第2期202-209,共8页
Deutsch-Jozsa算法首次实现了对经典算法的指数级加速,解决了n个量子比特的Deutsch问题,奠定了量子算法的基本思想,体现了量子叠加性和并行性的特征。首次提出了一种综合算法,可自动生成2比特Deutsch-Jozsa算法的全部8个真值表与量子电... Deutsch-Jozsa算法首次实现了对经典算法的指数级加速,解决了n个量子比特的Deutsch问题,奠定了量子算法的基本思想,体现了量子叠加性和并行性的特征。首次提出了一种综合算法,可自动生成2比特Deutsch-Jozsa算法的全部8个真值表与量子电路。并给出了一种综合方法,可在f(x)对应电路未知的情况下构建量子电路。通常用经典算法解决该问题最多需要执行2n-1+1次判断,而Deutsch-Jozsa算法只需要一步就可以完成,虽然新提出的方法需要两步,但为实际应用中不同问题的解决提供了另一种可能的途径。进一步通过IBM Q Experience平台运行生成的量子电路,验证了量子电路和Deutsch-Jozsa算法的正确性。 展开更多
关键词 量子信息 deutsch-JOZsA算法 量子电路 综合算法 IBM Q EXPERIENCE
在线阅读 下载PDF
基于正规基的大规模S盒FPGA设计与实现
14
作者 张磊 李国元 +2 位作者 洪睿鹏 王建新 肖超恩 《密码学报(中英文)》 北大核心 2025年第4期854-869,共16页
传统上的分组密码S盒硬件实现采用查表法,其实现效果受到芯片资源的限制.针对16-bit大规模S盒在FPGA硬件实现中资源消耗大的问题,本文提出了基于复合域中正规基的S盒构造方法,研究使用较少的硬件资源实现16-bit S盒.首先,设计了基于复... 传统上的分组密码S盒硬件实现采用查表法,其实现效果受到芯片资源的限制.针对16-bit大规模S盒在FPGA硬件实现中资源消耗大的问题,本文提出了基于复合域中正规基的S盒构造方法,研究使用较少的硬件资源实现16-bit S盒.首先,设计了基于复合域的16-bit S盒构造实现方案,构建了线性的同构映射矩阵及其逆矩阵.其次,通过映射矩阵使有限域GF(2^(16))的乘法逆转换到复合域GF((((2^(2))^(2))^(2))^(2))上,进而将非线性的高维乘法逆简化为低维子域运算.然后,通过分析各级复合域不同参数对S盒实现的影响,筛选最优参数.最后,结合所提出的16-bit S盒构造实现框架,本文利用Xilinx公司的Vivado开发工具,以MK-3算法的16-bit S盒为例进行了FPGA仿真验证与性能分析.结果表明,本文构造方法实现的MK-3算法S盒需要186个LUT,时钟频率为114.129 MHz,在时钟频率/LUT的性能指标下达到了0.61360.同目前已公开文献同类方法中的最优实现性能0.43538相比,性能提升了40.93%.本文的16-bit S盒实现方案能够在降低硬件资源消耗的同时保持密码算法较高的运行频率,对有基于有限域构造的S盒的高效软硬件实现具有一定的参考价值. 展开更多
关键词 大规模s 复合域 正规基 MK-3算法 FPGA
在线阅读 下载PDF
Smooth constraint inversion technique in genetic algorithms and its application to surface wave study in the Tibetan Plateau 被引量:3
15
作者 吴建平 明跃红 曾融生 《Acta Seismologica Sinica(English Edition)》 EI CSCD 2001年第1期49-57,共9页
Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be g... Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be greatly suppressed and all the models in population will tend to equal in a few iterations, so the optimal solution meeting requirement can not be obtained. In this paper, an indirect smooth constraint technique is introduced to genetic inversion. In this method, the new models produced in iteration are smoothed, then used as theoretical models in calculation of misfit function, but in process of iteration only the original models are used in order to keep the diversity of models. The technique is effective in inversion of surface wave and receiver function. Using this technique, we invert the phase velocity of Raleigh wave in the Tibetan Plateau, revealing the horizontal variation of S wave velocity structure near the center of the Tibetan Plateau. The results show that the S wave velocity in the north is relatively lower than that in the south. For most paths there is a lower velocity zone with 12-25 km thick at the depth of 15-40 km. The lower velocity zone in upper mantle is located below the depth of 100 km, and the thickness is usually 40-80 km, but for a few paths reach to 100 km thick. Among the area of Ando, Maqi and Ushu stations, there is an obvious lower velocity zone with the lowest velocity of 4.2-4.3 km/s at the depth of 90-230 km. Based on the S wave velocity structures of different paths and former data, we infer that the subduction of the Indian Plate is delimited nearby the Yarlung Zangbo suture zone. 展开更多
关键词 genetic algorithm smooth constraint surface wave s wave velocity structure Tibetan Plateau
在线阅读 下载PDF
A hybrid quantum encoding algorithm of vector quantization for image compression 被引量:4
16
作者 庞朝阳 周正威 郭光灿 《Chinese Physics B》 SCIE EI CAS CSCD 2006年第12期3039-3043,共5页
Many classical encoding algorithms of vector quantization (VQ) of image compression that can obtain global optimal solution have computational complexity O(N). A pure quantum VQ encoding algorithm with probability... Many classical encoding algorithms of vector quantization (VQ) of image compression that can obtain global optimal solution have computational complexity O(N). A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm. 展开更多
关键词 vector quantization Grover's algorithm image compression quantum algorithm
原文传递
Hydraulic Optimization of a Double-channel Pump's Impeller Based on Multi-objective Genetic Algorithm 被引量:12
17
作者 ZHAO Binjuan WANG Yu +2 位作者 CHEN Huilong QIU Jing HOU Duohua 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2015年第3期634-640,共7页
Computational fluid dynamics(CFD) can give a lot of potentially very useful information for hydraulic optimization design of pumps, however, it cannot directly state what kind of modification should be made to impro... Computational fluid dynamics(CFD) can give a lot of potentially very useful information for hydraulic optimization design of pumps, however, it cannot directly state what kind of modification should be made to improve such hydrodynamic performance. In this paper, a more convenient and effective approach is proposed by combined using of CFD, multi-objective genetic algorithm(MOGA) and artificial neural networks(ANN) for a double-channel pump's impeller, with maximum head and efficiency set as optimization objectives, four key geometrical parameters including inlet diameter, outlet diameter, exit width and midline wrap angle chosen as optimization parameters. Firstly, a multi-fidelity fitness assignment system in which fitness of impellers serving as training and comparison samples for ANN is evaluated by CFD, meanwhile fitness of impellers generated by MOGA is evaluated by ANN, is established and dramatically reduces the computational expense. Then, a modified MOGA optimization process, in which selection is performed independently in two sub-populations according to two optimization objectives, crossover and mutation is performed afterword in the merged population, is developed to ensure the global optimal solution to be found. Finally, Pareto optimal frontier is found after 500 steps of iterations, and two optimal design schemes are chosen according to the design requirements. The preliminary and optimal design schemes are compared, and the comparing results show that hydraulic performances of both pumps 1 and 2 are improved, with the head and efficiency of pump 1 increased by 5.7% and 5.2%, respectively in the design working conditions, meanwhile shaft power decreased in all working conditions, the head and efficiency of pump 2 increased by 11.7% and 5.9%, respectively while shaft power increased by 5.5%. Inner flow field analyses also show that the backflow phenomenon significantly diminishes at the entrance of the optimal impellers 1 and 2, both the area of vortex and intensity of vortex decreases in the whole flow channel. This paper provides a promising tool to solve the hydraulic optimization problem of pumps' impellers. 展开更多
关键词 double-channel pump's impeller multi-objective genetic algorithm artificial neural network computational fluid dynamics(CFD) UNI
在线阅读 下载PDF
Automatic Algorithm Programming Model Based on the Improved Morgan's Refinement Calculus 被引量:5
18
作者 ZUO Zhengkang HU Ying +2 位作者 HUANG Qing WANG Yuan WANG Changjing 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2022年第5期405-414,共10页
The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development,including specification generation,program refinement,and formal verification.However,the existi... The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development,including specification generation,program refinement,and formal verification.However,the existing model has two flaws:incompleteness of program refinement and inadequate automation of formal verification.This paper proposes an automatic algorithm programming model based on the improved Morgan’s refinement calculus.It extends the Morgan’s refinement calculus rules and designs the C++generation system for realizing the complete process of refinement.Meanwhile,the automation tools VCG(Verification Condition Generator)and Isabelle are used to improve the automation of formal verification.An example of a stock’s maximum income demonstrates the effectiveness of the proposed model.Furthermore,the proposed model has some relevance for automatic software generation. 展开更多
关键词 automatic algorithm programming model program refinement VCG IsABELLE Morgan’s refinement calculus
原文传递
DETERMINING THE STRUCTURES AND PARAMETERS OF RADIAL BASIS FUNCTION NEURAL NETWORKS USING IMPROVED GENETIC ALGORITHMS 被引量:1
19
作者 Meiqin Liu Jida Chen 《Journal of Central South University》 SCIE EI CAS 1998年第2期68-73,共6页
The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error t... The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error term is used as the best criterion of optimizing the structures and parameters of networks. It is shown from the simulation results that the method not only improves the approximation and generalization capability of RBFNNs ,but also obtain the optimal or suboptimal structures of networks. 展开更多
关键词 RADIAL BAsIs function neural network GENETIC algorithms Akaike′s information CRITERION OVERFITTING
在线阅读 下载PDF
Image Segmentation of Brain MR Images Using Otsu’s Based Hybrid WCMFO Algorithm 被引量:6
20
作者 A.Renugambal K.Selva Bhuvaneswari 《Computers, Materials & Continua》 SCIE EI 2020年第8期681-700,共20页
In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid betwee... In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid between the two techniques,comprising the water cycle and moth-flame optimization algorithms.The optimal thresholds are obtained by maximizing the between class variance(Otsu’s function)of the image.To test the performance of threshold searching process,the proposed algorithm has been evaluated on standard benchmark of ten axial T2-weighted brain MR images for image segmentation.The experimental outcomes infer that it produces better optimal threshold values at a greater and quicker convergence rate.In contrast to other state-of-the-art methods,namely Adaptive Wind Driven Optimization(AWDO),Adaptive Bacterial Foraging(ABF)and Particle Swarm Optimization(PSO),the proposed algorithm has been found to be better at producing the best objective function,Peak Signal-to-Noise Ratio(PSNR),Standard Deviation(STD)and lower computational time values.Further,it was observed thatthe segmented image gives greater detail when the threshold level increases.Moreover,the statistical test result confirms that the best and mean values are almost zero and the average difference between best and mean value 1.86 is obtained through the 30 executions of the proposed algorithm.Thus,these images will lead to better segments of gray,white and cerebrospinal fluid that enable better clinical choices and diagnoses using a proposed algorithm. 展开更多
关键词 Hybrid WCMFO algorithm Otsu’s function multilevel thresholding image segmentation brain MR image
在线阅读 下载PDF
上一页 1 2 75 下一页 到第
使用帮助 返回顶部