FAST SEGMENTATION OF RANGE IMAGES INTO PLANAR REGIONS BY SCAN LINE GROUPING

被引:123
作者
JIANG, XY
BUNKE, H
机构
[1] Institute of Informatics and Applied Mathematics, University of Berne, Berne, CH-3012
关键词
ALGORITHM; RANGE DATA; SEGMENTATION; REGION GROWING; PLANAR SURFACES;
D O I
10.1007/BF01215806
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A novel technique is presented for rapid partitioning of surfaces in range images into planar patches. The method extends and improves Pavlidis' algorithm (1976), proposed for segmenting images from electron microscopes. The new method is based on region growing where the segmentation primitives are scan line grouping features instead of individual pixels. We use a noise variance estimation to automatically set thresholds so that the algorithm can adapt to the noise conditions of different range images. The proposed algorithm has been tested on real range images acquired by two different range sensors. Experimental results show that the proposed algorithm is fast and robust.
引用
收藏
页码:115 / 122
页数:8
相关论文
共 18 条
[1]  
BESL PJ, 1988, SURFACES RANGE IMAGE
[2]  
Duda R.O., 1972, PATTERN CLASSIFICATI
[4]  
JIANG XY, 1992, IAM92006 TECH REP
[5]   ROBUST CLUSTERING WITH APPLICATIONS IN COMPUTER VISION [J].
JOLION, JM ;
MEER, P ;
BATAOUCHE, S .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1991, 13 (08) :791-802
[6]   FITTING AN UNKNOWN NUMBER OF LINES AND PLANES TO IMAGE DATA THROUGH COMPATIBLE CLUSTER MERGING [J].
KRISHNAPURAM, R ;
FREG, CP .
PATTERN RECOGNITION, 1992, 25 (04) :385-400
[7]  
LOZANOPEREZ T, 1987, IEEE T ROBOTIC AUTOM, P202
[8]  
MAITRE C, 1990, P ISPRS C SPIE, V1395, P275
[9]  
PAETH A, 1990, GRAPHICS GEMS, P171
[10]  
Parvin B., 1986, Proceedings CVPR '86: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.86CH2290-5), P415