Improving Difference Operators by Local Feature Detection

  • Kristof Teelen
  • Peter Veelaert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4245)


Differential operators are required to compute several characteristics for continuous surfaces, as e.g. tangents, curvature, flatness, shape descriptors. We propose to replace differential operators by the combined action of sets of feature detectors and locally adapted difference operators. A set of simple local feature detectors is used to find the fitting function which locally yields the best approximation for the digitized image surface. For each class of fitting functions, we determine which difference operator locally yields the best result in comparison to the differential operator. Both the set of feature detectors and the difference operator for a function class have a rigid mathematical structure, which can be described by Groebner bases. In this paper we describe how to obtain discrete approximates for the Laplacian differential operator and how these difference operators improve the performance of the Laplacian of Gaussian edge detector.


  1. 1.
    Haralick, R.: Digital step edges from zero crossing of second directional derivatives. IEEE Trans. Pattern Anal. Machine Intell. 6, 58–68 (1984)CrossRefGoogle Scholar
  2. 2.
    Langridge, D.: Detection of discontinuities in the first derivatives of surfaces. Comput. Vision Graphics Image Process. 27, 291–308 (1984)CrossRefGoogle Scholar
  3. 3.
    Fleck, M.: Multiple widths yield reliable finite differences. IEEE Trans. Pattern Anal. Machine Intell. 14, 412–429 (1992)CrossRefGoogle Scholar
  4. 4.
    Karabassis, E., Spetsakis, M.E.: An analysis of image interpolation, differentiation, and reduction using local polynomial fits. CVGIP: Graphical Models and Image Processing 57, 183–196 (1995)CrossRefGoogle Scholar
  5. 5.
    Veelaert, P.: Local feature detection for digital surfaces. In: Proceedings of the SPIE Conference on Vision geometry V, SPIE, vol. 2826, pp. 34–45 (1996)Google Scholar
  6. 6.
    Lachaud, J.-O., Vialard, A., de Vieilleville, F.: Analysis and Comparative Evaluation of Discrete Tangent Estimators. In: Andrès, É., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 240–251. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Lindeberg, T.: Discrete Derivative Approximations with Scale-Space Properties: A Basis for Low-Level Feature Extraction. J. of Mathematical Imaging and Vision 3, 349–376 (1993)CrossRefGoogle Scholar
  8. 8.
    Gunn, S.: On the discrete representation of the Laplacian of Gaussian. Pattern Recognition 32, 1463–1472 (1999)CrossRefGoogle Scholar
  9. 9.
    Demigny, D., Kamlé, T.: A Discrete Expression of Canny’s Criteria for Step Edge Detector Performances Evaluation. IEEE Trans. Patt. Anal. Mach. Intell. 19, 1199–1211 (1997)CrossRefGoogle Scholar
  10. 10.
    Lowe, D.G.: Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision 60(2), 91–110 (2004)CrossRefGoogle Scholar
  11. 11.
    Stoer, J., Witzgall, C.: Convexity and Optimization in Finite Dimensions I. Springer, Berlin (1970)Google Scholar
  12. 12.
    Cox, D., Little, J., O’Shea, D.: Ideals, Varieties and Algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, New York (1992)zbMATHGoogle Scholar
  13. 13.
    Veelaert, P., Teelen, K.: Fast polynomial segmentation of digitized curves. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 482–493. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kristof Teelen
    • 1
  • Peter Veelaert
    • 1
  1. 1.University College Ghent – Ghent University AssociationGhentBelgium

Personalised recommendations