paper-with-me

Papers

Boosting Segmentation Performance across datasets using histogram specification with application to pelvic bone segmentation

2021-01-26 · Prabhakara Subramanya Jois, Aniketh Manjunath, Thomas Fevens

Accurate segmentation of the pelvic CTs is crucial for the clinical diagnosis of pelvic bone diseases and for planning patient-specific hip surgeries. With the emergence and advancements of deep learning for digital healthcare, several methodologies have been proposed for such segmentation tasks. But in a low data scenario, the lack of abundant data needed to train a Deep Neural Network is a significant bottle-neck. In this work, we propose a methodology based on modulation of image tonal distributions and deep learning to boost the performance of networks trained on limited data. The strategy involves pre-processing of test data through histogram specification. This simple yet effective approach can be viewed as a style transfer methodology. The segmentation task uses a U-Net configuration with an EfficientNet-B0 backbone, optimized using an augmented BCE-IoU loss function. This configuration is validated on a total of 284 images taken from two publicly available CT datasets, TCIA (a cancer imaging archive) and the Visible Human Project. The average performance measures for the Dice coefficient and Intersection over Union are 95.7% and 91.9%, respectively, give strong evidence for the effectiveness of the approach, which is highly competitive with state-of-the-art methodologies.

📄 PDF Abstract BibTeX arXiv:2101.11135

Code (0)

등록된 구현이 없습니다.

Tasks

SegmentationStyle Transfer

Methods 이 논문이 사용한 방법론

Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Concatenated Skip Connection A Concatenated Skip Connection is a type of skip connection that seeks to reuse features by concatenating them to new layers, allowing more information to be retained from…
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
U-Net 설명 없음

Similar Papers 제목 키워드 기반

Local Adaptivity of Gradient Boosting in Histogram Transform Ensemble Learning

2021-12-05 · Hanyuan Hang

In this paper, we propose a gradient boosting algorithm called \textit{adaptive boosting histogram transform} (\textit{ABHT}) for regression to illustrate the local adaptivity of gradient boosting algorithms in histogram…

Ensemble Learningregression

Boosted Histogram Transform for Regression

2020-01-01 · ICML 2020 1 · Yuchao Cai, Hanyuan Hang, Hanfang Yang, Zhouchen Lin

In this paper, we propose a boosting algorithm for regression problems called \textit{boosted histogram transform for regression} (BHTR) based on histogram transforms composed of random rotations, stretchings, and transl…

HTRregression

Gradient Boosted Binary Histogram Ensemble for Large-scale Regression

2021-06-03 · Hanyuan Hang, Tao Huang, Yuchao Cai, Hanfang Yang 외

In this paper, we propose a gradient boosting algorithm for large-scale regression problems called \textit{Gradient Boosted Binary Histogram Ensemble} (GBBHE) based on binary histogram partition and ensemble learning. Fr…

Computational EfficiencyEnsemble Learningregression

Geodesic Distance Histogram Feature for Video Segmentation

2017-03-31 · Hieu Le, Vu Nguyen, Chen-Ping Yu, Dimitris Samaras

This paper proposes a geodesic-distance-based feature that encodes global information for improved video segmentation algorithms. The feature is a joint histogram of intensity and geodesic distances, where the geodesic d…

SegmentationSuperpixelsVideo SegmentationVideo Semantic Segmentation

GPU-acceleration for Large-scale Tree Boosting

2017-06-26 · Huan Zhang, Si Si, Cho-Jui Hsieh

In this paper, we present a novel massively parallel algorithm for accelerating the decision tree building procedure on GPUs (Graphics Processing Units), which is a crucial step in Gradient Boosted Decision Tree (GBDT) a…

CPUGPU