Biomedical subjects

M Mignotte

Publications and source records attributed to M Mignotte.

3 recordsLinked to original sources

PubMed2002

3D biplanar statistical reconstruction of scoliotic vertebrae.

A new 3D reconstruction method of scoliotic vertebrae of a spine, using two calibrated conventional radiographic images (postero-anterior and lateral), and a global prior knowledge on the geometrical structure of each vertebra is presented. This geometrical knowledge is efficiently captured by a statistical deformable template integrating a set of admissible deformations, expressed by the first modes of variation in the Karhunen-Loeve expansion of the pathological deformations observed on a representative scoliotic vertebra population. The proposed reconstruction method consists in fitting the projections of this deformable template with the preliminary segmented contours of the corresponding vertebra on the two radiographic views. The 3D reconstruction problem is stated as the minimization of a cost function for each vertebra and solved with a gradient descent technique. The reconstruction of the spine is then made vertebra by vertebra. The proposed method allows also to efficiently obtain an accurate 3D reconstruction of each scoliotic vertebra and, consequently, it allows also to get an accurate knowledge of the 3D structure of the whole scoliotic spine. This reconstruction method is in final phase of validation.

Artificial Intelligence↗

PubMed2000

Three-dimensional blind deconvolution of SPECT images.

Thanks to its ability to yield functionally rather than anatomically-based information, the three-dimensional (3-D) SPECT imagery technique has become a great help in the diagnostic of cerebrovascular diseases. Nevertheless, due to the imaging process, the 3-D single photon emission computed tomography (SPECT) images are very blurred and, consequently, their interpretation by the clinician is often difficult and subjective. In order to improve the resolution of these 3-D images and then to facilitate their interpretation, we propose herein to extend a recent image blind deconvolution technique (called the nonnegativity support constraint-recursive inverse filtering deconvolution method) in order to improve both the spatial and the interslice resolution of SPECT volumes. This technique requires a preliminary step in order to find the support of the object to be restored. In this paper, we propose to solve this problem with an unsupervised 3-D Markovian segmentation technique. This method has been successfully tested on numerous real and simulated brain SPECT volumes, yielding very promising restoration results.

Algorithms↗

PubMedDate not supplied

A multiscale optimization approach for the dynamic contour-based boundary detection issue.

We present a new multiscale approach for deformable contour optimization. The method relies on a multigrid minimization method and a coarse-to-fine relaxation algorithm. This approach consists in minimizing a cascade of optimization problems of reduced and increasing complexity instead of considering the minimization problem on the full and original configuration space. Contrary to classical multiresolution algorithms, no reduction of image is applied. The family of defined energy functions are derived from the original (full resolution) objective function, ensuring that the same function is handled at each scale and that the energy decreases at each step of the deformable contour minimization process. The efficiency and the speed of this multiscale optimization strategy is demonstrated in the difficult context of the minimization of a region-based contour energy function ensuring the boundary detection of anatomical structures in ultrasound medical imagery. In this context, the proposed multiscale segmentation method is compared to other classical region-based segmentation approaches such as Maximum Likelihood or Markov Random Field-based segmentation techniques. We also extend this multiscale segmentation strategy to active contour models using a classical edge-based likelihood approach. Finally, time and performance analysis of this approach, compared to the (commonly used) dynamic programming-based optimization procedure, is given and allows to attest the accuracy and the speed of the proposed method.

Algorithms↗