Most of the segmentation algorithms of range images are based upon either a region approach or an edge approach. While the region growing methods are poor in delimiting the region boundaries, the edges do not give information about the different surfaces and are not connected. But these two approaches can collaborate because they give complementary information about the scene. In the proposed method we first extract edges from the image. Two kinds of edges are considered: occlusion edges or signal discontinuity and roof edges or orientation discontinuities. The edges are completed by a concurrent step and roof edges closing method in order to form initial closed regions by connected components labeling. Then begins an iterative region correcting process. At each iteration we fit a least squares bivariate polynomial to every region. Then each boundary point is examined to see if it is better approximated by its region or by a neighboring region. But the regions are not allowed to overpass initial edge points considered as confident surface boundaries. This process converges after few iterations and produces a better correspondence between the shapes of the regions and the surfaces of the objects. Results are shown for real range images.
[1]
Bahram Parvin,et al.
Adaptive multiscale feature extraction from range data
,
1989,
Comput. Vis. Graph. Image Process..
[2]
Anil K. Jain,et al.
Segmentation and Classification of Range Images
,
1987,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3]
Tony Kasvand,et al.
The k1k2 space in range image analysis
,
1988,
[1988 Proceedings] 9th International Conference on Pattern Recognition.
[4]
Paul J. Besl,et al.
Surfaces in Range Image Understanding
,
1988,
Springer Series in Perception Engineering.
[5]
Jean Ponce,et al.
Toward a surface primal sketch
,
1985,
Proceedings. 1985 IEEE International Conference on Robotics and Automation.