# Patent

## Title
Method for automatic boundary segmentation of object in 2D and/or 3D image

## Abstract

Segmenting the prostate boundary is essential in determining the dose plan needed for a successful bracytherapy procedure—an effective and commonly used treatment for prostate cancer. However, manual segmentation is time consuming and can introduce inter and intra-operator variability. This present invention describes an algorithm for segmenting the prostate from two dimensional ultrasound (2D US) images, which can be full-automatic, with some assumptions of image acquisition. Segmentation begins with the user assuming the center of the prostate to be at the center of the image for the fully-automatic version. The image is then filtered to identify prostate edge candidates. The next step removes most of the false edges and keeps as many true edges as possible. Then, domain knowledge is used to remove any prostate boundary candidates that are probably false edge pixels. The image is then scanned along radial lines and only the first-detected boundary candidates are kept the final step includes the removal of some remaining false edge pixels by fitting a polynomial to the image points and removing the point with the maximum distance from the fit. The resulting candidate edges form an initial model that is then deformed using the Discrete Dynamic Contour (DDC) model to obtain a closed contour of the prostate boundary.

## Background
CLAIM OF PRIORITY
This application is a national phase application pursuant to 35 U.S.C. §371 of International Application No. PCT/IB2008/003171, filed May 22, 2008, which claims priority to U.S. Provisional Patent Application No. 60/939,443 filed on May 22, 2007.
The present application claims priority to the provisional application 60/939,443 filed to the United States Patent and Trademark Office on May 22, 2007, the content of which is hereby incorporated by reference into the present application.


FIELD OF THE INVENTION
The present invention relates in general to medical imaging systems, and more specifically, to a method for generating an automatic segmentation of the prostate boundary from 2D and 3D images.
BACKGROUND OF THE INVENTION
The prostate gland is an essential part of the male reproductive system. Located in the pelvis behind the pubic bone and right in front of the rectum and below the neck of the bladder, the prostate completely surrounds the urethra, which is the passageway that carries urine from the bladder through the penis and out of the body. In a healthy adult male, the prostate is approximately the size and shape of a walnut, weighing about 20 grams and measuring about 3 cm in width and 2.8 cm in length. Partly fibromuscular and partly glandular, the prostate gland is divided into the following four regions: Anterior fibromuscular zone, peripheral zone, central zone, and transition zone (McNeal 1988). One of the functions of the prostate is to produce a thin and milky seminal fluid that mixes with the fluid produced by the seminal vesicles, a pair of glands attached to it, to make the semen. The sperm, carried from the testicles to the prostate through the vas deferens tube, mixes with the semen. The resulting fluid is then ejaculated during orgasm first by the ejaculatory ducts to the urethra and then through the urethra out of the body.
Prostate cancer occurs when cells of the prostate begin to grow and to multiply out of control. These cells may spread out of the prostate to the nearby lymph nodes, bones or other parts of the body. This spread is called metastasis. Prostate cancer is the most commonly diagnosed malignancy in men, and is found at autopsy in 30% of men at the age of 50, 40% at age 60, and almost 90% at age 90 (Garfinkel et al. 1994). Worldwide, it is the second leading cause of death due to cancer in men. At its early stages, the disease might not have any symptoms. Some men, however, might experience symptoms that could indicate the presence of prostate cancer. Some of these symptoms include frequent and burning urination, difficulty starting a urinary stream, difficulty in having an erection, and painful ejaculation. Since these symptoms could also indicate other diseases, these men would undergo screening for prostate cancer.
When diagnosed at an early stage, prostate cancer is curable. The purpose of screening is to detect prostate cancer at its early stages before the development of any symptoms. It can be performed using two tests: the prostate-specific antigen (PSA) blood test, and the digital rectal exam (DRE).
If the DRE finds an abnormality in the prostate, or the blood test reveals a high level of PSA, then a biopsy of the prostate is recommended. A biopsy is a surgical procedure that involves removing samples of prostate tissues for microscopic examination to determine if they contain cancer cells. In the transrectal biopsy, which is the most commonly used method, a hand-held biopsy gun with a spring-loaded slender needle is guided through the wall of the rectum into the prostate gland then quickly removed. This is done under transrectal ultrasound (TRUS) guidance—a procedure that uses ultrasound generated from a probe that is inserted into the rectum to create an image of the prostate gland. The biopsy needle will contain a cylinder of a prostate tissue sample used for histological examination. This is repeated several times; each biopsy resulting in a sample from a different area of the prostate. Despite the fact that many samples (around 12) are obtained, cancer can still be missed if none of the biopsy needles pass through the cancerous growth. Although this procedure is low-risk, complication may occur. Some possible treatable complications could include prolonged bleeding into the urethra, and infection of the prostate gland or urinary tract.
An appropriate treatment choice of the prostate cancer is based primarily on its stage, PSA level, and other factors like the man's age and his general health. Treatment options change considerably if the cancer has already spread beyond the prostate. The results of this project will be used in procedures to treat localized prostate cancer, which has four treatment options, (Bangma et al. 2001), of which include brachytherapy.
Brachytherapy is radiation therapy that is minimally invasive and that involves inserting seeds containing radioactive material directly into the prostate. LDR, or low-dose-rate brachytherapy, consists of inserting low-dose or low-energy seeds permanently into the prostate. HDR, or high-dose-rate brachytherapy, on the other hand, involves placing high-dose or high-energy seeds temporarily into the prostate, and then removing them once the desired radiation dose has been delivered. HDR provides better dose control, whereas LDR is simpler and with lower risk of infection since it doesn't involve a removal procedure (Nag S. 1997). Appropriate candidates for brachytherapy are men with cancer confined to the prostate gland.
Implantation techniques for prostate brachytherapy had started as early as 1913 by inserting radium through a silver tube that was introduced into the urethra. Brachytherapy evolved in the 1970's with Whitmore who invented an open implant technique that involved interstitial implantation using an open retropubic surgery. In 1980, Charyulu described a transperineal interstitial implant technique. Then, in 1983, Holm, an urologist from Denmark, invented the TRUS-guided technique for implanting permanent radioactive seeds transperineally into the prostate (Nag et al. 1997). This technique became very popular for many reasons including the fact that it is a minimally invasive, outpatient and one-time procedure (Nag et al. 1997).
Transperineal prostate brachytherapy employs TRUS as the primary imaging modality. Under TRUS guidance, a needle carrying the radioactive seeds is inserted through the perinium and into the prostate via a template.
A successful brachytherapy procedure requires several steps, including preoperative volume study using TRUS, computerized dosimetry, pubic arch interference determination since the pubic arch is a potential barrier to the passage of the needles, and postoperative dosimetric evaluation (Pathak et al. 2000). Image processing and specifically outlining the prostate boundary accurately plays a key role in all four steps (Grimm et al. 1994). In the volume study, the TRUS probe is inserted into the rectum to acquire a series of cross-sectional 2D images at a fixed interval from the base to the apex (Nag et al. 1997). Then, the prostate boundary is outlined on these cross-sectional 2D image slices using a segmentation algorithm.
Traditional segmentation algorithms involved a skilled technician to manually outline the prostate boundary. Although this provides an acceptable result (Tong et al. 1996), it is time consuming and is prone to user variability. Therefore, several semi-automatic and fully automatic algorithms, which can be classified into edge-based, texture-based and model-based, have been proposed for segmenting the prostate boundary from 2D TRUS images.
Edge-Based Prostate Boundary Detection Methods from 2D TRUS Images:
These algorithms first find image edges by locating the local peaks in the intensity gradient of the image, and then they outline the prostate boundary by performing edge selection followed by edge linking (Shao et al. 2003). Aamink et al. presented an edge-based algorithm for determining the prostate boundary using the gradient of the image in combination with a Laplace filter. They located possible edges at the zero crossings of the second derivative of the image and determined the edge strength by the value of the gradient of the image at that location. Then they used knowledge-based features and ultrasonic appearance of the prostate to choose the correct edges. Finally, they used adaptive interpolation techniques to link the edges that actually present a boundary (Aamink et al. 1994). This method gave good results but it could generate erroneous edges due to artifacts in the image (Shao et al. 2003).
Pathak et al. also used an edge-based method for outlining the prostate boundary from transrectal ultrasound images. First, they enhanced the contrast and reduced image speckle using the sticks algorithm (Pathak et al. 2000). Then, they further smoothed the resulting image using an anisotropic diffusion filter, and used prior knowledge of the prostate and its shape and echo pattern in ultrasonic images to detect the most probable edges. Finally, they overlaid the detected edges on the top of the image and presented them as a visual guide to the observers to manually delineate the prostate boundary (Pathak et al. 2000).
Liu et al. also used an edge-based technique called the radial “bas-relief” (RBR) method for prostate segmentation where they obtained a “bas-relief” image, which they superimpose on the original TRUS image to obtain the edge map (Liu et al. 1997). Its insensitivity to edges parallel to the radial direction from the centre of the prostate was the weakness of this method (Chiu et al. 2004). In addition, this method failed if the image centre and the prostate boundary centroid were far from each other.
Texture-Based Prostate Boundary Detection Methods from 2D TRUS Images
These techniques characterize regions of an image based on the texture measures. They can determine regions of the image with different textures, and create borders between them to produce an edge map. In their work, Richard and Keen presented an automatic texture-based segmentation method, which was based on a pixel classifier using four texture energy measures associated with each pixel in the image to determine the cluster it belongs to (Richard & Keen 1996). One of the drawbacks of this method was that the resulting prostate may be represented by a set of disconnected regions (Chiu et al. 2004).
Model-Based Prostate Boundary Detection Methods from 2D TRUS Images
These techniques use prior knowledge of 2D TRUS images of the prostate to delineate the prostate boundary efficiently. Some model-based methods are based on deformable contour models, in which a closed curve deforms under the influence of internal and external forces until a curve energy metric is minimized (Ladak et al. 2000). Other methods are based on statistical models, in which the variation of the parameters describing the detected object are estimated from the available segmented images and are used for segmentation of new images. The statistical models are obtained from a training set in an observed population (Shao et al. 2003).
Prater et al. presented a statistical model-based method for segmenting TRUS images of the prostate using feed-forward neural networks. They presented three neural network architectures, which they trained using a small portion of a training image segmented by an expert sonographer (Prater et al. 1992). Their method had the disadvantage of needing extensive training data.
Pathak et al. presented a method based on snakes to detect the prostate boundary from TRUS images. They first used the sticks algorithm to selectively enhance the contrast along the edges, and then integrated it with a snakes model (Pathak et al. 1998). This algorithm required the user to input an initial curve for each ultrasound image to initiate the boundary detection process. This algorithm is very sensitive to the initial curve and only works well when this initial curve is reasonably close to the prostate boundary (Shao et al. 2003).
Ladak et al. presented a model-based algorithm for 2D semi-automatic segmentation of the prostate using a discrete dynamic contour (DDC) approach. It involved using cubic spline interpolation and shape information to generate an initial model using only four user-defined points to initialize the prostate boundary. This initial model was then deformed with the DDC model (Ladak et al 2000).
Ladak's segmentation algorithm gave good results, demonstrating an accuracy of 90.1% and a sensitivity of 94.5%. In this approach, manual initialization required about 1 min, but the prostate segmentation procedure required about 2 seconds. (Ladak et al. 2000). However, this method requires careful manual initialization of the contour and further user interaction to edit the detected boundary, which introduces complexity and user variability.
Reducing or removing user interaction, and as a result the variability among observers, would produce a faster, more accurate and reproducible segmentation algorithm. In addition, it may remove the need for the user to initialize the segmentation procedure, a critical criteria for an intraoperative prostate brachytherapy procedure.
The present invention provides an automatic prostate boundary segmentation method that minimizes and/or eliminates user initialization for segmenting the prostate in 2D or 3D images; thereby reducing both the time required for the procedure and the inter/intra-operator variability ultimately improving the effectiveness and utility of medical in the diagnosis and treatment of prostate cancer.
SUMMARY OF THE INVENTION
The present invention relates generally to a method and approach for generating automatic prostate boundary segmentation for 2D and 3D images. A fully-automated algorithm to select the prostate boundary is provided.
The method is composed of:

    
    
        prostate initialization by making an assumption about the center of the prostate,
        edge detection using a filter to remove detail and noise,
        length thresholding to remove false edges and keep true edges on the prostate boundary,
        use of prior knowledge to aid in determining the prostate boundary by removing any prostate boundary candidates that are false edge pixels,
        scanning along radial lines to keep first boundary candidates.
        polynomial fitting to remove remaining false edge pixels and to identify unconnected edge pixels that are on the prostate boundary, and
        the use of pixels as initial points to a DDC model to obtain a closed contour of the prostate boundary.
    
    


