search

YouyiSong / Codes-for-Selective-Learning

Codes for MICCAI 2021 Paper: Selective Learning from External Data for CT Image Segmentation
11 stars 1 forks source link

Problems in Network Updating #1

Open wangyunpengbio opened 3 years ago

wangyunpengbio commented 3 years ago

Hello, your repository is great and I have learned a lot from it. However, in the 'Network Updating' section 3.2 of the paper, I feel confused about the term C(f (t)). The constraint (2b) is converted into the term C(f (t)) in your paper. I am very curious about how this constraint is implemented in the code. If you can point out how the following formula is implemented in your code, I would be very grateful. The formula is : C(f (t)) = ∑ i∈[M] max (L i(f (t)) − L i(fˆM∗ ), 0)

YouyiSong commented 3 years ago

Hi,

Thanks for your interesting in the paper and code.

It is in the line 112-114 in the training.py file.

We first compute L_i(f(t)) - L_i(f^M*) in the line 112; here the 'weightTarget' is just for recognizing which are the extra data. We then compute the max() operation in the line 113 and finally get the sum in the line 114.

I am sorry for this unclear code writing. Thanks your careful reading and pointing out this.

If there are still any problems, welcome you in advance. Thanks.

wangyunpengbio commented 3 years ago

Thank you very much for your reply and the detailed answers. I got it.