Skip navigation
Skip navigation

Efficient feature selection for polyp detection

Seghouane, Abd-Krim; Ong, Ju

Description

Computed tomographic colonography (CTC) is a promising alternative to traditional invasive colonoscopic methods used in the detection and removal of cancerous growths, or polyps in the colon. Existing algorithms for CTC typically use a classifier to discriminate between true and false positives generated by a polyp candidate detection system. However, these classifiers often suffer from a phenomenon termed the curse of dimensionality, whereby there is a marked degradation in the performance of...[Show more]

dc.contributor.authorSeghouane, Abd-Krim
dc.contributor.authorOng, Ju
dc.coverage.spatialHong Kong China
dc.date.accessioned2015-12-10T23:05:42Z
dc.date.createdSeptember 26-29 2010
dc.identifier.urihttp://hdl.handle.net/1885/62474
dc.description.abstractComputed tomographic colonography (CTC) is a promising alternative to traditional invasive colonoscopic methods used in the detection and removal of cancerous growths, or polyps in the colon. Existing algorithms for CTC typically use a classifier to discriminate between true and false positives generated by a polyp candidate detection system. However, these classifiers often suffer from a phenomenon termed the curse of dimensionality, whereby there is a marked degradation in the performance of a classifier as the number of features used in the classifier is increased. In addition an increase in the number of features used also contributes to an increase in computational complexity and demands on storage space. This paper demonstrates the benefits of feature selection with the aim at increasing specificity while preserving sensitivity in a polyp detection system. It also compares the performances of an individual (F-score) and mutual information (MI) method for feature selection on a polyp candidate database, in order to select a subset of features for optimum CAD performance. Experimental results show that the performance of SVM+MI seems to be better for a small number of features used, but the SVM+Fscore method seems to dominate when using the 30-50 best ranked features. On the whole, the AUC measures are able to reach 0.8-0.85 for the top ranked 20-40 features using MI or F-score methods compared with 0.65-0.7 when using all 100 features in the worst-case scenario.
dc.publisherIEEE Signal Processing Society
dc.relation.ispartofseriesIEEE International Conference on Image Processing 2010
dc.sourceProceedings of IEEE International Conference on Image Processing 2010
dc.subjectKeywords: Cancerous growth; Computed tomographic colonography; Computed Tomography; Curse of dimensionality; Detection system; Efficient feature selections; F-score; False positive; Feature selection; Mutual information; Mutual informations; Polyp detection; Polyp Computed tomography (CT); Feature selection; Mutual information; Support vector classifier
dc.titleEfficient feature selection for polyp detection
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2010
local.identifier.absfor080106 - Image Processing
local.identifier.ariespublicationu4334215xPUB702
local.type.statusPublished Version
local.contributor.affiliationSeghouane, Abd-Krim, College of Engineering and Computer Science, ANU
local.contributor.affiliationOng, Ju, College of Engineering and Computer Science, ANU
local.description.embargo2037-12-31
local.bibliographicCitation.startpage2285
local.bibliographicCitation.lastpage2288
local.identifier.doi10.1109/ICIP.2010.5648923
local.identifier.absseo970109 - Expanding Knowledge in Engineering
dc.date.updated2016-02-24T11:02:45Z
local.identifier.scopusID2-s2.0-78651107350
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Seghouane_Efficient_feature_selection_2010.pdf347.16 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator