arXiv (All)
open access
Sparse plus low-rank matrix embedding with applications in cancer radiotherapy optimization
Decomposing a matrix into sparse and low-rank components is central to robust principal component analysis and has broad applications in machine learning, signal processing, and computer vision. Classical formulations seek to recover the underlying sparse and low-rank structure. We instead introduce
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Magnetic Resonance Imaging-based Prostate Cancer Diagnosis Using Principal Component Analysis and Machine Learning Algorithms.#354738
- The Factor Width Rank of a Matrix#1000456
- Tensor nuclear norm minimization with linear constraints#1117931
- Phantom-based evaluation of radiomics feature stability for low-dose CT lung cancer screening.#430995
- An nnU-Net-based framework with adaptive feature representation for 3D brain tumor segmentation.#662793
Record · ID 972746
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive