Evaluation of corner extraction schemes using invariance methods

  title={Evaluation of corner extraction schemes using invariance methods},
  author={Anders Heyden and Karl Rohr},
  journal={Proceedings of 13th International Conference on Pattern Recognition},
  pages={895-899 vol.1}
  • A. Heyden, K. Rohr
  • Published 25 August 1996
  • Computer Science, Mathematics
  • Proceedings of 13th International Conference on Pattern Recognition
We describe a new method to evaluate corner extraction schemes using invariance methods. Since the locations of centers in an image depend both on the intrinsic parameters of the camera and the relative position and orientation of the object with respect to the camera, the exact positions of corners in an image are generally not known. To circumvent the need for this knowledge, we use sets of points (instead of individual points) extracted from images of polyhedral objects and projective… 
Localization Error Measurement in Features Extraction Algorithms
  • 2010
Image features detection and matching is a fundamental step in many computer vision applications. A lot of methods have been proposed in recent years, with the aim to extract image features invariant
Adaptive Corner Detection Algorithm and its Extension using Window-based Approach for Gray-scale Images
Abstract In computer vision, the corners of an object play an important role in shape representation and analysis. In this paper, we carried out a dozen popular and most cited corner detection
Corner Detection Algorithms for Digital Images in Last Three Decades
Abstract Corner detection is an important step in many computer vision applications. A large number of corner detection algorithms were already developed. An exhaustive review of the existing corner
Learning the probability of correspondences without ground truth
We present a quality assessment procedure for correspondence estimation based on geometric coherence rather than ground truth. The procedure can be used for performance evaluation of correspondence
Evaluation of 3D Operators for the Detection of Anatomical Point Landmarks in MR and CT Images
Nine 3D differential operators based on only first order partial derivatives of an image yield a larger number of corresponding points than the other operators, and their performance on the basis of the statistical measures is better, and the separability of the detections is better so that a suitably chosen threshold can significantly decrease the number of false detections.
Evaluation of Interest Point Detectors for Non-planar, Transparent Scenes
A method is proposed to perform an evaluation of the performance of various available detectors for non-planar, calibrated X-ray images and has shown that the Laplacian-of-Gaussian and Harris-Laplace detectors show overall the best performance for the datasets used.
A Generic Framework for Assessing the Performance Bounds of Image Feature Detectors
A generic framework based on the repeatability measure is presented that allows assessment of the upper and lower bounds of detector performance and finds statistically significant performance differences between detectors as a function of image transformation amount by introducing a new variant of McNemar’s test in an effort to design more reliable and effective vision systems.
On moment-based local operators for detecting image patterns
  • A. Sluzek
  • Mathematics, Computer Science
    Image Vis. Comput.
  • 2005
Performance evaluation of corner detectors using consistency and accuracy measures
Performance Characterization of Landmark Operators
Within the field of computer vision the development of algorithms with predictable performance is of major concern. Before using a certain algorithm we like to know how well it performs and whether


A canonical framework for sequences of images
  • A. Heyden, K. Astrom
  • Mathematics
    Proceedings IEEE Workshop on Representation of Visual Scenes (In Conjunction with ICCV'95)
  • 1995
This paper deals with the problem of analysing sequences of images of rigid point objects taken by uncalibrated cameras. It is assumed that the correspondences between the points in the different
Reconstruction from image sequences by means of relative depths
  • A. Heyden
  • Mathematics, Computer Science
    Proceedings of IEEE International Conference on Computer Vision
  • 1995
The paper shows how the problems of reconstructing the locations of n points in space from m different images without camera calibration can be put into a similar theoretical framework and a new concept, the reduced fundamental matrix, is introduced.
Theory of Reconstruction from Image Motion
"Theory of Reconstruction from Image Motion" presents the mathematics underlying the reconstruction of camera motion from the movements of points in the camera image. The author describes recent work
Consistency and correction of line-drawings, obtained by projections of piecewise planar objects
Criteria for a line-drawing to be correct is given, along with methods to find possible interpretations, if there are many objects in the scene and there may be occlusions between objects.
A Common Framework for Kinetic Depth, Reconstruction and Motion for Deformable Objects
  • G. Sparr
  • Mathematics, Computer Science
  • 1994
In this paper, problems related to depth, reconstruction and motion from a pair of projective images are studied under weak assumptions, based on a novel interpretation of a theorem in projective geometry of M. Chasles and the notion of “affine shape”.
Extracting projective structure from single perspective views of 3D point sets
It is proved by example that although the general statement is true, invariants do exist for structured three-dimensional point sets and they can be used to compute projective structure.
On corner and vertex detection
  • G. Giraudon, R. Deriche
  • Mathematics, Computer Science
    Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
  • 1991
An analytical study is presented which allows one to know exactly what the behavior is of a detector around trihedral vertices, and it is shown that near three surfaces, two elliptic maxima of DET exist, and their location is inside extremal contrast surface.
Modelling and identification of characteristic intensity variations
  • K. Rohr
  • Mathematics, Computer Science
    Image Vis. Comput.
  • 1992
An efficient approach to the identification of characteristic intensity variations
An approximation of the original model, consisting of the superposition of wedge-shaped structures smoothed by a Gaussian filter is derived and the minimization method of Levenberg-Marquardt 3 is applied to reduce the computation time.
Depth Computations from Polyhedral Images
A method is developed for the computation of depth maps, modulo scale, from one single image of a polyhedral scene. Only aane shape properties of the scene and image are used, hence no metrical