Robust statistical methods of 2D and 3D image description
- 65 Downloads
- 3 Citations
Abstract
In this paper the problem of image feature extraction is considered with emphasis on developing methods which are resilient in the presence of data contamination. The issue of robustness of estimation procedures has received considerable attention in the statistics community [1–3] but its results are only recently being applied to specific image analysis tasks [4–7]. In this paper we show how the design of robust methods applies to image description tasks posed within a statistical hypothesis testing and parameter estimation framework. The methodology is illustrated by applying it to finding robust, optimal estimation kernels for line detection and edge detection. We then discuss the relationship of these optimal solutions to both the well established Hough Transform technique and the standard estimation kernels developed in the statistics literature. The application of standard robust kernels to image analysis tasks is illustrated by two examples which involve circular arc detection in gray-level imagery and planar surface segmentation in depth data. Robust methods are found to be effective general tools for generating 2D and 3D image descriptions.
Keywords
Feature Extraction Estimation Kernel Image Description Line Detection Hough TransformPreview
Unable to display preview. Download preview PDF.
References
- [1]P.J. Huber, Robust estimation of a location parameter, Ann. Math. Stat. 35 (1964) 73–101.Google Scholar
- [2]F. Hampel, E. Ronchetti, P. Rousseeuw and W. Stahel,Robust Statistics: The Approach Based on Influence Functions, (Wiley, New York, 1986).Google Scholar
- [3]P.J. Rousseeuw and A.M. Leroy,Robust Regression & Outlier Rejection, (Wiley, New York, 1987).Google Scholar
- [4]J. Princen, Hough transform methods for curve detection and parameter estimation, Ph.D. Thesis, University of Surrey (1990).Google Scholar
- [5]P. Meer, Robustness by consensus: the least median of squares family of estimators, in:Esprit-90 Vision Workshop, Heraklion, Greece, September 1990.Google Scholar
- [6]P.J. Besl, J.B. Birch and L.T. Watson, Robust window operators, in:Proc. 2nd IEEE Int. Conf. on Computer Vision, Florida, December 1988, pp. 591–600.Google Scholar
- [7]M. Petrou and J. Kittler, A robust method for edge detection, in:Applications of Artificial Intelligence X: Machine Vision and Robotics, SPIE 1708 (1992) 267–281.Google Scholar
- [8]J. Canny, A computational approach to edge detection, IEEE Trans. on Pattern Analysis and Machine Intelligence 6(6) (1986) 679–698.Google Scholar
- [9]R. Deriche, Using Canny's criteria to derive a recursively implemented optimal edge detector,Int. J. Computer Vision 1(2) (1987) 167.Google Scholar
- [10]M. Petrou and J. Kittler, Optimal edge detectors for ramp edges, IEEE Trans. Pattern Analysis and Machine Intelligence 13 (1991) 483–491.Google Scholar
- [11]G.C. Stockman and A.K. Agrawala, Equivalence of Hough curve detection to template matching, Commun. ACM 20 (1977) 820–822.Google Scholar
- [12]G.A. Jones, J. Princen, J. Illingworth and J. Kittler, Robust estimation of shape parameters, in:Proc. British Machine Vision Conference, Oxford, UK, September 1990.Google Scholar
- [13]G.A. Jones, J. Princen, J. Illingworth and J. Kittler, Depth data segmentation using robust estimation in a hierarchical data structure, in:Proc. IAPR Int. Workshop on Visual Form, Capri, Italy, May 1991.Google Scholar