+ All Categories
Home > Documents > A medial-surface oriented 3-d two-subfield thinning algorithm

A medial-surface oriented 3-d two-subfield thinning algorithm

Date post: 31-Dec-2015
Category:
Upload: echo-branch
View: 32 times
Download: 2 times
Share this document with a friend
Description:
A medial-surface oriented 3-d two-subfield thinning algorithm. Author : Cherng -Min Ma, Shu -Yen Wan Source : Pattern Recognition Letters 22 (2001) 1439-1446 Speaker : Jhen -Yu Yang Advisor : Ku-Yaw Chang. Outline. Introduction Method Results Conclusion. Introduction. Thinning - PowerPoint PPT Presentation
19
A medial-surface oriented 3-d two-subfield thinning algorithm Author Cherng-Min Ma, Shu-Yen Wan Source Pattern Recognition Letters 22 (2001) 1439-1446 Speaker Jhen-Yu Yang Advisor Ku-Yaw Chang
Transcript

A medial-surface oriented 3-d two-subfield

thinning algorithm

Author: Cherng-Min Ma, Shu-Yen WanSource: Pattern Recognition Letters 22 (2001) 1439-1446 Speaker: Jhen-Yu YangAdvisor: Ku-Yaw Chang

Outline• Introduction• Method• Results• Conclusion

2011/12/6

Introduction• Thinning

– A fundamental preprocess– To remove unnecessary information

• Allow to topological analysis

2011/12/6

Introduction• 2-subfield thinning algorithm

– Voxels are classified• 6- or directly adjacent voxels

– Different subfields

• Diagonally adjacent voxels– Same subfields

– Applied to voxels in each subfield alternatively

2011/12/6

Outline• Introduction• Method• Results• Conclusion

2011/12/6

Method• Basic notations

– Two kinds of voxels• 0’s and 1’s

– N(x)– N*(x) = N(x) – {x}– e(x)– layer

• Ex: east layer– middle layer

• Ex: midEW layer

2011/12/6

Method• Basic notations

– Two kinds of voxels• 0’s and 1’s

– N(x)– N*(x) = N(x) – {x}– e(x)– layer

• Ex: east layer– middle layer

• Ex: midEW layer

2011/12/6

Method• Condition 1, an upper border 1, x, with l(x) = 1 is:

– U-deletable• adjacent to only one 1’s in the midEW layer and

midNS layer, and• a, is 1, then b=1 or c=1

– U-preserving• See next page

2011/12/6

[vertically deletable or preserving]

Method(Condition 1, cont.)

• Condition 1– U-preserving, if x is U-deletable, and

• l(x), adjacent to two distinct 1-component • in N*(x) or• l(x), adjacent only two 1’s, p and q in N*(x) • where {x, l(x), p, q}• is a 2-d element

2011/12/6

Method• Condition 2, an end 1, x, δ(x)=lw(x)=1 in midNS layer is:

– UE-deletable• if all voxels are 0’s, upper and east layer

– UE-preserving• See next page

2011/12/6

Method(Condition 2, cont.)

• Condition 2, UE-preserving, if x is UE-deletable, and

– (a) a1 = a2 = b1 = b2=0, and either a0 = a3 =1 or b0 = b3 =1 ; or

– (b) a0=a3=p=0, where p= a1 or a2, or b0=b3=q=0, where q =b1 or b2

2011/12/6

Method• Condition 3

– an LW-deletable 1, x

2011/12/6

Method

2011/12/6

Outline• Introduction• Method• Results• Conclusion

2011/12/6

Results

2011/12/6

Results

2011/12/6

Outline• Introduction• Method• Results• Conclusion

2011/12/6

Conclusion

2011/12/6

The End

2011/12/6


Recommended