3D-reconstruction-from-2D-ultrasound-images
importedsoftware/3d-reconstruction-from-2d-ultrasound-images
Python program to convert slices of 2D images to 3D structure
Machine-generated from the listed sources and not yet reviewed by a human.
- Category
- Software & Systems
- Subcategory
- unknown
- License
- MIT(osi)
- Status
- dormant
- Maturity
- deployed
- Organization
- unknown
- Country
- unknown
- Homepage
- unknown
- Documentation
- unknown
- Tags
- 3d · 3d-reconstruction · kmeans-clustering · ultrasound
- Regulatory
- unknown
Top contributors by commit count, from the project’s public repository. Avatars are served by their origin, not stored here. To be removed from this list, open an issue.
Computed from shared tags, weighted so a rare tag counts for more than a common one. These are suggestions, not curated relationships.
- KMeans-Clustering-Food-Recomendationkmeans-clustering
This is a mini-project created in response to the "Microsoft Azure Scholarship Project Showcase Challenge" for recommending "safe food" for patients suffering from a number of killer-diseases at the…
- Dicom-Viewer3d-reconstruction
An application displaying 2D/3D Dicom
- DiffDRR3d-reconstruction
Auto-differentiable digitally reconstructed radiographs in PyTorch
- naf_cbct3d-reconstruction
"Neural Attenuation Fields for Sparse-View CBCT Reconstruction" (MICCAI 2022 Oral)
- NeSVoR3d-reconstruction
NeSVoR is a package for GPU-accelerated slice-to-volume reconstruction.
- SAX-NeRF3d-reconstruction
"Structure-Aware Sparse-View X-ray 3D Reconstruction" (CVPR 2024) - A Toolbox for CT reconstruction and X-ray Novel View Synthesis
- api.github.com/repos/sachin-vs/3D-reconstruction-from-2D-ultrasound-imagesretrieved 2026-08-05 · via github-api
Machine-imported from GitHub search. Last push 2022-01-20, 49 stars, license reported as MIT. Category and schematic were assigned by keyword heuristics and are unreviewed.
Not yet verified by a human. Correct this record →
/v1/entries/34.json→ .entries["3d-reconstruction-from-2d-ultrasound-images"]
Entries are sharded 64 ways by a stable hash of the id, so a consumer can find any record without an index.