CPR++: Object Localization via Single Coarse Point Supervision

• URL: http://arxiv.org/abs/2401.17203v1
• Date: Tue, 30 Jan 2024 17:38:48 GMT
• Title: CPR++: Object Localization via Single Coarse Point Supervision
• Authors: Xuehui Yu, Pengfei Chen, Kuiran Wang, Xumeng Han, Guorong Li, Zhenjun Han, Qixiang Ye, Jianbin Jiao
• Abstract summary: coarse point refinement (CPR) is first attempt to alleviate semantic variance from an algorithmic perspective. CPR reduces semantic variance by selecting a semantic centre point in a neighbourhood region to replace the initial annotated point. CPR++ can obtain scale information and further reduce the semantic variance in a global region.
• Score: 55.8671776333499
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point-based object localization (POL), which pursues high-performance object sensing under low-cost data annotation, has attracted increased attention. However, the point annotation mode inevitably introduces semantic variance due to the inconsistency of annotated points. Existing POL heavily rely on strict annotation rules, which are difficult to define and apply, to handle the problem. In this study, we propose coarse point refinement (CPR), which to our best knowledge is the first attempt to alleviate semantic variance from an algorithmic perspective. CPR reduces the semantic variance by selecting a semantic centre point in a neighbourhood region to replace the initial annotated point. Furthermore, We design a sampling region estimation module to dynamically compute a sampling region for each object and use a cascaded structure to achieve end-to-end optimization. We further integrate a variance regularization into the structure to concentrate the predicted scores, yielding CPR++. We observe that CPR++ can obtain scale information and further reduce the semantic variance in a global region, thus guaranteeing high-performance object localization. Extensive experiments on four challenging datasets validate the effectiveness of both CPR and CPR++. We hope our work can inspire more research on designing algorithms rather than annotation rules to address the semantic variance problem in POL. The dataset and code will be public at github.com/ucas-vg/PointTinyBenchmark.

Related papers

• Dense Center-Direction Regression for Object Counting and Localization with Point Supervision [1.9526430269580954]
  We propose a novel approach termed CeDiRNet for point-supervised learning. It uses a dense regression of directions pointing towards the nearest object centers. We show that it outperforms the existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-08-26T17:49:27Z)
• Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning [122.62311703151215]
  Divide and Contrast (DaC) aims to connect the good ends of both worlds while bypassing their limitations. DaC divides the target data into source-like and target-specific samples, where either group of samples is treated with tailored goals. We further align the source-like domain with the target-specific samples using a memory bank-based Maximum Mean Discrepancy (MMD) loss to reduce the distribution mismatch.
  arXiv  Detail & Related papers  (2022-11-12T09:21:49Z)
• Domain Adaptive Segmentation of Electron Microscopy with Sparse Point Annotations [2.5137859989323537]
  We develop a highly annotation-efficient approach with competitive performance. We focus on weakly-supervised domain adaptation (WDA) with a type of extremely sparse and weak annotation. We show that our model with only 15% point annotations can achieve comparable performance as supervised models.
  arXiv  Detail & Related papers  (2022-10-24T10:50:37Z)
• Global Pointer: Novel Efficient Span-based Approach for Named Entity Recognition [7.226094340165499]
  Named entity recognition (NER) task aims at identifying entities from a piece of text that belong to predefined semantic types. The state-of-the-art solutions for flat entities NER commonly suffer from capturing the fine-grained semantic information in underlying texts. We propose a novel span-based NER framework, namely Global Pointer (GP), that leverages the relative positions through a multiplicative attention mechanism.
  arXiv  Detail & Related papers  (2022-08-05T09:19:46Z)
• Object Localization under Single Coarse Point Supervision [107.46800858130658]
  We propose a POL method using coarse point annotations, relaxing the supervision signals from accurate key points to freely spotted points. CPR constructs point bags, selects semantic-correlated points, and produces semantic center points through multiple instance learning (MIL) In this way, CPR defines a weakly supervised evolution procedure, which ensures training high-performance object localizer under coarse point supervision.
  arXiv  Detail & Related papers  (2022-03-17T14:14:11Z)
• Rethinking Counting and Localization in Crowds:A Purely Point-Based Framework [59.578339075658995]
  We propose a purely point-based framework for joint crowd counting and individual localization. We design an intuitive solution under this framework, which is called Point to Point Network (P2PNet)
  arXiv  Detail & Related papers  (2021-07-27T11:41:50Z)
• Unveiling the Potential of Structure-Preserving for Weakly Supervised Object Localization [71.79436685992128]
  We propose a two-stage approach, termed structure-preserving activation (SPA), towards fully leveraging the structure information incorporated in convolutional features for WSOL. In the first stage, a restricted activation module (RAM) is designed to alleviate the structure-missing issue caused by the classification network. In the second stage, we propose a post-process approach, termed self-correlation map generating (SCG) module to obtain structure-preserving localization maps.
  arXiv  Detail & Related papers  (2021-03-08T03:04:14Z)
• Local Context Attention for Salient Object Segmentation [5.542044768017415]
  We propose a novel Local Context Attention Network (LCANet) to generate locally reinforcement feature maps in a uniform representational architecture. The proposed network introduces an Attentional Correlation Filter (ACF) module to generate explicit local attention by calculating the correlation feature map between coarse prediction and global context. Comprehensive experiments are conducted on several salient object segmentation datasets, demonstrating the superior performance of the proposed LCANet against the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-09-24T09:20:06Z)
• Learning to Predict Context-adaptive Convolution for Semantic Segmentation [66.27139797427147]
  Long-range contextual information is essential for achieving high-performance semantic segmentation. We propose a Context-adaptive Convolution Network (CaC-Net) to predict a spatially-varying feature weighting vector. Our CaC-Net achieves superior segmentation performance on three public datasets.
  arXiv  Detail & Related papers  (2020-04-17T13:09:17Z)

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.