Search

Summary Integrated array tomography combines fluorescence and electron imaging of ultrathin sections in one microscope, and enables accurate high‐resolution correlation of fluorescent proteins to cell organelles and membranes. Large numbers of serial sections can be imaged sequentially to produce aligned volumes from both imaging modalities, thus producing enormous amounts of data that must be handled and processed using novel techniques. Here, we present a scheme for automated detection of fluorescent cells within thin resin sections, which could then be used to drive automated electron image acquisition from target regions via ‘smart tracking’. The aim of this work is to aid in optimization of the data acquisition process through automation, freeing the operator to work on other tasks and speeding up the process, while reducing data rates by only acquiring images from regions of interest. This new method is shown to be robust against noise and able to deal with regions of low fluorescence.

Phase contrast microscopy (PCM) is routinely used for the inspection of adherent cell cultures in all fields of biology and biomedicine. Key decisions for experimental protocols are often taken by an operator based on typically qualitative observations. However, automated processing and analysis of PCM images remain challenging due to the low contrast between foreground objects (cells) and background as well as various imaging artefacts. We propose a trainable pixel-wise segmentation approach whereby image structures and symmetries are encoded in the form of multi-scale Basic Image Features local histograms, and classification of them is learned by random decision trees. This approach was validated for segmentation of cell versus background, and discrimination between two different cell types. Performance close to that of state-of-the-art specialised algorithms was achieved despite the general nature of the method. The low processing time (

A minimal variance reconstruction scheme is derived using derivatives of the Gaussian as filters. A closed form mixed correlation matrix for reconstructions from multiscale points and their local derivatives up to the second order is presented. With the inverse of this mixed correlation matrix, a reconstruction of the image can be easily calculated. Some interesting results of reconstructions from multiscale critical points are presented. The influence of limited calculation precision is considered, using the condition number of the mixed correlation matrix.

We consider detection of local image symmetry using linear filters. We prove a simple criterion for determining if a filter is sensitive to a group of symmetries. We show that derivative-of-Gaussian (DtG) filters are excellent at detecting local image symmetry. Building on this, we propose a very simple algorithm that, based on the responses of a bank of six DtG filters, classifies each location of an image into one of seven Basic Image Features (BIFs). This effectively and efficiently realizes Marr's proposal for an image primal sketch. We summarize results on the use of BIFs for texture classification, object category detection, and pixel classification.

In this paper we present a method to implement the monogenic scale space on a bounded domain and show some applications. The monogenic scale space is a vector valued scale space based on the Poisson scale space, which establishes a sophisticated alternative to the Gaussian scale space. The features of the monogenic scale space, including local amplitude, local phase, local orientation, local frequency, and phase congruency, are much easier to interpret in terms of image features evolving through scale than in the Gaussian case. Furthermore, applying results from harmonic analysis, relations between the features are obtained which improve the understanding of image analysis. As applications, we present a very simple but still accurate approach to image reconstruction from local amplitude and local phase and a method for extracting the evolution of lines and edges through scale.

A feasibility study for a new method for content based image retrieval is presented. First, an image representation using multiscale top points is introduced. This representation is validated using a minimal variance reconstruction algorithm. The image retrieval problem can now be translated into comparing distances between point sets. For this purpose the proportional transportation distance (PTD) is used. A method is proposed using multiscale top points and their reconstruction coefficients in the PTD to define these distances between images. We present some experiments with promising results on a database with face images.

Gaussian scale space permits one to compute image derivatives. The limitation to some finite order is not inherent in the paradigm itself (Gaussian blurred functions are always smooth), but is caused by the interplay of (at least) two external factors. One is the ratio of the Gaussian scale parameter versus the atomic scale that limits physically or perceptually meaningful sizes (e.g. pixel size, or in general any scale at which the image is "locally orderless"). The second factor involved is the fiducial level of tolerance. Together these factors conspire to determine a maximal order beyond which differential structure becomes meaningless. Thus they give rise to the notion of regularity classes for images akin to the conceptual Ck-classification pertaining to mathematical functions. We study the relationship between the maximal differential order k, the ratio of inner scale to atomic scale, and the prescribed tolerance level, and draw several conclusions that are of practical interest when considering image derivatives.