Random 2.5D U-net for Fully 3D Segmentation
Convolutional neural networks are state-of-the-art for various segmentation tasks. While for 2D images these networks are also computationally efficient, 3D convolutions have huge storage requirements and therefore, end-to-end training is limited by GPU memory and data size. To overcome this issue, we introduce a network structure for volumetric data without 3D convolution layers. The main idea is to include projections from different directions to transform the volumetric data to a sequence of images, where each image contains information of the full data. We then apply 2D convolutions to these projection images and lift them again to volumetric data using a trainable reconstruction algorithm. The proposed architecture can be applied end-to-end to very large data volumes without cropping or sliding-window techniques. For a tested sparse binary segmentation task, it outperforms already known standard approaches and is more resistant to generation of artefacts.
Code (0)
등록된 구현이 없습니다.
Tasks
GPUSegmentationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Forming A Random Field via Stochastic Cliques: From Random Graphs to Fully Connected Random Fields
Random fields have remained a topic of great interest over past decades for the purpose of structured inference, especially for problems such as image segmentation. The local nodal interactions commonly used in such mode…
Image SegmentationSemantic SegmentationMRI Brain Tumor Segmentation using Random Forests and Fully Convolutional Networks
In this paper, we propose a novel learning based method for automated segmentation of brain tumor in multimodal MRI images, which incorporates two sets of machine -learned and hand crafted features. Fully convolutional n…
Brain Tumor SegmentationSegmentationTumor SegmentationIncorporating Depth into both CNN and CRF for Indoor Semantic Segmentation
To improve segmentation performance, a novel neural network architecture (termed DFCN-DCRF) is proposed, which combines an RGB-D fully convolutional neural network (DFCN) with a depth-sensitive fully-connected conditiona…
Semantic SegmentationDiscriminative Parameter Estimation for Random Walks Segmentation
The Random Walks (RW) algorithm is one of the most e - cient and easy-to-use probabilistic segmentation methods. By combining contrast terms with prior terms, it provides accurate segmentations of medical images in a ful…
parameter estimationSegmentationDiscriminative Parameter Estimation for Random Walks Segmentation: Technical Report
The Random Walks (RW) algorithm is one of the most e - cient and easy-to-use probabilistic segmentation methods. By combining contrast terms with prior terms, it provides accurate segmentations of medical images in a ful…
parameter estimationSegmentation