English
Related papers

Related papers: Matching Cells

200 papers

In computer vision and medical imaging, the problem of matching structures finds numerous applications from automatic annotation to data reconstruction. The data however, while corresponding to the same anatomy, are often very different in…

Computer Vision and Pattern Recognition · Computer Science 2021-03-24 Pierre-Louis Antonsanti , Joan Glaunès , Thomas Benseghir , Vincent Jugnon , Irène Kaltenmark

Voronoi cells of a discrete set in Euclidean space are known as generalized polyhedra. We identify polyhedral cells of a discrete set through a direction cone. For an arbitrary set we distinguish polyhedral from non-polyhedral cells using…

Mathematical Physics · Physics 2016-05-17 Ina Voigt , Stephan Weis

Gradient vector fields are fundamental objects from both theoretical and practical perspectives, since various phenomena can be modeled within this framework. The ``moduli space'' of such vector fields provides the foundation for describing…

Dynamical Systems · Mathematics 2025-10-02 Tomoo Yokoyama

Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…

Computer Vision and Pattern Recognition · Computer Science 2024-04-04 Maolin Gao , Zorah Lähner , Johan Thunberg , Daniel Cremers , Florian Bernard

In this paper we develop a combinatorial abstraction of tropical linear programming. This generalizes the search for a feasible point of a system of min-plus-inequalities. It is based on the polyhedral properties of triangulations of the…

Optimization and Control · Mathematics 2017-12-05 Georg Loho

Following the analogy between algebras (monoids) and monoidal categories the construction of nucleus for non-associative algebras is simulated on the categorical level. Nuclei of categories of modules are considered as an example.

Category Theory · Mathematics 2007-08-22 Alexei Davydov

Refining the notion of an ideal triangulation of a compact three-manifold, we provide in this paper a combinatorial presentation of the set of pairs (M,a), where M is a three-manifold and a is a collection of properly embedded arcs. We also…

Geometric Topology · Mathematics 2019-01-30 Gennaro Amendola

A combinatorial formula for the Pontrjagin classes of a triangulated manifold is given. The main ingredients are oriented matroid theory and a modified formulation of Chern-Weil theory.

Algebraic Topology · Mathematics 2016-09-06 Israel M. Gelfand , Robert D. MacPherson

This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…

Multiagent Systems · Computer Science 2022-01-13 Pedro M. Sequeira , António P. Aguiar , João Hespanha

We show how to construct homology bases for certain CW complexes in terms of discrete Morse theory and cellular homology. We apply this technique to study certain subcomplexes of the half cube polytope studied in previous works. This…

Geometric Topology · Mathematics 2014-10-01 R. M. Green , Jacob T. Harper

It is well known that for many semilinear parabolic equations there is a global attractor which has a cell complex structure with finite dimensional cells. Additionally, many semilinear parabolic equations have equilibria with finite…

Dynamical Systems · Mathematics 2008-05-29 Michael Robinson

The questions when two Morse function on closed manifolds are conjugated is investigated. Using the handle decompositions of manifolds the condition of conjugation is formulated. For each Morse function on 3-manifold the ordered generalized…

Geometric Topology · Mathematics 2007-05-23 Alexander Prishlyak

A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.

Discrete Mathematics · Computer Science 2007-07-16 V. V. Mkrtchyan

This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…

Dynamical Systems · Mathematics 2020-11-30 Michael F. Barnsley , Louisa F. Barnsley , Andrew Vince

Incomplete binary mixing of two components can form a heterogeneous assemblage in space. The heterogeneity power spectrum of the assemblage can be frequently obtained. However, it is unknown if a stochastic binary field exists to generate…

Geophysics · Physics 2019-02-20 Jiaxuan Li , Yingcai Zheng

We consider manifolds with isolated singularities, i.e., topological spaces which are manifolds (say, $C^\infty$--) outside discrete subsets (sets of singular points). For (germs of) manifolds with, so called, cone--like singularities, a…

alg-geom · Mathematics 2007-05-23 Wolfgang Ebeling , Sabir M. Gusein-Zade

We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…

Combinatorics · Mathematics 2018-07-16 Oswin Aichholzer , Lukas Andritsch , Karin Baur , Birgit Vogtenhuber

If the four triangular facets of a tetrahedron can be partitioned into pairs having the same area, then the triangles in each pair must be congruent to one another. A Heron-style formula is then derived for the volume of a tetrahedron…

Metric Geometry · Mathematics 2022-11-01 Daniel A. Klain

We construct a cellular basis of the walled Brauer algebra which has similar properties as the Murphy basis of the group algebra of the symmetric group. In particular, the restriction of a cell module to a certain subalgebra can be easily…

Representation Theory · Mathematics 2014-08-29 Friederike Stoll , Mathias Werth

We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior…

Computer Vision and Pattern Recognition · Computer Science 2017-09-18 Zorah Lähner , Matthias Vestner , Amit Boyarski , Or Litany , Ron Slossberg , Tal Remez , Emanuele Rodolà , Alex Bronstein , Michael Bronstein , Ron Kimmel , Daniel Cremers