• 沒有找到結果。

A new thinning algorithm for gray-scale images by the relaxation technique

N/A
N/A
Protected

Academic year: 2022

Share "A new thinning algorithm for gray-scale images by the relaxation technique"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: A new thinning algorithm for gray-scale images by the relaxation technique 作者: S. S. Yu;W. H. Tsai

貢獻者: Department of Information Communication

關鍵詞: Thinning;Relaxation;Gray-scale image;Skeleton;Line straightness 日期: 1990

上傳時間: 2009-11-25T02:30:55Z 出版者: Asia University

摘要: A new thinning algorithm for gray-scale images based on the relaxation technique is proposed. Thinning is treated as a process of assigning each picture point to either a skeleton or a nonskeleton category so that relaxation can be used to perform thinning. Contextual information existing in input data is utilized in the thinning process so that line straightness can be preserved. Five classes are created to classify each point, with four classes belonging to the skeleton category for different orientations and one to the nonskeleton category. An initial probability value for assigning a point to each class is computed first. In the relaxation process, interactions take place among the probability values of neighbouring points, making the skeleton probability values of the points in compatible

orientations to enhance one another. The probability value for each point to belong to the nonskeleton class of each point is also refined according to the point type.

The relaxation process is terminated when it converges to a condition in which points lying on skeletons achieve high skeleton probability values, while other points have unity nonskeleton probability values. Experimental results show that the proposed approach produces good thinning results in keeping line straightness.

參考文獻

相關文件

{ As the number of dimensions d increases, the number of points n required to achieve a fair esti- mate of integral would increase dramatically, i.e., proportional to n d.. { Even

Primal-dual approach for the mixed domination problem in trees Although we have presented Algorithm 3 for finding a minimum mixed dominating set in a tree, it is still desire to

If x or F is a vector, then the condition number is defined in a similar way using norms and it measures the maximum relative change, which is attained for some, but not all

In summary, the main contribution of this paper is to propose a new family of smoothing functions and correct a flaw in an algorithm studied in [13], which is used to guarantee

Theorem 5.6.1 The qd-algorithm converges for irreducible, symmetric positive definite tridiagonal matrices.. It is necessary to show that q i are in

• To achieve small expected risk, that is good generalization performance ⇒ both the empirical risk and the ratio between VC dimension and the number of data points have to be small..

* All rights reserved, Tei-Wei Kuo, National Taiwan University, 2005..

When an algorithm contains a recursive call to itself, we can often describe its running time by a recurrenceequation or recurrence, which describes the overall running time on