Advanced Medical Image AnalysisView this Special Issue
Research Article | Open Access
Hui Liu, Ying Shao, Dongmei Guo, Yuanjie Zheng, Zuowei Zhao, Tianshuang Qiu, "Cirrhosis Classification Based on Texture Classification of Random Features", Computational and Mathematical Methods in Medicine, vol. 2014, Article ID 536308, 8 pages, 2014. https://doi.org/10.1155/2014/536308
Cirrhosis Classification Based on Texture Classification of Random Features
Accurate staging of hepatic cirrhosis is important in investigating the cause and slowing down the effects of cirrhosis. Computer-aided diagnosis (CAD) can provide doctors with an alternative second opinion and assist them to make a specific treatment with accurate cirrhosis stage. MRI has many advantages, including high resolution for soft tissue, no radiation, and multiparameters imaging modalities. So in this paper, multisequences MRIs, including T1-weighted, T2-weighted, arterial, portal venous, and equilibrium phase, are applied. However, CAD does not meet the clinical needs of cirrhosis and few researchers are concerned with it at present. Cirrhosis is characterized by the presence of widespread fibrosis and regenerative nodules in the hepatic, leading to different texture patterns of different stages. So, extracting texture feature is the primary task. Compared with typical gray level cooccurrence matrix (GLCM) features, texture classification from random features provides an effective way, and we adopt it and propose CCTCRF for triple classification (normal, early, and middle and advanced stage). CCTCRF does not need strong assumptions except the sparse character of image, contains sufficient texture information, includes concise and effective process, and makes case decision with high accuracy. Experimental results also illustrate the satisfying performance and they are also compared with typical NN with GLCM.
Liver cirrhosis is one of the leading causes of death by disease . Making a definite diagnosis and staging of the cirrhosis is crucial which will help doctor to offer the timely and appropriate therapeutic method. In recent decades, CAD has drawn an increasing attention for its convenient and noninvasive diagnosis procedure, meaningful diagnosis result. As it is well known, the more cirrhosis categories, the more valuable the classification result is, for it can provide a constructive assistance to doctors and facilitate the process for doctors to produce a specific treatment for patient. Therefore, the study of cirrhosis classification is developing form two categories classification of cirrhosis, such as methods provided by Chen et al. , Lee et al. [1, 3], Hui et al. , and Li et al. , to precisely class three stages (normal stage, early stage, and middle and advanced stage). Thus, a CAD system which can generate more precise stages is an inevitable tendency in the future.
The early CAD systems of cirrhosis mostly apply CT images, such as the methods provided by Li et al.  and Chen et al. [2, 6]. Compared with CT, MRI provides many advantages including high resolution of soft tissue, no radiation, and multiparameters imaging modalities and it is becoming an effective modality in assessing cirrhosis. However, few researchers are concerned with the cirrhosis CAD system with MRI by far. So in this paper, multisequences MRI, including T1-weighted, T2-weighted, arterial phase, portal venous phase, and equilibrium phase, are applied for cirrhosis classification which divide cases into three stages (normal stage, early stage, and middle and advanced stage).
Cirrhosis CAD usually consists of two steps: the first step involves feature extraction and effective feature selection, and the second step is to train classifier based on the selected features and identify cirrhosis . Feature extraction and selection occupy an important position that directly affects the performance of classifier. Cirrhosis is characterized by the presence of widespread fibrosis and regenerative nodules in the hepatic. The fibrosis and nodules formation causes distortion of the normal hepatic architecture, resulting in characteristic texture patterns . Therefore, extracting texture feature is the primary task of CAD. Jiang et al.’s cirrhosis classification method  achieves 56% accuracy with texture features directly extracted from region of interests (ROI), such as the ROI mean gray value and ROI standard deviation. Because simple texture features are unsatisfactory, Jiang et al. add morphological features to improve classification performance. Actually, effective texture feature that can fully describe cirrhosis feature is a key problem of CAD. GLCM based feature is a classical method to extract texture features for cirrhosis classification [4, 8–11]. However, GLCM has many weaknesses. For example, GLCM is a statistical texture description for two specific grayscales with specific distance and direction which will cause strong assumptions about the texture being studied in practice. And it is difficult to contain all texture information according to the GLCM texture features with such strong assumptions. It should also be noted that complex process of computing GLCM and its 14 typical texture parameters will take long time especially for large image. And with GLCM based features it will need a necessary procedure to select effective features with a heavily and complicated test to improve the classifier’s performance. Virmani et al.  uses all the 14 GLCM texture features for two stages classification (normal and cirrhosis). Its classification accuracy is 95.86%, achieved by using an NN classifier with stratified 10-fold cross validation method. For two stages classification, GLCM texture features are fine even though with the price of time and complexity. However, the classification with the GLCM texture features is far from satisfactory for three stages (normal, early, and middle and advanced); the accuracy is about 89.52% for normal, 70.98% for early, and 74.27% for middle and advanced stages that is verified in this paper, which causes most of traditional classifiers far from application.
Recently, texture classification from random features  proposed by Liu et al. provides an effective way to extract texture features. Firstly, it does not need strong assumptions about the texture images, except the sparse character of the texture image. Secondly, it almost does not lose information when extracting texture feature. Because no information is lost in the three stages which are extracting local image from image, extracting patch from local image, and stretching patch into patch vector, the process of compressing patch vector retains salient information when image is sparse character. Thus, the texture feature, which is compressed patch vector, almost does not lose information. Thirdly, Liu et al.’s method does not need feature selection, reducing method complexity. Finally, it costs little time because of the simple computation procedure which includes extracting local image from image, extracting patch from local image, stretching patch into patch vector, and compressing patch vector that only needs matrix multiplication. And omitting feature selection can also save time.
Considering the above reasons, we propose CCTCRF method and apply Liu et al.’s method to extract texture features. Liver organization of hepatic MRIs studied in this paper is a kind of image with texture character, and it also meets the sparse character requirement as an assumption in Liu et al.’s method. As it is well known, the key factor to obtain excellent performance in cirrhosis classification is preserving salient cirrhosis texture information, while Liu et al.’s method exactly meets the requirement according to the process of extracting texture feature. Furthermore, due to the weak assumption of Liu et al.’s method, we can apply it into five sequences MRIs all have sparse character without considering specific parameters for specific sequence, and the experiment result also demonstrates the effectiveness of the five sequences MRIs texture features. In addition, as the number of multisequences MRI used in our research is large, the little time costing and complexity reducing in feature extraction and selection is also a reason to choose Liu et al.’s method. Thus, we apply Liu et al.’s method as texture extraction method in our research. Except for the benefits of texture feature extraction based on Liu et al.’s method, CCTCRF also has a remarkable performance on case classification, compared with typical GLCM texture based CAD system.
In this paper, we propose the CCTCRF method with five sequences MRI, involving T1-weighted, T2-weighted, hepatic arterial phase, portal venous phase, and equilibrium phase images to class the patient samples into normal stage, early stage, and middle and advanced stage. In order to illustrate the effectiveness of CCTCRF method, we also do a contrast experiment with GLCM texture features and typical neural network (NN).
This paper is organized as follows. Section 2 presents the materials used in our study and describes the NN classification method with GLCM texture features to be compared and the CCTCRF theory applied in this paper. Section 3 describes the experiments performed to prove the effectiveness of CCTCRF and the NN classifier with GLCM texture features experiment as comparison study. The conclusion is in Section 4.
2. Materials and Methods
The MR images are collected from the Second Affiliated Hospital of Dalian Medical University between September 2012 and September 2013. The database containing 55 patient cases is used in this study. Of the 55 patient cases, 26 cases are at normal stage, 13 are early cirrhosis stage, and 16 are the middle and advanced cirrhosis, shown in Table 1.
Most of the 55 patient cases have five sequences MRI, T1-weighted, T2-weighted, arterial phase, portal venous phase, and equilibrium phase, except a few of them who are short of portal venous phase or equilibrium phase images. The cases are scanned by a 3.0-T superconductivity MR scanner (Signa, Siemens, Germany) or 1.5-T MR scanner (Signa, GE, USA); the scan order is T1-wighted, T2-wighted, and three kinds of dynamic enhancement scan which are arterial phase, portal venous phase, and equilibrium phase, respectively, after injecting Gd-DTPA 25 s, 65 s, and 120 s. The parameters of T1-weighted, arterial phase, portal venous phase, and equilibrium phase from 3.0-T superconductivity MR scanner are TR = 3.9 ms and TE = 1.4 ms; T2-weighted parameters are TE = 105 ms. The parameters of T1-weighted, arterial phase, portal venous phase, and equilibrium phase from 1.5-T MR scanner are TR = 175.0 ms and TE = 4.2 ms; T2-weighted parameters are TR = 7058.8 ms and TE = 89.5 ms.
2.2.1. Texture Classification from Random Features
The method of texture classification from random features  is inspired by theories of sparse representation and compressed sensing. And it presents a simple and powerful approach for texture image classification based on random projection. It includes four parts, patch extraction, compressed texton dictionary, histogram of textons learning, and the classification. At the feature extraction step, texture feature, compressed patch vector, is extracted with patch extraction, patch vector generation, and patch vector compressing. The texture features are embedded into a bag-of-words model to perform texture classification. The extraction of compressed patch vector with random projection is simple and takes full advantages of the sparse nature of texture images. Liu et al.’s method outperforms traditional feature extraction methods which involve careful design and complex steps. Compared with the four state-of-the-art texture classification involving Patch, Patch-MRF, MR8, and LBP on the databases of CUReT, Brodatz, and MSRC, Liu et al.’s method leads to an important improvement in classification accuracy and reductions in feature dimensionality .
2.2.2. NN Classification with GLCM Texture Features
NN classifier  is a classic method in pattern classification and recognition, widely used in speech recognition [14, 15], image recognition [16–18], handwritten character recognition [19, 20], radar target recognition , and sonar target recognition [22, 23]. NN simulates the progress of neure that obtains knowledge from outside world and learns by itself to achieve the class function. GLCM is a classic method to extract texture feature, provided by Haralick . It describes the probability that a couple of pixels, at direction and at a distance of pixels, appear gray level and gray level. Then, it deduces 14 texture features including angular second moment, contrast, correlation, variance, inverse differences moment, sum average, sum variance, sum entropy, entropy, difference variance, difference entropy, information measures of correlation, Maximum correlation coefficient 1, and Maximum correlation coefficient 2  according to GLCM . Thus, NN classifier with GLCM texture features is widely used in classification.
2.2.3. Cirrhosis Classification Based on Texture Classification from Random Features (CCTCRF)
We propose a new method CCTCRF which distinguishes hepatic cirrhosis patients into normal stage, early stage, and middle and advanced stage with five sequences MRI, which are T1-weighted, T2-weighted, arterial phase, portal venous phase, and equilibrium phase. Liu et al.’s method is applied to extract texture features and class intermediate samples. In addition, a final case decision making is produced with the intermediate samples classification results. CCTCRF includes four parts: ROI segment, texture feature extraction, ROI classification system, and case decision.
ROI segment step is shown in Figure 1. The images used for segment are manually selected according to the requirements that the images need to contain a clear and relatively whole liver. ROIs with size of are extracted from five sequences MRIs, and considering the extraction principle of the diffuse distribution of liver, large blood vessels within the liver are excluded . In this paper, the size of ROI is or , and it depends on the range in liver that can be extracted. And we extract many ROIs from the same image when it has enough region accord with the extraction principle.
Figures 2(a)–2(c) are the ROI examples of normal stage, early stage, and middle and advanced stage, respectively, and the image order is T1-weighted, T2-weighted, arterial phase, portal venous phase, and equilibrium phase for each stage. According to clinical information, hepatic MRI conveys the different texture information according to different cirrhosis stage: normal hepatic tissue appears as delicate texture and uniform medium gray level, while early cirrhosis and middle and advanced cirrhosis appear as coarse particles or diffuse small nodular with saltatory gray with different extent .
ROIs are manually segmented by an experienced radiologist; the number distribution of selected ROI is illustrated in Table 2.
At the feature extraction step, we extract texture feature from ROI. Processing a ROI of pixels by extracting square patch of pixels and is much less than , from every pixel located in . And in order to get the square, those pixels on the ROI boundary are removed. So the range of is . Then, stretch each patch into a vector of size and labelled as . Next, compress patch vector with , which is sampled from independent zero-mean, unit-variance normal distribution, to obtain compressed patch vector as the texture feature. Consider where is the set of the patch generated from a ROI.
Before processing as the input vector of classification, it needs to be normalized and there are two kind of normalization methods , formulated as (2) and (3) or no normalization as follows.(1)Weber’s law (2)Unit norm
Any kind of normalization can be selected based on the classification performance after the next process.
Patch vector, which comes from ROI, is the gray level assemble in practice. Thus, it reflects the different texture information of tissue and organ with T1 value and T2 value or proton density as well as gray level for MRI. It also reflects local information of a ROI and we can control the local range by adjusting to achieve the ideal scope of cirrhosis texture. Actually, to compress patch vector is a process of dimensionality reduction and is important in handling high dimensional data since it mitigates the curse of dimensionality and other undesired properties of high dimensional spaces , and the compressed patch vector does not need to feature selection which has heavy and complicated algorithm or analysis. In this paper, random projection which refers to the technique of projecting a set of points from a high dimensional space to a randomly chosen low dimensional subspace is the way of compressing patch. Random projection’s effectiveness in information-preserving and dimensionality-reduction power is evidenced in the emerging theory of compressed sensing (CS) [27–29], which states that, for sparse and compressible signals, a small number of nonadaptive linear measurements in the form of random projections can capture most of the salient information in the signal and allow for perfect reconstruction of the signal. And it has been widely used in information retrieval, face recognition , and machine learning [31, 32]. Thus, using the compressed patch vector as the following input is reasonable and effective.
Compressed Texton Dictionary Learning Step. Compressed texton dictionary is learned directly in the compressed domain . It learns textons with -means for each stage compressed patch vectors. Next, the compressed texton dictionary is formulated by concatenating the textons of each texture stage and the size of dictionary is (i.e. ).
Histogram of Textons Learning, Shown in Figure 3 (Top). By labeling each of extracted patches with the closest texton in , which is a histogram of compressed textons belonging to one of the samples from stage is learned for each training sample. Each stage is represented by a set of models .
The Classification Step Is Shown in Figure 3 (Bottom). Computing which is a histogram from one of the samples belongs to test data. Using nearest neighbor classifier, is classified and the distance between two histograms is measured using the statistic: Then, belongs to stage when the distance between and is the nearest compared with other histograms. Thus, the stage of corresponding ROI which derives from is determined; it is equal to stage.
Case decision making stage is as follows. As we have shown in Figure 4, a case of one sequence images can extract many ROIs that the number of ROI is determined by the image region scope that meets extraction principle. In other words, sequence images of case have many classification results that belong to corresponding ROI. When all ROIs belong to the same case and same sequence is classed to the same stage , surely the case of sequence stage is . However, when the ROIs classification results have more than one stage, case of sequence is determined by the vote principle that the minority stage subordinate to the majority stage.
3. Experiment Results
MATLAB R2010a is used to implement the CCTCRF experiment and the NN classifier with GLCM texture features experiment.
3.1. The CCTCRF Experiment Result
We use five sequences MRI in the experiment and the number of patients is shown in Table 1. Because images come from five different MR sequences, we need to do five experiments to class cases with the same sequence images in order to obtain the individual performance of every kind of sequence.
Take T1-weighted images for classification, for instance. There are 26 normal cases, 13 early cirrhosis cases, and 16 middle and advanced cirrhosis cases of T1-weighted. The train cases of normal stage, early stage, and middle and advanced stage are 13, 7, and 8; test cases are 13, 6, and 8. Extracting, respectively, 142, 93, and 235 ROIs from three kinds of cases according to the principle of extracting ROI and train cases of normal, early, and middle and advanced stage which are 54, 42, and 180 ROIs, respectively, the remaining ROIs belong to test cases. Each ROI is processed by extracting patches of size around each pixel position except those pixels on the ROI boundary. Stretching into , that is a vector of 25 pixels, we compressed into a 15-dimension compressed patch vector using independent zero-mean, unit-variance normal distribution. Choose unit norm as normalization method on account of unit norm which has the best evaluation among the three normalization ways for T1-weighted. Then, the texture feature, compressed path vector with normalization, is achieved. Next, input the texture features into the ROI classification system, the distribution of cases number is shown in Table 3. After obtaining the ROIs stages, we carry out the case decision making step to achieve the test cases stages of T1-weighted.
What is said above is for T1-weighted images. Except the number of each stage case and parameters, T1-weighted, T2-weighted, arterial phase, portal venous phase, and equilibrium phase have the same process. The parameters in texture feature extraction stage include the size of ROI and patch and the dimension of compressed patch vector. In compressed texton dictionary learning step of ROI classification system, parameters include textons with -means for each stage and which way to normalize compressed patch vector. We adjust these parameters according to the special sequence in order to achieve the desired performance of the sequence.
To evaluate the effectiveness of our study, we do five experiments using different sequences, respectively. The portal venous phase and equilibrium phase distribution are different from others because of the absence of portal venous phase in middle and advanced stage number 7, equilibrium phase in normal stage numbers 18 and 21–24, and middle and advanced stage numbers 6 and 7. Yet, we still keep the fact that the test cases are completely new compared with train cases.
The accuracy of every kind of sequence is demonstrated in Table 4. Firstly, it has a perfect result of case accuracy, that is, 100%, which means that all the cases can be classed correctly from case point. Secondly, ROI accuracy is not as good as case accuracy. Yet, it has completely no influence on case accuracy when taking all ROIs results of one case into account and it still has a remarkable performance, especially for normal stage. Normal stage can absolutely be separated from early stage and middle and advanced stage according to no matter ROI classification result or case classification result. To early stage, CCTCRF can almost be separated from others according to ROI classification result, except that ROI accuracy of T2-weighted images is 97.30%, because one of two ROIs of number 3 case is erroneous classified. Yet, case number 3 still classifies correctly after considering all the number 3 case ROIs.
Thirdly, the middle and advanced ROI accuracy is not as good as normal or early stage because the cirrhosis texture in middle and advanced liver is very irregular and is accompanied by morphological changes of liver which causes the difficulty to extract suitable ROI. However, it has no influence on case accuracy when considering all ROIs results, just like early stage number 3. In a word, all the cases have an encouraging case accuracy, that is, 100%, and maintain a remarkable ROI accuracy especially for normal and early stage which is more meaningful for doctors and patients.
3.2. NN Classifier with GLCM Texture Features in Comparison Study
We use five sequences MRI for NN classifier with GLCM texture features experiment and the number of patients is shown in Table 1. The texture features based on GLCM is classical statistics features. GLCM is a matrix that describes the probability of a couple of pixels whose gray levels are and , and the distance and direction between the couple pixels is and . We did three stages (normal stage, early stage, and middle and advanced stage) classification experiment with 14 kinds of GLCM texture features of ROIs. And ROIs were extracted from MRI with the same extraction principle which is excluding the diffuse distribution of liver, large blood vessels within the liver . We perform tenfold cross validation method to execute the classification and the result is shown in Figure 5. Obviously, the NN classifier with GLCM texture features does not have a harmonious or remarkable performance in cirrhosis classification with any sequence of MRI. However, it might be improved by adding feature selection and adjusting parameters, including adopting different angle and step to compute GLCM according to different MR sequence.
In this paper, we describe CCTCRF method with five sequences MRI, T1-weighted, T2-weighted, hepatic arterial phase, portal venous phase, and equilibrium phase, to class cirrhosis into three stages (normal, early, and middle and advanced stage). The experiment results show that CCTCRF method surpasses the typical classifier NN with GLCM texture features in cirrhosis classification, but with significant reductions in complexity and time. There are many advantages of CCTCRF than previous studies such as NN classifier with GLCM in cirrhosis texture classification.
Instead of GLCM texture features, we choose compressed patch vector as the texture features. Firstly, compared with GLCM which needs strong assumption including angle and step, compressed patch vector does not need strong assumptions about the texture images, except the sparse character of the image. And we apply the texture extraction method into five MRIs that all have sparse character without considering specific parameters adjusting for specific sequence and the experiment result also demonstrates the effectiveness of the five sequences MRI texture features. Secondly, it almost does not lose information when extracting texture feature, because no information is lost in the three steps which are extracting local image from image, extracting patch from local image, and stretching patch into patch vector. Meanwhile, the process of compressing patch vector process retains salient information when image is sparse. Thus, the texture feature, which is compressed patch vector, almost does not lose information. However, GLCM texture features must lose texture information under such a strong assumption condition. Thirdly, the texture features do not need feature selection, because it is already simplified with compressing and has a remarkable performance in experiment without feature selection. So, the omitting of feature selection reduces method complexity without reducing accuracy. Finally, CCTCRF texture feature extraction costs little time compared with GLCM texture feature extraction, which heavy computation burden and time-consuming are its big problem especially without feature selection. CCTCRF texture feature extraction has the simple texture feature extraction procedure which includes extracting local image from image, extracting patch from local image, stretching patch into patch vector, and compressing patch vector that only needs matrix multiplication. Meanwhile, omitting feature selection can also save time. Thus, the feature extraction of CCTCRF method is more suitable for the further popularization of cirrhosis CAD system that needs to provide diagnosis fast and accurately.
Further, CCTCRF experiment result has confirmed that the five sequences hepatic MRIs of T1-weighted, T2-weighted, arterial phase, portal venous phase, and equilibrium phase are all prominent for every stage cirrhosis classification. In addition, the case decision making step achieves a remarkable performance on the basis of ROI classification result which is already satisfying, and it eliminates few special ROIs inaccurate classification with an overall decision making of one case.
The promising results of this paper motivate a further research of cirrhosis diagnosis and classification. In the future, we will use more cases to verify CCTCRF’s effectiveness and add morphological features into middle and advanced classification to improve its ROI accuracy. Furthermore, we will class the cirrhosis with more subtle stages with CCTCRF and apply CCTCRF in hepatic fibrosis classification which is more meaningful for doctors and patients and our medical development is our research direction in the future.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
This work was supported by the National Natural Science Foundation of China (nos. 61003175 and 81071127), the Fundamental Research Funds for the Central Universities, and the National Key Technology Support Program no. 2012BAJ18B06.
- G. Lee, M. Kanematsu, H. Kato et al., “Unsupervised classification of cirrhotic livers using MRI data,” in Medical Imaging: Computer-Aided Diagnosis, vol. 6915 of Proceedings of SPIE, San Diego, Calif, USA, 2008.
- Y. Chen, J. Luo, T. Tateyama et al., “Statistical shape model of the liver and effective mode selection for classification of liver cirrhosis,” in Proceedings of the 6th International Conference on New Trends in Information Science, Service Science and Data Mining (ISSDM '12), pp. 446–449, Taipei, Taiwan, 2012.
- G. Lee, Y. Uchiyama, X. Zhang et al., “Classification of cirrhotic liver in gadolinium-enhanced MR images,” in Medical Imaging: Computer-Aided Diagnosis, vol. 6514 of Proceedings of SPIE, San Diego, Calif, USA, February 2007.
- L. Hui, G. D. Mei, and L. Xiang, “Cirrhosis classification based on MRI with duplicative-feature support vector machine (DFSVM),” Biomedical Signal Processing and Control, vol. 8, no. 4, pp. 346–353, 2013.
- W. Li, Y. Zeng, X. Zhang, Y. Huang, L. Long, and H. Fujita, “Staging the hepatic fibrosis on CT images: optimizing the slice thickness and texture features,” in Proceedings of the 2nd International Symposium on Bioelectronics and Bioinformatics (ISBB '11), pp. 267–270, Suzhou, China, November 2011.
- Y. Chen, J. Luo, C. Dong et al., “Computer-aided diagnosis and quantification of cirrhotic livers based on morphological analysis and machine learning,” Computational and Mathematical Methods in Medicine, vol. 2013, Article ID 264809, 8 pages, 2013.
- H.-Y. Jiang, Y. Zhao, and X.-F. Yang, “Computer aided diagnosis on hepatocirrhosis degree based on MRI,” Journal of Northeastern University, vol. 28, no. 1, pp. 31–34, 2007.
- Y. F. Zeng, X. J. Zhang, W. Yan et al., “Computer aided interpretation of fibrous texture in hepatic magnetic resonance images,” Advanced Materials Research, vol. 647, pp. 325–330, 2013.
- J. Virmani, V. Kumar, N. Kalra, and N. Khandelwal, “Prediction of cirrhosis based on singular value decomposition of gray level co-occurence marix and a neural network classifier,” in Proceedings of the 4th International Conference on Developments in E-Systems Engineering (DeSE '11), pp. 146–151, Dubai, UAE, December 2011.
- J. Virmani, V. Kumar, N. Kalra, and N. Khandelwal, “SVM-based characterisation of liver cirrhosis by singular value decomposition of GLCM matrix,” International Journal of Artificial Intelligence and Soft Computing, vol. 3, no. 3, pp. 276–296, 2013.
- S. Gao, Y. Peng, H. Guo et al., “Texture analysis and classification of ultrasound liver images,” Bio-Medical Materials and Engineering, vol. 24, no. 1, pp. 1209–1216, 2014.
- L. Liu and P. Fieguth, “Texture classification from random features,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 3, pp. 574–586, 2012.
- R. Hecht-Nielsen, “Theory of the backpropagation neural network,” in Proceedings of the International Joint Conference on Neural Networks (IJCNN '89), vol. 1, pp. 593–605, Washington, DC, USA, June 1989.
- D. Albesano, R. Gemello, and F. Mana, “Hybrid HMM-NN modeling of stationary-transitional units for continuous speech recognition,” Information Sciences, vol. 123, no. 1, pp. 3–11, 2000.
- F. Jelinek, “Continuous speech recognition by statistical methods,” Proceedings of the IEEE, vol. 64, no. 4, pp. 532–556, 1976.
- S. Lawrence, C. L. Giles, A. C. Tsoi, and A. D. Back, “Face recognition: a convolutional neural-network approach,” IEEE Transactions on Neural Networks, vol. 8, no. 1, pp. 98–113, 1997.
- H. A. Rowley, S. Baluja, and T. Kanade, “Rotation invariant neural network-based face detection,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 38–44, Santa Barbara, Calif, USA, June 1998.
- H. A. Rowley, S. Baluja, and T. Kanade, “Neural network-based face detection,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 1, pp. 23–38, 1998.
- I. Guyon, J. S. Denker, and Y. LeCun, “Time delay neural network for printed and cursive handwritten character recognition,” Google Patents, 1992.
- N. Arica and F. T. Yarman-Vural, “An overview of character recognition focused on off-line handwriting,” IEEE Transactions on Systems, Man and Cybernetics C, vol. 31, no. 2, pp. 216–233, 2001.
- G. Zhang, H. Rong, W. Jin, and L. Hu, “Radar emitter signal recognition based on resemblance coefficient features,” in Rough Sets and Current Trends in Computing, vol. 3066 of Lecture Notes in Computer Science, pp. 665–670, 2004.
- A. Kundu, G. C. Chen, and C. E. Persons, “Transient sonar signal classification using hidden Markov models and neural nets,” IEEE Journal of Oceanic Engineering, vol. 19, no. 1, pp. 87–99, 1994.
- B. Barshan, B. Ayrulu, and S. W. Utete, “Neural network-based target differentiation using sonar for robotics applications,” IEEE Transactions on Robotics and Automation, vol. 16, no. 4, pp. 435–442, 2000.
- R. M. Haralick, “Statistical and structural approaches to texture,” Proceedings of the IEEE, vol. 67, no. 5, pp. 786–804, 1979.
- K. Li, Study on breast lesions computer-aided diagnosis between malignant and benign based on DCE-MRI [M.S. thesis], Dalian University of Technology, Dalian, China, 2011.
- R. M. Haralick, K. Shanmugam, and I. H. Dinstein, “Textural features for image classification,” IEEE Transactions on Systems, Man and Cybernetics, vol. 3, no. 6, pp. 610–621, 1973.
- E. J. Candes and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, 2005.
- E. J. Candes and T. Tao, “Near-optimal signal recovery from random projections: universal encoding strategies?” IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5406–5425, 2006.
- D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006.
- N. Goel, G. Bebis, and A. Nefian, “Face recognition experiments with random projection,” in Biometric Technology for Human Identification II, vol. 5779 of Proceedings of SPIE, pp. 426–437, Orlando, Fla, USA, March 2005.
- E. Bingham and H. Mannila, “Random projection in dimensionality reduction: applications to image and text data,” in Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '01), pp. 245–250, San Francisco, Calif, USA, August 2001.
- X. Z. Fern and C. E. Brodley, “Random projection for high dimensional data clustering: a cluster ensemble approach,” in Proceedings of the 20th International Conference on Machine Learning (ICML '03), pp. 186–193, Washington, DC, USA, August 2003.
Copyright © 2014 Hui Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.