Fast determination of coarse grained cell anisotropy and size in epithelial tissue images using Fourier transform

Mechanical strain and stress play a major role in biological processes such as wound healing or morphogenesis. To assess this role quantitatively, fixed or live images of tissues are acquired at a cellular precision in large fields of views. To exploit these data, large numbers of cells have to be analyzed to extract cell shape anisotropy and cell size. Most frequently, this is performed through detailed individual cell contour determination, using so-called segmentation computer programs, complemented if necessary by manual detection and error corrections. However, a coarse grained and faster technique can be recommended in at least three situations. First, when detailed information on individual cell contours is not required, for instance in studies which require only coarse-grained average information on cell anisotropy. Second, as an exploratory step to determine whether full segmentation can be potentially useful. Third, when segmentation is too difficult, for instance due to poor image quality or too large a cell number. We developed a user-friendly, Fourier transform-based image analysis pipeline. It is fast (typically $10^4$ cells per minute with a current laptop computer) and suitable for time, space or ensemble averages. We validate it on one set of artificial images and on two sets of fully segmented images, one from a Drosophila pupa and the other from a chicken embryo; the pipeline results are robust. Perspectives include \textit{in vitro} tissues, non-biological cellular patterns such as foams, and $xyz$ stacks.Comment: 13 pages; 9 figure

Image segmentation with adaptive region growing based on a polynomial surface model

A new method for segmenting intensity images into smooth surface segments is presented. The main idea is to divide the image into flat, planar, convex, concave, and saddle patches that coincide as well as possible with meaningful object features in the image. Therefore, we propose an adaptive region growing algorithm based on low-degree polynomial fitting. The algorithm uses a new adaptive thresholding technique with the L∞ fitting cost as a segmentation criterion. The polynomial degree and the fitting error are automatically adapted during the region growing process. The main contribution is that the algorithm detects outliers and edges, distinguishes between strong and smooth intensity transitions and finds surface segments that are bent in a certain way. As a result, the surface segments corresponding to meaningful object features and the contours separating the surface segments coincide with real-image object edges. Moreover, the curvature-based surface shape information facilitates many tasks in image analysis, such as object recognition performed on the polynomial representation. The polynomial representation provides good image approximation while preserving all the necessary details of the objects in the reconstructed images. The method outperforms existing techniques when segmenting images of objects with diffuse reflecting surfaces

The identification of cellular automata

Although cellular automata have been widely studied as a class of the spatio temporal systems, very few investigators have studied how to identify the CA rules given observations of the patterns. A solution using a polynomial realization to describe the CA rule is reviewed in the present study based on the application of an orthogonal least squares algorithm. Three new neighbourhood detection methods are then reviewed as important preliminary analysis procedures to reduce the complexity of the estimation. The identification of excitable media is discussed using simulation examples and real data sets and a new method for the identification of hybrid CA is introduced

Extraction of main levels of a building from a large point cloud

Horizontal levels are references entities, the base of man-made environments. Their creation is the first step for various applications including the BIM (Building Information Modelling). BIM is an emerging methodology, widely used for new constructions, and increasingly applied to existing buildings (scan-to-BIM). The as-built BIM process is still mainly manual or semi-automatic and therefore is highly time-consuming. The automation of the as-built BIM is a challenging topic among the research community. This study is part of an ongoing research into the scan-to-BIM process regarding the extraction of the principal structure of a building. More specifically, here we present a strategy to automatically detect the building levels from a large point cloud obtained with a terrestrial laser scanner survey. The identification of the horizontal planes is the first indispensable step to produce an as-built BIM model. Our algorithm, developed in C++, is based on plane extraction by means of the RANSAC algorithm followed by the minimization of the quadrate sum of points-plane distance. Moreover, this paper will take an in-depth look at the influence of data resolution in the accuracy of plane extraction and at the necessary accuracy for the construction of a BIM model. A laser scanner survey of a three floors building composed by 36 scan stations has produced a point cloud of about 550 million points. The estimated plane parameters at different data resolution are analysed in terms of distance from the full points cloud resolution

Automatic segmentation of the left ventricle cavity and myocardium in MRI data

A novel approach for the automatic segmentation has been developed to extract the epi-cardium and endo-cardium boundaries of the left ventricle (lv) of the heart. The developed segmentation scheme takes multi-slice and multi-phase magnetic resonance (MR) images of the heart, transversing the short-axis length from the base to the apex. Each image is taken at one instance in the heart's phase. The images are segmented using a diffusion-based filter followed by an unsupervised clustering technique and the resulting labels are checked to locate the (lv) cavity. From cardiac anatomy, the closest pool of blood to the lv cavity is the right ventricle cavity. The wall between these two blood-pools (interventricular septum) is measured to give an approximate thickness for the myocardium. This value is used when a radial search is performed on a gradient image to find appropriate robust segments of the epi-cardium boundary. The robust edge segments are then joined using a normal spline curve. Experimental results are presented with very encouraging qualitative and quantitative results and a comparison is made against the state-of-the art level-sets method

Region-based segmentation of images using syntactic visual features

This paper presents a robust and efficient method for segmentation of images into large regions that reflect the real world objects present in the scene. We propose an extension to the well known Recursive Shortest Spanning Tree (RSST) algorithm based on a new color model and so-called syntactic features [1]. We introduce practical solutions, integrated within the RSST framework, to structure analysis based on the shape and spatial configuration of image regions. We demonstrate that syntactic features provide a reliable basis for region merging criteria which prevent formation of regions spanning more than one semantic object, thereby significantly improving the perceptual quality of the output segmentation. Experiments indicate that the proposed features are generic in nature and allow satisfactory segmentation of real world images from various sources without adjustment to algorithm parameters

PVR: Patch-to-Volume Reconstruction for Large Area Motion Correction of Fetal MRI

In this paper we present a novel method for the correction of motion artifacts that are present in fetal Magnetic Resonance Imaging (MRI) scans of the whole uterus. Contrary to current slice-to-volume registration (SVR) methods, requiring an inflexible anatomical enclosure of a single investigated organ, the proposed patch-to-volume reconstruction (PVR) approach is able to reconstruct a large field of view of non-rigidly deforming structures. It relaxes rigid motion assumptions by introducing a specific amount of redundant information that is exploited with parallelized patch-wise optimization, super-resolution, and automatic outlier rejection. We further describe and provide an efficient parallel implementation of PVR allowing its execution within reasonable time on commercially available graphics processing units (GPU), enabling its use in the clinical practice. We evaluate PVR's computational overhead compared to standard methods and observe improved reconstruction accuracy in presence of affine motion artifacts of approximately 30% compared to conventional SVR in synthetic experiments. Furthermore, we have evaluated our method qualitatively and quantitatively on real fetal MRI data subject to maternal breathing and sudden fetal movements. We evaluate peak-signal-to-noise ratio (PSNR), structural similarity index (SSIM), and cross correlation (CC) with respect to the originally acquired data and provide a method for visual inspection of reconstruction uncertainty. With these experiments we demonstrate successful application of PVR motion compensation to the whole uterus, the human fetus, and the human placenta.Comment: 10 pages, 13 figures, submitted to IEEE Transactions on Medical Imaging. v2: wadded funders acknowledgements to preprin