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

Faster Algorithms for the Maximum Common Subtree Isomorphism Problem

The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\sf NP}$-hard in general graphs. Confining to trees renders polynomial time algorithms possible and is of fundamental importance for approaches on more general graph classes. Various variants of this problem in trees have been intensively studied. We consider the general case, where trees are neither rooted nor ordered and the isomorphism is maximum w.r.t. a weight function on the mapped vertices and edges. For trees of order $n$ and maximum degree $\Delta$ our algorithm achieves a running time of $\mathcal{O}(n^2\Delta)$ by exploiting the structure of the matching instances arising as subproblems. Thus our algorithm outperforms the best previously known approaches. No faster algorithm is possible for trees of bounded degree and for trees of unbounded degree we show that a further reduction of the running time would directly improve the best known approach to the assignment problem. Combining a polynomial-delay algorithm for the enumeration of all maximum common subtree isomorphisms with central ideas of our new algorithm leads to an improvement of its running time from $\mathcal{O}(n^6+Tn^2)$ to $\mathcal{O}(n^3+Tn\Delta)$, where $n$ is the order of the larger tree, $T$ is the number of different solutions, and $\Delta$ is the minimum of the maximum degrees of the input trees. Our theoretical results are supplemented by an experimental evaluation on synthetic and real-world instances

The High-Acceptance Dielectron Spectrometer HADES

HADES is a versatile magnetic spectrometer aimed at studying dielectron production in pion, proton and heavy-ion induced collisions. Its main features include a ring imaging gas Cherenkov detector for electron-hadron discrimination, a tracking system consisting of a set of 6 superconducting coils producing a toroidal field and drift chambers and a multiplicity and electron trigger array for additional electron-hadron discrimination and event characterization. A two-stage trigger system enhances events containing electrons. The physics program is focused on the investigation of hadron properties in nuclei and in the hot and dense hadronic matter. The detector system is characterized by an 85% azimuthal coverage over a polar angle interval from 18 to 85 degree, a single electron efficiency of 50% and a vector meson mass resolution of 2.5%. Identification of pions, kaons and protons is achieved combining time-of-flight and energy loss measurements over a large momentum range. This paper describes the main features and the performance of the detector system

An elementary algorithm for digital arc segmentation

International audienceThis paper concerns the digital circle recognition problem, especially in the form of the circular separation problem. General fundamentals, based on classical tools, as well as algorithmic details are given (the latter by providing pseudo-code for major steps of the algorithm). After recalling the geometrical meaning of the separating circle problem, we present an incremental algorithm to segment a discrete curve into digital arcs