Homological computation using spanning trees

We introduce here a new F2 homology computation algorithm based on a generalization of the spanning tree technique on a finite 3-dimensional cell complex K embedded in ℝ3. We demonstrate that the complexity of this algorithm is linear in the number of cells. In fact, this process computes an algebraic map φ over K, called homology gradient vector field (HGVF), from which it is possible to infer in a straightforward manner homological information like Euler characteristic, relative homology groups, representative cycles for homology generators, topological skeletons, Reeb graphs, cohomology algebra, higher (co)homology operations, etc. This process can be generalized to others coefficients, including the integers, and to higher dimension

Homological tree-based strategies for image analysis

Homological characteristics of digital objects can be obtained in a straightforward manner computing an algebraic map φ over a finite cell complex K (with coefficients in the finite field F2={0,1}) which represents the digital object [9]. Computable homological information includes the Euler characteristic, homology generators and representative cycles, higher (co)homology operations, etc. This algebraic map φ is described in combinatorial terms using a mixed three-level forest. Different strategies changing only two parameters of this algorithm for computing φ are presented. Each one of those strategies gives rise to different maps, although all of them provides the same homological information for K. For example, tree-based structures useful in image analysis like topological skeletons and pyramids can be obtained as subgraphs of this forest

Enhanced Parallel Generation of Tree Structures for the Recognition of 3D Images

Segmentations of a digital object based on a connectivity criterion at n-xel or sub-n-xel level are useful tools in image topological analysis and recognition. Working with cell complex analogous of digital objects, an example of this kind of segmentation is that obtained from the combinatorial representation so called Homological Spanning Forest (HSF, for short) which, informally, classifies the cells of the complex as belonging to regions containing the maximal number of cells sharing the same homological (algebraic homology with coefficient in a field) information. We design here a parallel method for computing a HSF (using homology with coefficients in Z/2Z) of a 3D digital object. If this object is included in a 3D image of m1 × m2 × m3 voxels, its theoretical time complexity order is near O(log(m1 + m2 + m3)), under the assumption that a processing element is available for each voxel. A prototype implementation validating our results has been written and several synthetic, random and medical tridimensional images have been used for testing. The experiments allow us to assert that the number of iterations in which the homological information is found varies only to a small extent from the theoretical computational time.Ministerio de Economía y Competitividad MTM2016-81030-

Persistence modules, shape description, and completeness

Persistence modules are algebraic constructs that can be used to describe the shape of an object starting from a geometric representation of it. As shape descriptors, persistence modules are not complete, that is they may not distinguish non-equivalent shapes. In this paper we show that one reason for this is that homomorphisms between persistence modules forget the geometric nature of the problem. Therefore we introduce geometric homomorphisms between persistence modules, and show that in some cases they perform better. A combinatorial structure, the $H_0$-tree, is shown to be an invariant for geometric isomorphism classes in the case of persistence modules obtained through the 0th persistent homology functor

Coulomb-explosion imaging of CH2+: target-polarization effects and bond-angle distribution

The effect of target polarization fields on the bond-angle distribution following the foil-induced Coulomb explosion of CH2+ has been measured. Incorporating a detailed model description of the polarization effects and other target effects into a Monte Carlo simulation of the experiment, a good description of the various observables is obtained. In particular, the bond-angle distribution is found to agree with existing ab initio calculations.This work has been supported in part by the German-Israel Foundation for Scientific Research (GIF) under Contract No. I-707-55.7/2001, the Spanish Ministerio de Ciencia y Tecnología (Project Nos. BFM2003-04457-C02-01/02 and HA2001-0052), the DAAD in the framework of the Acciones Integrados Program 2002/03, and the European Community within the Research Training Network “Electron Transfer Reactions.” One of the authors (S.H.A.) thanks the Fundación Cajamurcia for a Postdoctoral Grant

Connectivity forests for homological analysis of digital volumes

