By Valentin Gies, Thierry M. Bernard (auth.), Eric Andres, Guillaume Damiand, Pascal Lienhardt (eds.)
This e-book constitutes the refereed lawsuits of the twelfth foreign convention on Discrete Geometry for desktop Imagery, DGCI 2005, held in Poitiers, France in April 2005.
The 36 revised complete papers offered including an invited paper have been rigorously reviewed and chosen from fifty three submissions. The papers are prepared in topical sections on functions, discrete hierarchical geometry, discrete tomography, discrete topology, item homes, reconstruction and popularity, doubtful geometry, and visualization.
Read or Download Discrete Geometry for Computer Imagery: 12th International Conference, DGCI 2005, Poitiers, France, April 13-15, 2005. Proceedings PDF
Similar geometry books
Porous media : geometry and transports
The target of "Porous Media: Geometry and Transports" is to supply the foundation of a rational and sleek method of porous media. This e-book emphasizes a number of geometrical buildings (spatially periodic, fractal, and random to reconstructed) and the 3 significant single-phase transports (diffusion, convection, and Taylor dispersion).
Representation Theories and Algebraic Geometry
The 12 lectures provided in illustration Theories and AlgebraicGeometry specialize in the very wealthy and robust interaction among algebraic geometry and the illustration theories of assorted sleek mathematical buildings, similar to reductive teams, quantum teams, Hecke algebras, limited Lie algebras, and their partners.
With the ebook of this publication I discharge a debt which our period has lengthy owed to the reminiscence of a good mathematician of antiquity: to pub lish the /llost books" of the Conics of Apollonius within the shape that is the nearest we need to the unique, the Arabic model of the Banu Musil. Un til now this has been available merely in Halley's Latin translation of 1710 (and translations into different languages completely depending on that).
Advances in Polymer technology enjoys a longstanding culture and stable attractiveness in its group. each one quantity is devoted to a present subject and every assessment seriously surveys one point of that subject, to put it in the context of the quantity. The volumes commonly summarize the numerous advancements of the final five to ten years and talk about them significantly, featuring chosen examples, explaining and illustrating the real rules and bringing jointly many vital references of fundamental literature.
- Nonlinear Methods in Riemannian and Kählerian Geometry: Delivered at the German Mathematical Society Seminar in Düsseldorf in June, 1986
- Geometric Control and Nonsmooth Analysis (Series on Advances in Mathematics for Applied Sciences)
- Analytical geometry
- Algebraic Geometry and its Applications: Proceedings of the 8th Algebraic Geometry Conference, Yaroslavl’ 1992. A Publication from the Steklov Institute of Mathematics. Adviser: Armen Sergeev
- Independent Axioms for Minkowski Space-Time
Additional resources for Discrete Geometry for Computer Imagery: 12th International Conference, DGCI 2005, Poitiers, France, April 13-15, 2005. Proceedings
Sample text
Robot pose estimation in unknown environments by matching 2D range scans. Journal of Intelligent and Robotic Systems, 1997. 8. S. T. Pfister, S. I. Roumeliotis, and J. W. Burdick. Weighted line fitting algorithms for mobile robot map building and efficient data representation. In ICRA, 2003. 9. T. R¨ ofer. Using histogram correlation to create consistent laser scan maps. In Proceedings of the IEEE International Conference on Robotics Systems (IROS2002), 2002. 10. S. Thrun. Robotic mapping: A survey.
Combinatorial Pyramids consitute the latest model of this family. Within this framework, each partition is encoded by a combinatorial map which encodes all topological relationships between regions such as multiple boundaries and inclusion relationships. Moreover, the combinatorial pyramid framework provides a direct access to the embedding of the image’s boundaries. We present in this paper a hierarchical watershed algorithm based on combinatorial pyramids. Our method overcomes the problems connected to the presence of noise both within the basins and along the watershed contours.
Marchadier, D. Arqu`es, and S. Michelin. Thinning grayscale well-composed images. Pattern Recognition Letters, 25:581–590, 2004. [12] F. Meyer. Topographic distance and watershed lines. Signal Processing, (38):113– 125, 1994. [13] A. Montanvert, P. Meer, and A. Rosenfeld. Hierarchical image analysis using irregular tessellations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(4):307–316, APRIL 1991. [14] L. Najman and M. Couprie. Watershed algorithms and contrast preservation.