Article Content

Abstract

Image segmentation is one of the most important tasks in medical image analysis and is often the first and the most critical step in many clinical applications. In brain MRI analysis, image segmentation is commonly used for measuring and visualizing the brain’s anatomical structures, for analyzing brain changes, for delineating pathological regions, and for surgical planning and image-guided interventions. In the last few decades, various segmentation techniques of different accuracy and degree of complexity have been developed and reported in the literature. In this paper we review the most popular methods commonly used for brain MRI segmentation. We highlight differences between them and discuss their capabilities, advantages, and limitations. To address the complexity and challenges of the brain MRI segmentation problem, we first introduce the basic concepts of image segmentation. Then, we explain different MRI preprocessing steps including image registration, bias field correction, and removal of nonbrain tissue. Finally, after reviewing different brain MRI segmentation methods, we discuss the validation problem in brain MRI segmentation.

1. Introduction

Over the last few decades, the rapid development of noninvasive brain imaging technologies has opened new horizons in analysing and studying the brain anatomy and function. Enormous progress in accessing brain injury and exploring brain anatomy has been made using magnetic resonance imaging (MRI). The advances in brain MR imaging have also provided large amount of data with an increasingly high level of quality. The analysis of these large and complex MRI datasets has become a tedious and complex task for clinicians, who have to manually extract important information. This manual analysis is often time-consuming and prone to errors due to various inter- or intraoperator variability studies. These difficulties in brain MRI data analysis required inventions in computerized methods to improve disease diagnosis and testing. Nowadays, computerized methods for MR image segmentation, registration, and visualization have been extensively used to assist doctors in qualitative diagnosis.

Brain MRI segmentation is an essential task in many clinical applications because it influences the outcome of the entire analysis. This is because different processing steps rely on accurate segmentation of anatomical regions. For example, MRI segmentation is commonly used for measuring and visualizing different brain structures, for delineating lesions, for analysing brain development, and for image-guided interventions and surgical planning. This diversity of image processing applications has led to development of various segmentation techniques of different accuracy and degree of complexity.

In this paper we review the most popular methods commonly used for brain MRI segmentation. We highlight differences between them and discuss their capabilities, advantages, and limitations. To introduce the reader to the complexity of the brain MRI segmentation problem and address its challenges, we first introduce the basic concepts of image segmentation. This includes defining 2D and 3D images, describing an image segmentation problem and image features, and introducing MRI intensity distributions of the brain tissue. Then, we explain different MRI preprocessing steps including image registration, bias field correction, and removal of nonbrain tissue. Finally, after reviewing different brain MRI segmentation methods, we discuss the validation problem in brain MRI segmentation.

2. Basic Concepts

2.1. 2D  and 3D Images

An image can be defined as a function I(ij) in 2D space or I(ijk) in 3D space, where i = 0, …, M − 1, j = 1, …, N − 1, and k = 0, …, D − 1 denote spatial coordinates. The values (or amplitudes) of the functions I(ij) and I(ijk) are intensity values and are typically represented by a gray value {0, …, 255} in MRI of the brain; see Figure 1. Every image consists of a finite set of image elements called pixels in 2D space or voxels in 3D space. Each image element is uniquely specified by its intensity value and its coordinates (ij) for pixels and (ijk) for voxels, where i is the image row number, j is the image column number, and k is the slice number in a volumetric stack; see Figure 2.

Details are in the caption following the image

Figure 1

Open in figure viewerPowerPoint
Illustration of image elements in the MRI of the brain. An image pixel (ij) is represented with the square in the 2D MRI slice and an image voxel (xyz) is represented as the cube in 3D space.
Details are in the caption following the image

Figure 2 (a)

Open in figure viewerPowerPoint
Illustration of image elements in 2D and 3D space. (a) In 2D space image elements (pixels) are represented with lattice nodes depicted as a square. (b) In 3D space image elements (voxels) are represented with lattice nodes depicted as a cube.
Details are in the caption following the image

Figure 2 (b)

Open in figure viewerPowerPoint
Illustration of image elements in 2D and 3D space. (a) In 2D space image elements (pixels) are represented with lattice nodes depicted as a square. (b) In 3D space image elements (voxels) are represented with lattice nodes depicted as a cube.