Shown in this present invention is that the fully-automatic version of the algorithm performs well. Thus this method for automatic prostate boundary segmentation eliminates user initialization for segmenting the prostate from 2D TRUS images, minimizes the time required for complete prostate segmentation, reduces inter and intra-operator variability and improves the effectiveness and utility of TRUS in diagnosis and treatment of prostate cancer. Although shown here is the use of this method in prostate boundary segmentation, this method is also applicable to segmentation of any object including, tumors, kidneys, and other organs. Also shown in this present invention is the use of 2D TRUS images for initialization, however, it is also applicable to other 2D or 3D US, CT and MRI images.



BRIEF DESCRIPTION OF THE DRAWINGS
The present invention will be further understood and supported using the following drawings and their associated descriptions. These descriptions and drawings are not meant to limit the invention by any circumstance and are to be interpreted as possible embodiments of the invention disclosed herein. The methods utilized in the generation of the data represented by these drawings are commonly known within the art and may be reproduced identically by employing the methods described herein.
FIG. 1 shows a flow chart of our proposed prostate segmentation algorithm. The following sections describe the steps used to generate the initial prostate boundary that is used as an input into Ladak's DDC segmentation algorithm.
FIG. 2 shows prostate initialization. Approximate prostate center is chosen manually or automatically.
FIG. 3 shows a mask used to implement the digital Gaussian filter with σ=1.
FIG. 4 shows masks used to implement the digital 3×3 Laplacian filter.
FIG. 5 shows 5×5 digital approximation to the LoG filter.
FIG. 6 shows the LOG filter result of the prostate image in FIG. 2.2 for T=0 and σ=7.
FIG. 7 shows results after removing short-length connected components. (a) After removing connected components less than 120 pixels from the image in FIG. 6. (b) After removing connected components shorter than 425 pixels with a minimum distance to the centre less than 50 pixels. One connected component inside the prostate gland was removed.
FIG. 8 shows an image in which matrices Iin and Iout represents two 5×5 regions at the pixel P on the inside and the outside of the prostate respectively. Xout is the mean of Iout, Xin the mean of Iin, σout the standard deviation of Iout and σin the standard deviation of Iin.
FIG. 9 shows t-values with their corresponding P-values.
FIG. 10 shows contrast-test membership function.
FIG. 11 shows distance test membership function.
FIG. 12 shows pixels' membership values. (a) is an image showing the membership value at each pixel based on the contrast test, (b) is an image showing the membership value at each pixel based on the distance test, (c) is an image showing the membership value at each pixel based on the product of the contrast test and the distance test, and (d) is an image showing the pixels left after keeping the pixels detected first along radial lines and removing the ones detected later.
FIG. 13 shows different F-values with their corresponding P-values.
FIG. 14 shows F-test membership function.
FIG. 15 shows remaining pixels based on the M membership function.
FIG. 16 shows remaining pixels based on the Mfinal membership function.
FIG. 17 shows polynomial fit. Gray: Candidate prostate boundary pixels; Black: fit.
FIG. 18 shows final polynomial fit showing that the maximum distance from the fit is less than 4 mm. Gray: Candidate prostate boundary pixels; Black: fit
FIG. 19 shows the final pixels on the prostate boundary.
FIG. 20 shows the final results. (a) and (c) show the final pixels generated by our initialization algorithm before applying the DDC segmentation for two different prostate images, and (b) and (d) show the final result after deformation using DDC segmentation.
FIG. 21 shows the LoG filter output for one prostate image. (a) σ=5, (b) σ=7, (c) σ=9, and (d) σ=11.



