• 沒有找到結果。

Weakly Supervised Learning for

N/A
N/A
Protected

Academic year: 2022

Share "Weakly Supervised Learning for"

Copied!
19
0
0

加載中.... (立即查看全文)

全文

(1)

Weakly Supervised Learning for

Findings Detection in Medical Images

HaoCheng Kao

(2)

Outline

• The Task

• A Naïve method

• The Dataset

• Grading

• Submission

• Rules

• Contacts

(3)

Task

(4)

Task

(5)

Task

• 14 Findings (classes)

• Predict bounding box + class

• Training data has only class labels

(6)

Naïve method

(7)

Dataset

• We use NIH ChestX-ray 14 dataset

https://nihcc.app.box.com/v/ChestXray-NIHCC

• Training set (111240)

• Validation set (440)

• Testing set (440)

(8)

Download

• Data_Entry_2017_v2.csv

Image-level annotation for all images.

• Bbox_List_2017.csv

Bounding box annotation for validation / testing images.

• train.txt / valid.txt / test.txt Lists of images in each set.

(9)

Grading

• 60% accuracy

• 40% novelty & report or poster

(10)

Intersection over Union

(11)

Accuracy

• For each ground truth box in a test image, we’ll check if there is an output box correctly locate this box.

– Class label is correctly predicted.

– IoU of ground truth box and predicted box >= T(IoU).

• The ratio of successful ground truth boxes in an image is the score of the image.

• The average score of all images is the score of a specific T(IoU).

• The final score is the average of T(IoU)=0.25 and T(IoU)=0.5.

• You must output up to 10 bounding boxes per image.

(12)

Typical workflow of a submission

1. Call get_file_names() to get the list of files.

2. Load your model.

3. For each image, inference the answer.

4. Call get_output_file_object() to get the output file object.

5. Write the output.

6. Call judge() to get the result.

Note that the timestamp created when judge() is called is used for judging if the submission is on time.

(13)

Submission

• Submission for evaluating on testing data

– During this competition, you can submit your model to be evaluated on testing data.

• Final submission

– After you complete your project, you should

submit your whole project so that we can verify your result.

(14)

Final Submission

• Your final submission should contain the following:

– Trained model & Whole Code – Document & report

(15)

Task Restrictions

• Keras / PyTorch / TensorFlow / MXNet / CNTK

• You can only submit a single archive

containing all the codes and model. This archive must not exceed 1GB in size.

(16)

Restrictions on Dataset

• Stick to the dataset provided by link.

• The bounding boxes of validation / testing set are publicly disclosed, but you may not use

them to train your model.

• You are allowed to use only the following extra context:

Patient Age / Patient Gender / View Position

(17)

Pre-trained Model

• The pre-trained model should only be trained by the ImageNet dataset for classification and

localization.

• You can download any available pre-trained model from the internet

– Make sure that it is only trained by the ImageNet dataset for classification and localization.

– Make sure you have the rights to use the model.

• You can create your own pre-trained model, but it should be trained from randomly-initialized

parameters.

(18)

Rules

• The final model must only rely on the training / validation set. The bounding boxes of the validation set can only be used to validate your model.

• For grading, you must submit your model / algorithm to the submission site before the deadline following the

submission rules.

• All submitted materials must be created by the team

members or the team members must have proper rights to use them.

• All novelty must be created solely by the team members.

No assistance from outside of the team is allowed.

• Course regulations, the contract, and school regulations bust be followed.

(19)

Contacts

• HaoCheng_Kao@htc.com

• In general, we will announce your questions and our answers to all students instead of replying to each email.

參考文獻

相關文件

float voxelToPos(int p, int axis) const { return bounds pMin[axis]+p*Width[axis];. return

(Lectures 207/210, *) Next, we implement the random forest algorithm by coupling bagging (by sampling with replacement) with N 0 = 0.5N with your unpruned decision tree in the

[d] get a data set that contains spams and non-spams, for all words in the data set, let the machine calculate the ratio of spams per word; produce a list of words that appear more

Generate a data set of size 2 by the procedure above and run the decision stump algorithm on the data set to get g.. Repeat the experiment 10000 times, each with a different

(Note: The choices here “hint” you that the expected value is related to the matrix being inverted for regularized linear regression—see page 10 of Lecture 14. That is, data

Down to switch between original image, filtered image and result. „ Both accuracy and efficiency will be encountered when

March 14 th is next Tuesday, and I’m planning to give Josh a box of chocolate in return because I have strong feelings for

If each box can hold a maximum of 18 capsule toys, how many boxes at least are needed for holding all the capsule toys.. There will be 287