Meeting Banner
Abstract #2657

Generalizability of Deep-Learning Segmentation Algorithms on Independent Datasets for Measuring T2 Relaxation Times

Andrew Schmidt1, Arjun D Desai1, Lauren E Watkins2, Hollis Crowder3, Elka Rubin1, Valentina Mazzoli1, Quin Lu4, Marianne S Black1,3, Feliks Kogan1, Garry E Gold1,2, Brian A Hargreaves1,5, and Akshay S Chaudhari1
1Radiology, Stanford University, Palo Alto, CA, United States, 2Bioengineering, Stanford University, Palo Alto, CA, United States, 3Mechanical Engineering, Stanford University, Palo Alto, CA, United States, 4Philips Healthcare North America, Gainesville, FL, United States, 5Electrical Engineering, Stanford University, Palo Alto, CA, United States

Automated segmentation using deep learning can potentially expedite segmentation tasks. However, the generalizability of such algorithms on new unseen datasets is unknown. To test this generalizability, we used a knee segmentation algorithm trained on Osteoarthritis Initiative double-echo steady-state (DESS) datasets to segment cartilage from quantitative DESS datasets from three independent studies. We compared manual-automatic segmentation accuracy and the resultant qDESS T2 map variations. These results quantitatively demonstrate that a deep learning network trained on a single dataset does not generalize with a high accuracy to additional datasets even with similar image characteristics, and that additional fine-tuning may be needed.

How to access this content:

For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.

After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.

After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.

Click here for more information on becoming a member.

Keywords