Table 1 shows t statistic's significance level optimization. Mean number of clusters on prostate boundary, mean of their maximum gap, and mean number of clusters off the boundary for the four prostate images used for different significant level values.
Table 2 shows F statistic's significance level optimization. Mean number of clusters on prostate boundary for the four prostate images used, mean of their maximum gap, and mean number of clusters off the boundary for each significant level value αF.
Table 3 shows evaluation metrics MD, MAXD, PC, AO, and AD for the semi-automatic version of our segmentation algorithm for the entire set of 51 prostate images. The first six entries are for the images shown in FIG. 4.
Table 4 shows evaluation metrics MD, MAXD, PC, AO, and AD for the fully-automatic version of our prostate segmentation algorithm for the entire set of 51 prostate images, and the mean and the standard deviation for the entire set.
DETAILED DESCRIPTION OF THE INVENTION
In accordance with one aspect of the present invention, as an input, the algorithm requires the approximate prostate centre. For prostate brachytherapy, the prostate gland is typically centred at the approximate centre of the image. In this case, the user does not need to select the prostate centre; as a result, the algorithm of the present invention would be fully-automatic. In cases when the prostate is not centred at the centre of the image, the user must select the approximate centre; as a result, our algorithm would be semi-automatic. FIG. 2 shows a 2D prostate TRUS image with the location of the user-selected centre shown by a dot and the centre of the image shown as a cross.
The Gaussian filter is used to blur the image and remove some detail and noise by convolving it with the 2D Gaussian distribution h(x, y):




  
    
      
        
          h
          ⁡
          
            (
            
              x
              ,
              y
            
            )
          
        
        =
        
          
            1
            
              2
              ⁢
              π
              ⁢
              
                
              
              ⁢
              
                σ
                2
              
            
          
          ⁢
          
            e
            
              -
              
                
                  
                    x
                    2
                  
                  +
                  
                    
                      y
                      ⁢
                      
                        
                      
                    
                    2
                  
                
                
                  2
                  ⁢
                  
                    σ
                    2
                  
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where σ is the standard deviation that determines the degree of smoothing. A digital approximation to the Gaussian function with σ=1 can be implemented using a 5×5 mask shown in FIG. 3. A larger σ would require a larger mask.

Used for edge detection, the Laplacian of a function (image), f(x, y), is a 2D second-order derivative defined as (Gonzalez and Woods 2002):




  
    
      
        
          
            ∇
            2
          
          ⁢
          f
        
        =
        
          
            
              
                ∂
                2
              
              ⁢
              f
            
            
              ∂
              
                x
                2
              
            
          
          +
          
            
              
                ∂
                2
              
              ⁢
              f
            
            
              ∂
              
                y
                2
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




The Laplacian highlights regions of rapid intensity change. FIG. 4 shows two most commonly used digital approximations to the Laplacian filter for a 3×3 region.
The Laplacian filter is very sensitive to noise since it is a second-order derivative, is unable to detect an edge direction and its magnitude produces double edges (Gonzalez and Woods 2002).
Since the Laplacian filter is very sensitive to noise, the image can first be smoothed by convolving it with a Gaussian filter; the result is then convolved with a Laplacian filter. Since the convolution operator is associative, the same result can be obtained by convolving the Gaussian filter with the Laplacian filter first to obtain the Laplacian of Gaussian (LoG) filter, which is then convolved with the image as shown in equation 3.




  
    
      
        
          
            
              
                Output
                ⁢
                
                  
                
                ⁢
                Image
              
              =
              
              ⁢
              
                
                  (
                  
                    Input
                    ⁢
                    
                      
                    
                    ⁢
                    Image
                    *
                    Gaussian
                    ⁢
                    
                      
                    
                    ⁢
                    filter
                  
                  )
                
                *
              
            
          
        
        
          
            
              
              ⁢
              
                Laplacian
                ⁢
                
                  
                
                ⁢
                filter
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  (
                  
                    Input
                    ⁢
                    
                      
                    
                    ⁢
                    Image
                  
                  )
                
                *
                
                  (
                  
                    Gaussian
                    ⁢
                    
                      
                    
                    ⁢
                    filter
                    *
                  
                
              
            
          
        
        
          
            
              
              ⁢
              
                Laplacian
                ⁢
                
                  
                
                ⁢
                filter
              
              )
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  (
                  
                    Input
                    ⁢
                    
                      
                    
                    ⁢
                    Image
                  
                  )
                
                *
                
                  (
                  
                    Laplacian
                    ⁢
                    
                      
                    
                    ⁢
                    of
                    ⁢
                    
                      
                    
                    ⁢
                    Gaussian
                    ⁢
                    
                      
                    
                    ⁢
                    filter
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




The 2-D LoG operator with Gaussian standard deviation σ is given by:





  
    
      
        
          LoG
          ⁡
          
            (
            
              x
              ,
              y
            
            )
          
        
        =
        
          
            -
            
              
                1
                
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  
                    σ
                    4
                  
                
              
              [
              
                
                  
                    
                      x
                      2
                    
                    +
                    
                      y
                      2
                    
                  
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    
                      σ
                      2
                    
                  
                
                -
                1
              
              ]
            
          
          ⁢
          
            e
            
              -
              
                
                  
                    x
                    2
                  
                  +
                  
                    y
                    2
                  
                
                
                  2
                  ⁢
                  
                    
                  
                  ⁢
                  
                    σ
                    2
                  
                
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




The LoG filter consists of convolving the image with LoG(x, y) operator, which yields an image with double edges. Then, finding edge location consists of finding zero crossings between the double edges.
The LOG filter inputs two parameters: the standard deviation, σ, and a sensitivity threshold in the range [0,1] used to ignore edge points with 2D first-order derivative (gradient magnitude at that location) not greater than T. Setting T to 0 produces edges that are closed contours. We used the built-in Matlab command, edge, specifying the two parameters σ and T of the LoG filter. The size of the filter is n×n, where n=ceil (σ×3)×2+1, and ceil rounds (σ×3) to the nearest integer greater than or equal to (σ×3). The output of the edge command is a logical array with 1's where edge points were detected, and 0's elsewhere as shown in FIG. 6 (Gonzalez et al. 2004).
Visual comparison of FIGS. 2 and 6 shows that some of the edges in FIG. 6 are “true” edges on the prostate boundary, and others are “false” edges that represent noise, calcifications and other structures. The aim of the next steps is to remove most of the false edges and keep as many correct edges as possible.
Groups of edge pixels in FIG. 6 are linked together to form the image's connected components, some are short lengths consisting of few pixels and others are long lengths consisting of many pixels. For most prostate images, connected components less than 120 pixels, or 24 mm, are not part of the prostate boundary; therefore such connected components are removed. FIG. 7 (a) shows the results of applying this step to the image in FIG. 6. In addition, connected components are removed with lengths less than 425 pixels, or 85 mm, and with a distance to the prostate centre that is less than 50 pixels, or 10 mm, as they would lie inside the gland since an average prostate gland measures more than 25 mm in width and height. The result of applying this step to the image in FIG. 6 is shown in FIG. 7 (b).
To identify the boundary of an object in an image, experts use a prior knowledge of the particular image class (Nanayakkara et al. 2006, Karmakar et al. 2002). To remove more of the “false” edges from the image shown in FIG. 7 (b), a prior knowledge of a typical prostate image was also used to help with determining the boundary. Some observations about 2D TRUS images of the prostate include:

    
    
        The inside of the prostate gland is typically darker than the outside.
        The inside of the prostate gland is typically smoother than the outside.
        An average prostate in patients undergoing a brachytherapy procedure is approximately 3 cm in width and 2.8 cm in height.

Using these criteria, three tests were performed on each edge pixel, where each is assigned a probability of being part of the prostate boundary.

    
    


In this test, the following observation was used: inside of the prostate is typically darker than the outside. Matrices Iout and Iin represent two 5×5 regions at a border candidate pixel, P, with mean grey levels Xout and Xin respectively as shown in FIG. 8. To prevent any overlap between these 2 matrices, their centres were chosen to be 10 pixels, or 2 mm, away from P. In order for the pixel P to be on the prostate boundary, Iout has to be brighter than Iin, and as a result Xout should be greater than Xin (Nannayakkara et al. 2006).
Since estimates of Xout and Xin are subject to variation due to image noise, it was tested whether Xout is greater than Xin, and assigned a probability of boundary membership based on the t-test where t-statistic is defined as (Rosner 2000):




  
    
      
        t
        =
        
          
            (
            
              
                X
                out
              
              -
              
                X
                
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  n
                
              
            
            )
          
          
            
              
                (
                
                  
                    σ
                    out
                    2
                  
                  n
                
                )
              
              +
              
                (
                
                  
                    σ
                    
                      i
                      ⁢
                      
                        
                      
                      ⁢
                      n
                    
                    2
                  
                  n
                
                )
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




where σout2 is the variance of region Iout, σin2 is the variance of Iin, and n is the size of Iout and Iin.

If a pixel is indeed on the prostate boundary, its t-value has to be positive and significantly different than zero. The significance of the difference is measured by a P-value. FIG. 9 shows the t-values of the image pixels with their corresponding P-values.
Although conventional biomedical statistical analysis typically uses a P-value of 0.05 as a threshold for significance, a threshold value Pth was chosen to optimize the segmentation performance, and tth is its corresponding t-value. Using Pth, a contrast membership function, Mc, was constructed as defined in equation (6), which assigns for each pixel being tested a probability of being on the prostate boundary based on its t-value. A plot of the contrast-test membership function Mc is shown in FIG. 10.




  
    
      
        
          
            M
            c
          
          ⁡
          
            (
            pixel
            )
          
        
        =
        
          {
          
            
              
                
                  
                    (
                    
                      
                        P
                        th
                      
                      -
                      
                        P
                        pixel
                      
                    
                    )
                  
                  
                    P
                    th
                  
                
              
              
                
                  
                    t
                    pixel
                  
                  >
                  
                    t
                    th
                  
                
              
            
            
              
                
                  t
                  ⁢
                  
                    
                  
                  ⁢
                  value
                
              
              
                
                  
                
              
            
            
              
                0
              
              
                else
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




The image showing each pixel's probability measure is shown in FIG. 12a. The darker font represents pixels with a higher membership value, the lighter font represents pixels with a lower membership value, and the pixels with zero membership value are of course eliminated.
In this test, the following fact is used: typical prostates in patients scheduled for brachytherapy are on average 3 cm in width and 2.8 cm in height. Therefore, assuming a circular shape of the prostate in the 2D ultrasound image, the boundary should be found between two distances, which encompass the mean size of the prostate. The following two distances were used from the centre, d1=7 mm and d2=14 mm, and constructed a membership function, MD, as shown in FIG. 11, which assigns for each pixel being examined a probability value based on its distance from the prostate centre. This membership function is the built-in Matalb function pimf given by equation (7).




  
    
      
        
          
            
              
                
                  M
                  D
                
                ⁡
                
                  (
                  
                    pixel
                    ,
                    
                      [
                      
                        a
                        ,
                        b
                        ,
                        c
                        ,
                        d
                      
                      ]
                    
                  
                  )
                
              
              =
              
              ⁢
              
                pimf
                ⁡
                
                  (
                  
                    pixel
                    ,
                    
                      [
                      
                        a
                        ,
                        b
                        ,
                        c
                        ,
                        d
                      
                      ]
                    
                  
                  )
                
              
            
          
        
        
          
            
              
                =
                
                ⁢
                
                  
                    smf
                    ⁡
                    
                      (
                      
                        pixel
                        ,
                        
                          [
                          
                            a
                            ,
                            b
                          
                          ]
                        
                      
                      )
                    
                  
                  ×
                  
                    zmf
                    ⁡
                    
                      (
                      
                        pixel
                        ,
                        
                          [
                          
                            c
                            ,
                            d
                          
                          ]
                        
                      
                      )
                    
                  
                
              
              ;
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




where the parameters [a, b, c, d]=[minimum(dist), d1, d2, maximum(dist)]; dist is the vector of distance values from the edge pixels to the prostate centre; and the two functions smf and xmf are defined as shown in equations (8) and (10), respectively (MATLAB—The Language of Technical Computing).





  
    
      
        
          smf
          ⁡
          
            (
            
              pixel
              ,
              
                [
                
                  a
                  ,
                  b
                
                ]
              
            
            )
          
        
        =
        
          {
          
            
              
                1
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      a
                      ≥
                      b
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                  and
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        d
                        pixel
                      
                      ≥
                      
                        
                          a
                          +
                          b
                        
                        2
                      
                    
                    )
                  
                
              
            
            
              
                0
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      a
                      ≥
                      b
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                  and
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        d
                        pixel
                      
                      <
                      
                        
                          a
                          +
                          b
                        
                        2
                      
                    
                    )
                  
                
              
            
            
              
                0
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      d
                      pixel
                    
                  
                  ≤
                  a
                
              
            
            
              
                
                  2
                  ×
                  
                    [
                    
                      
                        (
                        
                          
                            
                              d
                              pixel
                            
                            -
                            a
                          
                          
                            b
                            -
                            a
                          
                        
                        )
                      
                      2
                    
                    ]
                  
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    a
                  
                  <
                  
                    
                      d
                      pixel
                    
                    ⁢
                    
                      
                    
                    ⁢
                    and
                    ⁢
                    
                      
                    
                    ⁢
                    
                      (
                      
                        
                          d
                          pixel
                        
                        ≤
                        
                          
                            a
                            +
                            b
                          
                          2
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  1
                  -
                  
                    2
                    ×
                    
                      [
                      
                        
                          (
                          
                            
                              b
                              -
                              
                                d
                                pixel
                              
                            
                            
                              b
                              -
                              a
                            
                          
                          )
                        
                        2
                      
                      ]
                    
                  
                
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        
                          a
                          +
                          b
                        
                        2
                      
                      <
                      
                        d
                        pixel
                      
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                  and
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        d
                        pixel
                      
                      ≤
                      b
                    
                    )
                  
                
              
            
            
              
                1
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    b
                  
                  ≤
                  
                    d
                    pixel
                  
                
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  
  
    
      
        
          zmf
          ⁡
          
            (
            
              pixel
              ,
              
                [
                
                  c
                  ,
                  d
                
                ]
              
            
            )
          
        
        =
        
          {
          
            
              
                1
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      d
                      ≥
                      c
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                  and
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        d
                        pixel
                      
                      ≤
                      
                        
                          c
                          +
                          d
                        
                        2
                      
                    
                    )
                  
                
              
            
            
              
                0
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      d
                      ≥
                      c
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                  and
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        d
                        pixel
                      
                      >
                      
                        
                          c
                          +
                          d
                        
                        2
                      
                    
                    )
                  
                
              
            
            
              
                1
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      d
                      pixel
                    
                  
                  ≤
                  d
                
              
            
            
              
                
                  1
                  -
                  
                    2
                    ×
                    
                      [
                      
                        
                          (
                          
                            
                              
                                d
                                pixel
                              
                              -
                              d
                            
                            
                              d
                              -
                              c
                            
                          
                          )
                        
                        2
                      
                      ]
                    
                  
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    d
                  
                  <
                  
                    
                      d
                      pixel
                    
                    ⁢
                    
                      
                    
                    ⁢
                    and
                    ⁢
                    
                      
                    
                    ⁢
                    
                      (
                      
                        
                          d
                          pixel
                        
                        ≤
                        
                          
                            d
                            +
                            c
                          
                          2
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  2
                  ×
                  
                    [
                    
                      
                        (
                        
                          
                            c
                            -
                            
                              d
                              pixel
                            
                          
                          
                            d
                            -
                            c
                          
                        
                        )
                      
                      2
                    
                    ]
                  
                
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        
                          d
                          +
                          c
                        
                        2
                      
                      <
                      
                        d
                        pixel
                      
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                  and
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        d
                        pixel
                      
                      ≤
                      c
                    
                    )
                  
                
              
            
            
              
                0
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    c
                  
                  ≤
                  
                    d
                    pixel
                  
                
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




