A perceptually based comparison of image similarity metrics

Comparison of iterative reconstruction implementations for multislice helical CT

The most mature image reconstruction algorithms in multislice helical computed tomography are based on analytical and iterative methods. Over the past decades, several methods have been developed for iterative reconstructions that improve image quality by reducing noise and artifacts. In the regularization step of iterative reconstruction, noise can be significantly reduced, thereby making low-dose CT. The quality of the reconstructed image can be further improved by using model-based reconstructions. In these reconstructions, the main focus is on modeling the data acquisition process, including the behavior of the photon beams, the geometry of the system, etc. In this article, we propose two model-based reconstruction algorithms using a virtual detector for multislice helical CT. The aim of this study is to compare the effect of using a virtual detector on image quality for the two proposed algorithms with a model-based iterative reconstruction using the original detector model. Since the algorithms are implemented using multiple GPUs, the merging of separately reconstructed volumes can significantly affect image quality. This issue is often referred to as the "long object" problem, for which we also present a solution that plays an important role in the proposed reconstruction processes. The algorithms were evaluated using mathematical and physical phantoms, as well as patient cases. The SSIM, MS-SSIM and L1 metrics were utilized to evaluate the image quality of the mathematical phantom case. To demonstrate the effectiveness of the algorithms, we used the CatPhan 600 phantom. Additionally, anonymized patient scans were used to showcase the improvements in image quality on real scan data.

Advances in the computational analysis of SARS-COV2 genome

Given a data-set of Ribonucleic acid (RNA) sequences we can infer the phylogenetics of the samples and tackle the information for scientific purposes. Based on current data and knowledge, the SARS-CoV-2 seemingly mutates much more slowly than the influenza virus that causes seasonal flu. However, very recent evolution poses some doubts about such conjecture and shadows the out-coming light of people vaccination. This paper adopts mathematical and computational tools for handling the challenge of analyzing the data-set of different clades of the severe acute respiratory syndrome virus-2 (SARS-CoV-2). On one hand, based on the mathematical paraphernalia of tools, the concept of distance associated with the Kolmogorov complexity and Shannon information theories, as well as with the Hamming scheme, are considered. On the other, advanced data processing computational techniques, such as, data compression, clustering and visualization, are borrowed for tackling the problem. The results of the synergistic approach reveal the complex time dynamics of the evolutionary process and may help to clarify future directions of the SARS-CoV-2 evolution.

Computational analysis of the SARS-CoV-2 and other viruses based on the Kolmogorov's complexity and Shannon's information theories

This paper tackles the information of 133 RNA viruses available in public databases under the light of several mathematical and computational tools. First, the formal concepts of distance metrics, Kolmogorov complexity and Shannon information are recalled. Second, the computational tools available presently for tackling and visualizing patterns embedded in datasets, such as the hierarchical clustering and the multidimensional scaling, are discussed. The synergies of the common application of the mathematical and computational resources are then used for exploring the RNA data, cross-evaluating the normalized compression distance, entropy and Jensen-Shannon divergence, versus representations in two and three dimensions. The results of these different perspectives give extra light in what concerns the relations between the distinct RNA viruses.

Quality of biological images, reconstructed using localization microscopy data

Motivation

Fluorescence localization microscopy is extensively used to study the details of spatial architecture of subcellular compartments. This modality relies on determination of spatial positions of fluorophores, labeling an extended biological structure, with precision exceeding the diffraction limit. Several established models describe influence of pixel size, signal-to-noise ratio and optical resolution on the localization precision. The labeling density has been also recognized as important factor affecting reconstruction fidelity of the imaged biological structure. However, quantitative data on combined influence of sampling and localization errors on the fidelity of reconstruction are scarce. It should be noted that processing localization microscopy data is similar to reconstruction of a continuous (extended) non-periodic signal from a non-uniform, noisy point samples. In two dimensions the problem may be formulated within the framework of matrix completion. However, no systematic approach has been adopted in microscopy, where images are typically rendered by representing localized molecules with Gaussian distributions (widths determined by localization precision).

Results

We analyze the process of two-dimensional reconstruction of extended biological structures as a function of the density of registered emitters, localization precision and the area occupied by the rendered localized molecule. We quantify overall reconstruction fidelity with different established image similarity measures. Furthermore, we analyze the recovered similarity measure in the frequency space for different reconstruction protocols. We compare the cut-off frequency to the limiting sampling frequency, as determined by labeling density.

Availability and implementation

The source code used in the simulations along with test images is available at https://github.com/blazi13/qbioimages.

Supplementary information

Supplementary data are available at Bioinformatics online.

Feature-based face representations and image reconstruction from behavioral and neural data

The reconstruction of images from neural data can provide a unique window into the content of human perceptual representations. Although recent efforts have established the viability of this enterprise using functional magnetic resonance imaging (MRI) patterns, these efforts have relied on a variety of prespecified image features. Here, we take on the twofold task of deriving features directly from empirical data and of using these features for facial image reconstruction. First, we use a method akin to reverse correlation to derive visual features from functional MRI patterns elicited by a large set of homogeneous face exemplars. Then, we combine these features to reconstruct novel face images from the corresponding neural patterns. This approach allows us to estimate collections of features associated with different cortical areas as well as to successfully match image reconstructions to corresponding face exemplars. Furthermore, we establish the robustness and the utility of this approach by reconstructing images from patterns of behavioral data. From a theoretical perspective, the current results provide key insights into the nature of high-level visual representations, and from a practical perspective, these findings make possible a broad range of image-reconstruction applications via a straightforward methodological approach.