Sub-pixel distance maps and weighted distance transforms

被引:74
作者
Kimmel, R
Kiryati, N
Bruckstein, AM
机构
[1] TECHNION ISRAEL INST TECHNOL,DEPT ELECT ENGN,IL-32000 HAIFA,ISRAEL
[2] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,IL-32000 HAIFA,ISRAEL
关键词
distance transforms; weighted distance; curve evolution; differential geometry; continuous scale morphology;
D O I
10.1007/BF00119840
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A new framework for computing the Euclidean distance and weighted distance from the boundary of a given digitized shape is presented. The distance is calculated with sub-pixel accuracy. The algorithm is based on an equal distance contour evolution process. The moving contour is embedded as a level set in a time varying function of higher dimension. This representation of the evolving contour makes possible the use of an accurate and stable numerical scheme, due to Osher and Sethian [22]. The relation between the classical shape from shading problem and the weighted distance transform is presented, as well as an algorithm that calculates the geodesic distance transform on surfaces.
引用
收藏
页码:223 / 233
页数:11
相关论文
共 34 条
[1]  
Bichsel M., 1992, Proceedings. 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.92CH3168-2), P459, DOI 10.1109/CVPR.1992.223150
[2]  
BLUMH, 1973, J THEOR BIOL, V38, P205
[3]   ON SHAPE FROM SHADING [J].
BRUCKSTEIN, AM .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 44 (02) :139-154
[4]   SHAPE RECOGNITION PRAIRIE FIRES CONVEX DEFICIENCIES AND SKELETONS [J].
CALABI, L ;
HARTNETT, WE .
AMERICAN MATHEMATICAL MONTHLY, 1968, 75 (04) :335-+
[5]   EUCLIDEAN DISTANCE MAPPING [J].
DANIELSSON, PE .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1980, 14 (03) :227-248
[6]  
Dupuis P., 1992, Proceedings. 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.92CH3168-2), P453, DOI 10.1109/CVPR.1992.223151
[7]  
Horn B. K., 1989, SHAPE SHADING
[8]   HEIGHT AND GRADIENT FROM SHADING [J].
HORN, BKP .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1990, 5 (01) :37-75
[9]   NUMERICAL SHAPE FROM SHADING AND OCCLUDING BOUNDARIES [J].
IKEUCHI, K ;
HORN, BKP .
ARTIFICIAL INTELLIGENCE, 1981, 17 (1-3) :141-184
[10]   FINDING SHORTEST PATHS ON SURFACES USING LEVEL SETS PROPAGATION [J].
KIMMEL, R ;
AMIR, A ;
BRUCKSTEIN, AM .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (06) :635-640