where dpixel is the distance from the pixel under consideration to the prostate centre.

The image showing each pixel's probability for being part of the prostate boundary based on the distance test is shown in FIG. 12(b). As with the contrast-test membership function, the darker font represents pixels with a higher membership value, the lighter font represents pixels with a lower membership value, and the pixels with zero membership value are of course eliminated.
Since a pixel on the prostate boundary has to satisfy both the contrast-test and the distance-test, we multiply the contrast-test membership function and the distance-test membership function to obtain MCD membership function as follows:

MCD(pixel)=Mc(pixel)×MD(pixel)  (10)

The image showing each pixel's probability value based on MCD is shown in FIG. 12(c) using the same colour codes described previously. Although some of the false edge pixels are inside the gland, most of them are on the outside. Therefore, MCD was modified by removing more false edge pixels by assuming that true pixels are the first to be detected when scanning the image shown in FIG. 12(c) along radial lines from the centre. Therefore, a modified membership function M′CD was constructed as shown in equation 11 where the membership value of the first detected pixels along each radial line will be equal to MCD, and those that lie along same radial lines but are further away from the centre will have a zero membership value. The image showing each pixel's probability value based on M′CD is shown in FIG. 12(d) using the same colour codes described previously. As shown in this figure, more false edges have been removed.





  
    
      
        
          
            M
            
              C
              ⁢
              
                
              
              ⁢
              D
            
          
          ⁡
          
            (
            pixel
            )
          
        
        =
        
          {
          
            
              
                
                  
                    M
                    
                      C
                      ⁢
                      
                        
                      
                      ⁢
                      D
                    
                  
                  ⁡
                  
                    (
                    pixel
                    )
                  
                
              
              
                
                  
                    
                      
                        if
                        ⁢
                        
                          
                        
                        ⁢
                        pixel
                        ⁢
                        
                          
                        
                        ⁢
                        is
                        ⁢
                        
                          
                        
                        ⁢
                        first
                        ⁢
                        
                          
                        
                        ⁢
                        to
                        ⁢
                        
                          
                        
                        ⁢
                        be
                        ⁢
                        
                          
                        
                        ⁢
                        detected
                      
                    
                  
                  
                    
                      
                        along
                        ⁢
                        
                          
                        
                        ⁢
                        a
                        ⁢
                        
                          
                        
                        ⁢
                        given
                        ⁢
                        
                          
                        
                        ⁢
                        radial
                        ⁢
                        
                          
                        
                        ⁢
                        line
                      
                    
                  
                
              
            
            
              
                0
              
              
                else
              
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




Since many false edge pixels still remain inside and outside the prostate gland, as shown in FIG. 12(d), the observation that the inside of the prostate is typically smoother than the outside was used to perform a texture test. If σout2 and σin2 are the intensity variances of the regions Iout and Iin respectively, then in order for an edge pixel to be on the prostate boundary, Iin should be smoother than Iout, and as a result σout2>σin2. Since estimates of σout2 and σin2 are subject to variation due to image noise, it was tested whether σout2 is greater than σin2, and assign a probability of boundary membership based on the F-test where F-statistic is defined as (Rosner 2000):





  
    
      
        
          F
          th
        
        ⁢
        
          

        
        ⁢
        
          F
          =
          
            
              σ
              out
              2
            
            
              σ
              
                i
                ⁢
                
                  
                
                ⁢
                n
              
              2
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




If a pixel is indeed on the prostate boundary, its F-value has to be significantly greater than 1. FIG. 13 shows the F-values of the image pixels with their corresponding P-values.

Although conventional biomedical statistical analysis typically uses a P-value of 0.05 as a threshold for significance, a threshold value Pth was chosen to optimize the segmentation performance, and Fth is its corresponding F-value. Using Pth, we constructed a membership function, MT, described in equation (13), which assigns for each pixel being tested a probability of being on the prostate boundary based on its F-value. A plot of the texture-test membership function MT is shown in FIG. 14.




  
    
      
        
          
            M
            T
          
          ⁡
          
            (
            pixel
            )
          
        
        =
        
          {
          
            
              
                
                  
                    (
                    
                      
                        P
                        threshold
                      
                      -
                      
                        P
                        pixel
                      
                    
                    )
                  
                  
                    P
                    threshold
                  
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      F
                      pixel
                    
                  
                  >
                  
                    F
                    threshold
                  
                
              
            
            
              
                0
              
              
                else
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




A pixel on the prostate boundary has to satisfy all three tests; therefore, the final membership function M should be the product of MCD and MT, as described in equation 14. The image showing each pixel's probability value based on the final membership function M using the colour codes as before is shown in FIG. 15. Most of the edge pixels with a probability greater than 0.7 are on the prostate boundary. Therefore, the final membership function, MFinal, was constructed as described in equation (15), which assigns a membership of zero to the pixels with probability less than 0.7. FIG. 16 shows all edge pixels remaining after removing those with a probability less than 0.7.

M(pixel)=MCD(pixel)×MT(pixel)  (14)





  
    
      
        
          
            M
            Final
          
          ⁡
          
            (
            pixel
            )
          
        
        =
        
          {
          
            
              
                1
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      M
                      ⁡
                      
                        (
                        pixel
                        )
                      
                    
                  
                  ≥
                  0.7
                
              
            
            
              
                0
              
              
                else
              
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




As shown in FIG. 16, some false edge pixels remain. If the prostate gland is perfectly circular, then mapping the image into (R,Θ) coordinates (where R is the distance from a pixel to the prostate centre and Θ is the clockwise angle that the pixel forms with the horizontal diameter) should result in the true edge pixels forming a straight line. However, if the prostate gland is elliptical, then this kind of mapping should result in the true edge pixels forming a curve that could be described by a 9th order polynomial; false edge pixels would be far from the curve. Since a typical prostate gland in a transverse plane is elliptical, the removal of the false edge pixels remaining in the image shown in FIG. 16 can be carried out by mapping that image into (R,Θ) coordinates and fitting a polynomial to the pixels, as shown in FIG. 17. We then remove a candidate pixel with the maximum distance from the resulting fit and repeat the fit and the removal of the furthest pixel until the maximum distance of pixels away from the curve is less than 4 mm. The final polynomial fit is shown in FIG. 18, and the final image showing the remaining pixels on the prostate boundary is shown in FIG. 19.
After the polynomial fitting, we are left with unconnected edge pixels that are highly probable to be on the prostate boundary. Some of these pixels might not be exactly on the boundary. To obtain a closed contour of the prostate boundary, we use these pixels as initial points to Ladak's et al. DDC model (Ladak et al. 2000), a polyline that deforms under the influence of internal and external forces to fit features in an image (Lobregt and Viergever 1995, Ladak et al. 2000). FIG. 20 shows two prostate images with their respective initialization points resulting from our algorithm, and final contours. FIG. 20 (a) shows a prostate image with the result from the initialization algorithm, and FIG. 20 (b) shows its closed contour after deformation with the DDC model. FIG. 20 (c) shows another prostate image with the result from our initialization algorithm, and FIG. 20 (d) shows its closed contour that results from the DDC segmentation.
To evaluate the algorithm in this present invention, we segmented 51 2D TRUS prostate images obtained from three different patients scheduled for brachytherapy using both versions of the algorithm: the semi-automatic version and the fully-automatic version. The 51 images were acquired using a transrectal ultrasound coupled to a 3D TRUS system developed in our lab (Tong et al. 1998). The images were 468×356 pixels each with pixel size approximately 0.2 mm×0.2 mm. The ‘gold standard’ in evaluating the proposed algorithm was manually outlined prostate boundaries of the same images performed by an expert radiologist.
Four different images were used to optimize the parameters employed in the algorithm. To optimize the standard deviation, σ, which determines the degree of smoothing of the LOG filter, we varied its value from σ=1 to σ=11 in increments of 2, and visually determined the value that resulted in more true edge pixels, less false edge pixels, and a contour that is closer to the prostate boundary for four different prostate images. FIG. 21 shows examples of the result of the LOG filter for one of the prostate images used with different values of σ. The optimum a value was found to be 7 (FIG. 21b).
The null hypothesis for the contrast-test was that the regions Iin and Iout on both sides of the boundary (see FIG. 8) have the same mean brightness level; in which case, it would be less probable that the pixel is a part of the prostate boundary. The alternative hypothesis was that these two regions have different mean brightness levels with the outside being brighter than the inside; in which case, it is more probable that the pixel is a part of the prostate boundary. For each pixel in question, we performed a T-test with a significance level αT, and obtained a p-value. If this p-value is less than αT, then we reject the null hypothesis and assume that the alternative hypothesis is true. The higher the value of αT, the more pixels we accept as being part of the prostate boundary. To determine the optimal significance level, we performed the T-test using 7 different values of αT for each of the four images, from αT=0.001 to αT=0.05 and then computed the followings: the number of clusters on the prostate boundary, the gap between these clusters, and the number of clusters off the true prostate boundary. The objective was to find a combination that generated more clusters on the prostate boundary, smaller gaps between them, and fewer clusters off the prostate boundary. Table 1 shows for each αT the mean of the values obtained for the four prostate images. αT=0.03 was found to be the optimum.
The F-test was used to compare the standard deviation on each side of a candidate boundary pixel. The null hypothesis was that the region inside, Rin, and the region outside, Rout, (see FIG. 8) have the same variance; in which case, it would be less probable that the pixel is a part of the prostate boundary. The alternative hypothesis was that these two regions have different variances; in which case, it is more probable that the pixel is a part of the prostate boundary. After multiplying the contrast-test membership function and the distance membership function using the optimum values for the parameters σ and αT, we performed an F-test with a significance level αF for each pixel left in question, and obtained a p-value. Like the t-test, if this p-value is less than αF, then we reject the null hypothesis and assume that the alternative hypothesis is true. The higher the value of αF, the more pixels we accept as being a part of the prostate boundary. To determine the optimal αF value, we performed the F-test using 7 different values for a for each of the four images, from αF=0.001 to αF=0.05 and then computed the followings: the number of clusters on the prostate boundary, the gap between these clusters, and the number of clusters off the prostate boundary. The objective was to find the value of αF, which generated more clusters on the prostate boundary, smaller gaps between them, and fewer clusters off the prostate boundary. Table 2 shows for each αF the mean of the values obtained for the four prostate images. αF=0.03 was found to be the optimum for the F-test.
To test the overall performance of the algorithm, the following was determined: (1) the accuracy when the user inputs the prostate centre; (2) the sensitivity to the user input position and (3) the accuracy when the prostate centre is assumed to be the centre of the image and found automatically:
Automated initialization: Assuming that the prostate is centred at the centre of the image, and there is no need for the input of the user, the fully-automatic version of our proposed segmentation algorithm was used with the optimum parameter values found above to segment the prostate boundary using the set of 51 prostate images. The results of the fully-automatic version of the segmentation algorithm were compared with the manually segmented boundaries using the evaluation metrics described below.
Distance-based and area-based metrics were used to compare the boundaries outlined using either version of our algorithm (the semi-automatic version or the fully-automatic version) to the manually outlined boundaries (Nannayakkara et al. 2006, Chiu et al. 2004, Ladak et al. 2000).
Distance-based metrics were used to measure the distance between the contour generated using either version of our segmentation algorithm and the manually outlined contour. Let C={ci, i=1, 2, . . . K} be the set of vertices that define the algorithm-generated contour, and M={mj=1:2, . . . N} be the set of vertices that define the manually generated contour. To obtain a measure of the distance between both contours, these contours were linearly interpolated to have vertices 1 pixel apart, and then the distance between a vertex, ci, from C and M, d(ci,M), was computed as shown in equation (16):




  
    
      
        
          d
          ⁡
          
            (
            
              
                c
                i
              
              ,
              M
            
            )
          
        
        =
        
          
            min
            j
          
          ⁢
          
            
              
              
                
                  c
                  i
                
                -
                
                  m
                  j
                
              
              
            
            .
          
        
      
    
    
      
        (
        16
        )
      
    
  




For each image, we computed the following three parameters:

1) MAD, the mean absolute distance that measures the mean error in the segmentation:




  
    
      
        MAD
        =
        
          
            1
            k
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              k
            
            ⁢
            
              
                d
                ⁡
                
                  (
                  
                    
                      c
                      i
                    
                    ,
                    M
                  
                  )
                
              
              .
            
          
        
      
    
    
      
        (
        17
        )
      
    
  




2) MAXD, the maximum distance that measures the maximum error in segmentation:




  
    
      
        MAXD
        =
        
          
            max
            
              i
              ∈
              
                [
                
                  1
                  ,
                  k
                
                ]
              
            
          
          ⁢
          
            
              {
              
                d
                ⁡
                
                  (
                  
                    
                      c
                      i
                    
                    ,
                    M
                  
                  )
                
              
              }
            
            .
          
        
      
    
    
      
        (
        18
        )
      
    
  




3) PC, which is the percentage of vertices in C that have a distance to M less than 4 mm, evaluates the percentage of vertices in C considered to be very close to M. 4 mm, or 20 pixels, was used because previous studies showed that using an uncertainty of contouring less than 4 mm results in an impact on the dose that covers 90% of the target volume of less than 2%, and an impact on tumour control probability of less than 10%, which was not a significant impact on the implant dosimetry (Tong et al. 1998, Lindsay et al. 2003).




  
    
      
        PC
        =
        
          
            
              
                
                  
                    number
                    ⁢
                    
                      
                    
                    ⁢
                    of
                    ⁢
                    
                      
                    
                    ⁢
                    elements
                    ⁢
                    
                      
                    
                    ⁢
                    in
                  
                
              
              
                
                  
                    {
                    
                      
                        c
                        i
                      
                      ∈
                      
                        C
                        ⁢
                        
                          :
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          d
                          (
                          
                            
                              
                                c
                                i
                              
                              ⁢
                              
                                :
                              
                              ⁢
                              
                                
                              
                              ⁢
                              
                                d
                                ⁡
                                
                                  (
                                  
                                    
                                      c
                                      i
                                    
                                    ,
                                    M
                                  
                                  )
                                
                              
                            
                            ≤
                            
                              20
                              ⁢
                              
                                
                              
                              ⁢
                              pixels
                            
                          
                          }
                        
                      
                    
                  
                
              
            
            k
          
          ×
          100
          ⁢
          %
        
      
    
    
      
        (
        19
        )
      
    
  




In order to evaluate the performance of the semi-automatic version and the fully-automatic version of the proposed algorithm on all images, the average of MID, MAXD, PC, was calculated along with their standard deviation for the complete set of 51 images. For each image; two area-based metrics were used to compare the area enclosed by the algorithm-generated contour and the area enclosed by the manually generated contour (Ladak et al. 2003, Chiu et al. 2004, Nanayakkara et al. 2006). Let AC and AM be the area enclosed by the algorithm-generated contour and the manually-generated contour respectively, then we define the following:
1) AO is the percent area overlap, which measures the proportional area correctly identified by the algorithm:




  
    
      
        AO
        =
        
          
            
              
                A
                C
              
              ⋂
              
                A
                M
              
            
            
              A
              M
            
          
          ×
          100
          ⁢
          %
        
      
    
    
      
        (
        20
        )
      
    
  




