Patent Application
20180204046
The present embodiments relate to classification of images of brain tumors. Confocal laser endomicroscopy (CLE) is an alternative to in-vivo imaging technology for examining brain tissue for tumors. CLE allows real-time examination of body tissues on a scale that was previously only possible on histological slices. Neurosurgical resection is one of the early adopters of this technology, where the task is to manually identify tumors inside the human brain (e.g., dura matter, occipital cortex, parietal cortex, or other locations) using a probe or endomicroscope. However, this task may be highly time-consuming and error-prone considering the current nascent state of the technology.
Furthermore, with glioblastoma multiforme being an aggressive malignant cerebellar tumor with only 5% survival rates, there has been an increasing demand in employing automatic image recognition techniques for cerebellar tissue classification. Tissues affected by glioblastoma and meningioma are usually characterized by sharp granular and smooth homogeneous patterns, respectively. However, the low resolution of current CLE imaging systems, coupled with the presence of both kind of patterns in healthy tissue in the probing area, makes it extremely challenging for common image classification algorithms to distinguish between types of tumors and/or tumorous and healthy tissue.
Automatic analysis of CLE imagery adapts a generic image classification technique based on bag-of-visual words. Within this technique, images containing different tumors are collected and low-level features (characteristic property of an image patch) are extracted from them as part of a training step. From all images in the training set, representative features also known as visual words are then obtained using vocabulary or dictionary learning, usually either unsupervised clustering or by a supervised dictionary learning technique. After that, each of the collected training images is represented in a unified manner as a bag or collection of visual words in the vocabulary. This is followed by training classifiers, such as support vector machines (SVM) or random forests (RF), to use the unified representation of each image. Given an unlabeled image, features are extracted and the image in turn is represented in terms of already learned visual words. Finally, the representation is input to a pre-trained classifier, which predicts the label of the given image based on its similarity with pre-observed training images. However, the accuracy of classification is less than desired.
Systems, methods, and computer readable media are provided for brain tumor classification. Independent subspace analysis (ISA) is used to learn filter kernels for CLE images. Convolution and stacking are used for unsupervised learning with ISA to derive the filter kernels. A classifier is trained to classify CLE images based on features extracted using the filter kernels. The resulting filter kernels and trained classifier are used to assist in diagnosis of occurrence of brain tumors during or as part of neurosurgical resection. The classification may assist a physician in detecting whether CLE examined brain tissue is healthy or not and/or a type of tumor.
In a first aspect, a method is provided for brain tumor classification in a medical image system. Local features are extracted from a confocal laser endomicroscopy image of a brain of a patient. The local feature are extracted using filters learned from independent subspace analysis in each of first and second layers with the second layer based on convolution of output from the first layer with the image. The local features are coded. A machine-learnt classifier classifies from the coded local features. The classification indicates whether the image includes a tumor. An image representing the classification is generated.
In a second aspect, a method is provided for learning brain tumor classification in a medical system. One or more confocal laser endomicroscopes acquire confocal laser endomicroscopy images representing tumorous brain tissue and healthy brain tissue. A machine-learning computer of the medical system performs unsupervised learning on the images in a plurality of layers each with independent subspace analysis. The learning in the layers is performed greedily. A filter filters the images with filter kernels output from the unsupervised learning. In one embodiment, the images as filtered are coded. The outputs of the coding are pooled. In another embodiment, the filtered outputs are pooled without coding. The machine learning computer of the medical system trains, with machine learning, a classifier to distinguish between the images representing the tumorous brain tissue and the images representing the healthy brain tissue based on the pooling of the outputs as an input vector.
In a third aspect, a medical system includes a confocal laser endomicroscope configured to acquire an image of brain tissue of a patient. A filter is configured to convolve the image with a plurality of filter kernels. The filter kernels are machine-learnt kernels from a hierarchy of learnt filter kernels for a first stage, convolution with the learnt filter kernels from the first stage, and the filter kernels learnt from input of results of the convolution. A machine-learnt classifier is configured to classify the image based the convolution of the image with the filter kernels. A display is configured to display results of the classification.
Any one or more of the aspects described above may be used alone or in combination. These and other aspects, features and advantages will become apparent from the following detailed description of preferred embodiments, which is to be read in connection with the accompanying drawings. The present invention is defined by the following claims, and nothing in this section should be taken as a limitation on those claims. Further aspects and advantages of the invention are discussed below in conjunction with the preferred embodiments and may be later claimed independently or in combination.
The components and the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the embodiments. Moreover, in the figures, like reference numerals designate corresponding parts throughout the different views.
Since it is extremely difficult to have a clear understanding of the visual characteristics of tumor-affected regions under the current limitations of CLE imagery, a more efficient data-driven visual representation learning strategy is used. An exhaustive set of filters, which are used to represent even remotely similar images efficiently, are implicitly learned from training data. The learned representation is used as input to any classifier, without any further tuning of parameters.
The quality of a feature or features is important to many image analysis tasks. Useful features may be constructed from raw data using machine learning. The involvement of the machine may better distinguish or identify the useful features as compared to a human. Given the large amount of possible features for images and the variety of sources of images, the machine-learning approach is more robust than manual programming.
A network framework is provided for constructing features from raw image data. Rather than using only pre-programmed features, such as extracted Haar wavelets or local binary patterns (LBP), the network framework is used to learn features for classification. For example, in detection of tumorous brain tissue, local features are learned. Filters enhancing the local features are learned in any number of layers. The output from one layer is convolved with the input image, providing an input for the next layer. Two or more layers are used, such as greedily adding third, fourth or fifth layers were the input of each successive layer is the results from the previous layer. By stacking the unsupervised learning of the different layers with convolution to transition between layers, a hierarchal robust representation of the data effective for recognition tasks is learned. The learning process is performed with the network having any number of layers or depth. At the end, learned filters from one or more layers are used to extract information as an input vector for classification. An optimal visual representation for brain tumor classification is learnt using unsupervised techniques. The classifier is trained, based on the input vector from the learned filters, to classify images of brain tissue.
In one embodiment, surgeons may be assisted by classification of CLE imagery to examine brain tissues on a histological scale in real-time during the surgical resection. The classification of CLE imagery is a difficult problem due to the low signal to noise ratio between tumor inflicted and healthy tissue regions. Moreover, clinical data currently available to train classification algorithms are not annotated cleanly. Thus, off-the-shelf image representation algorithms may not be able to capture crucial information needed for classification purposes. This hypothesis motivates the investigation of unsupervised image representation learning that demonstrate significant success in generic visual recognition problems. A data-driven representation is learnt using unsupervised techniques, which alleviates the necessity of clearly annotated data. For example, an unsupervised algorithm called Independent Subspace Analysis is used in a convolutional neural network framework to enhance robustness of the learned representation. Preliminary experiments show 5-8% improvement over state of the art algorithms on brain tumor classification tasks with negligible sacrifice to computational efficiency.
A machine, such as a machine-learning processor, computer, or server, implements some or all of the acts. A CLE probe is used to acquire one or more CLE images. The machine then learns from the CLE images and/or ground truth (annotated tumor or not). The system of
The methods are provided in the orders shown, but other orders may be provided. Additional, different or fewer acts may be provided. For example, acts 44, 46, and/or 48 of
In act 40, CLE images are acquired. The images are acquired from a database, a plurality of patient records, CLE probes, and/or other sources. The images are loaded from or accessed in a memory. Alternatively or additionally, the images are received over a network interface from any source, such as a CLE probe or picture archiving and communications server (PACS).
The images may be received by scanning a patient and/or from previous scans. The same or different CLE probes are used to acquire the images. The images are from living patients. Alternatively, some or all of the images for training are from cadavers. CLE imaging of the cadavers is performed with the same or different probes. The images are from many different humans and/or many samples of brain tissue imaging. The images represent brain tissue. Different sub-sets of the images represent the brain tissue in different states, such as (1) healthy and tumorous brain tissue and/or (2) different types of tumorous brain tissue.
In one embodiment, a commercially available clinical endo-microscope (e.g., Cellvizio from Mauna Kea Technologies, Paris, France) is used as for CLE imaging. A laser scanning unit, software, a flat panel display and fiber optic probes provide a circular field of view with a diameter of 160 μm, but other structures and/or fields of view may be used. The CLE device is intended for imaging the internal microstructure of tissues in the anatomical tract that are accessed by an endoscope. The system is clinically used during an endoscopic procedure for analysis of sub-surface structures of suspicious lesions, which is referred to as optical biopsy. In a surgical resection application, a neurosurgeon inserts a hand-held probe into a surgical bed (e.g., brain tissue of interest) to examine the remainder of the tumor tissue to be resected. The images acquired during previous resections may be gathered as training data.
Where video is used, some of the images may not contain useful information. Due to the limited imaging capability of CLE devices or intrinsic properties of brain tumor tissues, the resultant images often contain little categorical information and are not useful for recognition algorithms. In one embodiment, to limit the influence of these images, the images are removed. The desired images are selected. Image entropy is used to quantitatively determine the information content of an image. Low-entropy images have less contrast and large runs of pixels with the same or similar values as compared to higher-entropy images. In order to filter uninformative video frames, the entropy of each frame or image is calculated and compared to an entropy threshold. Any threshold may be used. For example, the entropy distribution through a set of data is used. The threshold is selected to leave sufficient (e.g., hundreds or thousands) of images or frames for training. For example, the threshold of 4.05 is used in the dataset of
In act 42, a machine-learning computer, processor, or other machine of the medical system performs unsupervised learning on the images. The images are used as inputs to the unsupervised learning to determine features. Rather than or in addition to extracting Haar wavelet or other features, the machine learning determines features specific to the CLE images of brain tissue. A data driven methodology learns image representations that are in turn effective in classification tasks. The feature extraction stage in the computation pipeline (see
In the embodiment of
Any unsupervised learning may be used. The learning uses the input, in this case CLE images, without ground truth information (e.g., without the tumor or healthy tissue labels). Instead, the learning highlights contrast or variance common to the images and/or that maximizes differences between the input images. The machine learning is trained by the machine to create filters that emphasize features in the images and/or de-emphasize information of less content.
In one embodiment, the unsupervised learning is independent subspace analysis (ISA) or other form of independent component analysis (ICA). Natural image statistics are extracted by the machine learning from the input images. The natural image statistics learned with ICA or ISA emulate natural vision. Both ICA and ISA may be used to learn receptive fields similar to the V1 area of visual cortex when applied to static images. In contrast to ICA, ISA is capable of learning feature representations that are robust to affine transformation. Other decomposition approaches may be used, such as principle component analysis. Other types of unsupervised learning may be used, such as deep learning.
ICA and ISA may be computationally inefficient when the input training data is too large. Large images of many pixels may result in inefficient computation. The ISA formulation is scaled to support larger input data. Rather than direct ISA to each input image, various patches or smaller (e.g., 16×16 pixels) filter kernels are learnt. A convolutional neural network type of approach uses convolution and stacking. Different filter kernels are learned in act 44 from the input or training images with ISA in one layer. These learned filter kernels are convolved in act 46 with the input or training images. The images are filtered spatially using the filtering kernels windowed to filter each pixel of the images. The filtered images resulting from the convolution are then input to ISA in another layer. Different filter kernels are learned in act 48 from the filtered images resulting from the convolution. The process may repeat or may not repeat with further convolution and learning.
The output patches are filter kernels used for feature extraction in classification. The convolution neural network approach to feature extraction involves learning features with small input filter kernels, which are in turn convolved with a larger region of the input data. The input images are filtered with the learned filter kernels. The outputs of this convolution are used as input to the layer above. This convolution followed by stacking technique facilitates learning a hierarchical robust representation of the data effective for recognition tasks.
Any number of filter kernels or patches may be created by learning.
For a given layer, ISA learning is applied. Any now know or later developed ISA may be used. In one embodiment, the ISA learning uses a multi-layer network, such as a multi-layer network within one or each of the stacked layers of acts 44 and 48. For example, square and square root non-linearities are used in the learning of the multi-layer network for a given performance of ISA. The square is used in one layer and the square root in another layer of the multi-layer network of the ISA implementation.
In one embodiment, the first layer units are simple units and the second layer units are pooling units. There are k simple units and m pooling units in the multi-layer ISA network. For a vectorized input filter kernel x∈Rn, n being the input dimension (number of pixels in a filter kernel), the weights W∈Rm×k in the first layer are learned, while the weights V∈Rk×n of the second layer are fixed to represent the subspace structure of the neurons in the first layer. In other words, the first layer is learned, then the second layer. Specifically, each of the second layer hidden units pools over a small neighborhood of adjacent first layer units. The activation of each pooling unit is given by:
p
i(x;W,V)=[Σk=1mVik(Σj=1nWkjxj)]1/2 (1)
where p is the activation of the second layer output, W are weight parameters of the first layer, V are weights parameters of the second layer, and j and k are indices. The parameters W are learned through finding sparse feature representations in the pooling layer, by solving the following optimization problem over all T input samples:
minWΣt=1T(Σi=1mpi(xt;W,V)),s.t.WWT=1 (2)
where T is an index, and the orthonormal constraint WWT=1 ensures the features are diverse.
For empirical analysis, the filters are learned from different input filter kernel dimensions. However, the standard ISA training algorithm becomes less efficient when input filter kernels are large as for every step of projected gradient descent, there is a computational overhead for an orthogonalization method. This overhead cost grows as a cubic function of the input dimension of the filter kernel size. Using a convolution neural network architecture that progressively makes use of PCA and ISA as sub-units for unsupervised learning may overcome the computational inefficiency, at least in part.
The outputs of one of the layers in the stacking (e.g., output of act 44) may be whitened, such as with principle component analysis (PCA), prior to use in convolution and/or learning in a subsequent layer. First, the ISA algorithm is trained on small input filter kernels. Next, this learned network is convolved with a larger region of the input image. The combined responses of the convolution step are then given as input to the next layer, which is also implemented by another ISA algorithm with PCA as a preprocessing step. The PCA preprocessing is whitening to ensure that the following ISA training step only receives low dimensional inputs.
The learning performed in acts 44 and 48 is performed greedily. A hierarchal representation of the images is learned layer wise, such as done in deep learning. The learning of the first layer in act 44 is performed until convergence before training the second layer in act 48. By greedy training, the training time requirement is reduced to less than only a couple hours on a standard laptop hardware given the data set of
Once the patches or filter kernels are learned by machine learning using the input training images, a visual recognition system is trained to classify from input features extracted with the filter kernels. The input training images for machine learning the classification are filtered in act 50 with the filter kernels. A filter convolves each training image with each filter kernel or patches output from the unsupervised learning. The filter kernels output by the final layer (e.g., layer 2 of act 48) are used, but filter kernels from the beginning (e.g., layer 1 of act 44) or intermediate layers may be used as well.
For each input training image, a plurality of filtered images is output. The plurality is for the number of filter kernels being used. These filtered images are a visual representation that may be used for better classification than using the images without filtering.
Any visual recognition system may be used, such as directly classifying from the input filtered images. In one embodiment, features are further extracted from the filtered images and used as the input. In the embodiment of
In act 52, the filtered images are coded. The coding reduces the data used for training the classifier. For example, the filtered images each have thousands of pixels with each pixel being represented by multiple bits. The coding reduces the representation of a given image by half or more, such as providing data with a size of only hundreds of pixels.
Any coding may be used. For example, clustering (e.g., k-means clustering) or PCA is performed on the filtered images. As another example, a vocabulary is learned from the filtered images. The filtered images are then represented using the vocabulary. Other dictionary learning approaches may be used.
In one embodiment, the recognition pipeline codes similar to a Bag-of-Words based method. 10% or other number of descriptors (i.e., filtered images and/or filter kernels to use for filtering) are randomly selected from the training split, and k-means (k=512 is empirically determined from one of the training testing split) clustering is performed to construct four or other number of different vocabularies. Features from each frame are then quantized using these different sets of vocabularies.
In act 54, the processor or computer pools outputs of the coding. The pooling operation computes a statistic value from all encoded local features, e.g., mean value (average pooling) or max value (maximum pooling). This is used to further reduce dimensionality and improve robustness to certain variation, e.g., translation. In the example of K-means based coding, local feature after convolutions is projected to one entry of the K-means based vocabulary. The pooling operation in this embodiment is applied to the same entry of all the local feature, for example, average operation. Pooled features are provided for each of the training images and test images. Pooling may be provided without the coding of act 52.
In act 56, the machine-learning computer of the medical system trains a classifier to distinguish between the images representing the tumorous brain tissue and the images representing the healthy brain tissue and/or between images representing different types of tumors. Machine learning is used train a classifier to distinguish between the content of images. Many examples of each class are provided to statistically relate combinations of input values to each class.
Any type of machine learning may be used. For example, a random forest or support vector machine (SVM) is used. In other examples, a neural network, Bayesian network, or other machine learning is used. The learning is supervised as the training data is annotated with the results or classes. A ground truth from medical experts, past diagnosis, or other source is provided for each image for the training.
The input vector used to train the classifier is the pooled codes. The output of the pooling, coding, and/or filtering is used as an input to the training of the classifier. Other inputs, such as patient age, sex, family history, image features (e.g., Haar wavelet), or other clinical information, may be used in addition to the features extracted from the unsupervised learning. The input vector and the ground truth for each image are used as training data to train the classifier. For example, a support vector machine is trained with a radial basis function (RBF) kernel using parameters chosen using a coarse grid search, such as down sampling the images or coding for further data reduction. The resultant quantized representations from the pooled codes are used to train the SVM classifier with the RBF kernel. A linear kernel is used in alternative embodiments.
The classifier as trained is a matrix. This matrix and the filter kernels or patches are output from the training in
The same or different medical imaging system used for training is used for application. For a cloud or server based system, the same computer or processor may both learn and apply the learnt filter kernels and classifier. Alternatively, a different computer or processor is used, such as learning with a workstation and applying with a server. For a local based application, a different workstation or computer applies the learnt filter kernels and classifier than the workstation or computer used for training.
The method is performed in the order shown or a different order. Additional, different, or fewer acts may be provided. For example, where the classification is directly trained from the filtered image information without coding, act 62 may not be performed. As another example, the classification is output over a network or stored in memory without generating the image in act 66. In yet another example, acts for scanning with a CLE are provided.
In act 58, one or more CLE images of a brain are acquired with CLE. The image or images are acquired by scanning the patient with CLE, from a network transmission, and/or from memory. In one embodiment, a CLE probe is positioned in a patient's head during a resection. The CLE is performed during surgery. The resulting CLE images are generated.
Any number of CLE images may be received. Where the received CLE image is part of a video, all of the images of the video may be received and used. Alternatively, a sub-set of images is selected for classification. For example, frame entropy is used (e.g., entropy is calculated and a threshold applied) to select a sub-set of one or more images for classification.
In act 60, a filter and/or classifier computer extract local features from the CLE image or images for the patient. The filter filters the CLE image with the previously learned filter kernels, generating a filtered image for each filter kernel. The filters learned from ISA in a stacked (e.g., multiple layers of ISA) and convolution (e.g., convolution of the training images with filters output by one layer to create the input for the next layer) are used to filter the image from a given patient for classification. The sequentially learned filters or patches are created by ISA. The filters or patches of the last layer are output as the filter kernels to be used for feature extraction. These output filter kernels are applied to the CLE image of the patient.
Any number of filter kernels or patches may be used, such as all the learned filter kernels or a fewer number based on determinative filter kernels identified in the training of the classifier. Each filter kernel is centered over each pixel or other sampling of pixels and a new pixel value calculated based on the surrounding pixels as weighted by the kernels.
The output of the filtering is the local features. These local features are filtered images. The filtering enhances some aspects and/or reduces other aspects of the CLE image of the patient. The aspects to enhance and/or reduce, and by how much, was learned in creating the filter kernels.
In act 62, local feature represented in the filtered image are coded. The features are quantified. Using image processing, a classification processor determines values representing the features of the filtered image. Any coding may be used, such as applying principle component analysis, k-means analysis, clustering, or bag-of-words to the filtered images. The same coding used in the training is used for application for the given patient. For example, the learned vocabulary is used to code the filtered images as a bag-of-words. The coding reduces the amount or dimensionality of the data. Rather than having pixel values for each filtered image, the coding reduces the number of values for input to the classifier.
Each filtered image is coded. The codes from all or some of the filtered images created from the CLE image of the patient are pooled. In alternative embodiments, pooling is not used. In yet other embodiments, pooling is provided without coding.
In act 64, a machine-learnt classifier classifies the CLE image from the coded local features. The classifier processor receives the codes or values for the various filtered images. These codes are the input vector for the machine-learnt classifier. Other inputs may be included, such as clinical data for the patient.
The machine-learnt classifier is a matrix or other representation of the statistical relationship of the input vector to class. The previously learnt classifier is used. For example, the machine-learnt classifier is a SVM or random forest classifier learned from the training data.
The classifier outputs a class based on the input vector. The values of the input vector, in combination, indicate membership in the class. The classifier outputs a binary classification (e.g., CLE image is or is not a member—is or is not tumorous), selects between two classes (e.g., healthy or tumorous), or selects between three or more classes (e.g., classifying whether or not the CLE image includes glioblastoma multiforme, meningioma, or healthy tissue). Hierarchal, decision tree, or other classifier arrangements may be used to distinguish between healthy, glioblastoma multiforme and/or meningioma. Other types of tumors and/or other diagnostically useful information about the CLE image may be classified.
The classifier indicates the class for the entire CLE image. Rather than identifying the location of a tumor in the image, the classifier indicates whether the image represents a tumor or not. In alternative embodiments, the classifier or an additional classifier indicates the location of a suspected brain tumor.
In act 66, the classifier processor generates an image representing the classification. The generated image indicates whether the CLE image has a tumor or not or the brain tissue state. For example, the CLE image is output with an annotation, label, or coloring (e.g., tint) indicating the results of the classification. Where the classifier outputs a probability for the results, the probability may be indicated, such as indicating the type of tumor and the percent likelihood estimated for that type of tumor being represented in the CLE image.
The low-level feature representation may be a decisive factor in automatic image recognition tasks or classification. The performance of the ISA based stacking and convolution to derive the feature representation is evaluated against other different feature representation baselines. For each approach, a dense sampling strategy is used during the feature extraction phase to ensure a fair comparison across all feature descriptors. From each CLE image frame, 500 sample point or key points are uniformly sampled after applying a circular region of interest at approximately the same radius as the endoscopic lens.
Each key point is described using the following descriptor types (i.e., the approaches to low-level feature representation): stacked and convolved ISA, scale invariant feature transform (SIFT), and local binary patterns (LBP). These descriptors capture quantized gradient orientations of pixel intensities in a local neighborhood.
A recognition pipeline, similar to the Bag-of-Words (BOW) based method, is implemented for the dense SIFT feature modality as follows: 10% of descriptors are randomly selected from the training split, and k-means (k=512 is empirically determined from one of the training testing split) clustering is performed to construct 4 different vocabularies. Features from each frame are then quantized using these different sets of vocabularies. Locally constrained linear coding (LLC) may be used instead. The resultant quantized representation is used to train an SVM classifier with an RBF kernel. The parameters of the SVM classifier are chosen using a coarse grid search algorithm.
For classification with the LBP features, the LBP histograms are used directly to train a random forest classifier with 8 trees with a maximum depth of 16 levels for each tree. The output confidences from each representation-classifier combinations are then merged using a straightforward multiplicative fusion algorithm. Thus, the decision for a frame is obtained.
In order to make a detailed comparison, SIFT or LBP descriptors are replaced with the feature descriptor learned using the pre-trained two-layered ISA network (i.e., stacked and convolved ISA). The computational pipeline, including vector quantization and classifier training, is conceptually similar to the baseline (SIFT and LBP) approaches.
ISA, with or without the stacking and convolution within the stack, provides a slower but efficient strategy to extract features that enable effective representation learning directly from data without any supervision. Significant performance improvement over state of the art conventional methods (SIFT and LBP) is shown on an extremely challenging task of brain tumor classification from CLE image.
The medical system 11 implements the methods of
The medical system 11 includes a host computer, control station, workstation, server, or other arrangement. The system includes the display 18, memory 20, and a processor. Additional, different, or fewer components may be provided. The display 18, processor, and memory 20 may be part of a computer, server, or other system for image processing images from the CLE 12. A workstation or control station for the CLE 12 may be used for the rest of the medical system 11. Alternatively, a separate or remote device not part of the CLE 12 is used. Instead, the training and/or application are performed remotely. In one embodiment, the processor and memory 20 are part of a server hosting the training or application for use by the operator of the CLE 12 as the client. The client and server are interconnected by a network, such as an intranet or the Internet. The client may be a computer for the CLE 12, and the server may be provided by a manufacturer, provider, host, or creator of the medical system 11.
The CLE 12 is an endomicroscope for imaging brain tissue. Fluorescence confocal microscopy, multi-photon microscopy, optical coherence tomography, or other types of microscopy may be used. In one embodiment, laser light is used to excite fluorophores in the brain tissue. The confocal principle is used to scan the tissue, such as scanning a laser spot over the tissue and capturing images. A fiber or fiber bundles are used to form the endoscope for the scanning. Other CLE devices may be used.
The CLE 12 is configured to acquire an image of brain tissue of a patient. The CLE 12 is inserted into a head of a patient during brain surgery, and the adjacent tissue is imaged. The CLE 12 may be moved to create a video of the brain tissue.
The CLE 12 outputs the image or images to the filter 14 and/or the memory 20. For training, the CLE 12 or a plurality of CLEs 12 provide images to a processor. For the application example of
The filter 14 is a digital or analog filter. As a digital filter, a graphics processing unit, processor, computer, discrete components, and/or other devices are used to implement the filter 14. While one filter 14 is shown, a bank or plurality of filters 14 may be provided in other embodiments.
The filter 14 is configured to convolve the CLE image from the CLE 12 with each of a plurality of filter kernels. The filter kernels are machine-learnt kernels. Using a hierarchy in the training, filter kernels are learned using ISA for a first stage, the learnt filter kernels are then convolved with the images input to the first stage, and then the filter kernels are learned using ISA in a second stage where the input images are the results of the convolution. In alternative embodiments, other component analysis than ISA is used, such as PCA or ICA. Convolution and stacking are not used in other embodiments.
The result of the unsupervised learning is filter kernels. The filter 14 applies the learnt filter kernels to the CLE image from the CLE 12. At any sampling or resolution, the CLE image is filtered using one of the learned filter kernels. The filtering is repeated or performed in parallel by the filter 14 for each of the filter kernels, resulting in a filtered image for each filter kernel.
The machine-learnt classifier 16 is a processor configured with a matrix from the memory 20. The configuration is the learned relationship of the inputs to the output classes. The previously learned SVM or other classifier 16 is implemented for application.
The classifier 16 is configured to classify the CLE image from the CLE 12 based on the convolution of the image with the filter kernels. The outputs of the filter 14 are used for creating the input vector. A processor or other device may quantify the filtered images, such as applying a dictionary, locality constraint linear coding, PCA, bag-of-words, clustering, or other approach. For example, the processor implementing the classifier 16 codes the filtered images from the filter 14. Other input information may be gathered, such as from the memory 20.
The input information is input as an input vector into the classifier. In response to the input values, the classifier 16 outputs the class of the CLE image. The class may be binary, hierarchal, or multi-class. A probability or probabilities may be output with the class, such as 10% healthy, 85% GBM, and 5% MNG.
The display 18 is a CRT, LCD, projector, plasma, printer, smart phone, or other now known or later developed display device for displaying the results of the classification. The results may be displayed with the CLE image. For example, the display 18 displays the CLE image with an annotation for the class. As another example, tabs or other references to any images classified as not healthy or other label are provided. In response to user selection, the CLE image classified as not healthy for a given tab is displayed. The user may cycle through the tumorous CLE images to confirm the classified diagnosis or to use the classified diagnosis as a second opinion.
The memory 20 is an external storage device, RAM, ROM, database, and/or a local memory (e.g., solid-state drive or hard drive). The memory 20 may be implemented using a database management system (DBMS) managed by the processor and residing on a memory, such as a hard disk, RAM, or removable media. Alternatively, the memory 20 is internal to the processor (e.g. cache).
The outputs of the filtering, the filter kernels, the CLE image, the matrix for the classifier 16, and/or the classification may be stored in the memory 20. Any data used as inputs, results, and/or intermediary processing may be stored in the memory 20.
The instructions for implementing the training or application processes, methods and/or techniques discussed herein are stored in the memory 20. The memory 20 is a non-transitory computer-readable storage media or memories, such as a cache, buffer, RAM, removable media, hard drive or other computer readable storage media. The same or different non-transitory computer readable media may be used for the instructions and other data. Computer readable storage media include various types of volatile and nonvolatile storage media. The functions, acts or tasks illustrated in the figures or described herein are executed in response to one or more sets of instructions stored in or on computer readable storage media. The functions, acts or tasks are independent of the particular type of instructions set, storage media, processor or processing strategy and may be performed by software, hardware, integrated circuits, firmware, micro code and the like, operating alone or in combination.
In one embodiment, the instructions are stored on a removable media device for reading by local or remote systems. In other embodiments, the instructions are stored in a remote location for transfer through a computer network. In yet other embodiments, the instructions are stored within a given computer, CPU, GPU or system. Because some of the constituent system components and method steps depicted in the accompanying figures may be implemented in software, the actual connections between the system components (or the process steps) may differ depending upon the manner in which the present embodiments are programmed.
A processor of a computer, server, workstation or other device implements the filter 14 and/or the classifier 16. A program may be uploaded to, and executed by, the processor comprising any suitable architecture. Likewise, processing strategies may include multiprocessing, multitasking, parallel processing and the like. The processor is implemented on a computer platform having hardware, such as one or more central processing units (CPU), a random access memory (RAM), and input/output (I/O) interface(s). The computer platform also includes an operating system and microinstruction code. The various processes and functions described herein may be either part of the microinstruction code or part of the program (or combination thereof) which is executed via the operating system. Alternatively, the processor is one or more processors in a network.
Various improvements described herein may be used together or separately. Although illustrative embodiments of the present invention have been described herein with reference to the accompanying drawings, it is to be understood that the invention is not limited to those precise embodiments, and that various other changes and modifications may be affected therein by one skilled in the art without departing from the scope or spirit of the invention.
The present patent document claims the benefit of the filing dates under 35 U.S.C. § 119(e) of Provisional U.S. Patent Application Ser. No. 62/200,678, filed Aug. 4, 2015, which is hereby incorporated by reference.
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/US2016/043466 | 7/22/2016 | WO | 00 |
| Number | Date | Country | |
|---|---|---|---|
| 62200678 | Aug 2015 | US |
