Algorithmic modelling for performance evaluation

Many of the machine vision algorithms described in the literature are tested on a very small number of images. It is generally agreed that algorithms need to be tested on much larger numbers if any statistically meaningful measure of performance is to be obtained. However, these tests are rarely performed; in our opinion this is normally due to two reasons. Firstly, the scale of the testing problem is daunting when high levels of reliability are sought, since it is the proportion of failure cases that allows the reliability to be assessed and a large number of failure cases are needed to form an accurate estimation of reliability. For reliable and robust algorithms, this requires an inordinate number of test cases. Secondly, there is the difficulty of selecting test images to ensure that they are representative. This is aggravated by the fact that the assumptions made may be valid in one application domain but not in another. Hence, it is very difficult to relate the results of one evaluation to other users’ requirements. While it is true that published papers in the vision area must contain some evidence of the successful application of the suggested technique, a whole host of reasons have been put forward as to why researchers do not attempt to evaluate their algorithms more rigorously. These objections are valid only within a closely defined context and do not stand up to critical examination [13]. The real problem seems to be the time required for the various stages of algorithm development. The ratiotheory: implementation: evaluation seems to scale according to the rule of thumb 1 : 10 : 100 [13]. The effort required to get a new idea published is thus far less than an extensive empirical evaluation, which is a considerable demotivation for researchers to do evaluation work, particularly as evaluation is not much valued as publishable material in either conferences or journals. However, the truth of the matter is that unless algorithms are evaluated – and in a manner that can be used to predict the capabilities of a technique on an unseen data set – it is unlikely to be re-implemented and used. Moreover, the subject cannot advance without a well-founded scientific methodology, which it will not have without an acknowledged system for

[1]  Neil A. Thacker,et al.  Using a combined stereo/temporal matcher to determine ego-motion , 1990, BMVC.

[2]  Kenneth L. Carper “Design Paradigms: Case Histories of Error and Judgement in Engineering" by Henry Petroski , 1995 .

[3]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Neil A. Thacker,et al.  Statistical Analysis of a Stereo Matching Algorithm , 1992 .

[5]  Don Libes Exploring expect - a Tcl-based toolkit for automating interactive programs (2. ed.) , 1995 .

[6]  R.A Lane,et al.  Stretch-correlation as a real-time alternative to feature-based stereo matching algorithms , 1994, Image Vis. Comput..

[7]  John K. Ousterhout,et al.  Tcl and the Tk Toolkit , 1994 .

[8]  H. Wang,et al.  A structure-from-motion algorithm for robot vehicle guidance , 1992, Proceedings of the Intelligent Vehicles `92 Symposium.

[9]  Neil A. Thacker,et al.  Optimal combination of stereo camera calibration from arbitrary stereo images , 1990, BMVC.

[10]  Josef Kittler,et al.  Error-sensitivity assessment of vision algorithms , 1998 .

[11]  Josef Kittler,et al.  Error Guided Design of a 3D Vision System , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  N. Thacker,et al.  Multiple shape recognition using pairwise geometric histogram based algorithms , 1995 .

[13]  Eberhard Gülch Results of test on image matching of ISPRS WG III/4 , 1991 .

[14]  Claus B. Madsen,et al.  Modelling and testing the stability of edge segments: length and orientation , 1996 .

[15]  Neil A. Thacker,et al.  Robust Recognition of Scaled Shapes using Pairwise Geometric Histograms , 1995, BMVC.

[16]  Robert M. Haralick Propagating covariance in computer vision , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[17]  Neil A. Thacker,et al.  Assessing the completeness properties of pairwise geometric histograms , 1995, Image Vis. Comput..

[18]  Claus B. Madsen A comparative study of the robustness of two pose estimation techniques , 1997, Machine Vision and Applications.

[19]  Patrick Courtney,et al.  Algorithmic Modeling for Performance Evaluation , 1997 .

[20]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.