Advertisement

Reestablishing Consistency of Uncertain Geometric Relations in Digital Images

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

Abstract

In uncertain geometry in the 2D plane, points are replaced by uncertainty regions. By allowing uncertainty several geometric notions such as parallelism and concurrency become inconsistent with Euclidean geometry. In previous work we explained how consistency can be partially restored by graph-theoretical grouping algorithms. In this paper we study inconsistencies at a higher-level, e.g., the violation of Desargues’s Theorem or Pappus’s Theorem. We provide a simple algorithm that completely restores Euclidean consistency. Although the algorithm may not give optimal results with respect to grouping, it shows a way to develop more sophisticated algorithms to obtain global consistency in uncertain geometry.

Keywords

Parameter Point Uncertainty Region Parallel Pair Digital Plane Parallel Incidence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Berretti, A. Del Bimbo, and E. Vicario. Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans. Pattern Anal. Machine Intell., 23:1089–1105, 2001.CrossRefGoogle Scholar
  2. [2]
    D. Cox, J. Little, and D. O’shea. Ideals, Varieties and Algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, New York, 1992.zbMATHGoogle Scholar
  3. [3]
    Y. Gdalyahu, D. Weinshall, and M. Werman. Self-organization in vision: Stochastic clustering for image segmentation, perceptual grouping, and image database organization. IEEE Trans. Pattern Anal. Machine Intell., 23:1053–1074, 2001.CrossRefGoogle Scholar
  4. [4]
    R. Hartshorne. Geometry: Euclid and beyond. Springer, New York, 2000.zbMATHGoogle Scholar
  5. [5]
    H. J.A.M. Heijmans and A. Toet. Morphological sampling. CVGIP: Image Understanding, 54:384–400, 1991.zbMATHCrossRefGoogle Scholar
  6. [6]
    R. Hilbert. Foundations of geometry. Open Court, La Salle, 1971.zbMATHGoogle Scholar
  7. [7]
    J. Liu and Y.T. Lee. A graph-based method for face identification from a single 2D line drawing. IEEE Trans. Pattern Anal. Machine Intell., 23:1106–1119, 2001.CrossRefGoogle Scholar
  8. [8]
    J.-P. Reveillès. Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d’Etat, Université Louis Pasteur, Strasbourg, 1991.zbMATHGoogle Scholar
  9. [9]
    P. Veelaert. Algorithms that measure parallelism and concurrency of lines in digital images. In Proceedings of SPIE’s Conference on Vision Geometry VIII, pages 69–79, Denver, 1999. SPIE.Google Scholar
  10. [10]
    P. Veelaert. Geometric constructions in the digital plane. J. Math. Imaging and Vision, 11:99–118, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    P. Veelaert. Line grouping based on uncertainty modeling of parallelism and collinearity. In Proceedings of SPIE’s Conference on Vision Geometry IX, pages 36–45, San Diego, 2000. SPIE. 268Google Scholar
  12. [12]
    P. Veelaert. Parallel line grouping based on interval graphs, volume 1953 of Lecture Notes in Computer Science, pages 530–541. Springer, Uppsala, Sweden, 2000.Google Scholar
  13. [13]
    P. Veelaert. Collinearity and weak collinearity in the digital plane, volume Digital and Image Geometry of Lecture Notes in Computer Science, pages 439–453. Springer, Dagstuhl, Germany, 2001.Google Scholar
  14. [14]
    P. Veelaert. Concurrency of line segments in uncertain geometry, volume 2301 of Lecture Notes in Computer Science, pages 289–300. Springer, Bordeaux, France, 2002.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Peter Veelaert
    • 1
  1. 1.HogentGhentBelgium

Personalised recommendations