A modified information cut algorithm (MIC) is presented.
提出了一种改进的信息割(MIC)算法。
The graph cut algorithm is one of high effective optimal methods in the stereo images matching.
图割算法是图像立体匹配算法中一种高效的最优化计算方法。
Objective To propose a modified graph cut algorithm under the elliptical shape constraint to segment the ultrasonogram of cervical lymph nodes.
目的本研究的目的在于了解舌不同区域淋巴引流的特点以及初级淋巴结在颈部的分布特征。
To improve the efficiency of graph cut algorithm and reduce user interaction, the graph cut and mean shift algorithm were combined to automatically segment 3D vertebra images.
为提高图割算法的效率并减少用户交互量，提出将图割与均值漂移算法结合应用的脊椎骨自动分割方法。
Several typical phase unwrapping algorithms are introduced, the effectiveness of the branch cut algorithm and the quality-guided path following algorithm is validated by experiments.
介绍了多种典型的相位去包裹算法，通过实验验证了分割线法和质量导向图法的有效性。
So, this paper presents an information hiding method based on filling random sequences. In this method, the gold-cut algorithm is used to give the rate of hiding information and hidden information.
因此，文章提出了一种基于随机序列填充的信息隐藏方法，该方法中使用黄金分割算法计算出被隐藏信息的大小，然后使用填充算法将秘密信息隐藏在随机序列中。
Moreover, to improve the disparity accuracy, a novel energy function is well designed to restrict the depth-continuity of an image and applied to the Graph Cut algorithm to describe the image feature.
并针对图像的深度连续性约束，定义了一个反映图像自身特征的新能量函数，应用于图割算法，提高了视差计算精度。
Because the required scanning range is cut down to a large extent by use of edge detection methods, the efficiency of the minimum-discontinuity phase unwrapping algorithm is significantly improved.
由于利用边缘检测使增长环搜寻所需的扫描范围在很大程度上缩小，最小不连续相位展开算法的效率得到了很大提高。
The experiment results show that the algorithm has better robustness on JPEG and image cut.
实验结果表明，该算法对于JPEG有损压缩、图像剪切等处理有很强的鲁棒性。
In this paper a discretization algorithm based on importance of cut point.
提出一种基于断点重要性的离散化算法。
The experiment result shows that the algorithm is effective, and keeps a high computing efficiency when the number of candidate cut point increase.
实验结果表明此算法是有效的，而且当候选断点个数增多时仍有很高的计算效率。
The experiment results show that the algorithm has good robustness on image cut, JPEG and median filter.
实验结果表明，该算法对图像剪切、JPEG有损压缩、中值滤波等攻击有很强的鲁棒性。
This paper presents a total variation(TV) image denoising algorithm based on graph cut.
本文提出一种基于图割的全变差（TV）图像去噪算法。
The experiment results show that the algorithm has good robustness on image cut, JPEG.
实验结果表明，该算法对于JPEG有损压缩、图像剪切等处理有很强的鲁棒性。
A novel algorithm based on motion information is suggested to apply for shot cut detection.
该文提出了一种基于运动信息的镜头切变检测算法。
The efficiency of the algorithm is improved by analyzing non-stable cut points.
通过分析非平稳割点，算法的有效性被改进。
Furthermore, similar example neurons are combined and neurons with bad data are cut to maintain robustness of the algorithm and simpleness of the network architecture.
此外，对近似的样本神经元进行合并，使用剪枝操作删除含坏数据的样本神经元，从而保证了算法的健壮性，并且精炼了网络结构。
That algorithm can both satisfy THD requirements for laying out ordinary rectangular objects and for the problems of severing by one cut in industry.
该算法既可满足一般矩形物体布局的要求，又可满足工业上一刀切问题的要求。
The algorithm consists of the scene cut detection and scene gradual change detection.
该算法主要由场景突变检测算法和场景渐变检测算法两部分组成。
By applying inconsistency to check the chosen cut points set, the algorithm possesses global property.
同时由于采用了不一致度对备选切点集合进行调整，使本算法具有全局性。
The simulation results show that the algorithm have not only cut down the average coding time, but also reduced the average coding bit rate.
测试结果表明该算法在减少平均编码时间的同时，也降低了平均编码比特率。
The experimental results prove that this algorithm is invisible, robust against the attack of JPEG compression, noise and cut-and-paste attack.
实验结果证明该算法具有良好的不可见性，对JPEG压缩、噪声攻击和剪切攻击都有很好的鲁棒性。
Simplified formulae for computing the stiffness matrices in four cases are derived, which, compared with corresponding Gauss integration algorithm, can cut 94-98% computing time.
文中导出了四种情况下刚度矩阵的简化计算公式，这些公式比对应的高斯积分算法节省计算工作量94—98%。
The experimental results demonstrate that the watermarks generated with the proposed algorithm are invisible and robust against JPEG lossy compression and noise and cut processing.
实验结果证实了所提出的水印算法具有很好的不可见性，对JPEG有损压缩、噪声、剪切等攻击具有良好的稳健性。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在该模型的基础上，利用分枝定界算法求解最大割问题。
The stress of main memory is abated, the times of scan of database are cut down, and the algorithm executes more efficient mining of association rules in time-variant database.
该算法通过分组及时舍弃挖掘过程中生成的非频繁项目集，有效降低主存压力，减少对数据库的扫描次数，能够对时变数据库进行高效地关联规则挖掘。
Then this thesis presents a new approach to solve top event occurrence rate and a new generation algorithm of minimal cut sequence of dynamic fault tree that deviate from Markov model completely.
提出了一种完全脱离马尔可夫模型的求解动态故障树顶事件发生概率的方法和一种最小顺序割集的生成方法。
People pay mo re attention to and plunge more research into the latter because of its more practical use, and thus always solve the minimum cut problem by means of the maxim um flow algorithm.
由于后者的实用性更强，人们对它投入的关注与研究也更多，因而实际中是通过最大流问题来求最小割集问题。
In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.
本文给出了最大割问题的二次规划算法。
In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.
本文给出了最大割问题的二次规划算法。
应用推荐