PDRS : A Linear $\mathcal{O}(N)$ Algorithm for Segmentation of High-Activity Regions in Irregularly Sampled Time Series
Atal Agrawal

TL;DR
PDRS is a new linear-time algorithm that efficiently identifies high-activity regions in irregularly sampled time series, significantly improving scalability for large astronomical datasets.
Contribution
The paper introduces PDRS, a novel linear $ ext{O}(N)$ algorithm for segmenting high-activity regions, outperforming existing quadratic methods in speed and applicability.
Findings
PDRS accurately detects high-activity regions in astronomical light curves.
It reduces computational complexity from $ ext{O}(N^2)$ to $ ext{O}(N)$.
Demonstrated effectiveness on SDSS and ZTF datasets.
Abstract
Identifying transient high-activity episodes in astronomical time series requires partitioning data into regions of distinct statistical behavior. A widely adopted approach combines Bayesian Blocks with a hill-climbing procedure to isolate high-activity regions, but carries complexity -- a scalability challenge for wide-field surveys like ZTF and the upcoming Rubin Observatory (LSST), where light curves routinely contain thousands of irregularly sampled observations. We present Peak-Driven Region Segmentation (PDRS), a linear-time algorithm for rapid extraction of high-activity regions in irregularly sampled data. PDRS seeds candidate regions at statistically significant local maxima and expands them via a gradient-aware multi-source breadth-first search. Saddle-point merging and a median-based filter suppress spurious detections. Functioning as a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
