arrow
Return

An Efficient Shift-and-stack Algorithm Applied to Detection Catalogs

delete2025-12-01
delete0
PRE
AI
S
Steven Stetzler *
M
Mario Jurić
P
Pedro H. Bernardinelli
D
Dino Bektešević
C
Colin Orion Chandler
A
Andrew J. Connolly
F
Fred C. Adams
C
César Fuentes
D
D. W. Gerdes
M
Matthew J. Holman
H
Hsing Wen Lin
L
Larissa Markwardt
A
Andrew McNeill
M
Michael Mommert
K
Kevin J. Napier
W
William J. Oldroyd
M
Matthew J. Payne
A
A. S. Rivkin
L
Luis E. Salazar Manzano
H
Hilke E. Schlichting
S
Scott S. Sheppard
D
D. Spencer
R
Ryder Strauss
D
David E. Trilling
C
Chadwick A. Trujillo
DOI:10.3847/1538-3881/ae0e1adelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The boundary of solar system object discovery lies in detecting its faintest members. However, their discovery in detection catalogs from imaging surveys is fundamentally limited by the practice of thresholding detections at signal-to-noise (SNR) >= 5 to maintain catalog purity. Faint moving objects can be recovered from survey images using the shift-and-stack algorithm, which coadds pixels from multi-epoch images along a candidate trajectory. Trajectories matching real objects accumulate signal coherently, enabling high-confidence detections of very faint moving objects. Applying shift-and-stack comes with high computational cost, which scales with target object velocity, typically limiting its use to searches for slow-moving objects in the outer solar system. This work introduces a modified shift-and-stack algorithm that trades sensitivity for speedup. Our algorithm stacks low-SNR detection catalogs instead of pixels, the sparsity of which enables approximations that reduce the number of stacks required. Our algorithm achieves real-world speedups of 10-103x over image-based shift-and-stack while retaining the ability to find faint objects. We validate its performance by recovering synthetic inner and outer solar system objects injected into images from the DECam Ecliptic Exploration Project. Exploring the sensitivity-compute time trade-off of this algorithm, we find that our method achieves a speedup of similar to 30x with 88% of the memory usage while sacrificing 0.25 mag in depth compared to image-based shift-and-stack. These speedups enable the broad application of shift-and-stack to large-scale imaging surveys and searches for faint inner solar system objects. We provide a reference implementation via the find-asteroids Python package and this URL: https://github.com/stevenstetzler/find-asteroids.
Keywords:
COSMIC-RAY REJECTION
SIZE DISTRIBUTION
STREAK DETECTION
OBJECT DETECTION
HOUGH TRANSFORM
PROJECT
ASTROPY
IMAGE
CONSTRAINTS
PACKAGE

Journal

Astronomical Journal cover
Astronomical Journal
IF:
5.1
Papers:
1.4W
Citations:
5.0W

Organization

U
University of Washington
Scholars:
8.0W
Papers: 7.0W
Citations: 12.5W
S
Smithsonian Institution
Scholars:
1.2W
Papers: 1.2W
Citations: 4.2K
J
Johns Hopkins University Applied Physics Laboratory
Scholars:
1.9K
Papers: 1.4K
Citations: 3.1K
J
johns hopkins university
Scholars:
1.0W
Papers: 3.9K
Citations: 1
N
northern arizona university
Scholars:
304
Papers: 158
Citations: 0
U
Universidad de Chile
Scholars:
297
Papers: 137
Citations: 0
U
University of Michigan
Scholars:
6.4W
Papers: 5.3W
Citations: 124
U
university of michigan system
Scholars:
9.1W
Papers: 8.6W
Citations: 133
L
Lehigh University
Scholars:
4.8K
Papers: 5.1K
Citations: 6.3K
researcher View more organizations