Yiqun Lin, Wei Zhao, Hualiang Wang, Xiaomeng Li, Jiewen Yang, Xinpeng Ding
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Cone beam computed tomography (CBCT) is an important imaging technology widely used in medical scenarios, such as diagnosis and preoperative planning. Using fewer projection views to reconstruct CT, also known as sparse-view reconstruction, can reduce ionizing radiation and further benefit interventional radiology. Compared with sparse-view reconstruction for traditional parallel/fan-beam CT, CBCT reconstruction is more challenging due to the increased dimensionality caused by the measurement process based on cone-shaped X-ray beams. As a 2D-to-3D reconstruction problem, although implicit neural representations have been introduced to enable efficient training, only local features are considered and different views are processed equally in previous works, resulting in spatial inconsistency and poor performance on complicated anatomies. To this end, we propose C 2 RV by leveraging explicit multi-scale volumetric representations to enable cross-regional learning in the 3D space. Additionally, the scale-view crossattention module is introduced to adaptively aggregate multi-scale and multi-view features. Extensive experiments demonstrate that our C 2 RV achieves consistent and significant improvement over previous state-of-the-art methods on datasets with diverse anatomy. Code is available at https://github.com/xmed-lab/C2RV-CBCT.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.03902")
get_code_for_paper("2406.03902")
have("2406.03902")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.03902.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.03902)
Connect an agent — have() is free.