2) AD is the area difference, which measures the proportional area falsely identified by the algorithm:




  
    
      
        AD
        =
        
          
            
              
              
                
                  A
                  C
                
                -
                
                  A
                  M
                
              
              
            
            
              A
              M
            
          
          ×
          100
          ⁢
          %
        
      
    
    
      
        (
        21
        )
      
    
  




In order to further evaluate the performance of the semi-automatic version and the fully-automatic version of the proposed algorithm on all images, the average of AO, AD was calculated along with their standard deviation for the complete set of 51 prostate images.
The initialization point for the same entire set of the 51 images analysed was fixed in table 3 to be the centre of the image. Table 4 shows the results of all the metrics described in section 3.3. The prostate images are tabulated in the same order as in table 3. Table 4 shows that the fully-automatic version of our proposed algorithm produced prostate boundaries with an average error of 0.82±0.4 mm, and an average maximum distance of 2.66±1.92 mm; over 99% of points within 4 mm from the manually generated contour. The resulting boundaries show an area overlap, AO, of 91.2% and an error, AD, of 7.09%.
The AO resulting from the semi-automatic version of our algorithm is 0.8% higher than AO produced by the fully-automatic version of our algorithm, and the AD resulting from the semi-automatic version of our algorithm is 1.4% higher than AD produced by the fully-automatic version of our algorithm. This demonstrates that the fully-automatic version of our proposed algorithm gave good results, very close to those obtained from the semi-automatic version.
The average run time for the present algorithm was approximately 10 seconds on a personal computer with a Pentium 4, 2.6 GHz, when implemented in Matlab. The time would be significantly reduced if the algorithm were implemented in C++.
The summary of the method described here is as follows:
A) A fully automated algorithm to select an object boundary.
B) A method for automatic object boundary segmentation using an image, comprising the steps of: acquiring a point at the approximate center in said image which is assumed to be the center of said object; filtering said image to identify said object edge candidates; length thresholding to remove false edges on said object boundary and keep as many true edges on said object boundary as possible; domain knowledge to remove any said object boundary candidates that are false edges and aid in identifying said object boundary; scanning of said image along radial lines keeping only first-detected said object boundary candidates; removal of remaining false edge pixels by fitting a polynomial to the said image points; generating an initial closed contour of said object's boundary using the Discrete Dynamic Contour (DDC) model.

