https://www.cell.com/neuron/pdf/S0896-6273(06)00124-3.pdf

Bruchpilot, a Protein with Homology to ELKS/CAST, Is Required for Structural Integrity and Function of Synaptic Active Zones in Drosophila

The catecholamines play a major role in the regulation of behavior. Here we investigate, in the fly Drosophila melanogaster, the role of dopamine and octopamine (the presumed arthropod homolog of norepinephrine) during the formation of appetitive and aversive olfactory memories. We find that for the formation of both types of memories, cAMP signaling is necessary and sufficient within the same subpopulation of mushroom-body intrinsic neurons. On the other hand, memory formation can be distinguished by the requirement for different catecholamines, dopamine for aversive and octopamine for appetitive conditioning. Our results suggest that in associative conditioning, different memories are formed of the same odor under different circumstances, and that they are linked to the respective motivational systems by their specific modulatory pathways.

https://www.jneurosci.org/content/jneuro/23/33/10495.full.pdf

Dopamine and Octopamine Differentiate between Aversive and Appetitive Olfactory Memories in Drosophila

The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram is stable: small changes in the function imply only small changes in the diagram. We apply this result to estimating the homology of sets in a metric space and to comparing and classifying geometric shapes.

Stability of persistence diagrams

https://ir.nctu.edu.tw:443/bitstream/11536/25892/1/000286485200020.pdf

Three-Dimensional Reconstruction of Brain-wide Wiring Networks in Drosophila at Single-Cell Resolution

Cutting up a complex object into simpler sub-objects is a fundamental problem in various disciplines. In image processing, images are segmented while in computational geometry, solid polyhedra are decomposed. In recent years, in computer graphics, polygonal meshes are decomposed into sub-meshes. In this paper we propose a novel hierarchical mesh decomposition algorithm. Our algorithm computes a decomposition into the meaningful components of a given mesh, which generally refers to segmentation at regions of deep concavities. The algorithm also avoids over-segmentation and jaggy boundaries between the components. Finally, we demonstrate the utility of the algorithm in control-skeleton extraction.

/pdf/hierarchical-mesh-decomposition-using-fuzzy-clustering-and-1kf4uirtru.pdf

Hierarchical mesh decomposition using fuzzy clustering and cuts

A new technique for interactive vector field visualization using large numbers of properly illuminated stream lines is presented. Taking into account ambient, diffuse, and specular reflection terms as well as transparency, we employ a realistic shading model which significantly increases quality and realism of the resulting images. While many graphics workstations offer hardware support for illuminating surface primitives, usually no means for an accurate shading of line primitives are provided. However, we show that proper illumination of lines can be implemented by exploiting the texture mapping capabilities of modern graphics hardware. In this way high rendering performance with interactive frame rates can be achieved. We apply the technique to render large numbers of integral curves in a vector field. The impression of the resulting images can be further improved by making the curves partially transparent. We also describe methods for controlling the distribution of stream lines in space. These methods enable us to use illuminated stream lines within an interactive visualization environment.

Interactive visualization of 3D-vector fields using illuminated stream lines

The Drosophila standard brain.

We present a new technique for generating surface meshes from a uniform set of discrete samples. Our method extends the well-known marching cubes algorithm used for computing polygonal isosurfaces. While in marching cubes each vertex of a cubic grid cell is binary classified as lying above or below an isosurface, in our approach an arbitrary number of vertex classes can be specified. Consequently the resulting surfaces consist of patches separating volumes of two different classes each. Similar to the marching cubes algorithm all grid cells are traversed and classified according to the number of different vertex classes involved and their arrangement. The solution for each configuration is computed based on a model that assigns probabilities to the vertices and interpolates them. We introduce an automatic method to find a triangulation which approximates the boundary surfaces - implicitly given by our model - in a topological correct way. Look-up tables guarantee a high performance of the algorithm. In medical applications our method can be used to extract surfaces from a 3D segmentation of tomographic images into multiple tissue types. The resulting surfaces are well suited for subsequent volumetric mesh generation, which is needed for simulation as well as visualization tasks. The proposed algorithm provides a robust and unique solution, avoiding ambiguities occuring in other methods. The method is of great significance in modeling and animation too, where it can be used for polygonalization of non-manifold implicit surfaces.

/pdf/a-generalized-marching-cubes-algorithm-based-on-non-binary-31ii1wlg8t.pdf

A Generalized Marching Cubes Algorithm Based On Non-Binary Classifications

We describe a novel method for continuously transforming two triangulated models of arbitrary topology into each other. Equal global topology for both objects is assumed. However, extensions for genus changes during metamorphosis are provided. The proposed method addresses the major challenge in 3D metamorphosis, namely, specifying the morphing process intuitively with minimal user interaction and sufficient detail. Corresponding regions and point features are interactively identified. These regions are parametrized automatically and consistently, providing a basis for smooth interpolation. Suitable 3D interaction techniques offer a simple and intuitive control over the whole morphing process.

/pdf/fast-and-intuitive-generation-of-geometric-shape-transitions-3xrjpx19ok.pdf

Fast and Intuitive Generation of Geometric Shape Transitions

A new technique for interactive vector field visualization using large numbers of properly illuminated field lines is presented. Taking into account ambient, diffuse and specular reflection terms, as well as transparency and depth cueing, we employ a realistic shading model which significantly increases the quality and realism of the resulting images. While many graphics workstations offer hardware support for illuminating surface primitives, usually no means for an accurate shading of line primitives are provided. However, we show that proper illumination of lines can be implemented by exploiting the texture mapping capabilities of modern graphics hardware. In this way, high rendering performance with interactive frame rates can be achieved. We apply the technique to render large numbers of integral curves of a vector field. The impression of the resulting images can be further improved by a number of visual enhancements, like color coding or particle animation. We also describe methods for controlling the distribution of field lines in space. These methods enable us to use illuminated field lines for interactive exploration of vector fields.

/pdf/fast-display-of-illuminated-field-lines-r5v40vdjtl.pdf

Malte Zöckler

Papers

Interactive visualization of 3D-vector fields using illuminated stream lines

The Drosophila standard brain.

A Generalized Marching Cubes Algorithm Based On Non-Binary Classifications

Fast and Intuitive Generation of Geometric Shape Transitions

Fast display of illuminated field lines