In this paper, we provide a graph-based representation of the homology (information related to the different “holes” the object has) of a binary digital volume. We analyze the digital volume AT-model representation [8] from this point of view and the cellular version of the AT-model [5] is precisely described here as three forests (connectivity forests), from which, for instance, we can straightforwardly determine representative curves of “tunnels” and “holes”, classify cycles in the complex, computing higher (co)homology operations,... Depending of the order in which we gradually construct these trees, tools so important in Computer Vision and Digital Image Processing as Reeb graphs and topological skeletons appear as results of pruning these graphs

Using membrane computing for obtaining homology groups of binary 2D digital images

Membrane Computing is a new paradigm inspired from cellular communication. Until now, P systems have been used in research areas like modeling chemical process, several ecosystems, etc. In this paper, we apply P systems to Computational Topology within the context of the Digital Image. We work with a variant of P systems called tissue-like P systems to calculate in a general maximally parallel manner the homology groups of 2D images. In fact, homology computation for binary pixel-based 2D digital images can be reduced to connected component labeling of white and black regions. Finally, we use a software called Tissue Simulator to show with some examples how these systems wor

<i>Gaia</i> Data Release 1. Summary of the astrometric, photometric, and survey properties

Context. At about 1000 days after the launch of Gaia we present the first Gaia data release, Gaia DR1, consisting of astrometry and photometry for over 1 billion sources brighter than magnitude 20.7. Aims. A summary of Gaia DR1 is presented along with illustrations of the scientific quality of the data, followed by a discussion of the limitations due to the preliminary nature of this release. Methods. The raw data collected by Gaia during the first 14 months of the mission have been processed by the Gaia Data Processing and Analysis Consortium (DPAC) and turned into an astrometric and photometric catalogue. Results. Gaia DR1 consists of three components: a primary astrometric data set which contains the positions, parallaxes, and mean proper motions for about 2 million of the brightest stars in common with the HIPPARCOS and Tycho-2 catalogues – a realisation of the Tycho-Gaia Astrometric Solution (TGAS) – and a secondary astrometric data set containing the positions for an additional 1.1 billion sources. The second component is the photometric data set, consisting of mean G-band magnitudes for all sources. The G-band light curves and the characteristics of ∼3000 Cepheid and RR-Lyrae stars, observed at high cadence around the south ecliptic pole, form the third component. For the primary astrometric data set the typical uncertainty is about 0.3 mas for the positions and parallaxes, and about 1 mas yr−1 for the proper motions. A systematic component of ∼0.3 mas should be added to the parallax uncertainties. For the subset of ∼94 000 HIPPARCOS stars in the primary data set, the proper motions are much more precise at about 0.06 mas yr−1. For the secondary astrometric data set, the typical uncertainty of the positions is ∼10 mas. The median uncertainties on the mean G-band magnitudes range from the mmag level to ∼0.03 mag over the magnitude range 5 to 20.7. Conclusions. Gaia DR1 is an important milestone ahead of the next Gaia data release, which will feature five-parameter astrometry for all sources. Extensive validation shows that Gaia DR1 represents a major advance in the mapping of the heavens and the availability of basic stellar data that underpin observational astrophysics. Nevertheless, the very preliminary nature of this first Gaia data release does lead to a number of important limitations to the data quality which should be carefully considered before drawing conclusions from the data

Performance of the CMS Cathode Strip Chambers with Cosmic Rays

The Cathode Strip Chambers (CSCs) constitute the primary muon tracking device in the CMS endcaps. Their performance has been evaluated using data taken during a cosmic ray run in fall 2008. Measured noise levels are low, with the number of noisy channels well below 1%. Coordinate resolution was measured for all types of chambers, and fall in the range 47 microns to 243 microns. The efficiencies for local charged track triggers, for hit and for segments reconstruction were measured, and are above 99%. The timing resolution per layer is approximately 5 ns