paper-with-me

Papers

Error Corrective Boosting for Learning Fully Convolutional Networks with Limited Data

2017-05-02 · Abhijit Guha Roy, Sailesh Conjeti, Debdoot Sheet, Amin Katouzian, Nassir Navab, Christian Wachinger

Training deep fully convolutional neural networks (F-CNNs) for semantic image segmentation requires access to abundant labeled data. While large datasets of unlabeled image data are available in medical applications, access to manually labeled data is very limited. We propose to automatically create auxiliary labels on initially unlabeled data with existing tools and to use them for pre-training. For the subsequent fine-tuning of the network with manually labeled data, we introduce error corrective boosting (ECB), which emphasizes parameter updates on classes with lower accuracy. Furthermore, we introduce SkipDeconv-Net (SD-Net), a new F-CNN architecture for brain segmentation that combines skip connections with the unpooling strategy for upsampling. The SD-Net addresses challenges of severe class imbalance and errors along boundaries. With application to whole-brain MRI T1 scan segmentation, we generate auxiliary labels on a large dataset with FreeSurfer and fine-tune on two datasets with manual annotations. Our results show that the inclusion of auxiliary labels and ECB yields significant improvements. SD-Net segments a 3D scan in 7 secs in comparison to 30 hours for the closest multi-atlas segmentation method, while reaching similar performance. It also outperforms the latest state-of-the-art F-CNN models.

📄 PDF Abstract BibTeX arXiv:1705.00938

Code (0)

등록된 구현이 없습니다.

Tasks

Brain SegmentationImage SegmentationSegmentationSemantic Segmentation

Similar Papers 제목 키워드 기반

Fully-Corrective Gradient Boosting with Squared Hinge: Fast Learning Rates and Early Stopping

2020-04-01 · Jinshan Zeng, Min Zhang, Shao-Bo Lin

Boosting is a well-known method for improving the accuracy of weak learners in machine learning. However, its theoretical generalization guarantee is missing in literature. In this paper, we propose an efficient boosting…

Binary ClassificationGeneral Classification

Boosting Revisited: Benchmarking and Advancing LP-Based Ensemble Methods

2025-07-24 · Fabian Akkerman, Julien Ferry, Christian Artigues, Emmanuel Hebrard 외 arxiv

Despite their theoretical appeal, totally corrective boosting methods based on linear programming have received limited empirical attention. In this paper, we conduct the first large-scale experimental study of six LP-ba…

Gradient Boosting Neural Networks: GrowNet

2020-02-19 · Sarkhan Badirli, Xuanqing Liu, Zhengming Xing, Avradeep Bhowmik 외

A novel gradient boosting framework is proposed where shallow neural networks are employed as ``weak learners''. General loss functions are considered under this unified framework with specific examples presented for cla…

Learning-To-Rankregression

Learning Nonlinear Functions Using Regularized Greedy Forest

2011-09-05 · Rie Johnson, Tong Zhang

We consider the problem of learning a forest of nonlinear decision rules with general loss functions. The standard methods employ boosted decision trees such as Adaboost for exponential loss and Friedman's gradient boost…

Universal Boosting Variational Inference

2019-06-04 · NeurIPS 2019 12 · Trevor Campbell, Xinglong Li

Boosting variational inference (BVI) approximates an intractable probability density by iteratively building up a mixture of simple component distributions one at a time, using techniques from sparse convex optimization …

Stochastic OptimizationVariational Inference