本文選題：閾值分割 + 線性擬合��； 參考：《計算機應(yīng)用研究》2016年12期

【摘要】：傳統(tǒng)二維Otsu閾值分割法由于運算時間長、抗噪能力不足而在應(yīng)用中受到限制。為了克服這些缺點,提出了一種基于雙界線的二維Otsu閾值理論及其快速算法。在新的二維直方圖中,兩條平行于對角線的界線決定目標和背景區(qū)域的寬度,垂直于對角線的分割直線決定閾值大小。該算法運用Roberts算子和線性擬合法確定雙界線,然后運用改進的Otsu法計算最佳閾值,最后對噪聲區(qū)域進行后處理。實驗結(jié)果表明,該算法不僅運算速度快,而且具備較好的分割質(zhì)量和抗噪性能。同時,快速算法的引入,進一步降低了運算量,使得該算法具備更好的實時性。
[Abstract]:The traditional two-dimensional Otsu threshold segmentation method is limited in application because of its long operation time and insufficient anti-noise ability. In order to overcome these shortcomings, a 2-D Otsu threshold theory based on double boundaries and its fast algorithm are proposed. In the new two-dimensional histogram, the width of the target and the background region is determined by two boundaries parallel to the diagonal line, and the threshold value is determined by the segmentation line perpendicular to the diagonal line. In this algorithm, Roberts operator and linear fitting are used to determine the double boundary, then the improved Otsu method is used to calculate the optimal threshold. Finally, the noise region is post-processed. Experimental results show that the algorithm is not only fast, but also has good segmentation quality and anti-noise performance. At the same time, the introduction of fast algorithm further reduces the computation, making the algorithm has better real-time.
【作者單位】： 西南交通大學機械工程學院;
【基金】：國家自然科學基金資助項目(51275431)
【分類號】：TP391.41
，

本文編號：1952046