Robust comparison of binary images

被引:32
作者
Paumard, J [1 ]
机构
[1] Ecole Normale Super, CMLA, F-94235 Cachan, France
关键词
binary image comparison; Hausdorff distance;
D O I
10.1016/S0167-8655(97)80002-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Hausdorff distance between planar sets of points is known to be a good method to compare binary images. We present here a modification of this distance, called the censored Hausdorff distance. It allows robust comparisons of noisy binary images. The definition of the Voronoi surfaces is extended to this new distance, as well as the definition of the inclusion field. We then show that it is possible to localize a small binary pattern in an image. (C) 1997 Elsevier Science B.V.
引用
收藏
页码:1057 / 1063
页数:7
相关论文
共 10 条
[1]  
AZENCOTT R, 1996, P 13 INT C PATT REC, pC974
[2]  
AZENCOTT R, 1996, P INT C IM PROC LAUS
[3]  
BORGEFORS G, 1986, COMPUT VISION GRAPHI, V34
[4]  
BORGEFORS G, 1988, IEEE T PATTERN ANAL, V10
[5]  
BORGEFORS G, 1984, P 7 INT C PATT REC M
[6]  
DUBUISSON MP, 1994, P INT C PATT REC JER
[7]  
HUTTENLOCHER DP, 1993, IEEE T PATTERN ANALM, V15
[8]  
KWON OKK, 1996, P INT C IM PROC LAUS
[9]  
PAUMARD J, 1996, THESIS ECOLE NORMALE
[10]  
PAUMARD J, 1998, P INT C IM PROC SANT