A simple, strong baseline for building damage detection on the xBD dataset

• URL: http://arxiv.org/abs/2401.17271v1
• Date: Tue, 30 Jan 2024 18:59:56 GMT
• Title: A simple, strong baseline for building damage detection on the xBD dataset
• Authors: Sebastian Gerard, Paul Borne-Pons, Josephine Sullivan
• Abstract summary: We construct a strong baseline method for building damage detection by starting with the highly-winning solution of the xView2 competition. We expect the simplified solution to be more widely and easily applicable. We find that both the complex and the simplified model fail to generalize to unseen locations.
• Score: 2.7163621600184773
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We construct a strong baseline method for building damage detection by starting with the highly-engineered winning solution of the xView2 competition, and gradually stripping away components. This way, we obtain a much simpler method, while retaining adequate performance. We expect the simplified solution to be more widely and easily applicable. This expectation is based on the reduced complexity, as well as the fact that we choose hyperparameters based on simple heuristics, that transfer to other datasets. We then re-arrange the xView2 dataset splits such that the test locations are not seen during training, contrary to the competition setup. In this setting, we find that both the complex and the simplified model fail to generalize to unseen locations. Analyzing the dataset indicates that this failure to generalize is not only a model-based problem, but that the difficulty might also be influenced by the unequal class distributions between events. Code, including the baseline model, is available under https://github.com/PaulBorneP/Xview2_Strong_Baseline

Related papers

• Learning to Solve Complex Problems via Dataset Decomposition [53.1641602054716]
  This research explores a reverse curriculum generation approach that decomposes complex datasets into simpler, more learnable components.<n>We propose a teacher-student framework where the teacher is equipped with the ability to reason step-by-step, which is used to generate easier versions of examples.
  arXiv  Detail & Related papers  (2026-02-23T19:25:40Z)
• OverLayBench: A Benchmark for Layout-to-Image Generation with Dense Overlaps [43.782757481408076]
  We identify two primary challenges: large overlapping regions and overlapping instances with minimal semantic distinction.<n>We introduce OverLayScore, a novel metric that quantifies the complexity of overlapping bounding boxes.<n>We present Creati-AM, a benchmark featuring high-quality annotations and a balanced distribution across different levels of OverLayScore.
  arXiv  Detail & Related papers  (2025-09-23T17:50:00Z)
• Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning [0.0]
  We propose Hellsemble, a novel ensemble framework for binary classification.<n>Hellsemble incrementally partitions the dataset into circles of difficulty.<n>It achieves strong classification accuracy while maintaining computational efficiency and interpretability.
  arXiv  Detail & Related papers  (2025-06-25T20:26:04Z)
• Hedging Is Not All You Need: A Simple Baseline for Online Learning Under Haphazard Inputs [7.738999125093431]
  HapNet is a simple baseline that is scalable, does not require online backpropagation, and is adaptable to varying input types. We demonstrate that a variant of the proposed approach can work even for this complex scenario.
  arXiv  Detail & Related papers  (2024-09-16T12:45:03Z)
• D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruning [70.98091101459421]
  Coreset selection seeks to select a subset of the training data so as to maximize the performance of models trained on this subset, also referred to as coreset. We propose a novel pruning algorithm, D2 Pruning, that uses forward and reverse message passing over this dataset graph for coreset selection. Results show that D2 Pruning improves coreset selection over previous state-of-the-art methods for up to 70% pruning rates.
  arXiv  Detail & Related papers  (2023-10-11T23:01:29Z)
• Simplicity Bias Leads to Amplified Performance Disparities [8.60453031364566]
  We show that SGD-trained models have a bias towards simplicity, leading them to prioritize learning a majority class. A model may prioritize any class or group of the dataset that it finds simple-at the expense of what it finds complex.
  arXiv  Detail & Related papers  (2022-12-13T15:24:41Z)
• Unpaired Referring Expression Grounding via Bidirectional Cross-Modal Matching [53.27673119360868]
  Referring expression grounding is an important and challenging task in computer vision. We propose a novel bidirectional cross-modal matching (BiCM) framework to address these challenges. Our framework outperforms previous works by 6.55% and 9.94% on two popular grounding datasets.
  arXiv  Detail & Related papers  (2022-01-18T01:13:19Z)
• Information-Theoretic Measures of Dataset Difficulty [54.538766940287864]
  Estimating difficulty of a dataset typically involves comparing state-of-the-art models to humans. We propose an information-theoretic perspective, framing dataset difficulty as the absence of usable information.
  arXiv  Detail & Related papers  (2021-10-16T00:21:42Z)
• Examining and Combating Spurious Features under Distribution Shift [94.31956965507085]
  We define and analyze robust and spurious representations using the information-theoretic concept of minimal sufficient statistics. We prove that even when there is only bias of the input distribution, models can still pick up spurious features from their training data. Inspired by our analysis, we demonstrate that group DRO can fail when groups do not directly account for various spurious correlations.
  arXiv  Detail & Related papers  (2021-06-14T05:39:09Z)
• End-to-End Training of CNN Ensembles for Person Re-Identification [0.0]
  We propose an end-to-end ensemble method for person re-identification (ReID) to address the problem of overfitting in discriminative models. Our proposed ensemble learning framework produces several diverse and accurate base learners in a single DenseNet. Experiments on several benchmark datasets demonstrate that our method achieves state-of-the-art results.
  arXiv  Detail & Related papers  (2020-10-03T12:40:13Z)
• The Little W-Net That Could: State-of-the-Art Retinal Vessel Segmentation with Minimalistic Models [19.089445797922316]
  We show that a minimalistic version of a standard U-Net with several orders of magnitude less parameters closely approximates the performance of current best techniques. We also propose a simple extension, dubbed W-Net, which reaches outstanding performance on several popular datasets. We also test our approach on the Artery/Vein segmentation problem, where we again achieve results well-aligned with the state-of-the-art.
  arXiv  Detail & Related papers  (2020-09-03T19:59:51Z)
• The Devil is in Classification: A Simple Framework for Long-tail Object Detection and Instance Segmentation [93.17367076148348]
  We investigate performance drop of the state-of-the-art two-stage instance segmentation model Mask R-CNN on the recent long-tail LVIS dataset. We unveil that a major cause is the inaccurate classification of object proposals. We propose a simple calibration framework to more effectively alleviate classification head bias with a bi-level class balanced sampling approach.
  arXiv  Detail & Related papers  (2020-07-23T12:49:07Z)
• End-to-End Object Detection with Transformers [88.06357745922716]
  We present a new method that views object detection as a direct set prediction problem. Our approach streamlines the detection pipeline, effectively removing the need for many hand-designed components. The main ingredients of the new framework, called DEtection TRansformer or DETR, are a set-based global loss.
  arXiv  Detail & Related papers  (2020-05-26T17:06:38Z)
• Robust Question Answering Through Sub-part Alignment [53.94003466761305]
  We model question answering as an alignment problem. We train our model on SQuAD v1.1 and test it on several adversarial and out-of-domain datasets.
  arXiv  Detail & Related papers  (2020-04-30T09:10:57Z)

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.