26,122 research outputs found
A graph-based mathematical morphology reader
This survey paper aims at providing a "literary" anthology of mathematical
morphology on graphs. It describes in the English language many ideas stemming
from a large number of different papers, hence providing a unified view of an
active and diverse field of research
Combinatorial Continuous Maximal Flows
Maximum flow (and minimum cut) algorithms have had a strong impact on
computer vision. In particular, graph cuts algorithms provide a mechanism for
the discrete optimization of an energy functional which has been used in a
variety of applications such as image segmentation, stereo, image stitching and
texture synthesis. Algorithms based on the classical formulation of max-flow
defined on a graph are known to exhibit metrication artefacts in the solution.
Therefore, a recent trend has been to instead employ a spatially continuous
maximum flow (or the dual min-cut problem) in these same applications to
produce solutions with no metrication errors. However, known fast continuous
max-flow algorithms have no stopping criteria or have not been proved to
converge. In this work, we revisit the continuous max-flow problem and show
that the analogous discrete formulation is different from the classical
max-flow problem. We then apply an appropriate combinatorial optimization
technique to this combinatorial continuous max-flow CCMF problem to find a
null-divergence solution that exhibits no metrication artefacts and may be
solved exactly by a fast, efficient algorithm with provable convergence.
Finally, by exhibiting the dual problem of our CCMF formulation, we clarify the
fact, already proved by Nozawa in the continuous setting, that the max-flow and
the total variation problems are not always equivalent.Comment: 26 page
Basic nets in the projective plane
The notion of basic net (called also basic polyhedron) on plays a
central role in Conway's approach to enumeration of knots and links in .
Drobotukhina applied this approach for links in using basic nets on
. By a result of Nakamoto, all basic nets on can be obtained from a
very explicit family of minimal basic nets (the nets , ,
in Conway's notation) by two local transformations. We prove a similar result
for basic nets in .
We prove also that a graph on is uniquely determined by its pull-back
on (the proof is based on Lefschetz fix point theorem).Comment: 14 pages, 15 figure
Complex Curve of the Two Matrix Model and its Tau-function
We study the hermitean and normal two matrix models in planar approximation
for an arbitrary number of eigenvalue supports. Its planar graph interpretation
is given. The study reveals a general structure of the underlying analytic
complex curve, different from the hyperelliptic curve of the one matrix model.
The matrix model quantities are expressed through the periods of meromorphic
generating differential on this curve and the partition function of the
multiple support solution, as a function of filling numbers and coefficients of
the matrix potential, is shown to be the quasiclassical tau-function. The
relation to softly broken N=1 supersymmetric Yang-Mills theories is discussed.
A general class of solvable multimatrix models with tree-like interactions is
considered.Comment: 36 pages, 10 figures, TeX; final version appeared in special issue of
J.Phys. A on Random Matrix Theor
- …