Patent Publication Number: US-2023154610-A1

Title: Task interaction netwrok for prostate cancer diagnosis

Description:
COPYRIGHT NOTICE 
     A portion of the disclosure of this patent document contains material, which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever. 
     FIELD OF THE INVENTION 
     The present invention generally relates to machine learning prostate cancer diagnosis, more specifically, a task-interaction network (TI-Net) for prostate cancer diagnosis based on multi parametric-magnetic resonance imaging (mp-MRI) scan images. 
     BACKGROUND OF THE INVENTION 
     Prostate cancer is the most commonly diagnosed cancer and the second leading cause of cancer death among men. Early detection, diagnosis and treatment can improve the survival rate of patients. Multi-parametric MRI (mp-MRI) is one of the widely applied techniques for prostate cancer detection and risk assessment. However, interpreting mp-MRI sequences manually requires substantial expertise and labor from radiologists, and usually results in low sensitivity and specificity. Some existing technologies have been adopted to provide automatic prediction and diagnosis of prostate cancer by exploiting multiple networks to predict the aggressiveness and locations of prostate cancer lesion based on mp-MRI scans. However, these technologies consider these multiple tasks individually and ignore their complementary information, leading to limited performance and high overhead on run time. 
     SUMMARY OF THE INVENTION 
     The present invention provides a machine-learning task interaction network (TI-Net) which can assist radiologists to diagnose prostate cancer for patients based on multi parametric-magnetic resonance imaging (mp-MRI) scan images which include at least two types of MRI slides corresponding to two commonly used modalities respectively. In practice, it also can provide diagnosis reference for radiologists when the disease of patients is complicated. This invention can be applied into clinical scenarios to accelerate the time of disease diagnosis 
     According to one aspect of the present invention, a task-interaction network is provided for jointly performing a segmentation task to locate prostate cancer areas and a classification task to assess aggressiveness of lesions based on a multi parametric-magnetic resonance imaging (mp-MRI) scan image in terms of a plurality of defined categories, the TI-Net comprising: a backbone network configured to extract an initial discriminative feature representation from an aligned and concatenated first and second type MRI slices of the mp-MRI scan image; an auxiliary segmentation branch configured to generate an initial probability map and predict an initial lesion mask based on the initial discriminative feature representation; a classification branch configured to determine a plurality of category prototypes corresponding to the plurality of defined categories respectively and predict a lesion aggressiveness based on the initial discriminative feature representation, the plurality of category prototypes and the initial lesion mask; and a main segmentation branch configured to predict a lesion location based on the initial discriminative feature representation, the plurality of category prototypes and the predicted lesion aggressiveness. 
     According to another aspect of the present invention, a method using the task-interaction network (TI-Net) is provided for jointly performing a segmentation task to locate prostate cancer areas and a classification task to assess aggressiveness of lesions based on a multi parametric-magnetic resonance imaging (mp-MRI) scan image in terms of a plurality of defined categories. The method comprising: extracting, by the backbone network, an initial discriminative feature representation from an aligned and concatenated first and second type MRI slices of the mp-MRI scan image; generating, by a probability mapping module in the auxiliary segmentation branch, an initial probability map based on the initial discriminative feature representation; performing, by an auxiliary segmentation module in the auxiliary segmentation branch, a softmax operation on the initial probability map to obtain an initial lesion mask; generating, by a lesion awareness module in the classification branch, a refined discriminative feature representation based on the initial lesion mask and the initial discriminative feature representation; determining, by a prototyping module in the classification branch, a plurality of category prototypes corresponding to the plurality of defined categories respectively; predicting, by a classification module in the classification branch, a lesion aggressiveness based on the refined discriminative feature representation and the plurality of category prototypes; generating, by a category allocation module in the main segmentation branch, a hybrid feature representation based on the initial discriminative feature representation, the plurality of category prototypes and the predicted lesion aggressiveness; and predicting, by a main segmentation module in the main segmentation branch, a lesion location based on the hybrid feature representation. 
     The auxiliary segmentation branch is utilized to predict an initial lesion mask as location guidance information for the classification branch to perform the classification task. The lesion awareness module is configured to refine the initial lesion mask to make it more accurate. Moreover, the weights used in classification branch can serve as the category prototypes for generating category guidance features via the category allocation module to assist the main segmentation branch to perform the segmentation task. For training the TI-Net, a consistency loss is optimized to enhance the mutual guidance among these two tasks and guarantee the consistency of the predictions. 
     Compared with existing technologies the present invention has the faster diagnosis speed as multiple tasks can be completed simultaneously via the TI-Net. The present invention is easier to be deployed in computer-aided design (CAD) system and does not require complicated hardware for implementation. Because the segmentation and classification tasks are highly related and provide complementary information for each other, the present invention can conduct deep task interaction and guarantee the prediction consistency of the two tasks while leveraging complementary information between the two modalities, thus improve diagnosis accuracy of prostate cancer detection which is very significant in practically clinical diagnosis. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       Embodiments of the invention are described in more detail hereinafter with reference to the drawings, in which: 
         FIG.  1    depicts a block diagram of a task-interaction network (TI-Net) according to one embodiment of the present invention; 
         FIG.  2    depicts an arrangement for training a task-interaction network according to one embodiment of the present invention; 
         FIG.  3    depicts operation of a lesion awareness module according to one embodiment of the present invention; 
         FIG.  4    depicts operation of a category allocation module according to one embodiment of the present invention; 
         FIG.  5    depicts workflow of a method using a task-interaction network to provide prostate cancer diagnosis according to one embodiment of the present invention; and 
         FIG.  6    is a block diagram of an exemplary hardware system for training and deploying a task-interaction network according to one embodiment of the present invention. 
     
    
    
     DETAILED DESCRIPTION 
     In the following description, exemplary embodiments of the present invention are set forth as preferred examples. It will be apparent to those skilled in the art that modifications, including additions and/or substitutions may be made without departing from the scope and spirit of the invention. Specific details may be omitted so as not to obscure the invention; however, the disclosure is written to enable one skilled in the art to practice the teachings herein without undue experimentation. 
       FIG.  1    shows a block diagram of a task-interaction network (TI-Net)  100  according to one embodiment of the present invention. As shown, the TI-Net  100  may comprise a backbone network  110 , an auxiliary segmentation branch  120 , a classification branch  130  and a main segmentation branch  140 . The auxiliary segmentation branch  120  may include a probability mapping module  122  and an auxiliary segmentation module  124 . The classification branch  130  may include a lesion awareness module  132 , a prototyping module  134  and a classification module  136 . The main segmentation branch  140  may include a category allocation module  142  and a main segmentation module  144 . 
     The backbone network  110  may be a dilated convolution (atrous convolution) network such as DeeplabV3+ with Xception as encoder. The output stride of the backbone network may be set to 8. The main segmentation, auxiliary segmentation and classification branches share the first  20  blocks of convolution layers of the backbone network. 
     The probability mapping module  122  may consist of three convolutional layers. The first two layers are configured for providing non-linear mapping in feature extraction and the third layer is configured for batch normalization and dropout. 
     The TI-Net  100  may be trained and configured to jointly segment prostate cancer areas and assess aggressiveness of lesions from a multi parametric-magnetic resonance imaging (mp-MRI) scan image of a patient in terms of a plurality of defined categories. The mp-MRI scan image may include at least two types of MRI slides corresponding to two commonly used modalities respectively. The two commonly used modalities may provide correlated and complementary information to each other. In some embodiments, the two commonly used modalities may include T2-weight (T2w) and apparent diffusion coefficient (ADC). 
       FIG.  2    shows an arrangement for training the TI-Net  100  using a training dataset of mp-MRI scan images categorized in terms of a plurality of categories of prostate cancer. The training dataset of mp-MRI scans are prepared such that each mp-MRI scan has at least a first type MRI slide and a second type MRI slide corresponding to two commonly used modalities respectively. By way of example, the first type MRI slice is a T2w MRI slice and the second type MRI slice is an ADC MRI slice. There are five categories of prostate cancer defined as: 
     Grade Group 1 (Gleason score &lt;6): Only individual discrete well-formed glands; 
     Grade Group 2 (Gleason score 3+4=7): Predominantly well-formed glands with lesser component of poorly-formed/fused/cribriform glands; 
     Grade Group 3 (Gleason score 4+3=7): Predominantly poorly formed/fused/cribriform glands with lesser component of well-formed glands; 
     Grade Group 4 (Gleason score 4+4=8; 3+5=8; 5+3=8): (1) Only poorly-formed/fused/cribriform glands or (2) predominantly well-formed glands and lesser component lacking glands or (3) predominantly lacking glands and lesser component of well-formed glands; and 
     Grade Group 5 (Gleason scores 9-10): Lacks gland formation (or with necrosis) with or without poorly formed/fused/cribriform glands. 
     The training dataset of mp-MRI scan images are preprocessed by registering the first type MRI slice with the second type MRI slice via non-rigid registration based on mutual information of the first and second type MRI slices; normalizing intensity of the first and second type MRI slices with zero mean and unit variance; center-cropping and resizing the first and second type MRI slices in an axial plane to reduce noisy from irrelevant information; and spatially aligning and concatenating the first and second type MRI slices. The aligned and concatenated first and second type MRI slices X are then fed into the TI-Net for training. 
     Referring to  FIG.  2   , the backbone network  110  may be configured and trained to extract an initial discriminative feature representation F from each pair of aligned and concatenated first and second type MRI slices X. 
     The auxiliary segmentation branch  120  may be configured and trained to generate an initial probability map M 0  and predict an initial lesion mask A 0  based on the initial discriminative feature representation F 0 . In particular, the probability mapping module  122  may be configured and trained to generate the initial probability map M 0  based on the initial discriminative feature representation F 0 . The auxiliary segmentation module  124  may be configured and trained to perform a softmax operation on the initial probability map M 0  to obtain the initial lesion mask A 0 . 
     The classification branch  130  may be configured and trained to determine C category prototypes Q corresponding to the C categories respectively and predict a lesion aggressiveness P based on the initial discriminative feature representation F 0 , the C category prototypes Q and the initial lesion mask A 0 . 
     In particular, the lesion awareness module  132  may be configured and trained to generate a refined discriminative feature representation F r  based on the initial lesion mask A 0  and the initial discriminative feature representation F 0 ; the prototyping module  134  may be configured and trained to determine the C category prototypes Q corresponding to the C defined categories respectively; and the classification module  136  may be configured and trained to predict the lesion aggressiveness P based on the refined discriminative feature representation F r  and the C category prototypes Q. 
     Referring to  FIG.  3   , the lesion awareness module  132  may be configured and trained to divide the initial discriminative feature representation F 0  into a foreground feature representation F 1  and a background feature representation F 2  based on the initial lesion mask; obtain an aggregated foreground similarity map A 1  based on the foreground feature representation F 1 ; obtain an aggregated background similarity map A 2  based on the background feature representation F 2 ; refine the initial lesion mask A 0  by adding the aggregated foreground similarity map A 1  to and erasing the aggregated background similarity map A 2  from the initial lesion mask A 0  to obtain a refined lesion mask A (that is, A=A 0 +A 1 −A 2 ); and multiply the refined lesion mask A with the initial discriminative feature representation F 0  to obtain the refined discriminative feature representation F r  (that is, F r =F 0 ·A). 
     Preferably, the lesion awareness module  132  may be further configured and trained to index a K number of high-confidence foreground pixels in the foreground feature representation F 1  based on the initial probability map M 0 ; use each indexed foreground pixel to compute a cosine similarity with the background feature representation F 2  to obtain a K number of the foreground similarity maps; and fuse the K number of foreground similarity maps to obtain the aggregated foreground similarity map A 1 . 
     Preferably, the lesion awareness module 132  may be further configured and trained to index a K number of high-confidence background pixels in the background feature representation F 2  based on the initial probability map M 0 ; use each indexed background pixel to compute a cosine similarity with the foreground feature representation F 1  to obtain a K number of background similarity maps; and fuse the K number of background similarity maps to obtain the aggregated background similarity map A 2 . 
     Referring back to  FIG.  2   , the main segmentation branch  140  may be configured and trained to predict a lesion location S based on the initial discriminative feature representation F 0 , the C category prototypes Q and the predicted lesion aggressiveness P. 
     In particular, the category allocation module  142  may be configured and trained to generate a hybrid feature representation F h  based on the initial discriminative feature representation F 0 , the C category prototypes Q and the predicted lesion aggressiveness P; and the main segmentation module  144  may be configured and trained to predict the lesion location S based on the hybrid feature representation F h . 
     Referring to  FIG.  4   , the category allocation module  142  may be configured and trained to expand the predicted lesion aggressiveness P to obtain a refined probability map M; transform the initial discriminative feature representation F 0  and the C category prototypes Q to have a same channel number; compute cosine similarity for each of the C transformed category prototypes Q with respect to the transformed discriminative feature representation F 0  to obtain C discriminative feature similarity maps; pass the C discriminative feature similarity maps through a softmax function with a temperature T to obtain C similarity values, where T is a hyper-parameter; compute a category-guided pixel-level feature representation for each pixel of the scan image by fusing the C category prototypes Q using the C similarity values as weights; integrate category-guided pixel-level feature representations for all pixels of the scan image into the initial discriminative feature representation F 0  to obtain a category-guided feature representation F c ; concatenate the initial discriminative feature representation F 0  and the category-guided feature representation F c  with the refined probability map M to form a concatenated feature representation; and hybridize the concatenated feature representation to obtain the hybrid feature representation F h . 
     The training of the classification branch and backbone network may be supervised with a multi-label loss function such that parameters in the backbone network and the classification branch can be updated through optimizing the multi-label loss function. 
     The multi-label loss function may be defined as: 
     
       
         
           
             
               L 
               1 
             
             = 
             
               
                 
                   - 
                   
                     1 
                     N 
                   
                 
                 ⁢ 
                 
                   Σ 
                   
                     i 
                     = 
                     1 
                   
                   N 
                 
                 ⁢ 
                 
                   Σ 
                   
                     c 
                     = 
                     0 
                   
                   C 
                 
                 ⁢ 
                 
                   y 
                   i 
                   c 
                 
                 ⁢ 
                 log 
                 ⁢ 
                 
                   
                     y 
                     ˆ 
                   
                   i 
                   c 
                 
               
               + 
               
                 
                   ( 
                   
                     1 
                     - 
                     
                       y 
                       i 
                       c 
                     
                   
                   ) 
                 
                 ⁢ 
                 
                   log 
                   ⁡ 
                   ( 
                   
                     1 
                     - 
                     
                       
                         y 
                         ˆ 
                       
                       i 
                       c 
                     
                   
                   ) 
                 
               
             
           
         
       
     
     where L 1  is the multi-lable loss, N is the number of training samples, C is the number of categories, y i   c  and ŷ i   c  are the prediction probability value and ground-truth value of i-th sample corresponding to c-th category respectively. 
     The training of the main segmentation branch and auxiliary segmentation branch may be supervised with a standard dice loss function such that parameters in the main segmentation branch and the auxiliary segmentation branch can be updated through optimizing the standard dice loss function. 
     The standard dice loss function may be defined as: 
     
       
         
           
             
               
                 L 
                 2 
               
               = 
               
                 
                   2 
                   ⁢ 
                   T 
                   ⁢ 
                   P 
                 
                 
                   
                     2 
                     ⁢ 
                     T 
                     ⁢ 
                     P 
                   
                   + 
                   
                     F 
                     ⁢ 
                     P 
                   
                   + 
                   
                     F 
                     ⁢ 
                     N 
                   
                 
               
             
             , 
           
         
       
     
     where L 2  is the standard dice loss, TP is the number of true positives, FP is the number of false positives and FN is the numbers of false negatives. 
     The consistency between the lesion aggressiveness predictions P provided by the classification branch and the lesion location predictions S provided by the segmentation branch may be restrained with a mean squared error (MSE) loss function defined as: 
     
       
         
           
             
               
                 L 
                 3 
               
               = 
               
                 
                   1 
                   
                     2 
                     ⁢ 
                     N 
                   
                 
                 ⁢ 
                 
                   Σ 
                   
                     i 
                     = 
                     1 
                   
                   N 
                 
                 ⁢ 
                 
                   
                      
                     
                       P 
                       - 
                       S 
                     
                      
                   
                   2 
                 
               
             
             , 
           
         
       
     
     such that parameters in TI-Net may be updated jointly through optimizing the MSE loss function. In some embodiments, if P and S are not compatible, S may be first transformed into the same size with P by the average operation on the mask of each class before being evaluated with the MSE loss function. 
     By way of example, if the aggressiveness prediction shows Gleason score (GS) grading of a patient is normal (Gleason score &lt;6) and there is no lesion area in output of segmentation branch, the patient should be health. If the aggressiveness prediction for a patient belongs to Grade Group 2-5 and the segmentation branch also illustrates that the corresponding lesion areas is same group, the diagnosis result obtained by the trained TI-Net for this patient will be confident. When the predictions of classification and segmentation branches are inconsistent, assistance of radiologists may be required to further analyze the patient&#39;s condition by refereeing to the predictions of two branches. 
       FIG.  5    shows workflow of a method using a TI-Net for jointly segmenting prostate cancer areas and assessing aggressiveness of lesions from a multi parametric-magnetic resonance imaging (mp-MRI) scan image in terms of a plurality of defined categories. As shown, the method may include a feature extraction stage S 510 , an auxiliary segmentation stage S 520 , a classification stage S 530  and a main segmentation stage S 540 . 
     The feature extraction stage S 510  include a step of extracting, by a backbone network of the TI-Net, an initial discriminative feature representation from an aligned and concatenated first and second type MRI slices of the mp-MRI scan image; 
     The auxiliary segmentation stage S 520  includes: 
     Step S 522 : generating, by a probability mapping module in an auxiliary segmentation branch of the TI-Net, an initial probability map based on the initial discriminative feature representation; and 
     Step S 524 : performing, by an auxiliary segmentation module in the auxiliary segmentation branch, a softmax operation on the initial probability map to obtain an initial lesion mask; 
     The classification stage S 530  includes: 
     Step S 532 : generating, by a lesion awareness module in a classification branch of the TI-Net, a refined discriminative feature representation based on the initial lesion mask and the initial discriminative feature representation; 
     Step S 534 : determining, by a prototyping module in the classification branch, a plurality of category prototypes corresponding to the plurality of defined categories respectively; and 
     Step S 536 : predicting, by a classification module in the classification branch, a lesion aggressiveness based on the refined discriminative feature representation; 
     The main segmentation stage S 540  includes: 
     Step S 542 : generating, by a category allocation module in a main segmentation branch of the TI-Net, a hybrid feature representation based on the initial discriminative feature representation, the plurality of category prototypes and the predicted lesion aggressiveness; and 
     Step S 544 : predicting, by a main segmentation module in the main segmentation branch, a lesion location based on the hybrid feature representation. 
     In some embodiments, to accelerate inference of network, a mixed-precision strategy may be introduced into the TI-Net. First, the input of prostate areas is scaled into half-precision floating point format (FP16). Therefore, the output of network is also half-precision, which is scaled back into single precision (FP32) to obtain final prediction. This strategy not only can reduce the demand on hardware memory, but also speed up the computation. 
       FIG.  6    is a block diagram of an exemplary system  600  for training and deploying a TI-Net according to one embodiment of the present invention. The system  600  can be any suitable computer-aided design (CAD) system. The system  600  may include at least one receiving module  602  configured for receiving or recording mp-MRI scans of a prostate of a patient. 
     The system  600  may further include a processor  604  which may be a CPU, an MCU, application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or any suitable programmable logic devices configured or programmed to be a processor for preprocessing the mp-MRI scans, training and deploying the TI-Net according to the teachings of the present disclosure. 
     The device  600  may further include a memory unit  606  which may include a volatile memory unit (such as RAM), a non-volatile unit (such as ROM, EPROM, EEPROM and flash memory) or both, or any type of media or devices suitable for storing instructions, codes, and/or data. 
     Preferably, the system  600  may further include one or more input devices  606  such as a keyboard, a mouse, a stylus, a microphone, a tactile input device (e.g., touch sensitive screen) and/or a video input device (e.g., camera). The system  600  may further include one or more output devices  610  such as one or more displays, speakers and/or disk drives. The displays may be a liquid crystal display, a light emitting display or any other suitable display that may or may not be touch sensitive. 
     The system  600  may also preferably include a communication module  612  for establishing one or more communication links (not shown) with one or more other computing devices such as a server, personal computers, terminals, wireless or handheld computing devices. The communication module  612  may be a modem, a Network Interface Card (NIC), an integrated network interface, a radio frequency transceiver, an optical port, an infrared port, a USB connection, or other interfaces. The communication links may be wired or wireless for communicating commands, instructions, information and/or data. 
     Preferably, the receiving module  602 , the processing unit  604 , the memory unit  606 , and optionally the input devices  606 , the output devices  610 , the communication module  612  are connected with each other through a bus, a Peripheral Component Interconnect (PCI) such as PCI Express, a Universal Serial Bus (USB), and/or an optical bus structure. In one embodiment, some of these components may be connected through a network such as the Internet or a cloud computing network. A person skilled in the art would appreciate that the system  600  shown in  FIG.  6    is merely exemplary, and that different systems  600  may have different configurations and still be applicable in the invention. 
     The foregoing description of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations will be apparent to the practitioner skilled in the art. 
     The apparatuses and the methods in accordance to embodiments disclosed herein may be implemented using computing devices, computer processors, or electronic circuitries and other programmable logic devices configured or programmed according to the teachings of the present disclosure. Computer instructions or software codes running in the computing devices, computer processors, or programmable logic devices can readily be prepared by practitioners skilled in the software or electronic art based on the teachings of the present disclosure. 
     All or portions of the methods in accordance to the embodiments may be executed in one or more computing devices including server computers, personal computers, laptop computers, mobile computing devices such as smartphones and tablet computers. 
     The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention for various embodiments and with various modifications that are suited to the particular use contemplated.