C) The method of B), wherein said images are 2D TRUS, US, MRI and CT images of said object.

D) The method of B) and C), wherein no user selection of the said object center is needed since said object is typically centered at the approximate center of said ultrasound image.

E) The method of B) and C), wherein said filtering could be performed by and filtering system including but not limited to a Laplacian of Gaussian (LOG) filter and/or zero-crossing filtering.

F) The method of B) and C), wherein polynomial fitting removes the point with the maximum distance from the fit, and repeats the process until this maximum distance is less than 4 mm.

G) The method of A), wherein the use of pixels as initial points are used to generate an initial boundary which is deformed in a DDC model to obtain a closed contour of said object's boundary.

H) The method of A) and B), wherein said object is the prostate.

I) The method of H), wherein said domain knowledge includes; the inside of the prostate gland being typically darker than the outside, the inside of the prostate gland being typically smoother than the outside and an average prostate in patients undergoing a brachytherapy procedure being approximately 3 cm in width and 2.8 cm in height.

J) The method of claim H) and I), wherein since the average width and height of the prostate are known a circular or elliptical shape of the prostate in the 2D ultrasound image can be assumed, in which the boundary should be found between two distances that encompasses the mean size of the prostate.

K) A method for initializing a DDC model to obtain a closed contour of said object's boundary, comprising the steps of: acquiring a point at the center in said image which is assumed to be the approximate center of said object; filtering said image to identify said object edge candidates; length thresholding to remove false edges on said object boundary and keep as many true edges on said object boundary as possible; domain knowledge to remove any said object boundary candidates that are false edges and aid in identifying said object boundary; scanning of said image along radial lines keeping only first-detected said object boundary candidates; removal of remaining false edge pixels by fitting a polynomial to the said image points; generating an initial closed contour of said object's boundary using the Discrete Dynamic Contour (DDC) model.











TABLE 1







Mean maximum gap



