|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM322244609 |
| 003 |
DE-627 |
| 005 |
20231225181629.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2021 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2021.3062726
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1074.xml
|
| 035 |
|
|
|a (DE-627)NLM322244609
|
| 035 |
|
|
|a (NLM)33667164
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Ke, Rihuan
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Multi-Task Deep Learning for Image Segmentation Using Recursive Approximation Tasks
|
| 264 |
|
1 |
|c 2021
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 12.03.2021
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Fully supervised deep neural networks for segmentation usually require a massive amount of pixel-level labels which are manually expensive to create. In this work, we develop a multi-task learning method to relax this constraint. We regard the segmentation problem as a sequence of approximation subproblems that are recursively defined and in increasing levels of approximation accuracy. The subproblems are handled by a framework that consists of 1) a segmentation task that learns from pixel-level ground truth segmentation masks of a small fraction of the images, 2) a recursive approximation task that conducts partial object regions learning and data-driven mask evolution starting from partial masks of each object instance, and 3) other problem oriented auxiliary tasks that are trained with sparse annotations and promote the learning of dedicated features. Most training images are only labeled by (rough) partial masks, which do not contain exact object boundaries, rather than by their full segmentation masks. During the training phase, the approximation task learns the statistics of these partial masks, and the partial regions are recursively increased towards object boundaries aided by the learned information from the segmentation task in a fully data-driven fashion. The network is trained on an extremely small amount of precisely segmented images and a large set of coarse labels. Annotations can thus be obtained in a cheap way. We demonstrate the efficiency of our approach in three applications with microscopy images and ultrasound images
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Bugeau, Aurelie
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Papadakis, Nicolas
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Kirkland, Mark
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Schuetz, Peter
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Schonlieb, Carola-Bibiane
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 30(2021) vom: 05., Seite 3555-3567
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:30
|g year:2021
|g day:05
|g pages:3555-3567
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2021.3062726
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 30
|j 2021
|b 05
|h 3555-3567
|