Dataset Information

The successive projection algorithm as an initialization method for brain tumor segmentation using non-negative matrix factorization.

ABSTRACT: Non-negative matrix factorization (NMF) has become a widely used tool for additive parts-based analysis in a wide range of applications. As NMF is a non-convex problem, the quality of the solution will depend on the initialization of the factor matrices. In this study, the successive projection algorithm (SPA) is proposed as an initialization method for NMF. SPA builds on convex geometry and allocates endmembers based on successive orthogonal subspace projections of the input data. SPA is a fast and reproducible method, and it aligns well with the assumptions made in near-separable NMF analyses. SPA was applied to multi-parametric magnetic resonance imaging (MRI) datasets for brain tumor segmentation using different NMF algorithms. Comparison with common initialization methods shows that SPA achieves similar segmentation quality and it is competitive in terms of convergence rate. Whereas SPA was previously applied as a direct endmember extraction tool, we have shown improved segmentation results when using SPA as an initialization method, as it allows further enhancement of the sources during the NMF iterative procedure.

SUBMITTER: Sauwen N

PROVIDER: S-EPMC5573288 | biostudies-literature | 2017

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

The successive projection algorithm as an initialization method for brain tumor segmentation using non-negative matrix factorization.

Sauwen Nicolas N Acou Marjan M Bharath Halandur N HN Sima Diana M DM Veraart Jelle J Maes Frederik F Himmelreich Uwe U Achten Eric E Van Huffel Sabine S

PloS one 20170828 8

Non-negative matrix factorization (NMF) has become a widely used tool for additive parts-based analysis in a wide range of applications. As NMF is a non-convex problem, the quality of the solution will depend on the initialization of the factor matrices. In this study, the successive projection algorithm (SPA) is proposed as an initialization method for NMF. SPA builds on convex geometry and allocates endmembers based on successive orthogonal subspace projections of the input data. SPA is a fast ...[more]

PMID: 28846686

Similar Datasets

Project description:BackgroundPattern Recognition techniques can provide invaluable insights in the field of neuro-oncology. This is because the clinical analysis of brain tumors requires the use of non-invasive methods that generate complex data in electronic format. Magnetic Resonance (MR), in the modalities of spectroscopy (MRS) and spectroscopic imaging (MRSI), has been widely applied to this purpose. The heterogeneity of the tissue in the brain volumes analyzed by MR remains a challenge in terms of pathological area delimitation.Methodology/principal findingsA pre-clinical study was carried out using seven brain tumor-bearing mice. Imaging and spectroscopy information was acquired from the brain tissue. A methodology is proposed to extract tissue type-specific sources from these signals by applying Convex Non-negative Matrix Factorization (Convex-NMF). Its suitability for the delimitation of pathological brain area from MRSI is experimentally confirmed by comparing the images obtained with its application to selected target regions, and to the gold standard of registered histopathology data. The former showed good accuracy for the solid tumor region (proliferation index (PI)>30%). The latter yielded (i) high sensitivity and specificity in most cases, (ii) acquisition conditions for safe thresholds in tumor and non-tumor regions (PI>30% for solid tumoral region; ?5% for non-tumor), and (iii) fairly good results when borderline pixels were considered.Conclusions/significanceThe unsupervised nature of Convex-NMF, which does not use prior information regarding the tumor area for its delimitation, places this approach one step ahead of classical label-requiring supervised methods for discrimination between tissue types, minimizing the negative effect of using mislabeled voxels. Convex-NMF also relaxes the non-negativity constraints on the observed data, which allows for a natural representation of the MRSI signal. This should help radiologists to accurately tackle one of the main sources of uncertainty in the clinical management of brain tumors, which is the difficulty of appropriately delimiting the pathological area.

Project description:Background:Matrix factorization is a well established pattern discovery tool that has seen numerous applications in biomedical data analytics, such as gene expression co-clustering, patient stratification, and gene-disease association mining. Matrix factorization learns a latent data model that takes a data matrix and transforms it into a latent feature space enabling generalization, noise removal and feature discovery. However, factorization algorithms are numerically intensive, and hence there is a pressing challenge to scale current algorithms to work with large datasets. Our focus in this paper is matrix tri-factorization, a popular method that is not limited by the assumption of standard matrix factorization about data residing in one latent space. Matrix tri-factorization solves this by inferring a separate latent space for each dimension in a data matrix, and a latent mapping of interactions between the inferred spaces, making the approach particularly suitable for biomedical data mining. Results:We developed a block-wise approach for latent factor learning in matrix tri-factorization. The approach partitions a data matrix into disjoint submatrices that are treated independently and fed into a parallel factorization system. An appealing property of the proposed approach is its mathematical equivalence with serial matrix tri-factorization. In a study on large biomedical datasets we show that our approach scales well on multi-processor and multi-GPU architectures. On a four-GPU system we demonstrate that our approach can be more than 100-times faster than its single-processor counterpart. Conclusions:A general approach for scaling non-negative matrix tri-factorization is proposed. The approach is especially useful parallel matrix factorization implemented in a multi-GPU environment. We expect the new approach will be useful in emerging procedures for latent factor analysis, notably for data integration, where many large data matrices need to be collectively factorized.

Dataset Information

The successive projection algorithm as an initialization method for brain tumor segmentation using non-negative matrix factorization.

Publications

The successive projection algorithm as an initialization method for brain tumor segmentation using non-negative matrix factorization.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets