3D MRI heart segmentation of mouse embryos.

MRI has become an effective tool for anatomical mice studies. Currently, embryologists study the development of mouse embryos in order to understand the mechanisms of human development. The aim of the research presented in this paper, is to develop a semi-automatic image segmentation framework based 3D deformable models to identify cardiac malformations which are a major cause of death in children.

Measurement of knee cartilage thickness using MRI: a reproducibility study in a meniscectomized guinea pig model of osteoarthritis.

The in vivo precision (reproducibility) of quantitative MRI is of particular importance in osteoarthritis (OA) progression of small magnitude and response to therapy. In this study, three-dimensional high-resolution MRI performed at 7 T was used to assess the short-term reproducibility of measurements of mean tibial cartilage thickness in a meniscectomized guinea pig model of OA. MR image acquisition was repeated five times in nine controls (SHAM) and 10 osteoarthritic animals 3 months after meniscectomy (MNX), in vivo.

Knee cartilage thickness measurements using MRI: a 4(1/2)-month longitudinal study in the meniscectomized guinea pig model of OA.

Objective: The aim of this study was to follow, over a 4(1/2)-month period, the medial tibia cartilage thickness on a meniscectomy (MNX) guinea pig osteoarthritis (OA) model and to compare with control animals, using three-dimensional high-resolution magnetic resonance imaging (3D HR-MRI).

Methods: MRI experimentations were performed in vivo at 7 T on guinea pig knee joints. 3D HR-MR images were acquired in 60 controls (SHAM) and 45 osteoarthritic animals (MNX) at four time-points (15, 45, 90 and 135 days) after surgery.

Computing shortest cycles on discrete surfaces for acurate topological modifications of medical image isosurfaces.

Topological control over discrete isosurface is of primordial interest in medical applications, especially discrete model building for active contours. Previous attempts showed that the key point in acurately modifying topology was computation of shortest cycles on the surface of interest. This paper generalizes the shortest path algorithm to compute shortest cycles in a given homotopy class on a discrete surface with arbitrary topology.