Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


John Abela has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Transformer-based source detection and morphological classification in LOFAR Deep-Field continuum images

    by Guangwen Chen, Kristian Z Adami, John Abela, Caijuan Yue, Weibin Sun, Fujia Li, Zhaoting Chen, Daniel Magro, Yogesh Wadadekar, Leah K Morabito

    Radio source detection and morphological classification are fundamental for exploiting the scientific potential of modern radio continuum surveys. However, the rapidly increasing data volumes and the wide diversity of radio morphologies make traditional visual inspection infeasible and pose significant challenges for automated source finding. We apply a transformer-based set-prediction detector (RF-DETR) to 150 MHz continuum images from the LOFAR Deep Fields for instance-level source detection and morphological classification. The method is adapted to multi-frequency-synthesis images of interferometric data and trained with a morphology-driven scheme using five mutually exclusive classes. The model is trained on the ELAIS-N1 Deep Field, where it achieves high detection and classification performance ($\mathrm{F1}\simeq 91$ per cent), and is then applied without retraining to the other three LOFAR Deep Fields. Across all four fields, the model yields consistent catalogues with modest field-to-field differences arising from survey depth and calibration. Compared with widely used PyBDSF catalogues, RF-DETR recovers the majority of PyBDSF sources while representing classical multi-component radio galaxies as single source-level detections rather than fragmented Gaussian components. Artefact-affected and spurious detections are identified as explicit classes, allowing these detections to be distinguished from general astrophysical sources in the resulting catalogues. As external validation, RF-DETR recovers the majority of visually identified extended and giant radio galaxies in the LOFAR Deep Fields and assigns them predominantly to extended morphological classes. These results indicate that transformer-based detectors provide a practical, scalable, morphology-aware approach to source finding in deep radio surveys, with clear relevance for forthcoming facilities such as SKA-Low.

  • Open Access

    From P ≟ NP to Practice: Description Complexity and Certificate-First Algorithm Discovery for Hard Problems

    by John Abela, Ernest Cachia, Colin Layfield

    The celebrated question of whether P=NP continues to define the boundary between the feasible and the intractable in computer science. In this paper, we revisit the problem from two complementary angles: Time-Relative Description Complexity and automated discovery, adopting an epistemic rather than ontological perspective. Even if polynomial-time algorithms for NP-complete problems do exist, their minimal descriptions may have very high Kolmogorov complexity. This creates what we call an epistemic barrier, making such algorithms effectively undiscoverable by unaided human reasoning. A series of structural results—relativization, Natural Proofs, and the Probabilistically Checkable Proofs (PCPs) theorem—already indicate that classical proof techniques are unlikely to resolve the question, which motivates a more pragmatic shift in emphasis. We therefore ask a different, more practical question: what can systematic computational search achieve within these limits? We propose a certificate-first workflow for algorithmic discovery, in which candidate algorithms are considered scientifically credible only when accompanied by machine-checkable evidence. Examples include Deletion/Resolution Asymmetric Tautology (DRAT)/Flexible RAT (FRAT) proof logs for SAT, Linear Programming (LP)/Semidefinite Programming (SDP) dual bounds for optimization, and other forms of independently verifiable certificates. Within this framework, high-capacity search and learning systems can explore algorithmic spaces far beyond manual (human) design, yet still produce artifacts that are auditable and reproducible. Empirical motivation comes from large language models and other scalable learning systems, where increasing capacity often yields new emergent behaviors even though internal representations remain opaque. This paper is best described as a position and expository essay that synthesizes insights from complexity theory, Kolmogorov complexity, and automated algorithm discovery, using Time-Relative Description Complexity as an organising lens and outlining a pragmatic research direction grounded in verifiable computation. We argue for a shift in emphasis from the elusive search for polynomial-time solutions to the constructive pursuit of high-performance heuristics and approximation methods grounded in verifiable evidence. The overarching message is that capacity plus certification offers a principled path toward better algorithms and clearer scientific limits without presuming a final resolution of P=?NP.

  • Open Access

    From P =? NP to Practice: Description Complexity and Certificate-First Automated Discovery of Approximation Algorithms and Heuristics for Hard Problems

    by John Abela, Ernest Cachia, Colin Layfield

    We revisit the P ? = NP question through the joint lenses of time–relative description complexity and automated discovery. Our premise is epistemic rather than ontological: even if polynomial–time algorithms for NP–complete problems exist, they may have very high Kolmogorov (description) complexity and thus be undiscoverable by unaided humans. Formal barriers (relativization, natural proofs, and algebrization) already suggest that familiar techniques are insufficient to separate or collapse P and NP. Regardless of the ultimate truth of P ? = NP, we argue that systematic search in high–K code spaces is valuable today: it may yield stronger heuristics, tighter exponential bases, improved approximation schemes, and fixed–parameter runtimes. To make such artifacts scientifically credible, we advocate a certificate–first workflow ([9,78]) that couples (i) polytime–by–construction skeletons with (ii) machine–checkable evidence (e.g., DRAT/FRAT logs; LP/SDP duals) and (iii) non–uniform search distilled into uniform algorithms. We also note empirical motivation from large language models: scaling laws and energy budgets indicate that high capacity often unlocks new emergent behaviors, while internal mappings remain complex and opaque. The overarching message is pragmatic: capacity (high descriptive complexity) plus certification may provide a principled path to better algorithms and clearer limits without presuming a resolution of P ? = NP. This paper is best described as an position/expository essay. We synthesize existing work from complexity theory, Kolmogorov complexity, and algorithmic discovery, and offers a rational justification for a shift in emphasis: from the elusive goal of discovering polynomial-time algorithms for NP-complete problems, to the tractable and fruitful pursuit of discovering high-performance heuristics and approximation methods via automated search and learning.

  • Open Access

    From Dennett to Transformers: Emergent Properties, Kolmogorov Complexity, and the Turing-Computability of Human Intelligence

    by John Abela

    This paper explores the Turing-computability of human cognition through the lens of the late philosopher Daniel Dennett’s computational functionalism, Kolmogorov Complexity, and recent advances in large language models (LLMs). We compare the high complexity and capacity of the human brain to the deliberate scaling of LLMs, noting that emergent properties—such as zero-shot reasoning—arise when models reach critical thresholds in parameter count and training data. By analyzing whether these emergent capabilities can approximate human-level intelligence, we shed light on the debate concerning the algorithmic replicability of human consciousness. We suggest that capacity, complexity, and scaling play pivotal roles in shaping advanced cognitive behaviors, offering preliminary insights into artificial general intelligence (AGI). Although the emphasis is primarily theoretical, we briefly note that transformer models have the potential for unlocking new analytical capabilities in fields such as astrophysics and cosmology, highlighting the broad impact of scaling laws beyond natural language alone.

  • Open Access

    Fine-Grained Synthetic Population Generation and Agent-Based Models for COVID-19 in Malta

    by Jurgen Cuschieri, John Abela

    This study presents the development of a fine-grained COVID-19 agent-based model (Agent-based Model (ABM)) specifically designed for Malta, leveraging a synthetic population that captures the country’s demographic and tourism characteristics. The research is structured into three phases. In Phase 1, the SynthPops framework is extended to generate a statistically accurate synthetic population, enriched with additional attributes such as employment, education, BMI, and long-term illnesses. A detailed tourism model is also integrated to reflect Malta’s unique visitor dynamics. Phase 2 focuses on implementing the Agent-based Model (ABM), which incorporates detailed daily itineraries, a contact network, and virus transmission dynamics. Transmission is influenced by factors such as individual sociability, contact duration, and public health interventions. The model is used to simulate multiple intervention scenarios, producing epidemiological outcomes that align closely with the input parameters and provide actionable insights. In Phase 3, the study evaluates four computational strategies to optimise execution time and scalability: single-node multiprocessing and three distributed approaches using Dask Distributed. Among these, the actor-based strategy demonstrates the best performance, achieving up to a 13-fold speed-up in specific tasks and scaling effectively with population size. Testing on a high-performance machine reveals that the model performs well for Malta’s population size, with distributed setups showing potential for larger populations. This research provides a robust and scalable framework for simulating COVID- 19 dynamics in islands such as Malta, offering valuable insights for public health decision-making and highlighting computational strategies for efficient large-scale simulations.

  • Open Access

    Recombination vs Stochasticity: A Comparative Study on the Maximum Clique Problem

    by Michael Vella, John Abela, Kristian Guillaumier

    The maximum clique problem (MCP) is a fundamental problem in graph theory and in computational complexity. Given a graph G, the problem is that of finding the largest clique (complete subgraph) in G. The MCP has many important applications in different domains and has been much studied. The problem has been shown to be NP-Hard and the corresponding decision problem to be NP-Complete. All exact (optimal) algorithms discovered so far run in exponential time. Various meta-heuristics have been used to approximate the MCP. These include genetic and memetic algorithms, ant colony optimization, greedy algorithms, Tabu algorithms, and simulated annealing. This study presents a critical examination of the effectiveness of applying genetic algorithms (GAs) to the MCP compared to a purely stochastic approach. Our results indicate that Monte Carlo algorithms, which employ random searches to generate and then refine sub-graphs into cliques, often surpass genetic algorithms in both speed and capability, particularly in less dense graphs. This observation challenges the conventional reliance on genetic algorithms, suggesting a reevaluation of the roles of the crossover and mutation operators in exploring the solution space. We observe that, in some of the denser graphs, the recombination strategy of genetic algorithms shows unexpected efficacy, hinting at the untapped potential of genetic methods under specific conditions. This work not only questions established paradigms but also opens avenues for exploring algorithmic efficiency in solving the MCP and other NP-Hard problems, inviting further research into the conditions that favor purely stochastic methods over genetic recombination and vice versa.

  • Open Access

    The Best of Both Worlds: A Framework for Combining Degradation Prediction with High Performance Super-Resolution Networks

    by Matthew Aquilina, Keith George Ciantar, Christian Galea, Kenneth P. Camilleri, Reuben A. Farrugia, John Abela

    To date, the best-performing blind super-resolution (SR) techniques follow one of two paradigms: (A) train standard SR networks on synthetic low-resolution–high-resolution (LR–HR) pairs or (B) predict the degradations of an LR image and then use these to inform a customised SR network. Despite significant progress, subscribers to the former miss out on useful degradation information and followers of the latter rely on weaker SR networks, which are significantly outperformed by the latest architectural advancements. In this work, we present a framework for combining any blind SR prediction mechanism with any deep SR network. We show that a single lightweight metadata insertion block together with a degradation prediction mechanism can allow non-blind SR architectures to rival or outperform state-of-the-art dedicated blind SR networks. We implement various contrastive and iterative degradation prediction schemes and show they are readily compatible with high-performance SR networks such as RCAN and HAN within our framework. Furthermore, we demonstrate our framework’s robustness by successfully performing blind SR on images degraded with blurring, noise and compression. This represents the first explicit combined blind prediction and SR of images degraded with such a complex pipeline, acting as a baseline for further advancements.

  • Open Access

    The Best of Both Worlds: a Framework for Combining Degradation Prediction with High Performance Super-Resolution Networks

    by Matthew Aquilina, Keith George Ciantar, Christian Galea, Kenneth P. Camilleri, Reuben A. Farrugia, John Abela

    To date, the best-performing blind super-resolution (SR) techniques follow one of two paradigms: A) generate and train a standard SR network on synthetic low-resolution - high-resolution (LR - HR) pairs or B) attempt to predict the degradations an LR image has suffered and use these to inform a customised SR network. Despite significant progress, subscribers to the former miss out on useful degradation information that could be used to improve the SR process. On the other hand, followers of the latter rely on weaker SR networks, which are significantly outperformed by the latest architectural advancements. In this work, we present a framework for combining any blind SR prediction mechanism with any deep SR network, using a metadata insertion block to insert prediction vectors into SR network feature maps. Through comprehensive testing, we prove that state-of-the-art contrastive and iterative prediction schemes can be successfully combined with high-performance SR networks such as RCAN and HAN within our framework. We show that our hybrid models consistently achieve stronger SR performance than both their non-blind and blind counterparts. Furthermore, we demonstrate our framework's robustness by predicting degradations and super-resolving images from a complex pipeline of blurring, noise and compression.

  • Improving Super-Resolution Performance Using Meta-Attention Layers

    by Matthew Aquilina, Christian Galea, John Abela, Kenneth P. Camilleri, Reuben A. Farrugia

    Convolutional Neural Networks (CNNs) have achieved impressive results across many super-resolution (SR) and image restoration tasks. While many such networks can upscale low-resolution (LR) images using just the raw pixel-level information, the ill-posed nature of SR can make it difficult to accurately super-resolve an image which has undergone multiple different degradations. Additional information (metadata) describing the degradation process (such as the blur kernel applied, compression level, etc.) can guide networks to super-resolve LR images with higher fidelity to the original source. Previous attempts at informing SR networks with degradation parameters have indeed been able to improve performance in a number of scenarios. However, due to the fully-convolutional nature of many SR networks, most of these metadata fusion methods either require a complete architectural change, or necessitate the addition of significant extra complexity. Thus, these approaches are difficult to introduce into arbitrary SR networks without considerable design alterations. In this paper, we introduce meta-attention, a simple mechanism which allows any SR CNN to exploit the information available in relevant degradation parameters. The mechanism functions by translating the metadata into a channel attention vector, which in turn selectively modulates the network's feature maps. Incorporating meta-attention into SR networks is straightforward, as it requires no specific type of architecture to function correctly. Extensive testing has shown that meta-attention can consistently improve the pixel-level accuracy of state-of-the-art (SOTA) networks when provided with relevant degradation metadata. Despite average memory/runtime overheads of less than ~2.6%/0.025 seconds for the datasets and models considered, meta-attention improves the performance for both PSNR and SSIM; for PSNR, the gain on blurred/downsampled (X4) images is of 0.2969 dB (on average) and 0.3320 dB for SOTA general and face SR models, respectively. The coding framework used for this paper is available at: https://github.com/um-dsrg/Super-Resolution-Meta-Attention-Networks.


  • Open Access

    Automating Jellyfish Species Recognition through Faster Region-Based Convolution Neural Networks

    by Adam Gauci, Alan Deidun, John Abela

    In recent years, citizen science campaigns have provided a very good platform for widespread data collection. Within the marine domain, jellyfish are among the most commonly deployed species for citizen reporting purposes. The timely validation of submitted jellyfish reports remains challenging, given the sheer volume of reports being submitted and the relative paucity of trained staff familiar with the taxonomic identification of jellyfish. In this work, hundreds of photos that were submitted to the “Spot the Jellyfish” initiative are used to train a group of region-based, convolution neural networks. The main aim is to develop models that can classify, and distinguish between, the five most commonly recorded species of jellyfish within Maltese waters. In particular, images of the Pelagia noctiluca, Cotylorhiza tuberculata, Carybdea marsupialis, Velella velella and salps were considered. The reliability of the digital architecture is quantified through the precision, recall, f1 score, and κ score metrics. Improvements gained through the applicability of data augmentation and transfer learning techniques, are also discussed. Very promising results, that support upcoming aspirations to embed automated classification methods within online services, including smart phone apps, were obtained. These can reduce, and potentially eliminate, the need for human expert intervention in validating citizen science reports for the five jellyfish species in question, thus providing prompt feedback to the citizen scientist submitting the report.