Massive-Training Support Vector Regression With Feature Selection in Application of Computer-Aided Detection of Polyps in CT Colonography

Massive-Training Support Vector Regression With Feature Selection in Application of Computer-Aided Detection of Polyps in CT Colonography

Jianwu Xu (University of Chicago, USA), Amin Zarshenas (Illinois Institute of Technology, USA), Yisong Chen (Peking University, China) and Kenji Suzuki (Illinois Institute of Technology, USA)
Copyright: © 2018 |Pages: 38
DOI: 10.4018/978-1-5225-3085-5.ch006


A major challenge in the latest computer-aided detection (CADe) of polyps in CT colonography (CTC) is to improve the false positive (FP) rate while maintaining detection sensitivity. Radiologists prefer CADe system produce small number of false positive detections, otherwise they might not consider CADe system improve their workflow. Towards this end, in this study, we applied a nonlinear regression model operating on CTC image voxels directly and a nonlinear classification model with extracted image features based on support vector machines (SVMs) in order to improve the specificity of CADe of polyps. We investigated the feasibility of a support vector regression (SVR) in the massive-training framework, and we developed a massive-training SVR (MTSVR) in order to reduce the long training time associated with the massive-training artificial neural network (MTANN) for reduction of FPs in CADe of polyps in CTC. In addition, we proposed a feature selection method directly coupled with an SVM classifier to maximize the CADe system performance. We compared the proposed feature selection method with the conventional stepwise feature selection based on Wilks' lambda with a linear discriminant analysis classifier. The FP reduction system based on the proposed feature selection method was able to achieve a 96.0% by-polyp sensitivity with an FP rate of 4.1 per patient. The performance is better than that of the stepwise feature selection based on Wilks' lambda (which yielded the same sensitivity with 18.0 FPs/patient). To test the performance of the proposed MTSVR, we compared it with the original MTANN in the distinction between actual polyps and various types of FPs in terms of the training time reduction and FP reduction performance. The CTC database used in this study consisted of 240 CTC datasets obtained from 120 patients in the supine and prone positions. With MTSVR, we reduced the training time by a factor of 190, while achieving a performance (by-polyp sensitivity of 94.7% with 2.5 FPs/patient) comparable to that of the original MTANN (which has the same sensitivity with 2.6 FPs/patient).
Chapter Preview


Colorectal cancer is the second leading cause of mortality due to cancer in the United States (Jemal et al., 2009; Mamonov, et al., 2014). Evidence has shown that the risk of colon cancer death could be reduced with early detection and removal of colonic polyps (Winawer et al., 1997). Fiberoptic (or optical) colonoscopy is considered the gold-standard diagnostic test as it offers direct biopsy or removal of suspicious colonic polyps (Winawer et al., 1997). However, optical colonoscopy is invasive, i.e., it has risks of complications such as perforation; it is expensive, and it requires a long examination time and creates high patient discomfort. Therefore, medical centers are seeking alternative techniques as population screening tools. CT colonography (CTC), also known as virtual colonoscopy, has been proposed as an alternative, less invasive technique for detecting colorectal neoplasms (Chaoui, Blake, Barish, & Fenlon, 2000; Coin et al., 1983; Johnson & Dachman, 2000; McKenna, et al., 2012; van Wijk, et al., 2010; Vining, 1997), which requires a lesser examination time and causes less patient discomfort. However, the sensitivity of CTC can be lower for inexperienced readers because there is a long learning curve for CTC reading. This limitation begs for a CADe approach as a “second reader” to assist radiologists in detecting polyps from CTC images (Yoshida & Dachman, 2005).

Complete Chapter List

Search this Book: