Learn More
Prostate cancer is the most diagnosed form of cancer, but survival rates are relatively high with sufficiently early diagnosis. Current computer-aided image-based cancer detection methods face notable challenges include noise in MRI images, variability between different MRI modalities, weak contrast, and non-homogeneous texture patterns, making it difficult(More)
Radiomics has proven to be a powerful prognostic tool for cancer detection, and has previously been applied in lung, breast, prostate, and head-and-neck cancer studies with great success. However, these radiomics-driven methods rely on pre-defined, hand-crafted radiomic feature sets that can limit their ability to characterize unique cancer traits. In this(More)
—Objective: Lung cancer is the leading cause for cancer related deaths. As such, there is an urgent need for a streamlined process that can allow radiologists to provide diagnosis with greater efficiency and accuracy. A powerful tool to do this is radiomics. Method: In this study, we take the idea of radiomics one step further by introducing the concept of(More)
Markov random fields (MRFs) and conditional random fields (CRFs) are influential tools in image modeling, particularly for applications such as image segmentation. Local MRFs and CRFs utilize local nodal interactions when modeling, leading to excessive smoothness on boundaries (i.e., the short-boundary bias problem). Recently, the concept of fully connected(More)
Given the high costs of conducting a drug-response trial, researchers are now aiming to use retrospective analyses to conduct genome-wide association studies (GWAS) to identify underlying genetic contributions to drug-response variation. To prevent confounding results from a GWAS to investigate drug response, it is necessary to account for concomitant(More)
—We propose an effective framework for salient region detection in natural images based on the concept of self-guided statistical non-redundancy (SGNR). Salient regions are unique because they have low information redundancy within a given image, while the rest of the scene may be highly redundant. We first analyze the structural characteristics of the(More)
The approximation of nonlinear kernels via linear feature maps has recently gained interest due to their applications in reducing the training and testing time of kernel-based learning algorithms. Current random projection methods avoid the curse of dimensionality by embedding the nonlin-ear feature space into a low dimensional Euclidean space to create(More)