To each image element is assigned a single value based on the average magnetic resonance characteristics present in the tissue corresponding to that element. The size of the element determines the spatial resolution, or the fineness of detail that can be distinguished in an image. Voxel/pixel sizes vary depending on imaging parameters, magnet strength, the time allowed for acquisition, and other factors, but often in standard MRI studies voxel sizes are on the order of 1-2 mm. Greater spatial resolution can be obtained with a longer scanning time, but this must be weighed against patient discomfort. In adult brain MRI studies image acquisition time is around 20 min, while in pediatric MRI studies image acquisition time is limited to between 5 and 15 min.

2.2. Image Segmentation

The goal of image segmentation is to divide an image into a set of semantically meaningful, homogeneous, and nonoverlapping regions of similar attributes such as intensity, depth, color, or texture. The segmentation result is either an image of labels identifying each homogeneous region or a set of contours which describe the region boundaries.

Fundamental components of structural brain MRI analysis include the classification of MRI data into specific tissue types and the identification and description of specific anatomical structures. Classification means to assign to each element in the image a tissue class, where the classes are defined in advance. The problems of segmentation and classification are interlinked because segmentation implies a classification, while a classifier implicitly segments an image. In the case of brain MRI, image elements are typically classified into three main tissue types: white matter (WM), gray matter (GM), and cerebrospinal fluid (CSF); see Figure 3. The segmentation results are further used in different applications such as for analyzing anatomical structures, for studying pathological regions, for surgical planning, and for visualization.

Details are in the caption following the image

Figure 3 (a)

Open in figure viewerPowerPoint
An example of the brain MRI segmentation with an original MR image (a) and segmented image with three labels: WM, GM, and CSF (b).
Details are in the caption following the image

Figure 3 (b)

Open in figure viewerPowerPoint
An example of the brain MRI segmentation with an original MR image (a) and segmented image with three labels: WM, GM, and CSF (b).

Image segmentation can be performed on 2D images, sequences of 2D images, or 3D volumetric imagery. Most of the image segmentation research has focused on 2D images. If the data is defined in 3D space (e.g., obtained from a series of MRI images), then typically each image “slice” is segmented individually in a “slice-by-slice” manner. This type of segmenting 3D image volumes often requires a postprocessing step to connect segmented 2D slices into a 3D volume or a continuous surface. Furthermore, the resulting segmentation can contain inconsistencies and nonsmooth surface due to omitting important anatomical information in 3D space. Therefore, the development of 3D segmentation algorithms is desired for more accurate segmentation of volumetric imagery. The main difference between 2D and 3D image segmentation is in the processing elements, pixels/voxels, respectively, and their 2D or 3D neighborhoods (see Section 2.3) over which image features are calculated (see Section 2.4). In practice, 2D image segmentation methods can be extended to 3D space, but often with the cost of an increased complexity of the method and slower computational time.

2.3. Modeling the Spatial Context

The use of spatial context or neighborhood information is of great importance in brain MRI segmentation. Unless the image is simply random noise, the intensity of an image pixel/voxel is highly statistically dependent on the gray intensities of its neighbors (surrounding pixels/voxels). Markov random field (MRF) theory provides a basis for modeling local properties of an image, where the global image properties follow the local interactions. MRF models have been successfully integrated in various brain MRI segmentation methods to decrease misclassification errors due to image noise [1–3].

First, let us introduce some notations. As has been described in Section 2.1, every pixel (or voxel) in an image can be represented with one node in the lattice mathematical equation. Let xi represent an intensity value of a single pixel (or voxel) with a position i in an image mathematical equation defined over a finite lattice mathematical equation, where m is the total number of image elements (m = MN for a 2D image and m = MND for a 3D image). Let mathematical equation denote a neighboring system for a lattice mathematical equation, where mathematical equation represent a small neighborhood around i, not including xi.

The nodes (pixels/voxels) in a lattice mathematical equation are related to one another via neighborhood system mathematical equation that can be defined as

mathematical equation()

The neighboring relationship has the following properties:

  • (i)a node i does not belong to its own neighborhood: mathematical equation;
  • (ii)the neighboring relationship is mutual:
    mathematical equation()

     

The set of neighbors of i can be defined as the set of surrounding nodes within a radius of mathematical equation from the center i:

mathematical equation()

where dist⁡(ab) is the Euclidean distance between neighboring pixels a and b and mathematical equation is an integer number.

WhatsApp