Tug of War games and PDEs on graphs with applications in image and high dimensional data processing.

The aim of this note is to revisit the connections between some stochastic games, namely Tug-of-War games, and a class of nonlocal PDEs on graphs. We consider a general formulation of Tug-of-War games which is shown to be related to many classical PDEs in the continuous setting. We transcribe these equations on graphs using ad hoc differential operators and we show that it covers several nonlocal PDEs on graphs such as [Formula: see text]-Laplacian, game p-Laplacian and the eikonal equation. This unifying mathematical framework allows us to easily design simple algorithms to solve several inverse problems in imaging and data science, with a particular focus on cultural heritage and medical imaging.

A Novel Iterative MLEM Image Reconstruction Algorithm Based on Beltrami Filter: Application to ECT Images.

The implementation of emission-computed tomography (ECT), including positron emission tomography and single-photon emission-computed tomography, has been an important research topic in recent years and is of significant and practical importance. However, the slow rate of convergence and the computational complexity have severely impeded the efficient implementation of iterative reconstruction. By combining the maximum-likelihood expectation maximization (MLEM) iteratively along with the Beltrami filter, this paper proposes a new approach to reformulate the MLEM algorithm. Beltrami filtering is applied to an image obtained using the MLEM algorithm for each iteration. The role of Beltrami filtering is to remove mainly out-of-focus slice blurs, which are artifacts present in most existing images. To improve the quality of an image reconstructed using MLEM, the Beltrami filter employs similar structures, which in turn reduce the number of errors in the reconstructed image. Numerical image reconstruction tomography experiments have demonstrated the performance capability of the proposed algorithm in terms of an increase in signal-to-noise ratio (SNR) and the recovery of fine details that can be hidden in the data. The SNR and visual inspections of the reconstructed images are significantly improved compared to those of a standard MLEM. We conclude that the proposed algorithm provides an edge-preserving image reconstruction and substantially suppress noise and edge artifacts.

Improved Simultaneous Algebraic Reconstruction Technique Algorithm for Positron-Emission Tomography Image Reconstruction via Minimizing the Fast Total Variation.

CONTEXT: There has been considerable progress in the instrumentation for data measurement and computer methods for generating images of measured PET data. These computer methods have been developed to solve the inverse problem, also known as the "image reconstruction from projections" problem. AIM: In this paper, we propose a modified Simultaneous Algebraic Reconstruction Technique (SART) algorithm to improve the quality of image reconstruction by incorporating total variation (TV) minimization into the iterative SART algorithm. METHODOLOGY: The SART updates the estimated image by forward projecting the initial image onto the sinogram space. Then, the difference between the estimated sinogram and the given sinogram is back-projected onto the image domain. This difference is then subtracted from the initial image to obtain a corrected image. Fast total variation (FTV) minimization is applied to the image obtained in the SART step. The second step is the result obtained from the previous FTV update. The SART and the FTV minimization steps run iteratively in an alternating manner. Fifty iterations were applied to the SART algorithm used in each of the regularization-based methods. In addition to the conventional SART algorithm, spatial smoothing was used to enhance the quality of the image. All images were sized at 128 × 128 pixels. RESULTS: The proposed algorithm successfully accomplished edge preservation. A detailed scrutiny revealed that the reconstruction algorithms differed; for example, the SART and the proposed FTV-SART algorithm effectively preserved the hot lesion edges, whereas artifacts and deviations were more likely to occur in the ART algorithm than in the other algorithms. CONCLUSIONS: Compared to the standard SART, the proposed algorithm is more robust in removing background noise while preserving edges to suppress the existent image artifacts. The quality measurements and visual inspections show a significant improvement in image quality compared to the conventional SART and Algebraic Reconstruction Technique (ART) algorithms.

Partial difference operators on weighted graphs for image processing on surfaces and point clouds.

Partial difference equations (PDEs) and variational methods for image processing on Euclidean domains spaces are very well established because they permit to solve a large range of real computer vision problems. With the recent advent of many 3D sensors, there is a growing interest in transposing and solving PDEs on surfaces and point clouds. In this paper, we propose a simple method to solve such PDEs using the framework of PDEs on graphs. This latter approach enables us to transcribe, for surfaces and point clouds, many models and algorithms designed for image processing. To illustrate our proposal, three problems are considered: (1) p -Laplacian restoration and inpainting; (2) PDEs mathematical morphology; and (3) active contours segmentation.

Multi-resolution graph-based analysis of histopathological whole slide images: application to mitotic cell extraction and visualization.

In this paper, we present a graph-based multi-resolution approach for mitosis extraction in breast cancer histological whole slide images. The proposed segmentation uses a multi-resolution approach which reproduces the slide examination done by a pathologist. Each resolution level is analyzed with a focus of attention resulting from a coarser resolution level analysis. At each resolution level, a spatial refinement by label regularization is performed to obtain more accurate segmentation around boundaries. The proposed segmentation is fully unsupervised by using domain specific knowledge.

Nonlocal PDEs-based morphology on weighted graphs for image and data processing.

Mathematical morphology (MM) offers a wide range of operators to address various image processing problems. These operators can be defined in terms of algebraic (discrete) sets or as partial differential equations (PDEs). In this paper, we introduce a nonlocal PDEs-based morphological framework defined on weighted graphs. We present and analyze a set of operators that leads to a family of discretized morphological PDEs on weighted graphs. Our formulation introduces nonlocal patch-based configurations for image processing and extends PDEs-based approach to the processing of arbitrary data such as nonuniform high dimensional data. Finally, we show the potentialities of our methodology in order to process, segment and classify images and arbitrary data.

Automated region of interest retrieval and classification using spectral analysis.

Efficient use of whole slide imaging in pathology needs automated region of interest (ROI) retrieval and classification, through the use of image analysis and data sorting tools. One possible method for data sorting uses Spectral Analysis for Dimensionality Reduction. We present some interesting results in the field of histopathology and cytohematology. In histopathology, we developed a Computer-Aided Diagnosis system applied to low-resolution images representing the totality of histological breast tumour sections. The images can be digitized directly at low resolution or be obtained from sub-sampled high-resolution virtual slides. Spectral Analysis is used (1) for image segmentation (stroma, tumour epithelium), by determining a "distance" between all the images of the database, (2) for choosing representative images and characteristic patterns of each histological type in order to index them, and (3) for visualizing images or features similar to a sample provided by the pathologist. In cytohematology, we studied a blood smear virtual slide acquired through high resolution oil scanning and Spectral Analysis is used to sort selected nucleated blood cell classes so that the pathologist may easily focus on specific classes whose morphology could then be studied more carefully or which can be analyzed through complementary instruments, like Multispectral Imaging or Raman MicroSpectroscopy.

Nonlocal discrete regularization on weighted graphs: a framework for image and manifold processing.

We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a variational one, which consists of minimizing a weighted sum of two energy terms: a regularization one that uses a discrete weighted p-Dirichlet energy and an approximation one. This is the discrete analogue of recent continuous Euclidean nonlocal regularization functionals. The proposed formulation leads to a family of simple and fast nonlinear processing methods based on the weighted p-Laplace operator, parameterized by the degree p of regularity, the graph structure and the graph weight function. These discrete processing methods provide a graph-based version of recently proposed semi-local or nonlocal processing methods used in image and mesh processing, such as the bilateral filter, the TV digital filter or the nonlocal means filter. It works with equal ease on regular 2-D and 3-D images, manifolds or any data. We illustrate the abilities of the approach by applying it to various types of images, meshes, manifolds, and data represented as graphs.