Professional Documents
Culture Documents
(2004) - Hausdorff Distance For Shape Matching
(2004) - Hausdorff Distance For Shape Matching
(2004) - Hausdorff Distance For Shape Matching
Outline
Introduction n Curve Segment Hausdorff Distance (CHD) n Experiment Results n Conclusion and Future Work
n
Outline
Introduction n Curve Segment Hausdorff Distance (CHD) n Experiment Results n Conclusion and Future Work
n
Chinese character
Fingerprints
Industrial parts
Logos
IntroductionRelated Works
n
H ( A, B ) = max( h ( A, B ), h ( B , A ))
where
h ( A, B ) = max min || a b ||
a A b B
1 h( A, B ) = m
min
a A
b B
|| a b ||
IntroductionRelated Works
n
Lb
1. Parallel distance:
La l ||1
l
l||2
d || ( La , Lb ) = min(l||1 , l||2 )
2. Perpendicular distance:
Distances between
La and Lb
d ( La , Lb ) = l
IntroductionRelated Works
3. Angle distance:
La
( La , Lb )
d ( La , Lb ) = f ( ( La , Lb ))
f:
Lb
IntroductionRelated Works
n
La
sin( ( La , Lb ))
( La , Lb )
Lb
IntroductionRelated Works
n
La
l 2 l 1
1 d ( La , Lb ) = ( w1 l1 + w2 l 2 ) 2
Where
Lb
li wi = , l1 + l2
(i = 1,2)
IntroductionRelated Works
HD: Hausdorff Distance
HD LHD1
Huttenlocher etc. 1993 Gao and Leung 2002 Chen and Leung 2003 Yu and Leung 2003 Yu and Leung 2003
LHD2 LHD*
CHD
Outline
Introduction n Curve Segment Hausdorff Distance (CHD) n Experiment Results n Conclusion and Future Work
n
CHD
n
n
Curves
Lines
M - Model image N
- Test image
N LM / L i, p j , q - Lines
M N C / C on i j
CHD
n
Angle distance
Perpendicular distance
La
Lb
n
1 d ( La , Lb ) = (w1 l1 + w2 l2 ) 2 l i wi = , (i = 1,2) l1 + l2
Parallel distance is omitted
CHD
n
M i, p
CN j '
1 M N d ( L , C ' ) = N LN d ( L , L j ,q i, p j ,q ) C j ' LNj ,q C N j '
M i, p N j
N d ( LM , C i, p j ' ) =|
N LN j ,q C j '
M N d ( L , L i , p j ,q ) |
CHD
n
1 M N d (C , C ) = M LM d ( L , C i, p i, p j ') M Ci LM i , p Ci
M i N j
d (CiM , C N j )=
M LM i , p C i
M N d ( L , C i, p j ' )
CHD
n
I.
M CN j S ( Ci )
1 C
N j
M CN j S ( Ci
M N CN d ( C , C j i j ) )
d (CiM , N ) =
S (CiM ) :
M CN j S ( Ci )
M N d ( C , C i j)
matching and
JN
j = J1
C jN C iM
CHD
II.
d (M , N ) = + 1 ( Rm
CiM M M d ( C i , N ) + dc (M , N ))
1 CiM
C iM M
CiM d (CiM , N )
CiM M
d c (M , N ) : compensation distance
Outline
Introduction n Curve Segment Hausdorff Distance (CHD) n Experiment Results n Conclusion and Future Work
n
Experiment Results
n
Examples:
Set 1
Set 2
Set 3
Set 4
Set 5
Set 6
Set 7
Set 8
Experiment Results
100.00% 80.00% Recognition rate 60.00% 40.00% 20.00% 0.00% Set 1 Set 2 Set 3 Set 4 Set 5 Set 6 Set 7 Set 8 MHD LHD CHD
Test images
Outline
Introduction n Curve Segment Hausdorff Distance (CHD) n Experiment Results n Conclusion and Future Work
n
Conclusion
n n n
We analyzed the development of the methods in Hausdorff distance family. A novel shape matching algorithm (CHD) is proposed. The proposed shape recognition system is relatively robust to distortions and noise with encouraging experiment results.
Future Work
n n
The performance of CHD can be further improved. We will extend CHD for 3D object recognition, CHDs good performance in occlusion and skewing implies the potential of our work in this direction.
Thank you!