Identifying complex sources in large astronomical data using a coarse-grained complexity measure
Gary Segal, David Parkinson, Ray P. Norris, Jesse Swan

TL;DR
This paper introduces a computationally efficient complexity measure called apparent complexity, which helps identify interesting and morphologically complex astronomical observations in large data sets, aiding discovery.
Contribution
It presents a novel application of apparent complexity as a machine-learning feature for automated classification of galaxy morphologies in large astronomical data.
Findings
Apparent complexity effectively distinguishes simple and complex galaxy morphologies.
The method outperforms pixel-based classification techniques.
It generalizes well across different data sets after calibration.
Abstract
The volume of data that will be produced by the next generation of astrophysical instruments represents a significant opportunity for making unplanned and unexpected discoveries. Conversely, finding unexpected objects or phenomena within such large volumes of data presents a challenge that may best be solved using computational and statistical approaches. We present the application of a coarse-grained complexity measure for identifying interesting observations in large astronomical data sets. This measure, which has been termed apparent complexity, has been shown to model human intuition and perceptions of complexity. Apparent complexity is computationally efficient to derive and can be used to segment and identify interesting observations in very large data sets based on their morphological complexity. We show, using data from the Australia Telescope Large Area Survey, that apparent…
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.
