Component

A Component is an implementation of certain image processing / analysis algorithms.

Each component alone does not solve a Bioimage Analysis problem.

These problems can be addressed by combining such components into workflows.

Description

We have developed a novel approach, named DF-Tracing, to tackle this challenge. This method first extracts the neurite signal (foreground) from a noisy image by using anisotropic filtering and automated thresholding. Then, DF-Tracing executes a coupled distance-field (DF) algorithm on the extracted foreground neurite signal and reconstructs the neuron morphology automatically. Two distance-transform based “force” fields are used: one for “pressure”, which is the distance transform field of foreground pixels (voxels) to the background, and another for “thrust”, which is the distance transform field of the foreground pixels to an automatically determined seed point. The coupling of these two force fields can“push” a “rolling ball” quickly along the skeleton of a neuron, reconstructing the 3D cell morphology.

Simple Tracing - DT-fields
Description

A complete package for fluorescence lifetime analysis implemented as an R package with sample data.

Description

nctuTW is a "high-throughput computer method of reconstructing the neuronal structure of the fruit fly brain. The design philosophy of the proposed method differs from those of previous methods. We propose first to compute the 2D skeletons of a neuron in each slice of the image stack. The 3D neuronal structure is then constructed from the 2D skeletons. Biologists tend to use confocal microscopes for optimal images in a slice for human visualization; and images in two consecutive slices contain overlapped information. Consequently, a spherical object becomes oval in the image stack; that is, neurons in the image stack do not reflect the true shape of the neuron. This is the main reason we chose not to work directly on the 3D volume.

The proposed method comprises two steps. The first is the image processing step, which involves computing a set of voxels that is a superset of the 3D centerlines of the neuron. The shortest path graph algorithm then computes the centerlines. The proposed method was applied to process more than 16 000 neurons. By using a large amount of reconstructions, this study also demonstrated a result derived from the reconstructed data using the clustering technique." (Extracted from reference publication)

Illustrative image shows gold standard (top) and method results (bottom). 

nctuTW_results_example
Description

Part of ATLAS software

Comment / Instructions: 

You can upload your image at the Mobyle@SERPICO portal and download the result. The workflow is only available online, i.e. no download possible.

Description

This plugin filters a 3D image stack (or 2D image) to produce a score for how "tube-like" each point in the image is. This is useful as a preprocessing step for tracing neurons or blood vessels, for example. For 3D image stacks, the plugin uses the eigenvalues of the Hessian matrix to calculate this measure of "tubeness", using a metrics mentioned in Sato et al 1997 ¹: if the larger two eigenvalues (λ₂ and λ₃) are both negative then value is √(λ₂λ₃), otherwise the value is 0. For 2D images, if the large eigenvalue is negative, we return its absolute value and otherwise return 0.

This plugin is now bundled as part of Fiji.