Iterative tomographic image reconstruction using Fourier-based forward and back-projectors

Iterative image reconstruction algorithms play an increasingly important role in modern tomographic systems, especially in emission tomography. With the fast increase of the sizes of the tomographic data, reduction of the computation demands of the reconstruction algorithms is of great importance. Fourier-based forward and back-projection methods have the potential to considerably reduce the computation time in iterative reconstruction. Additional substantial speed-up of those approaches can be obtained utilizing powerful and cheap off-the-shelf fast Fourier transform (FFT) processing hardware. The Fourier reconstruction approaches are based on the relationship between the Fourier transform of the image and Fourier transformation of the parallel-ray projections. The critical two steps are the estimations of the samples of the projection transform, on the central section through the origin of Fourier space, from the samples of the transform of the image, and vice versa for back-projection. Interpolation errors are a limitation of Fourier-based reconstruction methods. We have applied min-max optimized Kaiser-Bessel interpolation within the nonuniform FFT (NUFFT) framework and devised ways of incorporation of resolution models into the Fourier-based iterative approaches. Numerical and computer simulation results show that the min-max NUFFT approach provides substantially lower approximation errors in tomographic forward and back-projection than conventional interpolation methods. Our studies have further confirmed that Fourier-based projectors using the NUFFT approach provide accurate approximations to their space-based counterparts but with about ten times faster computation, and that they are viable candidates for fast iterative image reconstruction.     

Replacement of traditional emulsifying salts by selected hydrocolloids in processed cheese production

Different hydrocolloids were examined as possible replacements for traditional phosphate- and citrate-based emulsifying salts in processed cheese production. The following hydrocolloids (at concentrations in the final product of ≤1.0%, w/w) were chosen: modified starch (with bound sodium octenyl succinate), low methoxyl pectin (alone or combined with lecithin), locust bean gum, κ-carrageenan and ι-carrageenan. The products were assessed by sensory analysis, microscopic image analysis and dynamic oscillatory rheometry. Modified starch, locust bean gum and low methoxyl pectin could not be recommended as replacements for traditional emulsifying salts. Model processed cheeses without traditional emulsifying salts of 40% (w/w) dry matter and 55% (w/w) fat-in-dry matter containing 1.0% (w/w) κ-carrageenan or ι-carrageenan were found to be homogeneous, however the products were hard with fracturable texture.     

Algorithms and tools for the preprocessing of LC-MS metabolomics data

Metabolomics encompasses the study of small molecules in a biological sample. Liquid Chromatography coupled with Mass Spectrometry (LC-MS) profiling is an important approach for the identification and quantification of metabolites from complex biological samples. The amount and complexity of data produced in an LC-MS profiling experiment demand automatic tools for the preprocessing, analysis, and extraction of useful biological information. Data preprocessing—a topic that covers noise filtering, peak detection, deisotoping, alignment, identification, and normalization—is thus an active area of metabolomics research. Recent years have witnessed development of many software for data preprocessing, and still there is a need for further improvement of the data preprocessing pipeline. This review presents an overview of selected software tools for preprocessing LC-MS based metabolomics data and tries to provide future directions.     

The Optimal Sizing of HSS Database in IMS

Our paper deals with the architecture and standards of IP the multimedia subsystem from next generation networks point of view. It describes the structure of the home subscriber server database and then derives equations for sizing of its load in the proposed scenarios. We have used two methods for the database sizing—Erlang C formula and Markov chains. Finally, the achieved results and used methods are evaluated and discussed.

     

Point-in-polygon tests for geometric buffers

The point-in-polygon problem is often encountered in geographical information systems. The algorithms usually work on polygons defined by straight edges. In some situations, however, polygons containing circular arcs are applied. In geographical information systems these polygons are usually considered as geometric buffers, geodesic offsets, or geodesic parallels. This paper presents three algorithms suitable for providing information about the containment of a point in geometric buffers: the Ray-crossing method, the Cell-Based Algorithm and the Approximate approach. An extensive experimental section allows the reader to select the most efficient algorithm for practical problems.