位置:成果数据库 > 期刊 > 期刊详情页
Task Graph Reduction Algorithm for Hardware/Software Partitioning
  • 期刊名称:Wuhan University Journal of Natural Sciences
  • 时间:0
  • 页码:126-130
  • 分类:TP31[自动化与计算机技术—计算机软件与理论;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]天津工业大学计算机科学与软件学院,天津300000
  • 相关基金:国家自然科学基金(61173032)
  • 相关项目:容错处理器网格的高效重构技术
中文摘要:

为了得到清晰准确的二值化图像,且避免全局阈值化对图像细微信息的二值化不清晰和局部阈值二值化中往往存在伪影现象,提出了一种借助Candy算子检测边缘特征,将改进的二维Otsu最佳全局阈值与局部Bernsen阈值法在边缘信息的基础上相结合的二值化方法。实验表明这种方法能很好地处理带有噪声和低对比度的图像,通过改进的二维Otsu法降低了传统二维Otsu法的时间复杂度,并且可以减少局部阈值法的块效应,避免了大量虚假信息,又能保留图像的细节信息。

英文摘要:

In order to obtain clear accurate binarization image, avoiding the binarizafion not clear of image subtle information by global thresholding and artifact phenomenon existed in local thresholding, a binarization method combined improved 2d-Otsu best global thresh- olding with local Berasen thresholding based on edge information is proposed ,detecting edge feature with the aid of Candy operator. The experiments indicate that the method can handle with image with noise and low contrast well ,reduce the time complexity of traditional 2d Otsu by improved 2d-Otsu and block effect of local thresholding,avoid the much false information and keep the detail of the image in formation.

同期刊论文项目
期刊论文 27 会议论文 22
同项目期刊论文