Fig. 11. Two successive outdoor range scans, smoothed and segmented by the line mask. The line intersection points ( ) in the first scan, and inverted triangles ( ) in the second, can be used as occlusion-invariant, point features.
VII. CONCLUSIONUnlike RANSAC, the presented algorithm smoothes range data, to produce a local description of features, which, in some circumstances, can be more beneficial than global descriptions for robot navigation. Also, its computational complexity is independent of the number of model outliers, and is less affected by the use of higher order geometric models.The smoothing and segmentation of range data is fundamentally different from that of image data. Structure preserving, and noise reduction algorithms in vision, use the local intensity gradient as a measure of noise. Range values are completely environment dependent, and not constant between features. Therefore, in this algorithm, the Mahalanobis distance between observed range values and their geometric-model-based predictions is used as the "measure of noise." A mask weighting function of the Mahalanobis distance was derived, which behaves as the diffusion coefficient in the anisotropic diffusion equation, often applied in vision, which guarantees that no new features are introduced with increase of scale. This mask can be applied iteratively, providing smoothing at different scales. The results demonstrated that the number of extracted features (lines or circles) converged to the true number with increase of scale, and the error between the extracted and true feature coordinates converged to a minimum. It has been shown that with increase of scale, the algorithm automatically reduces noise, only within the model-compliant regions of the range scans, yielding superior, postsmoothing, segmentation possibilities.
REFERENCES[1] P. Perona and J. Malik, "Scale-space and edge detection using anisotropic diffusion," IEEE Trans.