Pith. sign in

REVIEW 7 cited by

The iWildCam 2021 Competition Dataset

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.03494 v1 pith:O6KMMLS3 submitted 2021-05-07 cs.CV

The iWildCam 2021 Competition Dataset

classification cs.CV
keywords speciescameradataseentrapsacrosscameraschallenge
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Camera traps enable the automatic collection of large quantities of image data. Ecologists use camera traps to monitor animal populations all over the world. In order to estimate the abundance of a species from camera trap data, ecologists need to know not just which species were seen, but also how many individuals of each species were seen. Object detection techniques can be used to find the number of individuals in each image. However, since camera traps collect images in motion-triggered bursts, simply adding up the number of detections over all frames is likely to lead to an incorrect estimate. Overcoming these obstacles may require incorporating spatio-temporal reasoning or individual re-identification in addition to traditional species detection and classification. We have prepared a challenge where the training data and test data are from different cameras spread across the globe. The set of species seen in each camera overlap, but are not identical. The challenge is to classify species and count individual animals across sequences in the test cameras.

discussion (0)

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

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. DA-MergeLoRA: Hypernetwork-Based LoRA Merging for Few-Shot Test-Time Domain Adaptation

    cs.CV 2026-07 conditional novelty 6.0

    A hypernetwork generates per-column merging weights to combine source LoRA modules on CLIP, achieving state-of-the-art few-shot test-time domain adaptation.

  2. Learning Subset-Shared Invariances for Domain Generalization with Mixture-of-Experts

    cs.LG 2026-06 unverdicted novelty 6.0

    Introduces subset-shared invariance using mixture-of-experts to improve domain generalization by modeling partially shared structure across domain subsets.

  3. Weight Clipping for Robust Conformal Inference under Unbounded Covariate Shifts

    cs.LG 2026-05 unverdicted novelty 6.0

    Clipped least-squares importance fitting enables weighted conformal prediction to achieve dataset-conditional coverage guarantees under unbounded covariate shifts by bounding undercoverage and estimating a corrective ...

  4. Lessons and Open Questions from a Unified Study of Camera-Trap Species Recognition Over Time

    cs.CV 2026-03 conditional novelty 6.0

    At a fixed camera-trap site, naively updating a recognition model on newly observed data frequently drops accuracy below the zero-shot baseline; LoRA with balanced softmax mostly fixes it, and post-processing closes m...

  5. Robust Adaptation of Foundation Models with Black-Box Visual Prompting

    cs.CV 2024-07 unverdicted novelty 6.0

    BlackVIP adapts foundation models via a Coordinator for input-dependent visual prompts and SPSA-GC for gradient estimation, enabling robust transfer on 19 datasets with low memory use and a link to randomized smoothin...

  6. Visual Species Recognition with Large Multimodal Models as Post-Hoc Correctors

    cs.LG 2025-12 conditional novelty 5.0

    LMMs underperform few-shot experts on species recognition, but re-ranking the expert's top-5 candidates with an LMM improves mean accuracy by 6.4 points across five benchmarks.

  7. Measuring Weak-to-Strong Legibility of Reasoning Models

    cs.MA 2026-03 unverdicted novelty 4.0

    Strong reasoning models need traces weaker models can digest; current efficiency metrics miss thoroughness and understate this weak-to-strong legibility requirement.