Back to Feed
Computer Vision

U-Net for Biomedical Image Segmentation

Original: U-Net: Convolutional Networks for Biomedical Image Segmentation

Listen to the summary

Uses a voice available on your device

Audio options
On this page 4 sections
Related concepts 2 concepts

Key Takeaways

  • The contracting path repeatedly applies convolutions and max pooling to capture context while doubling feature channels.
  • The expansive path uses up-sampling and concatenation with cropped feature maps from the contracting path to achieve precise localization.
  • Training relies on stochastic gradient descent with a batch size of one, high momentum, and excessive data augmentation using random elastic deformations.
  • The model achieves high performance metrics, such as an average IOU of 92 percent on the PhC-U373 dataset.
  • An overlap-tile strategy allows seamless segmentation of arbitrarily large images by mirroring input context at borders.

Summary & Methodology Analysis

The paper addresses biomedical image segmentation using very few training images while achieving both precise localization and context capture. To accomplish this, the authors design a network structure featuring a contracting path and an expansive path. The contracting path uses repeated application of two 3 by 3 unpadded convolutions, each followed by a rectified linear unit (ReLU) activation function and a 2 by 2 max pooling operation with stride 2 for downsampling, doubling the number of feature channels at each step. The expansive path handles up-sampling of the feature map followed by a 2 by 2 up-convolution that halves the feature channels, concatenation with the cropped feature map from the contracting path, and two 3 by 3 convolutions each followed by a ReLU. A final 1 by 1 convolution maps each 64-component feature vector to the desired number of classes.

The training pipeline uses stochastic gradient descent in Caffe with a batch size of a single image and a high momentum of 0.99. The energy function is computed via a pixel-wise soft-max over the final feature map combined with a cross entropy loss function using a pre-computed weight map for touching cells. To handle limited training data, the authors apply excessive data augmentation using random elastic deformations generated on a coarse 3 by 3 grid with 10 pixels standard deviation. For inference on arbitrarily large images, an overlap-tile strategy mirrors input image context at borders to enable seamless segmentation without size limits.

Regarding performance, the U-Net achieves a warping error of 0.0003529 and a rand-error of 0.0382 on the EM segmentation challenge. It also achieves an average intersection over union (IOU) of 92 percent on the PhC-U373 dataset and 77.5 percent on the DIC-HeLa dataset of the ISBI cell tracking challenge 2015. The paper does not specify any computational limitations or hardware constraints.

Interactive System Flowchart

Click diagram to expand and zoom

Cross-Examination & FAQs

A deeper dive clarifying mechanics, constraints, and baseline evaluations.

Q1. What is the core problem addressed in the paper?

The paper addresses biomedical image segmentation using very few training images while achieving both precise localization and context capture.

Q2. What is the main architecture introduced in the paper?

The paper introduces the U-Net architecture, which uses a contracting path for context and an expansive path for localization.

Q3. How does the model handle large input images?

It uses an overlap-tile strategy that mirrors input image context at borders to enable seamless segmentation of arbitrarily large images.

Q4. What operations are performed in the contracting path?

The contracting path uses repeated application of two 3 by 3 unpadded convolutions, each followed by a ReLU and a 2 by 2 max pooling operation with stride 2 for downsampling, doubling the number of feature channels at each step.

Q5. How does the expansive path recover spatial resolution?

The expansive path uses up-sampling of the feature map followed by a 2 by 2 up-convolution that halves the feature channels, concatenation with the cropped feature map from the contracting path, and two 3 by 3 convolutions each followed by a ReLU.

Q6. What loss function and optimization setup are used during training?

Training uses stochastic gradient descent in Caffe with a batch size of a single image and a high momentum of 0.99, computing the energy function via a pixel-wise soft-max over the final feature map combined with a cross entropy loss function using a pre-computed weight map for touching cells.

Q7. How is data scarcity handled during training?

The paper uses excessive data augmentation using random elastic deformations generated on a coarse 3 by 3 grid with 10 pixels standard deviation.

Q8. What datasets and challenges are used to evaluate the model?

The models and datasets evaluated include the EM segmentation challenge, the ISBI cell tracking challenge 2015, the ISBI cell tracking challenge 2014, PhC-U373, DIC-HeLa, IMCB-SG (2014), KTH-SE (2014), HOUS-US (2014), and ImageNet.

Q9. What specific performance metrics does the U-Net achieve on the ISBI cell tracking challenge 2015?

The U-Net achieves an average intersection over union (IOU) of 92 percent on the PhC-U373 dataset and an average IOU of 77.5 percent on the DIC-HeLa dataset of the ISBI cell tracking challenge 2015.

Flag an issue

What is wrong with this summary?

What is wrong?