Search

We develop an automatic method for synaptic partner identification in insect brains and use it to predict synaptic partners in a whole-brain electron microscopy dataset of the fruit fly. The predictions can be used to infer a connectivity graph with high accuracy, thus allowing fast identification of neural pathways. To facilitate circuit reconstruction using our results, we develop CIRCUITMAP, a user interface add-on for the circuit annotation tool CATMAID. A deep-learning-based approach enables automatic identification of synaptically connected neurons in electron microscopy datasets of the fly brain.

Model supramolecular associates possessing nondirectional intermolecular interactions were investigated in order to demonstrate the opportunity of plotting of an atomic connectivity graph based on trajectories of Hessian eigenvector of electron density corresponding to the largest eigenvalue. Such trajectories are a reasonable alternative to the gradient bond paths in the case of proximity of the latter to the T-shaped form upon the presence of parallel surface of the zero-flux of electron density in the neighborhood of gradient-based trajectory.

Establishing corresponding features on two non-rigidly deformed 3D surfaces is a challenging and well-studied problem in computer graphics. Unlike previous approaches that constrain the matching between feature pairs using isometry-invariant distance metrics, we constrain the matching using a discrete connectivity graph derived from the Morse–Smale complex of the Auto Diffusion Function. We observed that the graph remains stable even for surfaces differing by topology or by significant deformation. This algorithm is simple to implement and efficient to run. When tested on a range of examples, our algorithm produces comparable results with state-of-art methods on surfaces with strong isometry but with greatly improved efficiency, and often gets better correspondences on surfaces with larger shape variances.

In this paper, two measures are proposed for valuation of size and coupling complexities of design products as abstracted by three distinct representations. The proposed size complexity measure is based on the information theoretic definition of complexity that connects the complexity of a design to the level of entropy, or uncertainty, inherent in the design product. The proposed coupling complexity measure evaluates the decomposability of the graph-based representation of design products. To validate the proposed measures, an experiment is conducted to calculate the complexities of three consumer products based on three product representations, namely, function structure, connectivity graph, and parametric associativity graph. The findings indicate that coupling and size are independent measures of a product’s complexity. Thus, it is recommended that both measures should be used. Further, the complexity of a product is not independent of the choice of representation model used to describe the product. This suggests that the complexity of a product will vary with the selected view. Finally, it is shown that the two approaches for measuring complexity of a product are generalizable and can be applied to different representations.

This paper proposes a novel generalization model for selecting characteristic streets in an urban street network. This model retains the central structure of a street network. It relies on a structural representation of a street network using graph principles where vertices represent named streets and links represent street intersections. Based on this representation, so-called connectivity graph, centrality measures are introduced to qualify the status of each individual vertex within the graph. We show that these measures can be used for characterizing the structural properties of an urban street network, and for the selection of important streets. The proposed approach is validated by a case study applied to a middle-sized Swedish city.

We have implemented a multiscale vision model based on the wavelet transform to analyse field astronomical images. The discrete transform is performed by the a trous algorithm. The vision model is based on the notion of significant structures. We identify the pixels of the associated wavelet transform space (WTS) with the objects. For each scale a region labelling is carried out. An interscale connectivity graph is then established. In accordance with some rules that permit false detections to be removed, the objects and their sub-objects are identified. They define respectively trees and sub-trees in the graph. In this way, the identification of the WTS pixels of the tree related to a given object leads to the reconstruction of its image by the conjugate gradient method. The model has been tested successfully on simulated images of stars and galaxies which allow us to show the capabilities of the detection and restoration procedures of the model. Finally, tests on real images show that one can analyse complex structures better than with classical astronomical vision models.

We use an evolutionary algorithm (EA) to search the space of leaky integrate-and-fire (LIF) neuron networks, in order to identify network connectivities producing significant rhythmic activity at sub-spiking frequencies (i.e., 'bursting-like behavior'). We find that the connectivities of the most-fit LIF networks exhibit a relatively broad in-degree distribution and a relatively narrow out-degree distribution. We examine the frequencies of connection motifs in the most-fit LIF networks as compared to random networks. In a network of more realistically modeled neurons, the most-fit network connectivities are observed to produce a broader frequency response as compared to that resulting from random network connectivities. Figure ​Figure11 shows the cumulative in- and out-degree distributions of a representative most-fit network, whose connectivity graph is illustrated in the inset. The orange line represents the cumulative in-degree distribution, and the red line the cumulative out-degree distribution. The blue bars represent the expected cumulative distribution (and error bars) for random network connectivities. Figure 1 shows the cumulative in- and out-degree distributions of a representative most-fit network, whose connectivity graph is illustrated in the inset. The orange line represents the cumulative in-degree distribution, and the red line the cumulative out-degree ...