Bounding Box Tightness Prior for Weakly Supervised Image Segmentation

• URL: http://arxiv.org/abs/2110.00934v1
• Date: Sun, 3 Oct 2021 06:19:20 GMT
• Title: Bounding Box Tightness Prior for Weakly Supervised Image Segmentation
• Authors: Juan Wang and Bin Xia
• Abstract summary: It proposes generalized multiple instance learning (MIL) and smooth maximum approximation to integrate the bounding box tightness prior to the deep neural network in an end-to-end manner. The proposed approach was evaluated on two pubic medical datasets using Dice coefficient.
• Score: 5.517632401040172
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: This paper presents a weakly supervised image segmentation method that adopts tight bounding box annotations. It proposes generalized multiple instance learning (MIL) and smooth maximum approximation to integrate the bounding box tightness prior into the deep neural network in an end-to-end manner. In generalized MIL, positive bags are defined by parallel crossing lines with a set of different angles, and negative bags are defined as individual pixels outside of any bounding boxes. Two variants of smooth maximum approximation, i.e., $\alpha$-softmax function and $\alpha$-quasimax function, are exploited to conquer the numeral instability introduced by maximum function of bag prediction. The proposed approach was evaluated on two pubic medical datasets using Dice coefficient. The results demonstrate that it outperforms the state-of-the-art methods. The codes are available at \url{https://github.com/wangjuan313/wsis-boundingbox}.

Related papers

• Combinatorial Stochastic-Greedy Bandit [79.1700188160944]
  We propose a novelgreedy bandit (SGB) algorithm for multi-armed bandit problems when no extra information other than the joint reward of the selected set of $n$ arms at each time $tin [T]$ is observed. SGB adopts an optimized-explore-then-commit approach and is specifically designed for scenarios with a large set of base arms.
  arXiv  Detail & Related papers  (2023-12-13T11:08:25Z)
• Sarah Frank-Wolfe: Methods for Constrained Optimization with Best Rates and Practical Features [65.64276393443346]
  The Frank-Wolfe (FW) method is a popular approach for solving optimization problems with structured constraints. We present two new variants of the algorithms for minimization of the finite-sum gradient.
  arXiv  Detail & Related papers  (2023-04-23T20:05:09Z)
• Bridging Discrete and Backpropagation: Straight-Through and Beyond [62.46558842476455]
  We propose a novel approach to approximate the gradient of parameters involved in generating discrete latent variables. We propose ReinMax, which achieves second-order accuracy by integrating Heun's method, a second-order numerical method for solving ODEs.
  arXiv  Detail & Related papers  (2023-04-17T20:59:49Z)
• Split, Merge, and Refine: Fitting Tight Bounding Boxes via Over-Segmentation and Iterative Search [15.29167642670379]
  We propose a novel framework for finding a set of tight bounding boxes of a 3D shape via over-segmentation and iterative merging and refinement. By thoughtful evaluation, we demonstrate full coverage, tightness, and an adequate number of bounding boxes of our method without requiring any training data or supervision.
  arXiv  Detail & Related papers  (2023-04-10T00:25:15Z)
• BoxSnake: Polygonal Instance Segmentation with Box Supervision [34.487089567665556]
  We propose a new end-to-end training technique, termed BoxSnake, to achieve effective polygonal instance segmentation using only box annotations for the first time. Compared with the mask-based weakly-supervised methods, BoxSnake further reduces the performance gap between the predicted segmentation and the bounding box, and shows significant superiority on the Cityscapes dataset.
  arXiv  Detail & Related papers  (2023-03-21T06:54:18Z)
• Weakly Supervised Image Segmentation Beyond Tight Bounding Box Annotations [5.000514512377416]
  This study investigates whether it is possible to maintain good segmentation performance when loose bounding boxes are used as supervision. The proposed polar transformation based MIL formulation works for both tight and loose bounding boxes. The results demonstrate that the proposed approach achieves state-of-the-art performance for bounding boxes at all precision levels.
  arXiv  Detail & Related papers  (2023-01-28T02:11:36Z)
• BoxPolyp:Boost Generalized Polyp Segmentation Using Extra Coarse Bounding Box Annotations [79.17754846553866]
  We propose a boosted BoxPolyp model to make full use of both accurate mask and extra coarse box annotations. In practice, box annotations are applied to alleviate the over-fitting issue of previous polyp segmentation models. Our proposed model outperforms previous state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2022-12-07T07:45:50Z)
• FuSS: Fusing Superpixels for Improved Segmentation Consistency [2.7771471571972333]
  We propose two approaches to improve the semantic consistency of Open Set Semantic. First, we propose a method called OpenGMM to model the distribution of pixels for each class in a multimodal manner. The second approach is a post-processing which uses superpixels to enforce highly homogeneous regions to behave equally.
  arXiv  Detail & Related papers  (2022-06-06T16:14:19Z)
• Polar Transformation Based Multiple Instance Learning Assisting Weakly Supervised Image Segmentation With Loose Bounding Box Annotations [5.000514512377416]
  This study investigates weakly supervised image segmentation using loose bounding box supervision. It presents a multiple instance learning strategy based on polar transformation to assist image segmentation when loose bounding boxes are employed as supervision.
  arXiv  Detail & Related papers  (2022-03-03T00:44:40Z)
• Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms [59.724977092582535]
  We consider the problem of quantizing a linear model learned from measurements. We derive an information-theoretic lower bound for the minimax risk under this setting. We show that our method and upper-bounds can be extended for two-layer ReLU neural networks.
  arXiv  Detail & Related papers  (2022-02-23T02:39:04Z)
• DeepStrip: High Resolution Boundary Refinement [60.00241966809684]
  We propose to convert regions of interest into strip images and compute a boundary prediction in the strip domain. To detect the target boundary, we present a framework with two prediction layers. We enforce a matching consistency and C0 continuity regularization to the network to reduce false alarms.
  arXiv  Detail & Related papers  (2020-03-25T22:44:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.