The present invention relates to segmentation of anatomical structures in magnetic resonance imaging (MRI) volumes, and more particularly, to 3D segmentation of anatomical structures of the brain in MRI volumes using graph cuts.
The quantitative analysis of anatomical structures, such as the cerebrum, cerebellum, and the brain stem in MRI brain volumes is important in the study and detection of cerebral disease. In particular, volumetric quantification of cerebral and cerebellar tissues is important in image-based assessment of neuroanatomical disorders such as autism and Asperger's syndrome. The segmentation of the anatomical structures of the brain can be difficult due to problems such as lack of boundaries between the anatomical structures, poor contrast in medical images of the brain, and noise in the images, which is mainly attributed to the image acquisition systems (e.g., MRI) and partial volume effects. Accordingly, because of such problems, image segmentation methods such as active contours or region growing are subject to leakage issues and are not reliable. Since a manual delineation of the anatomical brain structures is too time consuming, various techniques have been developed to increase robustness in segmenting anatomical brain structures. These techniques include active contours with shape model prior knowledge, atlas registration, and interactive graph cuts segmentation.
In active contour with shape model prior knowledge techniques, a prior shape constraint is incorporated into the active contour evolution in order to further constrain the segmentation. Shape priors can be modeled by a known class of shapes or through statistical training. These techniques are highly dependent on the selection of an accurate shape prior. Accordingly, the choice of the models for the training or for the class of shapes determines the accuracy of the segmentation.
In atlas registration techniques, combinations of rigid and non-rigid transformations of an atlas are used to aid in detecting the internal structures in an MR image of the brain. For an atlas to be accurate, the atlas typically must be very complex. Although these techniques can be successful, there typically is a high computational cost and it is difficult to construct an accurate atlas. Thus, these techniques can be time consuming and expensive.
In interactive graph cuts techniques, an MRI brain volume is represented as a discrete graph. The graph is generated using vertices representing the image pixels (or voxels), as well as edges connecting the vertices, typically using 6 or 26 neighborhood connectivity. A user marks certain pixels as object or background, which would define the terminals of the graph. Graph cuts are then calculated to determine the segmentation. The quality of the segmentation depends on the number of seeds used in initialization. In this technique, it can be difficult for a user to accurately mark the object and background. In addition, many seeds must be added in order to give a strong spatial constraint for the graph cuts. Accordingly, graph cuts segmentation techniques can lead to erroneous segmentations.
The present invention overcomes the foregoing and other problems encountered by providing a system and method for segmentation of anatomical structures in MRI volumes using graph cut segmentation based on an anatomical template. The template is used to provide seed points of anatomical structures, and these structures can be segmented in MRI volumes using graph cuts segmentation initialized based on the seed points provided by the template. This invention can be implemented to segment anatomical brain structures such the cerebrum, cerebellum, and brain stem in MRI brain volumes.
In one embodiment of the present invention, a template is registered to an MRI brain volume. The template identifies seed points of anatomical brain structures in the MRI brain volume. At least one anatomical brain structure is segmented in the MRI brain volume using graph cuts segmentation initialized based on the seed points identified by the template. The template can be registered by aligning a centroid of the template with a centroid of the MRI brain volume, and scaling the template to match of size of the MRI brain volume. It is possible that a skull stripping segmentation be applied to the MRI brain volume to separate the brain from non-brain tissue. The segmentation can be hierarchically performed by extracting the cerebrum from the brain, and then separating the cerebellum and the brain stem in the remaining brain volume.
These and other advantages of the invention will be apparent to those of ordinary skill in the art by reference to the following detailed description and the accompanying drawings.
According to an embodiment of the present invention, anatomical structures are segmented in MRI volume data using graph cuts based on an anatomical template. As described herein, the method is implemented to segment anatomical brain structures in MRI brain volumes, however, the present invention is not limited thereto, and may be applied to other types of anatomical structures in various regions of the body as well.
Before discussing specific aspects of the graph cut segmentation algorithm using an anatomical template, graph cut theory will be discussed. In particular, an undirected graph G=V,E consists of vertices V and undirected edges E that connect the vertices. Each edge eεE is assigned a non-negative cost c. There are two special vertices (referred to herein as “terminals”) in the graph that are identified as the source s and the sink t. With the exception of the terminals s and t, the vertices are comprised of pixels P of an image to be segmented. The image to be segmented is a digital image, and can be obtained using standard digital photography, as well as medical imaging technology, such as Magnetic Resonance Imaging, ultrasound, x-ray, computed tomography, SPECT, PET, IVUS, OCT, etc.
The cost of the cut is the sum of the costs of the edges that are severed by the cut, such that:
In order to select a cut C, a minimum cut (i.e., the cut with the smallest cost) must be determined. There are numerous algorithms for finding the minimum, as is well known in the art.
In the case of volume segmentation, the vertices will be voxels P of the volume data and two other nodes denoting the “object” O and “background” B terminals. In order to perform a graph cut volume segmentation for a set of pixels V, it is possible to compute a labeling f that minimizes an energy function. The labeling f labels each pixel as either object or background. The energy function takes the form:
where E is the energy, p and q are voxels, and N is a neighborhood formed from the vertex connectivity. Here, connectivity refers to the way edges are formed between adjacent voxels in the image. For example, in three dimensions, 6-connectivity implies forming edges between a voxel p and its neighboring voxels to the right, left, up, down, front, and back. The connectivity defines the topology of the graph, Dp(fp) is a region term that measures the cost of assigning the label fp (foreground or object) to voxel p, while Vp,q is a boundary term that measures the cost of assigning labels fp,fq to adjacent voxels p and q.
According to a possible implementation, Dp(fp) and Vp,q can be defined as follows:
In order to register the template 300 to MRI brain volume, the centroid of the template 300 is aligned with the centroid of the MRI brain volume. The template 300 is then scaled to match the size of the MRI brain volume. The template 300 is scaled based on the size of a bounding box around the MRI brain volume. The size of the bounding box around the MRI brain volume is determined, and compared to a bounding box around the template 300. The size of the template 300 is then adjusted so that the bounding boxes of the template 300 and the MRI brain volume are the same size. The template 300 then provides voxels in the each of the different anatomical structures of the brain (cerebrum 302, cerebellum 304, and brain stem 306), which can be used as seed points for segmenting the different anatomical structures in the MRI brain volume.
Once the template 300 is registered to the MRI brain volume, a three-stage segmentation process can be performed to segment the different anatomical structures of the brain, so that every voxel in the MRI brain volume can be classified as, non-brain, cerebrum, cerebellum, or brain stem. Accordingly, returning to
At step 230, a second graph cuts segmentation is applied to the brain voxels 222 to extract the cerebrum 232 from remaining brain voxels (i.e., cerebellum and brain stem) 234. This graph cuts segmentation uses the cerebrum seed points 302 of the template 300 for the seed points for the cerebellum and the cerebellum and brain stem seed points 304 and 306 of the template 300 for the seed points for the remaining brain voxels. For example, the cerebrum seed points 302 can be associated with the source terminal and the cerebellum seed points 304 and the brain stem seed points 306 can be associated with the sink terminal. A graph of the brain voxels 222 is generated and the minimum cut of the graph is determined to segment the cerebrum for the rest of the brain. Thus, each of the brain voxels 222 is classified as either a cerebrum voxel 232 or a cerebellum/brain stem voxel 234.
At step 240, a third graph cuts segmentation is applied to the cerebellum/brain stem voxels 234 to separate the cerebellum 242 from the brain stem 244. This graph cuts segmentation is initialized using the cerebellum seed points 304 and the brain stem seed points 306 of the template 300. For example, the cerebellum seed points 304 can be associated with the source terminal and the brain stem seed points 306 can be associated with the sink terminal. A graph of the cerebellum/brain stem voxels 234 is generated and the minimum cut of the graph is determined to segment the cerebellum from the brain stem. Thus, each of the cerebellum/brain stem voxels 234 is classified as either a cerebellum voxel 242 or a brain stem voxel 244.
Accordingly, the anatomical structures of the cerebrum, cerebellum, and brain stem can each be segmented from the MRI brain volume. According to a possible embodiment of the present invention, each of the graph cuts segmentations described in this method can be implemented using a different value of σ. Also, although the method is described as first extracting the cerebrum, then separating the cerebellum and the brain stem, it is possible that these anatomical structures could be extracted in any order.
The steps of the method described above have been described to give a visual understanding of the brain segmentation method. It is to be understood, that the steps may be performed within a computer system using images stored within the computer system. Accordingly, some steps of the above-described method can occur as internal representations within the computer system.
The method for segmenting anatomical structures of the brain from MRI volumes using graph cuts segmentation based on an anatomical template can be implemented on a computer using well known computer processors, memory units, storage devices, computer software, and other components. A high level block diagram of such a computer is illustrated in
The foregoing Detailed Description is to be understood as being in every respect illustrative and exemplary, but not restrictive, and the scope of the invention disclosed herein is not to be determined from the Detailed Description, but rather from the claims as interpreted according to the full breadth permitted by the patent laws. It is to be understood that the embodiments shown and described herein are only illustrative of the principles of the present invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention. Those skilled in the art could implement various other feature combinations without departing from the scope and spirit of the invention.
This application claims the benefit of U.S. Provisional Application No. 60/758,407, filed Jan. 12, 2006, the disclosure of which is herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
6332034 | Makram-Ebeid et al. | Dec 2001 | B1 |
6430430 | Gosche | Aug 2002 | B1 |
6813373 | Suri et al. | Nov 2004 | B1 |
6895107 | Park et al. | May 2005 | B2 |
6973212 | Boykov et al. | Dec 2005 | B2 |
7136516 | Alyassin | Nov 2006 | B2 |
7236618 | Chui et al. | Jun 2007 | B1 |
7672492 | Shen et al. | Mar 2010 | B2 |
7813531 | Becker | Oct 2010 | B2 |
20020048401 | Boykov et al. | Apr 2002 | A1 |
20030044055 | Park et al. | Mar 2003 | A1 |
20050111757 | Brackett et al. | May 2005 | A1 |
20050113679 | Suryanarayanan et al. | May 2005 | A1 |
20050134587 | Geiger et al. | Jun 2005 | A1 |
20050163375 | Grady | Jul 2005 | A1 |
20060104516 | Lee et al. | May 2006 | A1 |
20060214932 | Grady et al. | Sep 2006 | A1 |
20060239519 | Nowinski et al. | Oct 2006 | A1 |
20070036432 | Xu et al. | Feb 2007 | A1 |
20070116338 | Fidrich et al. | May 2007 | A1 |
20100049035 | Hu et al. | Feb 2010 | A1 |
20100278405 | Kakadiaris et al. | Nov 2010 | A1 |
Entry |
---|
Michael et al, Automated SEgmentation of MR Images of Brain Tumors, Feb. 2001, Radiology, 218, pp. 586-591. |
E. D. Angelini, et al., “Segmentation and Quanitative Evaluation of Brain MRI Data with a Multiphase Three-Dimensional Implicit Deformable Model”, SPIE International Symposium, Medical Imaging 2004, San Diego, CA USA. |
Y.Boykov, et al., “Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images”, Proc. of Intl Conf. on Comp. Vision, vol. 1, pp. 105-112, 2001. |
Y. Boykov, et al., “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision”, IEEE Trans. on PAMI, vol. 26, No. 9, pp. 1124-1137, Sep. 2004. |
D. W. Shattuck, et al., “Magnetic Resonance Image Tissue Classification Using a Partial Volume Model”, NeuroImage 13, 2001, pp. 856-876. |
Number | Date | Country | |
---|---|---|---|
20070160277 A1 | Jul 2007 | US |
Number | Date | Country | |
---|---|---|---|
60758407 | Jan 2006 | US |