Sparse classification for computer aided diagnosis using learned dictionaries

N/ACitations
Citations of this article
73Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Classification is one of the core problems in computer-aided cancer diagnosis (CAD) via medical image interpretation. High detection sensitivity with reasonably low false positive (FP) rate is essential for any CAD system to be accepted as a valuable or even indispensable tool in radiologists' workflow. In this paper, we propose a novel classification framework based on sparse representation. It first builds an overcomplete dictionary of atoms for each class via K-SVD learning, then classification is formulated as sparse coding which can be solved efficiently. This representation naturally generalizes for both binary and multiwise classification problems, and can be used as a standalone classifier or integrated with an existing decision system. Our method is extensively validated in CAD systems for both colorectal polyp and lung nodule detection, using hospital scale, multi-site clinical datasets. The results show that we achieve superior classification performance than existing state-of-the-arts, using support vector machine (SVM) and its variants [1,2], boosting [3], logistic regression [4], relevance vector machine (RVM) [5,6], or k-nearest neighbor (KNN) [7]. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Liu, M., Lu, L., Ye, X., Yu, S., & Salganicoff, M. (2011). Sparse classification for computer aided diagnosis using learned dictionaries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6893 LNCS, pp. 41–48). https://doi.org/10.1007/978-3-642-23626-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free