Yizhou Wang, Chunyu Wang, Yizhou Yu, Ping Gong, Zihao Yin
We lifted 16 functions out of this paper's own repositories and ran 13 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| GoldExcalibur/EdgeTrans4Mark | canonical | 13 of 16 |
| Function | Status | Where it lives |
|---|---|---|
| calc_dists | Ran | GoldExcalibur/EdgeTrans4Mark/lib/core/evaluate.py code served (permissive licence) · get_code("b91b38261b03587d") |
| convert2unicode | Ran | GoldExcalibur/EdgeTrans4Mark/lib/utils/share.py code served (permissive licence) · get_code("d3b8cfd6b3b2dfb6") |
| create_window | Ran | GoldExcalibur/EdgeTrans4Mark/lib/core/loss.py code served (permissive licence) · get_code("da927b7672f6f833") |
| dist_acc | Ran | GoldExcalibur/EdgeTrans4Mark/lib/core/evaluate.py code served (permissive licence) · get_code("1c2da88027e6e151") |
| flip_back | Ran | GoldExcalibur/EdgeTrans4Mark/lib/utils/transforms.py code served (permissive licence) · get_code("6ad4687e2bb97aaa") |
| flow2pts | Ran | GoldExcalibur/EdgeTrans4Mark/lib/core/function_st1.py code served (permissive licence) · get_code("1c64871da34c0bfa") |
| gaussian | Ran | GoldExcalibur/EdgeTrans4Mark/lib/core/loss.py code served (permissive licence) · get_code("0d209028c2dee969") |
| get_max_preds | Ran | GoldExcalibur/EdgeTrans4Mark/lib/core/inference.py code served (permissive licence) · get_code("55c58ef5f795e3d1") |
| get_model_name | Ran | GoldExcalibur/EdgeTrans4Mark/lib/core/config.py code served (permissive licence) · get_code("9ff2eaab2a0fd2d7") |
| is_equal_file | Ran | GoldExcalibur/EdgeTrans4Mark/lib/utils/share.py code served (permissive licence) · get_code("29edfb8df144683d") |
| load_pickle | Ran | GoldExcalibur/EdgeTrans4Mark/lib/utils/share.py code served (permissive licence) · get_code("6d32d6b22d611f93") |
| theta2pts | Ran | GoldExcalibur/EdgeTrans4Mark/lib/core/function_st1.py code served (permissive licence) · get_code("ca8ee266219227b4") |
| transform_preds | Ran | GoldExcalibur/EdgeTrans4Mark/lib/utils/transforms.py code served (permissive licence) · get_code("fd1dd6dc7c341426") |
| fliplr_joints | Not yet run | GoldExcalibur/EdgeTrans4Mark/lib/utils/transforms.py code served (permissive licence) · get_code("d49a474bc36c5234") |
| get_grad | Not yet run | GoldExcalibur/EdgeTrans4Mark/lib/core/loss.py code served (permissive licence) · get_code("eb211362afd244c4") |
| im2edge | Not yet run | GoldExcalibur/EdgeTrans4Mark/lib/core/function_st1.py code served (permissive licence) · get_code("af4708fcb42e173f") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
As an important upstream task for many medical applications, supervised landmark localization still requires non-negligible annotation costs to achieve desirable performance. Besides, due to cumbersome collection procedures, the limited size of medical landmark datasets impacts the effectiveness of large-scale self-supervised pre-training methods. To address these challenges, we propose a two-stage framework for one-shot medical landmark localization, which first infers landmarks by unsupervised registration from the labeled exemplar to unlabeled targets, and then utilizes these noisy pseudo labels to train robust detectors. To handle the significant structure variations, we learn an endto-end cascade of global alignment and local deformations, under the guidance of novel loss functions which incorporate edge information. In stage II, we explore self-consistency for selecting reliable pseudo labels and cross-consistency for semi-supervised learning. Our method achieves state-of-the-art performances on public datasets of different body parts, which demonstrates its general applicability. Code is available at https: //github.com/GoldExcalibur/EdgeTrans4Mark.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2208.00453")
get_code_for_paper("2208.00453")
have("2208.00453")
Connect an agent — have() is free.