αT
Mean # of clusters on
between clusters on
Mean # of clusters


value
prostate boundary
boundary (degrees)
off boundary


















0.001
8
15.3
19


0.003
9
14.7
18


0.005
8
14.0
18


0.008
8
13.7
21


0.01
8
13.7
20


0.03
6 large clusters
13.5
21


0.05
5 large clusters
13.5
24



















TABLE 2







Mean maximum 



αF
Mean # of clusters on
gap between
Mean # of clusters


value
prostate boundary
clusters (degrees)
off boundary


















0.001
13
60.3
7


0.003
18
59.4
8


0.005
17
59.2
10


0.008
17
58.8
11


0.01
16
58.6
12


0.03
23
53.9
20


0.05
21
51.9
26























TABLE 3





Prostate Image
MAD
MAD
MAXD
MAXD
PC
AD
AO


number
(pixels)
(mm)
(pixels)
(mm)
(%)
(%)
(%)






















1
3.2
0.6
9.5
1.9
100
7.0
91.7


2
2.9
0.6
9.0
1.8
100
4.2
93.5


3
2.2
0.5
6.9
1.4
100
2.9
95.4


4
2.1
0.4
9.0
1.8
100
2.4
95.0


5
2.4
0.5
5.4
1.1
100
3.3
94.7


6
2.5
0.5
7.8
1.6
100
0.1
95.9


7
1.6
0.3
5.0
1.0
100
1.7
96.0


8
4.3
0.9
15.3
3.1
100
9.2
88.1


9
7.7
1.5
26.3
5.3
94
6.0
85.1


10
2.8
0.6
9.7
1.9
100
5.3
92.8


11
6.6
1.3
18.3
3.7
100
13.8
83.6


12
4.7
1.0
16.0
3.2
100
5.0
92.0


13
3.6
0.7
15.6
3.1
100
6.1
91.4


14
2.5
0.5
6.7
1.3
100
4.3
94.0


15
2.7
0.6
8.5
1.7
100
1.2
96.3


16
3.1
0.6
10.3
2.1
100
4.5
93.1


17
2.9
0.6
7.5
1.5
100
6.0
93.2


18
2.5
0.5
7.8
1.6
100
3.4
94.6


19
1.9
0.4
8.0
1.6
100
1.5
96.9


20
3.2
0.6
11.7
2.3
100
0.4
95.4


21
3.7
0.8
11.9
2.4
100
2.4
92.8


22
4.2
0.8
14.4
2.9
100
2.0
93.7


23
2.8
0.6
6.8
1.4
100
6.9
92.4


24
2.7
0.5
7.5
1.5
100
2.7
94.7


25
4.9
1.0
11.9
2.4
100
9.0
88.3


26
3.4
0.7
11.1
2.2
100
5.4
92.3


27
4.4
0.9
10.8
2.2
100
11.1
88.8


28
2.0
0.4
6.4
1.3
100
3.0
95.5


29
4.0
0.8
16.4
3.3
100
6.7
90.9


30
3.1
0.6
15.8
3.2
100
5.8
92.7


31
3.0
0.6
11.3
2.3
100
0.3
96.0


32
2.2
0.4
7.0
1.4
100
0.7
96.5


33
2.2
0.4
6.4
1.3
100
1.5
96.3


34
3.5
0.7
21.0
4.2
99.1
2.7
94.3


35
3.1
0.6
15.0
3.0
100
1.6
94.7


36
3.7
0.7
13.1
2.6
100
5.6
93.3


37
3.9
0.8
10.4
2.1
100
3.8
92.2


38
3.5
0.7
12.4
2.5
100
10.1
89.6


39
7.8
1.6
35.4
7.1
86.9
15.6
82.5


40
4.7
0.9
9.7
1.9
100
13.4
86.5


41
5.7
1.1
15.9
3.2
100
12.6
87.2


42
3.8
0.8
14.1
2.8
100
10.4
89.3


43
4.3
0.9
18.3
3.7
100
11.6
87.5


44
1.6
0.3
4.8
1.0
100
2.9
96.1


45
4.2
0.9
13.7
2.7
100
11.9
87.3


46
3.4
0.7
12.8
2.6
100
8.8
89.4


47
3.7
0.7
10.6
2.1
100
8.6
89.8


48
1.9
0.4
8.4
1.7
100
2.1
95.3


49
4.5
0.9
14.6
2.9
100
12.9
86.5


50
3.3
0.7
11.7
2.3
100
9.7
90.0


51
2.4
0.5
8.1
1.6
100
0.8
94.4


Mean
3.5
0.7
11.8
2.4
99.6
5.7
92.1


Standard
1.4
0.3
5.5
1.1
2
4.2
3.6


Deviation























TABLE 4





Prostate Image
MAD
MAD
MAXD
MAXD
PC
AD
AO


(number)
(pixels)
(mm)
(pixels) 
(mm)
(%)
(%)
(%)






















1
3.1
0.6
8.0
1.6
100
8.2
91.5


2
3.6
0.7
9.0
1.8
100
3.7
92.6


3
2.1
0.4
6.8
1.4
100
2.8
95.3


4
2.4
0.5
9.9
2.0
100
0.1
96.2


5
2.2
0.4
4.7
0.9
100
3.0
95.0


6
2.0
0.4
6.5
1.3
100
0.9
96.4


7
1.9
0.4
5.5
1.1
100
0.5
96.3


8
4.0
0.8
13.7
2.7
100
9.2
88.9


9
5.8
1.2
15.5
3.1
100
7.3
85.9


10
3.7
0.7
9.6
1.9
100
8.9
89.6


11
7.0
1.4
23.3
4.7
98.5
5.6
85.8


12
4.7
0.9
13.0
2.6
100
3.3
90.6


13
4.5
0.9
16.0
3.2
100
8.3
89.4


14
3.8
0.8
8.9
1.8
100
6.6
91.3


15
3.8
0.8
9.5
1.9
100
2.3
93.8


16
2.3
0.5
9.0
1.8
100
4.7
94.8


17
10.5
2.1
47.8
9.6
77.9
19.8
78.7


18
7.3
1.5
30.0
6.0
84
15.6
83.5


19
2.8
0.6
8.2
1.6
100
4.9
94.3


20
3.9
0.8
15.6
3.1
100
0.1
93.9


21
2.8
0.6
7.9
1.6
100
2.0
94.3


22
4.7
0.9
14.2
2.8
100
3.5
92.4


23
4.4
0.9
10.9
2.2
100
4.3
95.8


24
3.1
0.6
8.2
1.6
100
0.1
95.2


25
6.0
1.2
13.4
2.7
100
10.8
86.1


26
3.9
0.8
11.0
2.2
100
4.4
92.1


27
4.3
0.9
10.6
2.1
100
10.9
89.0


28
1.8
0.4
4.4
0.9
100
0.6
96.7


29
5.0
1.0
17.6
3.5
100
5.9
89.7


30
4.1
0.8
17.8
3.6
100
9.9
89.6


31
2.6
0.5
10.8
2.2
100
0.8
97.3


32
2.4
0.5
6.6
1.3
100
0.3
96.6


33
2.5
0.5
8.2
1.6
100
0.9
96.5


34
1.9
0.4
5.6
1.1
100
0.4
97.7


35
2.0
0.4
7.0
1.4
100
2.5
98.3


36
3.1
0.6
8.6
1.7
100
2.2
95.8


37
2.9
0.6
7.7
1.5
100
4.9
93.3


38
9.3
1.9
46.2
9.2
84.8
22.4
77.5


39
5.5
1.1
10.8
2.2
100
16.0
84.0


40
4.3
0.9
14.0
2.8
100
8.7
89.6


41
3.2
0.6
11.3
2.3
100
8.0
91.7


42
6.0
1.2
13.2
2.6
100
3.8
91.2


43
5.1
1.0
16.0
3.2
100
14.5
85.1


44
9.7
1.9
18.1
3.6
100
0.6
80.1


45
5.7
1.1
17.7
3.5
100
15.8
83.2


46
3.0
0.6
8.6
1.7
100
27.3
90.7


47
5.1
1.0
13.5
2.7
100
12.8
85.8


48
7.0
1.4
44.3
8.9
87.6
29.1
97.1


49
2.8
0.6
7.1
1.4
100
8.5
91.5


50
3.0
0.6
12.3
2.5
100
8.0
91.0


51
2.2
0.4
6.2
1.2
100
1.9
94.5


Mean
4.1
0.8
13.3
2.7
98.7
7.1
91.2


standard
2.0
0.4
9.6
1.9
4.57
6.9
5.1


deviation

## Claims

