期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
基于迭代阀值分割法的植物特征图像处理
1
作者 官飞 《辽宁科技学院学报》 2018年第4期17-19,16,共4页
通过构建好的植物分类识别系统,运用图像处理算法中迭代阀值法对植物的特征图像进行分割运算,获取植物属性图像中的个性特征,解决了传统植物识别速度慢、准确率低等问题。
关键词 识别系统 迭代阀值 分割运算
下载PDF
AES算法及其实现技术 被引量:6
2
作者 张超 陆浪如 +1 位作者 楚泽甫 聂乃明 《交通与计算机》 2001年第2期28-31,共4页
文章在简述AES算法产生背景的基础上对算法进行了分析 ,对算法的具体实现方法进行了说明 ,给出了算法的测试数据。最后 。
关键词 高级加密标准 有限域 状态 密码密钥 分割运算 AES算法 实现技术
下载PDF
Motion feature descriptor based moving objects segmentation
3
作者 Yuan Hui Chang Yilin +2 位作者 Ma Yanzhuo Bai Donglin Lu Zhaoyang 《High Technology Letters》 EI CAS 2012年第1期84-89,共6页
A novel moving objects segmentation method is proposed in this paper. A modified three dimensional recursive search (3DRS) algorithm is used in order to obtain motion information accurately. A motion feature descrip... A novel moving objects segmentation method is proposed in this paper. A modified three dimensional recursive search (3DRS) algorithm is used in order to obtain motion information accurately. A motion feature descriptor (MFD) is designed to describe motion feature of each block in a picture based on motion intensity, motion in occlusion areas, and motion correlation among neighbouring blocks. Then, a fuzzy C-means clustering algorithm (FCM) is implemented based on those MFDs so as to segment moving objects. Moreover, a new parameter named as gathering degree is used to distinguish foreground moving objects and background motion. Experimental results demonstrate the effectiveness of the proposed method. 展开更多
关键词 motion estimation (ME) motion feature descriptor (MFD) fuzzy C-means clustering .moving objects segmentation video analysis
下载PDF
Fast wire segmenting algorithm considering layout density and signal integrity
4
作者 马鸿 Ho Chingyen Peng Silong 《High Technology Letters》 EI CAS 2009年第4期416-422,共7页
A k-shortest path based algorithm considering layout density and signal integrity for good buffer candidatelocations is proposed in this paper. Theoretical results for computing the maximal distance betweenbuffers are... A k-shortest path based algorithm considering layout density and signal integrity for good buffer candidatelocations is proposed in this paper. Theoretical results for computing the maximal distance betweenbuffers are derived under the timing, noise and slew rate constraints. By modifying the traditional uniformwire segmenting strategy and considering the impact of tile size on density penalty function, this work proposesk-shortest path algorithm to find the buffer insertion candidate locations. The experiments show thatthe buffers inserted can significantly optimize the design density, alleviate signal degradation, save thenumber of buffers inserted and the overall run time. 展开更多
关键词 candidate location buffer insertion layout density slew noise
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部