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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
R. Hartshorne. Geometry: Euclid and beyond. Springer, New York, 2000.
H. J.A.M. Heijmans and A. Toet. Morphological sampling. CVGIP: Image Understanding, 54:384–400, 1991.
R. Hilbert. Foundations of geometry. Open Court, La Salle, 1971.
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.
J.-P. Reveillès. Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d’Etat, Université Louis Pasteur, Strasbourg, 1991.
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.
P. Veelaert. Geometric constructions in the digital plane. J. Math. Imaging and Vision, 11:99–118, 1999.
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. 268
P. Veelaert. Parallel line grouping based on interval graphs, volume 1953 of Lecture Notes in Computer Science, pages 530–541. Springer, Uppsala, Sweden, 2000.
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.
P. Veelaert. Concurrency of line segments in uncertain geometry, volume 2301 of Lecture Notes in Computer Science, pages 289–300. Springer, Bordeaux, France, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Veelaert, P. (2003). Reestablishing Consistency of Uncertain Geometric Relations in Digital Images. In: Asano, T., Klette, R., Ronse, C. (eds) Geometry, Morphology, and Computational Imaging. Lecture Notes in Computer Science, vol 2616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36586-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-36586-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00916-0
Online ISBN: 978-3-540-36586-0
eBook Packages: Springer Book Archive