1. A method for automatic boundary segmentation of an object in a medical image, comprising the steps of:
determining a point indicating a center or an approximate center of an object in a medical image displayed on a display;
applying a filter to the medical image so as to determine candidate pixels as edge pixels indicating a boundary of the object;
removing linked candidate pixels, a length of the linked candidate pixels being shorter than a predetermined threshold;
determining a pixel among the candidate pixels as a false edge of the boundary of the object by using domain knowledge and removing the candidate pixel determined as the false edge, wherein the determining is based on a probability that the candidate pixel indicates part of the boundary of the object, wherein the probability is determined based on a combination of the following:
a contrast membership function;
a domain membership function; and
a texture membership function;

identifying candidate pixels which are first detected when the medical image is scanned along each radial direction from the center as the remaining candidate pixels;
removing a candidate pixel from the remaining candidate pixels by fitting a polynomial to the remaining candidate pixels;
generating a closed contour as the boundary of the object by applying a Discrete Dynamic Contour (DDC) model to the remaining candidate pixels other than the candidate pixels removed by fitting a polynomial to the remaining candidate pixels; and
displaying the closed contour on the display.

2. The method according to claim 1, wherein the medical image is one of a two dimensional TRUS image, a two dimensional ultrasound image, a two dimensional MR image and a two dimensional X-ray CT image of the object.

3. The method according to claim 1, wherein the medical image is filtered by convolving the medical image with a Gaussian filter or a zero-crossing filter.

4. The method according to claim 3, wherein the medical image filtered with the Gaussian filter is filtered by convolving the medical image filtered with the Gaussian filter with a Laplacian filter.

5. The method according to claim 1, wherein the medical image is filtered by convolving the medical image with a convolution of a Gaussian filter or a zero-crossing filter and a Laplacian filter.

6. The method according to claim 1, wherein the step of removing a candidate pixel from the remaining candidate pixels by fitting a polynomial to the remaining candidate pixels comprises the steps of:
(a) determining an order of a polynomial;
(b) fitting the polynomial to the remaining candidate pixels and removing a candidate pixel at a point having a maximum distance from a fit between the polynomial having the order determined in the step (a) and the remaining candidate pixels; and
(c) if the maximum distance is equal or more than a predetermined value, changing an order of a polynomial to be fitted to the remaining candidate pixels;
(d) fitting the polynomial having the order changed in the step (c) to the remaining candidate pixels and removing a candidate pixel at a point having a maximum distance from a fit between the polynomial having the order changed in the step (c) and the remaining candidate pixels; and
(e) repeating the steps (c) and (d) until the maximum distance is less than the predetermined value.

7. The method according to claim 1, wherein the remaining candidate pixels other than the candidate pixels removed by fitting a polynomial to the remaining candidate pixels are used as initial points to generate an initial boundary which is deformed in a DDC model to obtain a closed contour of said object's boundary.

8. The method according to claim 1, wherein the object is a prostate.

9. The method according to claim 8, wherein the domain knowledge includes at least one of
an inside of a prostate gland being darker than an outside of the prostate gland, the inside of the prostate gland being smoother than the outside of the prostate gland, and
a size of the prostate being approximately 3 cm in width and 2.8 cm in height if a subject of the medical image is in a therapeutic procedure.

10. The method according to claim 8, wherein the domain knowledge includes at least one of
an inside of a prostate gland being darker than an outside of the prostate gland, the inside of the prostate gland being smoother than the outside of the prostate gland, and
a size of the prostate being approximately 3 cm in width and 2.8 cm in height if a subject of the medical image is in a diagnostic procedure.

11. The method according to claim 8, wherein the domain knowledge includes the boundary of the prostate being within a substantially circular or substantially elliptical shape, the prostrate having a width equal or less than 3 cm and a height equal or less than 2.8 cm.

12. A non-transitory machine-readable medium storing a computer program for automatic boundary segmentation of an object in a medical image, the computer program comprising the steps of:
determining a point indicating a center or an approximate center of an object in a medical image displayed on a display;
applying a filter to the medical image so as to determine candidate pixels as edge pixels indicating a boundary of the object;
removing linked candidate pixels, a length of the linked candidate pixels being shorter than a predetermined threshold;
determining a pixel among the candidate pixels as a false edge of the boundary of the object by using domain knowledge and removing the candidate pixel determined as the false edge, wherein the determining is based on a probability that the candidate pixel indicates part of the boundary of the object, wherein the probability is determined based on a combination of the following:
a contrast membership function;
a domain membership function; and
a texture membership function;

identifying candidate pixels which are first detected when the medical image is scanned along each radial direction from the center as the remaining candidate pixels;
removing a candidate pixel from the remaining candidate pixels by fitting a polynomial to the remaining candidate pixels;
generating a closed contour as the boundary of the object by applying a Discrete Dynamic Contour (DDC) model to the remaining candidate pixels other than the candidate pixels removed by fitting a polynomial to the remaining candidate pixels; and
displaying the closed contour on the display.

13. The machine-readable medium according to claim 12, wherein the medical image is one of a two dimensional TRUS image, a two dimensional ultrasound image, a two dimensional MR image and a two dimensional X-ray CT image of the object.

14. The machine-readable medium according to claim 12, wherein the medical image is filtered by convolving the medical image with a Gaussian filter or a zero-crossing filter.

15. The machine-readable medium according to claim 14, wherein the medical image filtered with the Gaussian filter is filtered by convolving the medical image filtered with the Gaussian filter with a Laplacian filter.

16. The machine-readable medium according to claim 12, wherein the medical image is filtered by convolving the medical image with a convolution of a Gaussian filter or a zero-crossing filter and a Laplacian filter.

17. The machine-readable medium according to claim 12, wherein the step of removing a candidate pixel from the remaining candidate pixels by fitting a polynomial to the remaining candidate pixels comprises the steps of:
(a) determining an order of a polynomial;
(b) fitting the polynomial to the remaining candidate pixels and removing a candidate pixel at a point having a maximum distance from a fit between the polynomial having the order determined in the step (a) and the remaining candidate pixels; and
(c) if the maximum distance is equal or more than a predetermined value, changing an order of a polynomial to be fitted to the remaining candidate pixels;
(d) fitting the polynomial having the order changed in the step (c) to the remaining candidate pixels and removing a candidate pixel at a point having a maximum distance from a fit between the polynomial having the order changed in the step (c) and the remaining candidate pixels; and
(e) repeating the steps (c) and (d) until the maximum distance is less than the predetermined value.

18. The machine-readable medium according to claim 12, wherein the remaining candidate pixels other than the candidate pixels removed by fitting a polynomial to the remaining candidate pixels are used as initial points to generate an initial boundary which is deformed in a DDC model to obtain a closed contour of said object's boundary.

19. The machine-readable medium according to claim 12, wherein the object is a prostate.

20. The machine-readable medium according to claim 19, wherein the domain knowledge includes at least one of
an inside of a prostate gland being darker than an outside of the prostate gland, the inside of the prostate gland being smoother than the outside of the prostate gland, and
a size of the prostate being approximately 3 cm in width and 2.8 cm in height if a subject of the medical image is in a therapeutic procedure.

21. The machine-readable medium according to claim 19, wherein the domain knowledge includes at least one of
an inside of a prostate gland being darker than an outside of the prostate gland, the inside of the prostate gland being smoother than the outside of the prostate gland, and
a size of the prostate being approximately 3 cm in width and 2.8 cm in height if a subject of the medical image is in a diagnostic procedure.

22. The machine-readable medium according to claim 19, wherein the domain knowledge includes the boundary of the prostate being within a substantially circular or substantially elliptical shape, the prostrate having a width equal or less than 3 cm and a height equal or less than 2.8 cm.

23. A method for automatic boundary segmentation of an object in a medical image, the method comprising:
applying a Gaussian filter and a Laplacian filter to the medical image to identify a first set of pixels in the medical image, wherein each of the identified first set of pixels indicates a potential boundary of the object;
removing a first one of the first set of identified pixels to derive a second set of identified pixels if the first one of the first set of identified pixels is part of a group of linked pixels which includes less than a predetermined number of pixels;
utilizing domain knowledge to determine a probability that a first one of the second set of identified pixels indicates part of the boundary of the object, wherein the probability is determined based on a combination of the following:
a contrast membership function;
a domain membership function; and
a texture membership function;

removing the first one of the second set of identified pixels to derive a third set of identified pixels if the determined probability for the first one of the second set of identified pixels is below a predetermined threshold;
removing a first one of the third set of identified pixels to derive a fourth set of identified pixels if the first one of the third set of identified pixels is more than a predetermined distance from a curve described by a polynomial, wherein the curve indicates the potential boundary of the object; and
applying a discrete dynamic contour model to the fourth set of identified pixels.