pith. sign in

arxiv: 1805.09233 · v1 · pith:3I44HUJFnew · submitted 2018-05-23 · 💻 cs.CV

Segmentation of Liver Lesions with Reduced Complexity Deep Models

classification 💻 cs.CV
keywords architectureliverbilinearcompetitiveconvolutioninterpolationlearnablelesions
0
0 comments X
read the original abstract

We propose a computationally efficient architecture that learns to segment lesions from CT images of the liver. The proposed architecture uses bilinear interpolation with sub-pixel convolution at the last layer to upscale the course feature in bottle neck architecture. Since bilinear interpolation and sub-pixel convolution do not have any learnable parameter, our overall model is faster and occupies less memory footprint than the traditional U-net. We evaluate our proposed architecture on the highly competitive dataset of 2017 Liver Tumor Segmentation (LiTS) Challenge. Our method achieves competitive results while reducing the number of learnable parameters roughly by a factor of 13.8 compared to the original UNet model.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.