Search PubMed⌕ Search

Biomedical subjects

Max Mignotte

Publications and source records attributed to Max Mignotte.

9 recordsLinked to original sources

A segmentation-based regularization term for image deconvolution.

This paper proposes a new and original inhomogeneous restoration (deconvolution) model under the Bayesian framework for observed images degraded by space-invariant blur and additive Gaussian noise. In this model, regularization is achieved during the iterative restoration process with a segmentation-based a priori term. This adaptive edge-preserving regularization term applies a local smoothness constraint to pre-estimated constant-valued regions of the target image. These constant-valued regions (the segmentation map) of the target image are obtained from a preliminary Wiener deconvolution estimate. In order to estimate reliable segmentation maps, we have also adopted a Bayesian Markovian framework in which the regularized segmentations are estimated in the maximum a posteriori (MAP) sense with the joint use of local Potts prior and appropriate Gaussian conditional luminance distributions. In order to make these segmentations unsupervised, these likelihood distributions are estimated in the maximum likelihood sense. To compute the MAP estimate associated to the restoration, we use a simple steepest descent procedure resulting in an efficient iterative process converging to a globally optimal restoration. The experiments reported in this paper demonstrate that the discussed method performs competitively and sometimes better than the best existing state-of-the-art methods in benchmark tests.

Algorithms↗

Fusion of Hidden Markov Random Field models and its Bayesian estimation.

In this paper, we present a Hidden Markov Random Field (HMRF) data-fusion model. The proposed model is applied to the segmentation of natural images based on the fusion of colors and textons into Julesz ensembles. The corresponding Exploration/ Selection/Estimation (ESE) procedure for the estimation of the parameters is presented. This method achieves the estimation of the parameters of the Gaussian kernels, the mixture proportions, the region labels, the number of regions, and the Markov hyper-parameter. Meanwhile, we present a new proof of the asymptotic convergence of the ESE procedure, based on original finite time bounds for the rate of convergence.

Algorithms↗

Three-dimensional biplanar reconstruction of scoliotic rib cage using the estimation of a mixture of probabilistic prior models.

In this paper, we present an original method for the three-dimensional (3-D) reconstruction of the scoliotic rib cage from a planar and a conventional pair of calibrated radiographic images (postero-anterior with normal incidence and lateral). To this end, we first present a robust method for estimating the model parameters in a mixture of probabilistic principal component analyzers (PPCA). This method is based on the stochastic expectation maximization (SEM) algorithm. Parameters of this mixture model are used to constrain the 3-D biplanar reconstruction problem of scoliotic rib cage. More precisely, the proposed PPCA mixture model is exploited for dimensionality reduction and to obtain a set of probabilistic prior models associated with each detected class of pathological deformations observed on a representative training scoliotic rib cage population. By using an appropriate likelihood, for each considered class-conditional prior model, the proposed 3-D reconstruction is stated as an energy function minimization problem, which is solved with an exploration/selection algorithm. The optimal 3-D reconstruction then corresponds to the class of deformation and parameters leading to the minimal energy. This 3-D method of reconstruction has been successfully tested and validated on a database of 20 pairs of biplanar radiographic images of scoliotic patients, yielding very promising results. As an alternative to computed tomography-scan 3-D reconstruction this scheme has the advantage of low radiation for the patient, and may also be used for diagnosis and evaluation of deformity of a scoliotic rib cage. The proposed method remains sufficiently general to be applied to other reconstruction problems for which a database of objects to be reconstructed is available (with two or more radiographic views).

Algorithms↗

A hierarchical statistical modeling approach for the unsupervised 3-D biplanar reconstruction of the scoliotic spine.

This paper presents a new and accurate three-dimensional (3-D) reconstruction technique for the scoliotic spine from a pair of planar and conventional (postero-anterior with normal incidence and lateral) calibrated radiographic images. The proposed model uses a priori hierarchical global knowledge, both on the geometric structure of the whole spine and of each vertebra. More precisely, it relies on the specification of two 3-D statistical templates. The first, a rough geometric template on which rigid admissible deformations are defined, is used to ensure a crude registration of the whole spine. An accurate 3-D reconstruction is then performed for each vertebra by a second template on which nonlinear admissible global, as well as local deformations, are defined. Global deformations are modeled using a statistical modal analysis of the pathological deformations observed on a representative scoliotic vertebra population. Local deformations are represented by a first-order Markov process. This unsupervised coarse-to-fine 3-D reconstruction procedure leads to two separate minimization procedures efficiently solved in our application with evolutionary stochastic optimization algorithms. In this context, we compare the results obtained with a classical genetic algorithm (GA) and a recent Exploration Selection (ES) technique. This latter optimization method with the proposed 3-D reconstruction model, is tested on several pairs of biplanar radiographic images with scoliotic deformities. The experiments reported in this paper demonstrate that the discussed method is comparable in terms of accuracy with the classical computed-tomography-scan technique while being unsupervised and while requiring only two radiographic images and a lower amount of radiation for the patient.

Algorithms↗

A stochastic method for Bayesian estimation of hidden Markov random field models with application to a color model.

