Adaptive Mesh Reconstruction in X-Ray Tomography

International audiencehis paper presents an X-ray tomographic reconstruction method based on an adaptive mesh in order to directly obtain the typical gray level reconstructed image simultaneously with its segmentation. It also leads to reduce the number of unknows throughout the iterations of reconstruction and accelerates the process of algebraic algorithms. The process of reconstruction is no more based on a regular grid of voxels but on a mesh composed of non regular tetraedra that are progressively adapted to the content of the image. Each iteration is composed by two main steps that successively estimate the values of the mesh elements and segment the sample in order to make the grid adapted to the content of the image. The method was applied on numerical and experimental data. The results show that the method provides reliable reconstructions and leads to drastically reduce the memory storage compared to usual reconstructions based on pixel representation

Prediction and Tracking of Moving Objects in Image Sequences

We employ a prediction model for moving object velocity and location estimation derived from Bayesian theory. The optical flow of a certain moving object depends on the history of its previous values. A joint optical flow estimation and moving object segmentation algorithm is used for the initialization of the tracking algorithm. The segmentation of the moving objects is determined by appropriately classifying the unlabeled and the occluding regions. Segmentation and optical flow tracking is used for predicting future frames

Linear chemically sensitive electron tomography using DualEELS and dictionary-based compressed sensing

We have investigated the use of DualEELS in elementally sensitive tilt series tomography in the scanning transmission electron microscope. A procedure is implemented using deconvolution to remove the effects of multiple scattering, followed by normalisation by the zero loss peak intensity. This is performed to produce a signal that is linearly dependent on the projected density of the element in each pixel. This method is compared with one that does not include deconvolution (although normalisation by the zero loss peak intensity is still performed). Additionaly, we compare the 3D reconstruction using a new compressed sensing algorithm, DLET, with the well-established SIRT algorithm. VC precipitates, which are extracted from a steel on a carbon replica, are used in this study. It is found that the use of this linear signal results in a very even density throughout the precipitates. However, when deconvolution is omitted, a slight density reduction is observed in the cores of the precipitates (a so-called cupping artefact). Additionally, it is clearly demonstrated that the 3D morphology is much better reproduced using the DLET algorithm, with very little elongation in the missing wedge direction. It is therefore concluded that reliable elementally sensitive tilt tomography using EELS requires the appropriate use of DualEELS together with a suitable reconstruction algorithm, such as the compressed sensing based reconstruction algorithm used here, to make the best use of the limited data volume and signal to noise inherent in core-loss EELS

EIT Reconstruction Algorithms: Pitfalls, Challenges and Recent Developments

We review developments, issues and challenges in Electrical Impedance Tomography (EIT), for the 4th Workshop on Biomedical Applications of EIT, Manchester 2003. We focus on the necessity for three dimensional data collection and reconstruction, efficient solution of the forward problem and present and future reconstruction algorithms. We also suggest common pitfalls or ``inverse crimes'' to avoid.Comment: A review paper for the 4th Workshop on Biomedical Applications of EIT, Manchester, UK, 200

Anisotropic Mesh Adaptation for Image Representation

Triangular meshes have gained much interest in image representation and have been widely used in image processing. This paper introduces a framework of anisotropic mesh adaptation (AMA) methods to image representation and proposes a GPRAMA method that is based on AMA and greedy-point removal (GPR) scheme. Different than many other methods that triangulate sample points to form the mesh, the AMA methods start directly with a triangular mesh and then adapt the mesh based on a user-defined metric tensor to represent the image. The AMA methods have clear mathematical framework and provides flexibility for both image representation and image reconstruction. A mesh patching technique is developed for the implementation of the GPRAMA method, which leads to an improved version of the popular GPRFS-ED method. The GPRAMA method can achieve better quality than the GPRFS-ED method but with lower computational cost.Comment: 25 pages, 15 figure

A virtual world of paleontology

Computer-aided visualization and analysis of fossils has revolutionized the study of extinct organisms. Novel techniques allow fossils to be characterized in three dimensions and in unprecedented detail. This has enabled paleontologists to gain important insights into their anatomy, development, and preservation. New protocols allow more objective reconstructions of fossil organisms, including soft tissues, from incomplete remains. The resulting digital reconstructions can be used in functional analyses, rigorously testing long-standing hypotheses regarding the paleobiology of extinct organisms. These approaches are transforming our understanding of long-studied fossil groups, and of the narratives of organismal and ecological evolution that have been built upon them

Mesh-based video coding for low bit-rate communications

In this paper, a new method for low bit-rate content-adaptive mesh-based video coding is proposed. Intra-frame coding of this method employs feature map extraction for node distribution at specific threshold levels to achieve higher density placement of initial nodes for regions that contain high frequency features and conversely sparse placement of initial nodes for smooth regions. Insignificant nodes are largely removed using a subsequent node elimination scheme. The Hilbert scan is then applied before quantization and entropy coding to reduce amount of transmitted information. For moving images, both node position and color parameters of only a subset of nodes may change from frame to frame. It is sufficient to transmit only these changed parameters. The proposed method is well-suited for video coding at very low bit rates, as processing results demonstrate that it provides good subjective and objective image quality at a lower number of required bits

ADAM: a general method for using various data types in asteroid reconstruction

We introduce ADAM, the All-Data Asteroid Modelling algorithm. ADAM is simple and universal since it handles all disk-resolved data types (adaptive optics or other images, interferometry, and range-Doppler radar data) in a uniform manner via the 2D Fourier transform, enabling fast convergence in model optimization. The resolved data can be combined with disk-integrated data (photometry). In the reconstruction process, the difference between each data type is only a few code lines defining the particular generalized projection from 3D onto a 2D image plane. Occultation timings can be included as sparse silhouettes, and thermal infrared data are efficiently handled with an approximate algorithm that is sufficient in practice due to the dominance of the high-contrast (boundary) pixels over the low-contrast (interior) ones. This is of particular importance to the raw ALMA data that can be directly handled by ADAM without having to construct the standard image. We study the reliability of the inversion by using the independent shape supports of function series and control-point surfaces. When other data are lacking, one can carry out fast nonconvex lightcurve-only inversion, but any shape models resulting from it should only be taken as illustrative global-scale ones.Comment: 11 pages, submitted to A&