1,754 research outputs found
Graph matching with a dual-step EM algorithm
This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifying point-correspondence matches. Unification is realized by constructing a mixture model over the bipartite graph representing the correspondence match and by affecting optimization using the EM algorithm. According to our EM framework, the probabilities of structural correspondence gate contributions to the expected likelihood function used to estimate maximum likelihood transformation parameters. These gating probabilities measure the consistency of the matched neighborhoods in the graphs. The recovery of transformational geometry and hard correspondence matches are interleaved and are realized by applying coupled update operations to the expected log-likelihood function. In this way, the two processes bootstrap one another. This provides a means of rejecting structural outliers. We evaluate the technique on two real-world problems. The first involves the matching of different perspective views of 3.5-inch floppy discs. The second example is furnished by the matching of a digital map against aerial images that are subject to severe barrel distortion due to a line-scan sampling process. We complement these experiments with a sensitivity study based on synthetic data
Quantum Gravity from Causal Dynamical Triangulations: A Review
This topical review gives a comprehensive overview and assessment of recent
results in Causal Dynamical Triangulations (CDT), a modern formulation of
lattice gravity, whose aim is to obtain a theory of quantum gravity
nonperturbatively from a scaling limit of the lattice-regularized theory. In
this manifestly diffeomorphism-invariant approach one has direct, computational
access to a Planckian spacetime regime, which is explored with the help of
invariant quantum observables. During the last few years, there have been
numerous new and important developments and insights concerning the theory's
phase structure, the roles of time, causality, diffeomorphisms and global
topology, the application of renormalization group methods and new observables.
We will focus on these new results, primarily in four spacetime dimensions, and
discuss some of their geometric and physical implications.Comment: 64 pages, 28 figure
Multiple Representation Approach to Geometric Model Construction From Range Data
A method is presented for constructing geometric design data from noisy 3-D sensor measurements of physical parts. In early processing phase, RLTS regression filters stemming from robust estimation theory are used for separating the desired part of the signal in contaminated sensor data from undesired part. Strategies for producing a complete 3-D data set from partial views are studied. Multiple representations are used in model construction because there is no single representation that would be most appropriate in all situations. In particular, surface triangulation, NURBS, and super-ellipsoids are employed in order to represent efficiently polygonal and irregular shapes, free form surfaces and standard primitive solids. The size of the required control point mesh for spline description is estimated using a surface characterization process. Surfaces of arbitrary topology are modeled using triangulation and trimmed NURBS. A user given tolerance value is driving refinement of the obtained surface model. The resulting model description is a procedural CAD model which can convey structural information in addition to low level geometric primitives. The model is translated to IGES standard product data exchange format to enable data sharing with other processes in concurrent engineering environment. Preliminary results on view registration using simulated data are shown. Examples of model construction using both real and simulated data are also given
Échantillonnage basé sur les Tuiles de Penrose et applications en infographie
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal
Recommended from our members
Computational Geometric and Algebraic Topology
Computational topology is a young, emerging field of mathematics that seeks out practical algorithmic methods for solving complex and fundamental problems in geometry and topology. It draws on a wide variety of techniques from across pure mathematics (including topology, differential geometry, combinatorics, algebra, and discrete geometry), as well as applied mathematics and theoretical computer science. In turn, solutions to these problems have a wide-ranging impact: already they have enabled significant progress in the core area of geometric topology, introduced new methods in applied mathematics, and yielded new insights into the role that topology has to play in fundamental problems surrounding computational complexity.
At least three significant branches have emerged in computational topology: algorithmic 3-manifold and knot theory, persistent homology and surfaces and graph embeddings. These branches have emerged largely independently. However, it is clear that they have much to offer each other. The goal of this workshop was to be the first significant step to bring these three areas together, to share ideas in depth, and to pool our expertise in approaching some of the major open problems in the field
Real-time Terrain Mapping
We present an interactive, real-time mapping system for digital elevation maps (DEMs), which allows Earth scientists to map and therefore understand the deformation of the continental crust at length scales of 10m to 1000km. Our system visualizes the surface of the Earth as a 3D~surface generated from a DEM, with a color texture generated from a registered multispectral image and vector-based mapping elements draped over it. We use a quadtree-based multiresolution method to be able to render high-resolution terrain mapping data sets of large spatial regions in real time. The main strength of our system is the combination of interactive rendering and interactive mapping directly onto the 3D~surface, with the ability to navigate the terrain and to change viewpoints arbitrarily during mapping. User studies and comparisons with commercially available mapping software show that our system improves mapping accuracy and efficiency, and also enables qualitatively different observations that are not possible to make with existing systems
Three Puzzles on Mathematics, Computation, and Games
In this lecture I will talk about three mathematical puzzles involving
mathematics and computation that have preoccupied me over the years. The first
puzzle is to understand the amazing success of the simplex algorithm for linear
programming. The second puzzle is about errors made when votes are counted
during elections. The third puzzle is: are quantum computers possible?Comment: ICM 2018 plenary lecture, Rio de Janeiro, 36 pages, 7 Figure
Computation of protein geometry and its applications: Packing and function prediction
This chapter discusses geometric models of biomolecules and geometric
constructs, including the union of ball model, the weigthed Voronoi diagram,
the weighted Delaunay triangulation, and the alpha shapes. These geometric
constructs enable fast and analytical computaton of shapes of biomoleculres
(including features such as voids and pockets) and metric properties (such as
area and volume). The algorithms of Delaunay triangulation, computation of
voids and pockets, as well volume/area computation are also described. In
addition, applications in packing analysis of protein structures and protein
function prediction are also discussed.Comment: 32 pages, 9 figure
- …