We propose a new stochastic algorithm for computing useful Bayesian estimators of hidden Markov random field (HMRF) models that we call exploration/selection/estimation (ESE) procedure. The algorithm is based on an optimization algorithm of O. François, called the exploration/selection (E/S) algorithm. The novelty consists of using the a posteriori distribution of the HMRF, as exploration distribution in the E/S algorithm. The ESE procedure computes the estimation of the likelihood parameters and the optimal number of region classes, according to global constraints, as well as the segmentation of the image. In our formulation, the total number of region classes is fixed, but classes are allowed or disallowed dynamically. This framework replaces the mechanism of the split-and-merge of regions that can be used in the context of image segmentation. The procedure is applied to the estimation of a HMRF color model for images, whose likelihood is based on multivariate distributions, with each component following a Beta distribution. Meanwhile, a method for computing the maximum likelihood estimators of Beta distributions is presented. Experimental results performed on 100 natural images are reported. We also include a proof of convergence of the E/S algorithm in the case of nonsymmetric exploration graphs.

Algorithms↗

Detection of diffuse abnormal perfusion in SPECT using a normal brain atlas.

Visual assessment, with significant inter- or intraobserver variability, is still the norm for the evaluation of Single Photon Emission Computerized Tomography (SPECT) cerebral perfusion studies. We present in this paper an automated method for screening SPECT studies to detect diffuse disseminated abnormalities based on a computerized atlas of normal regional cerebral blood flow (rCBF). To generate the atlas, a set of normal brain SPECT studies are registered together. The atlas contains the intensity mean, the nonlinear displacement mean, and the variance of the activity pattern. A patient is then evaluated by registering his or her SPECT volume to the atlas and computing the nonlinear 3-D displacement of each voxel needed for the best shape fit to it. A voxel is counted as "abnormal" if the intensity difference between the atlas and the registered patient (or if the 3-D motion necessary to move the voxel to its registered position) is superior to 3 SD of normal mean. The number of abnormal voxels is used to classify studies. We validated this approach on 24 SPECT perfusion studies selected visually for having clear diffuse anomalies and 21 normal studies. A Markovian segmentation algorithm is also used to identify the white and gray matters for regional analysis. Based on the number of abnormal voxels, two supervised classifiers were tested: (1) minimum distance-to-mean and (2) Bayesian. The analysis of the intensity and displacement "abnormal" voxels allow one to achieve an 80% correct classification rate for the whole brain and a 93% rate if we consider only voxels in the segmented gray matter region.

Algorithms↗

Nonparametric multiscale energy-based model and its application in some imagery problems.

This paper investigates the use of a nonparametric regularization energy term for devising a example-based rendering and segmentation technique. We have stated this problem in the multiresolution energy minimization framework and exploited the multiscale structure proposed by Wei and Levoy for the texture synthesis problem. In this nonparametric energy minimization framework, we also propose a computationally efficient coarse-to-fine recursive optimization method to minimize the cost function related to this hierarchical model. In this context, the formulation of our example-based regularization term also allows to directly infer an intuitive dissimilarity measure between two contour shapes. This measure is herein exploited to define an efficient shape descriptor for the contour-based shape recognition and indexing problem.

Algorithms↗

A statistical model for contours in images.

In this paper, we describe a statistical model for the gradient vector field of the gray level in images validated by different experiments. Moreover, we present a global constrained Markov model for contours in images that uses this statistical model for the likelihood. Our model is amenable to an Iterative Conditional Estimation (ICE) procedure for the estimation of the parameters; our model also allows segmentation by means of the Simulated Annealing (SA) algorithm, the Iterated Conditional Modes (ICM) algorithm, or the Modes of Posterior Marginals (MPM) Monte Carlo (MC) algorithm. This yields an original unsupervised statistical method for edge-detection, with three variants. The estimation and the segmentation procedures have been tested on a total of 160 images. Those tests indicate that the model and its estimation are valid for applications that require an energy term based on the log-likelihood ratio. Besides edge-detection, our model can be used for semiautomatic extraction of contours, localization of shapes, non-photo-realistic rendering; more generally, it might be useful in various problems that require a statistical likelihood for contours.

Algorithms↗

3D/2D registration and segmentation of scoliotic vertebrae using statistical models.

We propose a new 3D/2D registration method for vertebrae of the scoliotic spine, using two conventional radiographic views (postero-anterior and lateral), and a priori global knowledge of the geometric structure of each vertebra. This geometric knowledge is efficiently captured by a statistical deformable template integrating a set of admissible deformations, expressed by the first modes of variation in Karhunen-Loeve expansion, of the pathological deformations observed on a representative scoliotic vertebra population. The proposed registration method consists of fitting the projections of this deformable template with the preliminary segmented contours of the corresponding vertebra on the two radiographic views. The 3D/2D registration problem is stated as the minimization of a cost function for each vertebra and solved with a gradient descent technique. Registration of the spine is then done vertebra by vertebra. The proposed method efficiently provides accurate 3D reconstruction of each scoliotic vertebra and, consequently, it also provides accurate knowledge of the 3D structure of the whole scoliotic spine. This registration method has been successfully tested on several biplanar radiographic images and validated on 57 scoliotic vertebrae. The validation results reported in this paper demonstrate that the proposed statistical scheme performs better than other conventional 3D reconstruction methods.

Humans↗