Search

Hand gesture recognition has become an important research area, driven by the growing demand for human-computer interaction in fields such as sign language recognition, virtual and augmented reality, and robotics. Despite the rapid growth of the field, there are few surveys that comprehensively cover recent research developments, available solutions, and benchmark datasets. This survey addresses this gap by examining the latest advancements in hand gesture and 3D hand pose recognition from various types of camera input data including RGB images, depth images, and videos from monocular or multiview cameras, examining the differing methodological requirements of each approach. Furthermore, an overview of widely used datasets is provided, detailing their main characteristics and application domains. Finally, open challenges such as achieving robust recognition in real-world environments, handling occlusions, ensuring generalization across diverse users, and addressing computational efficiency for real-time applications are highlighted to guide future research directions. By synthesizing the objectives, methodologies, and applications of recent studies, this survey offers valuable insights into current trends, challenges, and opportunities for future research in human hand gesture recognition.

The VC-dimension of a family of sets is a measure of its combinatorial complexity used in machine learning theory, computational geometry, and even model theory. Computing the VC-dimension of the $k$-fold union of geometric set systems has been an open and difficult combinatorial problem, dating back to Blumer, Ehrenfeucht, Haussler, and Warmuth in 1989, who ask about the VC-dimension of $k$-fold unions of half-spaces in $\mathbb{R}^d$. Let $\mathcal{F}_1$ denote the family of all lines in $\mathbb{R}^2$. It is well-known that $\mathsf{VC}\text{-}\mathsf{dim}(\mathcal{F}_1) = 2$. In this paper, we study the $2$-fold and $3$-fold unions of $\mathcal{F}_1$, denoted $\mathcal{F}_2$ and $\mathcal{F}_3$, respectively. We show that $\mathsf{VC}\text{-}\mathsf{dim}(\mathcal{F}_2) = 5$ and $\mathsf{VC}\text{-}\mathsf{dim}(\mathcal{F}_3) = 9$. Moreover, we give complete characterisations of the subsets of $\mathbb{R}^2$ of maximal size that can be shattered by $\mathcal{F}_2$ and $\mathcal{F}_3$, showing they are exactly two and five, respectively, up to isomorphism in the language of the point-line incidence relation., Comment: 31 pages, including two appendices

We investigate the geometry of the moduli spaces $\mathscr{M}_{HE}^*(M^{2n})$ of Hermitian-Einstein irreducible connections on a vector bundle $E$ over a K\"ahler with torsion (KT) manifold $M^{2n}$ that admits holomorphic $\hat\nabla$-covariantly constant vector fields, where $\hat\nabla$ is the connection with skew-symmetric torsion $H$. We demonstrate that such vector fields induce an action on $\mathscr{M}_{HE}^*(M^{2n})$ that leaves both the metric and complex structure invariant. Moreover, if an additional condition is satisfied, the induced vector fields are convariantly constant with respect to the connection with skew-symmetric torsion $\hat{\mathcal{ D}}$ on $\mathscr{M}_{HE}^*(M^{2n})$. We demonstrate that in the presence of such vector fields, the geometry of $\mathscr{M}_{HE}^*(M^{2n})$ can be modeled on that of holomorphic toric principal bundles with base space KT manifolds and give some examples. We also extend our analysis to the moduli spaces $\mathscr{M}_{asd}^*(M^{4})$ of instanton connections on vector bundles over KT, bi-KT (generalised K\"ahler) and hyper-K\"ahler with torsion (HKT) manifolds $M^4$. We find that the geometry of $\mathscr{M}_{asd}^*(S^3\times S^1)$ can be modeled on that of principal bundles with fibre $S^3\times S^1$ over Quaternionic K\"ahler manifolds with torsion (QKT). In addition motivated by applications to AdS/CFT, we explore the (superconformal) symmetry algebras of two-dimensional sigma models with target spaces such moduli spaces., Comment: 64 pages

The dynamic properties of molecular clouds are set by the interplay of their self-gravity, turbulence, external pressure and magnetic fields. Extended surveys of Galactic molecular clouds typically find that their kinetic energy ($E_{\rm k}$) counterbalances their self-gravitational energy ($E_{\rm g}$), setting their virial parameter $\alpha_{\rm vir}=2E_{\rm k}/|E_{\rm g}|\approx1$. However, past studies either have been biased by the use of optically-thick lines or have been limited within the solar neighborhood and the inner Galaxy (Galactocentric radius $R_{\rm gc}

Estimating physical quantities such as the star formation rate, stellar mass and active galactic nucleus (AGN) fraction of galaxies is a key step in understanding galaxy formation and evolution. In order to estimate the uncertainties in the predicted values for these quantities, in this paper we explore the impact of adopting four different AGN torus models in fitting the multi-wavelength spectral energy distributions (SED) of galaxies. We also explore the impact of adopting two different geometries for the host, a spheroidal geometry, more appropriate for late-stage mergers, and a disc geometry, more appropriate for galaxies forming stars with secular processes. We use optical to submillimeter photometry from the Herschel Extragalactic Legacy Project (HELP) and utilize a Markov chain Monte Carlo SED-fitting code. We use exclusively radiative transfer models for the AGN torus as well as for the starburst and host galaxy. We concentrate on a sample of 200 galaxies at z~2, selected in the ELAIS-N1 field. All galaxies have a detection at 250um which ensures the presence of a starburst. We find that the stellar mass and star formation rate of the galaxies can be robustly estimated by the SED fitting but the AGN fraction depends very much on the adopted torus model. We also find that the vast majority of the galaxies in our sample are better fitted by a spheroidal geometry and lie above the main sequence. Our method predicts systematically higher SFR and lower stellar mass than the popular energy balance method CIGALE., Comment: Accepted for publication in Monthly Notices of the Royal Astronomical Society

This paper proposes a new approach for the calibration of material parameters in elastoplastic constitutive models. The calibration is posed as a constrained optimization problem, where the constitutive evolution equations serve as constraints. The objective function quantifies the mismatch between the stress predicted by the model and corresponding experimental measurements. To improve calibration efficiency, a novel direct-adjoint approach is presented to compute the Hessian of the objective function, which enables the use of second-order optimization algorithms. Automatic differentiation (AD) is used for gradient and Hessian computations. Two numerical examples are employed to validate the Hessian matrices and to demonstrate that the Newton-Raphson algorithm consistently outperforms gradient-based algorithms such as L-BFGS-B.

Distributed ledger technology offers several advantages for banking and finance industry, including efficient transaction processing and cross-party transaction reconciliation. The key challenges for adoption of this technology in financial institutes are (a) the building of a privacy-preserving ledger, (b) supporting auditing and regulatory requirements, and (c) flexibility to adapt to complex use-cases with multiple digital assets and actors. This paper proposes a framework for a private, audit-able, and distributed ledger (PADL) that adapts easily to fundamental use-cases within financial institutes. PADL employs widely-used cryptography schemes combined with zero-knowledge proofs to propose a transaction scheme for a `table' like ledger. It enables fast confidential peer-to-peer multi-asset transactions, and transaction graph anonymity, in a no-trust setup, but with customized privacy. We prove that integrity and anonymity of PADL is secured against a strong threat model. Furthermore, we showcase three fundamental real-life use-cases, namely, an assets exchange ledger, a settlement ledger, and a bond market ledger. Based on these use-cases we show that PADL supports smooth-lined inter-assets auditing while preserving privacy of the participants. For example, we show how a bank can be audited for its liquidity or credit risk without violation of privacy of itself or any other party, or how can PADL ensures honest coupon rate payment in bond market without sharing investors values. Finally, our evaluation shows PADL's advantage in performance against previous relevant schemes.

With today's multi-petawatt lasers, testing quantum electrodynamics (QED) in the strong field regime, where the electric field exceeds the Schwinger critical field in the rest frame of an electron, becomes within reach. Inverse Compton scattering of an intense laser pulse off a high-energy electron beam is the mainstream approach, resulting in the emission of high-energy photons that can decay into Breit-Wheeler electron-positron pairs. Here, we demonstrate experimentally that very high energy photons can be generated in a self-aligned single-laser Compton scattering setup, combining a laser-plasma accelerator and a plasma mirror. Reaching up to the GeV scale, photon emission via nonlinear Compton scattering exhibits a nonclassical scaling in the experiment that is consistent with electric fields reaching up to a fraction $\chi\simeq0.3$ of the Schwinger field in the electron rest frame. These foolproof collisions guaranteed by automatic laser-electron overlap provide a new approach for precise investigations of strong-field QED processes.

A 200-member ensemble developed at the Center for Western Weather and Water Extremes based on the Weather Research and Forecast atmospheric model tailored for the prediction of atmospheric rivers and associated heavy-to-extreme precipitation events over the Western US (West-WRF) is presented. The ensemble (WW200En) is generated with initial and boundary conditions from the US National Center for Environmental Prediction's Global Ensemble Forecast System (GEFS) and the European Centre for Medium-Range Weather Forecasts' Ensemble Prediction System (EPS), 100 unique combinations of microphysics, planetary boundary layer, and cumulus schemes, as well as perturbations applied to each of the 200 members based on the stochastic kinetic-energy backscatter scheme. Each member is run with 9-km horizontal increments and 60 vertical levels for a 10-month period spanning two winters. The performance of WW200En is compared to GEFS and EPS for probabilistic forecasts of 24-h precipitation, integrated water vapor transport (IVT), and for several thresholds including high percentiles of the observed climatological distribution. The WW200En precipitation forecast skill is better than GEFS at nearly all thresholds and lead times, and comparable or better than the EPS. For larger rainfall thresholds WW200En typically exhibits the best forecast skill. Additionally, WW200En has a better spread-skill relationship than the global systems, and an improved overall reliability and resolution of the probabilistic prediction. The results for IVT are qualitatively similar to those for precipitation forecasts. A sensitivity analysis of the physics parameterizations and the number of ensemble members provides insights into possible future developments of WW200En., Comment: This work has been submitted to Monthly Weather Review

We leverage the proximal Galerkin algorithm (Keith and Surowiec, Foundations of Computational Mathematics, 2024, DOI: 10.1007/s10208-024-09681-8), a recently introduced mesh-independent algorithm, to obtain a high-order finite element solver for variational problems with pointwise inequality constraints. This is achieved by discretizing the saddle point systems, arising from the latent variable proximal point method, with the hierarchical $p$-finite element basis. This results in discretized sparse Newton systems that admit a simple and effective block preconditioner. The solver can handle both obstacle-type, $u \leq \varphi$, and gradient-type, $|\nabla u| \leq \varphi$, constraints. We apply the resulting algorithm to solve obstacle problems with $hp$-adaptivity, a gradient-type constrained problem, and the thermoforming problem, an example of an obstacle-type quasi-variational inequality. We observe $hp$-robustness in the number of Newton iterations and only mild growth in the number of inner Krylov iterations to solve the Newton systems. Crucially we also provide wall-clock timings that are faster than low-order discretization counterparts.

We present the results of the second commissioning phase of the short-focal-length area of the Apollon laser facility (located in Saclay, France), which was performed with the main laser beam (F1), scaled to a peak power of 2 PetaWatt. Under the conditions that were tested, this beam delivered on-target pulses of maximum energy up to 45 J and 22 fs duration. Several diagnostics were fielded to assess the performance of the facility. The on-target focal spot and its spatial stability, as well as the secondary sources produced when irradiating solid targets, have all been characterized, with the goal of helping users design future experiments. The laser-target interaction was characterized, as well as emissions of energetic ions, X-ray and neutrons recorded, all showing good laser-to-target coupling efficiency. Moreover, we demonstrated the simultaneous fielding of F1 with the auxiliary 0.5 PW F2 beam of Apollon, enabling dual beam operation. The present commissioning will be followed in 2025 by a further commissioning stage of F1 at the 8 PW level, en route to the final 10 PW goal.

Traditional wavefront control in high-energy, high-intensity laser systems usually lacks real-time capability, failing to address dynamic aberrations. This limits experimental accuracy due to shot-to-shot fluctuations and necessitates long cool-down phases to mitigate thermal effects, particularly as higher repetition rates become essential, e.g. in Inertial Fusion research. This paper details the development and implementation of a real-time capable adaptive optics system at the Apollon laser facility. Inspired by astronomical adaptive optics, the system uses a fiber-coupled 905 nm laser diode as a pilot beam that allows for spectral separation, bypassing the constraints of pulsed lasers. A GPU-based controller, built on the open-source CACAO framework, manages a loop comprising a bimorph deformable mirror and high-speed Shack-Hartmann sensor. Initial tests showed excellent stability and effective aberration correction. However, integration into the Apollon laser revealed critical challenges unique to the laser environment that must be resolved to ensure safe operation with amplified shots., Comment: 15 pages, 17 figures, 2 tables; to be published in High Power Laser Science and Engineering

EXplainable Artificial Intelligence (XAI) approaches are widely applied for identifying fairness issues in Artificial Intelligence (AI) systems. However, in the context of facial analysis, existing XAI approaches, such as pixel attribution methods, offer explanations for individual images, posing challenges in assessing the overall behavior of a model, which would require labor-intensive manual inspection of a very large number of instances and leaving to the human the task of drawing a general impression of the model behavior from the individual outputs. Addressing this limitation, we introduce FaceX, the first method that provides a comprehensive understanding of face attribute classifiers through summary model explanations. Specifically, FaceX leverages the presence of distinct regions across all facial images to compute a region-level aggregation of model activations, allowing for the visualization of the model's region attribution across 19 predefined regions of interest in facial images, such as hair, ears, or skin. Beyond spatial explanations, FaceX enhances interpretability by visualizing specific image patches with the highest impact on the model's decisions for each facial region within a test benchmark. Through extensive evaluation in various experimental setups, including scenarios with or without intentional biases and mitigation efforts on four benchmarks, namely CelebA, FairFace, CelebAMask-HQ, and Racial Faces in the Wild, FaceX demonstrates high effectiveness in identifying the models' biases.

Mitigating biases in computer vision models is an essential step towards the trustworthiness of artificial intelligence models. Existing bias mitigation methods focus on a small set of predefined biases, limiting their applicability in visual datasets where multiple, possibly unknown biases exist. To address this limitation, we introduce MAVias, an open-set bias mitigation approach leveraging foundation models to discover spurious associations between visual attributes and target classes. MAVias first captures a wide variety of visual features in natural language via a foundation image tagging model, and then leverages a large language model to select those visual features defining the target class, resulting in a set of language-coded potential visual biases. We then translate this set of potential biases into vision-language embeddings and introduce an in-processing bias mitigation approach to prevent the model from encoding information related to them. Our experiments on diverse datasets, including CelebA, Waterbirds, ImageNet, and UrbanCars, show that MAVias effectively detects and mitigates a wide range of biases in visual recognition tasks outperforming current state-of-the-art.

Energy efficiency of Convolutional Neural Networks (CNNs) has become an important area of research, with various strategies being developed to minimize the power consumption of these models. Previous efforts, including techniques like model pruning, quantization, and hardware optimization, have made significant strides in this direction. However, there remains a need for more effective on device AI solutions that balance energy efficiency with model performance. In this paper, we propose a novel approach to reduce the energy requirements of inference of CNNs. Our methodology employs two small Complementary CNNs that collaborate with each other by covering each other's "weaknesses" in predictions. If the confidence for a prediction of the first CNN is considered low, the second CNN is invoked with the aim of producing a higher confidence prediction. This dual-CNN setup significantly reduces energy consumption compared to using a single large deep CNN. Additionally, we propose a memory component that retains previous classifications for identical inputs, bypassing the need to re-invoke the CNNs for the same input, further saving energy. Our experiments on a Jetson Nano computer demonstrate an energy reduction of up to 85.8% achieved on modified datasets where each sample was duplicated once. These findings indicate that leveraging a complementary CNN pair along with a memory component effectively reduces inference energy while maintaining high accuracy.

Recent works have established that AI models introduce spectral artifacts into generated images and propose approaches for learning to capture them using labeled data. However, the significant differences in such artifacts among different generative models hinder these approaches from generalizing to generators not seen during training. In this work, we build upon the key idea that the spectral distribution of real images constitutes both an invariant and highly discriminative pattern for AI-generated image detection. To model this under a self-supervised setup, we employ masked spectral learning using the pretext task of frequency reconstruction. Since generated images constitute out-of-distribution samples for this model, we propose spectral reconstruction similarity to capture this divergence. Moreover, we introduce spectral context attention, which enables our approach to efficiently capture subtle spectral inconsistencies in images of any resolution. Our spectral AI-generated image detection approach (SPAI) achieves a 5.5% absolute improvement in AUC over the previous state-of-the-art across 13 recent generative approaches, while exhibiting robustness against common online perturbations.

In this research, wettability control by area fraction of laser ablated surface of copper is presented. The functional surfaces with full wettability control from highly hydrophilic to super-hydrophobic were created on copper by nanosecond (ns) and picosecond (ps) laser irradiation. The area fraction and color change were evaluated by digital image processing of microscopic images of the laser-ablated copper surface. The control of the wetting angle from almost 0 degrees to 132 degrees was achieved for both ps and ns pulses by controlling the area fraction of the laser-ablated surface. Cassie, Cassie-Baxter, and Wenzel models were adopted to explain the experimental results. For the first time, the wettability and color of copper were controlled by controlling the area fraction of the laser-ablated surface. It is expected that the current results make an impact on the heat exchanger technology of water heat sinks, cooling units, atmospheric water generators, and fog harvesting and impact numerous applications from power plants to solar thermal water systems devices where highly-hydrophilic to super hydrophobic copper can be applied., Comment: 30 pages, 11 figures, 1 table, 103 references

Deepfake technology has rapidly advanced, posing significant threats to information integrity and societal trust. While significant progress has been made in detecting deepfakes, the simultaneous manipulation of audio and visual modalities, sometimes at small parts but still altering the meaning, presents a more challenging detection scenario. We present a novel audio-visual deepfake detection framework that leverages the inter-modality differences in machine perception of speech, based on the assumption that in real samples - in contrast to deepfakes - visual and audio signals coincide in terms of information. Our framework leverages features from deep networks that specialize in video and audio speech recognition to spot frame-level cross-modal incongruities, and in that way to temporally localize the deepfake forgery. To this end, DiMoDif employs a Transformer encoder-based architecture with a feature pyramid scheme and local attention, and optimizes the detection model through a composite loss function accounting for frame-level detections and fake intervals localization. DiMoDif outperforms the state-of-the-art on the Temporal Forgery Localization task by +47.88% AP@0.75 on AV-Deepfake1M, and performs on-par on LAV-DF. On the Deepfake Detection task, it outperforms the state-of-the-art by +30.5% AUC on AV-Deepfake1M, +2.8% AUC on FakeAVCeleb, and performs on-par on LAV-DF. Code available at https://github.com/mever-team/dimodif.

Cold and dense matter may break rotational symmetry spontaneously and thus form an anisotropic phase in the interior of neutron stars. We consider the concrete example of an anisotropic chiral condensate in the form of a chiral density wave. Employing a nucleon-meson model and taking into account fermionic vacuum fluctuations, we improve and extend previous results by imposing the conditions of electric charge neutrality and electroweak equilibrium, by allowing for a more general form of the vector meson self-interactions, and by including properties of pure neutron matter into the fit of the model parameters. We find that the conditions inside neutron stars postpone the onset of the chiral density wave to larger densities compared to isospin-symmetric nuclear matter. While this still allows for the construction of stars with an anisotropic core, we find that the chiral density wave is energetically preferred only in a corner of the parameter space where matter is too soft to generate stars with realistic masses. Therefore, taking into account constraints from astrophysical data, our calculation predicts an isotropic neutron star core., Comment: 21 pages, 7 figures; v2: two new panels added in Fig. 2, minor improvements to the text, references added, to appear in PRD

Over the recent years, the protection of the so-called `soft-targets', i.e. locations easily accessible by the general public with relatively low, though, security measures, has emerged as a rather challenging and increasingly important issue. The complexity and seriousness of this security threat growths nowadays exponentially, due to the emergence of new advanced technologies (e.g. Artificial Intelligence (AI), Autonomous Vehicles (AVs), 3D printing, etc.); especially when it comes to large-scale, popular and diverse public spaces. In this paper, a novel Digital Twin-as-a-Security-Service (DTaaSS) architecture is introduced for holistically and significantly enhancing the protection of public spaces (e.g. metro stations, leisure sites, urban squares, etc.). The proposed framework combines a Digital Twin (DT) conceptualization with additional cutting-edge technologies, including Internet of Things (IoT), cloud computing, Big Data analytics and AI. In particular, DTaaSS comprises a holistic, real-time, large-scale, comprehensive and data-driven security solution for the efficient/robust protection of public spaces, supporting: a) data collection and analytics, b) area monitoring/control and proactive threat detection, c) incident/attack prediction, and d) quantitative and data-driven vulnerability assessment. Overall, the designed architecture exhibits increased potential in handling complex, hybrid and combined threats over large, critical and popular soft-targets. The applicability and robustness of DTaaSS is discussed in detail against representative and diverse real-world application scenarios, including complex attacks to: a) a metro station, b) a leisure site, and c) a cathedral square.

Reliability is necessary in safety-critical applications spanning numerous domains. Conventional hardware-based fault tolerance techniques, such as component redundancy, ensure reliability, typically at the expense of significantly increased power consumption, and almost double (or more) hardware area. To mitigate these costs, microarchitectural fault tolerance methods try to lower overheads by leveraging microarchitectural insights, but prior evaluations focus primarily on only application performance. As different safety-critical applications prioritize different requirements beyond reliability, evaluating only limited metrics cannot guarantee that microarchitectural methods are practical and usable for all different application scenarios. To this end, in this work, we extensively characterize and compare three fault detection methods, each representing a different major fault detection category, considering real requirements from diverse application settings and employing various important metrics such as design area, power, performance overheads and latency in detection. Through this analysis, we provide important insights which may guide designers in applying the most effective fault tolerance method tailored to specific needs, advancing the overall understanding and development of robust computing systems. For this, we study three methods for hardware error detection within a processor, i.e., (i) Dual Modular Redundancy (DMR) as a conventional method, and (ii) Redundant Multithreading (R-SMT) and (iii) Parallel Error Detection (ParDet) as microarchitecture-level methods. We demonstrate that microarchitectural fault tolerance, i.e., R-SMT and ParDet, is comparably robust compared to conventional approaches (DMR), however, still exhibits unappealing trade-offs for specific real-world use cases, thus precluding their usage in certain application scenarios.

The Multi-Capacity Fixed-Charge Network Flow (MC-FCNF) problem, a generalization of the Fixed-Charge Network Flow problem, aims to assign capacities to edges in a flow network such that a target amount of flow can be hosted at minimum cost. The cost model for both problems dictates that the fixed cost of an edge is incurred for any non-zero amount of flow hosted by that edge. This problem naturally arises in many areas including infrastructure design, transportation, telecommunications, and supply chain management. The MC-FCNF problem is NP-Hard, so solving large instances using exact techniques is impractical. This paper presents a genetic algorithm designed to quickly find high-quality flow solutions to the MC-FCNF problem. The genetic algorithm uses a novel solution representation scheme that eliminates the need to repair invalid flow solutions, which is an issue common to many other genetic algorithms for the MC-FCNF problem. The genetic algorithm's efficiency is displayed with an evaluation using real-world CO2 capture and storage infrastructure design data. The evaluation results highlight the genetic algorithm's potential for solving large-scale network design problems.

Single-shot hyperspectral wavefront sensing is essential for applications like spatio-spectral coupling metrology in high power laser or fast material dispersion imaging. Under broadband illumination, traditional wavefront sensors assume an achromatic wavefront, which makes them unsuitable. We introduce a hyperspectral wavefront sensing scheme based on the Hartmann wavefront sensing principles, employing a multicore fiber as a modified Hartmann mask to overcome these limitations. Our system leverages the angular memory effect and spectral decorrelation from the multicore fiber, encoding wavefront gradients into displacements and the spectral information into uncorrelated patterns. This method retains the simplicity, compactness, and single-shot capability of conventional wavefront sensors, with only a slight increase in computational complexity. It also allows a tunable trade-off between spatial and spectral resolution. We demonstrate its efficacy for recording the hyperspectral wavefront cube from single-pulse acquisitions at the Apollon multi-PW laser facility, and for performing multispectral microscopic imaging of dispersive phase objects.

Over the past few years, the European Commission has made significant steps to reduce disinformation in cyberspace. One of those steps has been the introduction of the 2022 "Strengthened Code of Practice on Disinformation". Signed by leading online platforms, this Strengthened Code of Practice on Disinformation is an attempt to combat disinformation on the Web. The Code of Practice includes a variety of measures including the demonetization of disinformation, urging, for example, advertisers "to avoid the placement of advertising next to Disinformation content". In this work, we set out to explore what was the impact of the Code of Practice and especially to explore to what extent ad networks continue to advertise on dis-/mis-information sites. We perform a historical analysis and find that, although at a hasty glance things may seem to be improving, there is really no significant reduction in the amount of advertising relationships among popular misinformation websites and major ad networks. In fact, we show that ad networks have withdrawn mostly from unpopular misinformation websites with very few visitors, but still form relationships with highly unreliable websites that account for the majority of misinformation traffic. To make matters worse, we show that ad networks continue to place advertisements of legitimate companies next to misinformation content. In fact, major ad networks place ads in almost 400 misinformation websites of our dataset., Comment: 12 pages, 11 figures

Deep learning techniques have achieved significant success in Synthetic Aperture Radar (SAR) target recognition using predefined datasets in static scenarios. However, real-world applications demand that models incrementally learn new information without forgetting previously acquired knowledge. The challenge of catastrophic forgetting, where models lose past knowledge when adapting to new tasks, remains a critical issue. In this paper, we introduce IncSAR, an incremental learning framework designed to tackle catastrophic forgetting in SAR target recognition. IncSAR combines the power of a Vision Transformer (ViT) and a custom-designed Convolutional Neural Network (CNN) in a dual-branch architecture, integrated via a late-fusion strategy. Additionally, we explore the use of TinyViT to reduce computational complexity and propose an attention mechanism to dynamically enhance feature representation. To mitigate the speckle noise inherent in SAR images, we employ a denoising module based on a neural network approximation of Robust Principal Component Analysis (RPCA), leveraging a simple neural network for efficient noise reduction in SAR imagery. Moreover, a random projection layer improves the linear separability of features, and a variant of Linear Discriminant Analysis (LDA) decorrelates extracted class prototypes for better generalization. Extensive experiments on the MSTAR, SAR-AIRcraft-1.0, and OpenSARShip benchmark datasets demonstrate that IncSAR significantly outperforms state-of-the-art approaches, achieving a 99.63\% average accuracy and a 0.33\% performance drop, representing an 89\% improvement in retention compared to existing techniques. The source code is available at https://github.com/geokarant/IncSAR.

We show that the spatial part of the Klein-Gordon operator is an essentially self-adjoint operator on the Cauchy surfaces of various classes of spacetimes. Our proof employs the intricate connection between global hyperbolicity and geodesically complete Riemannian surfaces, and concludes by proving global hyperbolicity of the spacetimes under study., Comment: 16 pages

The Offshore Wind (OSW) industry is experiencing significant expansion, resulting in increased Operations \& Maintenance (O\&M) costs. Intelligent alarm systems offer the prospect of swift detection of component failures and process anomalies, enabling timely and precise interventions that could yield reductions in resource expenditure, as well as scheduled and unscheduled downtime. This paper introduces an innovative approach to tackle this challenge by capitalising on Large Language Models (LLMs). We present a specialised conversational agent that incorporates statistical techniques to calculate distances between sentences for the detection and filtering of hallucinations and unsafe output. This potentially enables improved interpretation of alarm sequences and the generation of safer repair action recommendations by the agent. Preliminary findings are presented with the approach applied to ChatGPT-4 generated test sentences. The limitation of using ChatGPT-4 and the potential for enhancement of this agent through re-training with specialised OSW datasets are discussed.

Non-convex optimization is a critical tool in advancing machine learning, especially for complex models like deep neural networks and support vector machines. Despite challenges such as multiple local minima and saddle points, non-convex techniques offer various pathways to reduce computational costs. These include promoting sparsity through regularization, efficiently escaping saddle points, and employing subsampling and approximation strategies like stochastic gradient descent. Additionally, non-convex methods enable model pruning and compression, which reduce the size of models while maintaining performance. By focusing on good local minima instead of exact global minima, non-convex optimization ensures competitive accuracy with faster convergence and lower computational overhead. This paper examines the key methods and applications of non-convex optimization in machine learning, exploring how it can lower computation costs while enhancing model performance. Furthermore, it outlines future research directions and challenges, including scalability and generalization, that will shape the next phase of non-convex optimization in machine learning.

We develop a semismooth Newton framework for the numerical solution of fixed-point equations that are posed in Banach spaces. The framework is motivated by applications in the field of obstacle-type quasi-variational inequalities and implicit obstacle problems. It is discussed in a general functional analytic setting and allows for inexact function evaluations and Newton steps. Moreover, if a certain contraction assumption holds, we show that it is possible to globalize the algorithm by means of the Banach fixed-point theorem and to ensure $q$-superlinear convergence to the problem solution for arbitrary starting values. By means of a localization technique, our Newton method can also be used to determine solutions of fixed-point equations that are only locally contractive and not uniquely solvable. We apply our algorithm to a quasi-variational inequality which arises in thermoforming and which not only involves the obstacle problem as a source of nonsmoothness but also a semilinear PDE containing a nondifferentiable Nemytskii operator. Our analysis is accompanied by numerical experiments that illustrate the mesh-independence and $q$-superlinear convergence of the developed solution algorithm.

In his paper Minimal stretch maps between hyperbolic surfaces, William Thurston defined a norm on the tangent space to Teichm{\"u}ller space of a hyperbolic surface, which he called the earthquake norm. This norm is obtained by assigning a length to a tangent vector after such a vector is considered as an infinitesimal earthquake deformation of the surface. This induces a Finsler metric on the Teichm{\"u}ller space, called the earthquake metric. This theory was recently investigated by Huang, Ohshika, Pan and Papadopoulos. In the present paper, we study this metric from the conformal viewpoint and we adapt Thurston's theory to the case of Riemann surfaces of arbitrary genus with marked points. A complex version of the Legendre transform defined for Finsler manifolds gives an analogue of the Wolpert duality for the Weil-Petersson symplectic form, which establishes a complete analogue of Thurston's theory of the earthquake norm in the conformal setting.

The time-consuming nature of training and deploying complicated Machine and Deep Learning (DL) models for a variety of applications continues to pose significant challenges in the field of Machine Learning (ML). These challenges are particularly pronounced in the federated domain, where optimizing models for individual nodes poses significant difficulty. Many methods have been developed to tackle this problem, aiming to reduce training expenses and time while maintaining efficient optimisation. Three suggested strategies to tackle this challenge include Active Learning, Knowledge Distillation, and Local Memorization. These methods enable the adoption of smaller models that require fewer computational resources and allow for model personalization with local insights, thereby improving the effectiveness of current models. The present study delves into the fundamental principles of these three approaches and proposes an advanced Federated Learning System that utilises different Personalisation methods towards improving the accuracy of AI models and enhancing user experience in real-time NG-IoT applications, investigating the efficacy of these techniques in the local and federated domain. The results of the original and optimised models are then compared in both local and federated contexts using a comparison analysis. The post-analysis shows encouraging outcomes when it comes to optimising and personalising the models with the suggested techniques.

Memes are an increasingly prevalent element of online discourse in social networks, especially among young audiences. They carry ideas and messages that range from humorous to hateful, and are widely consumed. Their potentially high impact requires adequate means of control to moderate their use in large scale. In this work, we propose SimCLIP a deep learning-based architecture for cross-modal understanding of memes, leveraging a pre-trained CLIP encoder to produce context-aware embeddings and a Siamese fusion technique to capture the interactions between text and image. We perform an extensive experimentation on seven meme classification tasks across six datasets. We establish a new state of the art in Memotion7k with a 7.25% relative F1-score improvement, and achieve super-human performance on Harm-P with 13.73% F1-Score improvement. Our approach demonstrates the potential for compact meme classification models, enabling accurate and efficient meme monitoring. We share our code at https://github.com/jahuerta92/meme-classification-simclip

The rise of financial crime that has been observed in recent years has created an increasing concern around the topic and many people, organizations and governments are more and more frequently trying to combat it. Despite the increase of interest in this area, there is a lack of specialized datasets that can be used to train and evaluate works that try to tackle those problems. This article proposes a new micro-benchmark dataset for algorithms and models that identify individuals and organizations, and their multiple writings, in news articles, and presents an approach that assists in its creation. Experimental efforts are also reported, using this dataset, to identify individuals and organizations in financial-crime-related articles using various low-billion parameter Large Language Models (LLMs). For these experiments, standard metrics (Accuracy, Precision, Recall, F1 Score) are reported and various prompt variants comprising the best practices of prompt engineering are tested. In addition, to address the problem of ambiguous entity mentions, a simple, yet effective LLM-based disambiguation method is proposed, ensuring that the evaluation aligns with reality. Finally, the proposed approach is compared against a widely used state-of-the-art open-source baseline, showing the superiority of the proposed method.

We demonstrate that all perturbative scale invariant heterotic sigma models with a compact target space $M^D$ are conformally invariant. The proof, presented in detail for up to and including two loops, utilises a geometric analogue of the $c$-theorem based on a generalisation of the Perelman's results on geometric flows. Then, we present examples of scale invariant heterotic sigma models with target spaces that exhibit special geometry, which is characterised by the holonomy of the connection with torsion a 3-form, and explore the additional conditions that are necessary for such sigma models to be conformally invariant. For this, we find that the geometry of the target spaces is further restricted to be either conformally balanced or the a priori holonomy of the connection with torsion reduces. We identify the pattern of holonomy reduction in the cases that the holonomy is $SU(n)$ $(D=2n)$, $Sp(k)$ $D=4k)$, $G_2$ $(D=7)$ and $\mathrm{Spin}(7)$ $(D=8)$. We also investigate the properties of these geometries and present some examples., Comment: 35 pages

Synthetic images disseminated online significantly differ from those used during the training and evaluation of the state-of-the-art detectors. In this work, we analyze the performance of synthetic image detectors as deceptive synthetic images evolve throughout their online lifespan. Our study reveals that, despite advancements in the field, current state-of-the-art detectors struggle to distinguish between synthetic and real images in the wild. Moreover, we show that the time elapsed since the initial online appearance of a synthetic image negatively affects the performance of most detectors. Ultimately, by employing a retrieval-assisted detection approach, we demonstrate the feasibility to maintain initial detection performance throughout the whole online lifespan of an image and enhance the average detection efficacy across several state-of-the-art detectors by 6.7% and 7.8% for balanced accuracy and AUC metrics, respectively.

Computer vision (CV) datasets often exhibit biases that are perpetuated by deep learning models. While recent efforts aim to mitigate these biases and foster fair representations, they fail in complex real-world scenarios. In particular, existing methods excel in controlled experiments involving benchmarks with single-attribute injected biases, but struggle with multi-attribute biases being present in well-established CV datasets. Here, we introduce BAdd, a simple yet effective method that allows for learning fair representations invariant to the attributes introducing bias by incorporating features representing these attributes into the backbone. BAdd is evaluated on seven benchmarks and exhibits competitive performance, surpassing state-of-the-art methods on both single- and multi-attribute benchmarks. Notably, BAdd achieves +27.5% and +5.5% absolute accuracy improvements on the challenging multi-attribute benchmarks, FB-Biased-MNIST and CelebA, respectively.

Incomplete Hippocampal Inversion (IHI), sometimes called hippocampal malrotation, is an atypical anatomical pattern of the hippocampus found in about 20% of the general population. IHI can be visually assessed on coronal slices of T1 weighted MR images, using a composite score that combines four anatomical criteria. IHI has been associated with several brain disorders (epilepsy, schizophrenia). However, these studies were based on small samples. Furthermore, the factors (genetic or environmental) that contribute to the genesis of IHI are largely unknown. Large-scale studies are thus needed to further understand IHI and their potential relationships to neurological and psychiatric disorders. However, visual evaluation is long and tedious, justifying the need for an automatic method. In this paper, we propose, for the first time, to automatically rate IHI. We proceed by predicting four anatomical criteria, which are then summed up to form the IHI score, providing the advantage of an interpretable score. We provided an extensive experimental investigation of different machine learning methods and training strategies. We performed automatic rating using a variety of deep learning models (conv5-FC3, ResNet and SECNN) as well as a ridge regression. We studied the generalization of our models using different cohorts and performed multi-cohort learning. We relied on a large population of 2,008 participants from the IMAGEN study, 993 and 403 participants from the QTIM/QTAB studies as well as 985 subjects from the UKBiobank. We showed that deep learning models outperformed a ridge regression. We demonstrated that the performances of the conv5-FC3 network were at least as good as more complex networks while maintaining a low complexity and computation time. We showed that training on a single cohort may lack in variability while training on several cohorts improves generalization., Comment: Accepted for publication at the Journal of Machine Learning for Biomedical Imaging (MELBA) https://melba-journal.org/2024:016

Out-of-context (OOC) misinformation poses a significant challenge in multimodal fact-checking, where images are paired with texts that misrepresent their original context to support false narratives. Recent research in evidence-based OOC detection has seen a trend towards increasingly complex architectures, incorporating Transformers, foundation models, and large language models. In this study, we introduce a simple yet robust baseline, which assesses MUltimodal SimilaritiEs (MUSE), specifically the similarity between image-text pairs and external image and text evidence. Our results demonstrate that MUSE, when used with conventional classifiers like Decision Tree, Random Forest, and Multilayer Perceptron, can compete with and even surpass the state-of-the-art on the NewsCLIPpings and VERITE datasets. Furthermore, integrating MUSE in our proposed "Attentive Intermediate Transformer Representations" (AITR) significantly improved performance, by 3.3% and 7.5% on NewsCLIPpings and VERITE, respectively. Nevertheless, the success of MUSE, relying on surface-level patterns and shortcuts, without examining factuality and logical inconsistencies, raises critical questions about how we define the task, construct datasets, collect external evidence and overall, how we assess progress in the field. We release our code at: https://github.com/stevejpapad/outcontext-misinfo-progress

Automated fact-checking (AFC) is garnering increasing attention by researchers aiming to help fact-checkers combat the increasing spread of misinformation online. While many existing AFC methods incorporate external information from the Web to help examine the veracity of claims, they often overlook the importance of verifying the source and quality of collected "evidence". One overlooked challenge involves the reliance on "leaked evidence", information gathered directly from fact-checking websites and used to train AFC systems, resulting in an unrealistic setting for early misinformation detection. Similarly, the inclusion of information from unreliable sources can undermine the effectiveness of AFC systems. To address these challenges, we present a comprehensive approach to evidence verification and filtering. We create the "CREDible, Unreliable or LEaked" (CREDULE) dataset, which consists of 91,632 articles classified as Credible, Unreliable and Fact checked (Leaked). Additionally, we introduce the EVidence VERification Network (EVVER-Net), trained on CREDULE to detect leaked and unreliable evidence in both short and long texts. EVVER-Net can be used to filter evidence collected from the Web, thus enhancing the robustness of end-to-end AFC systems. We experiment with various language models and show that EVVER-Net can demonstrate impressive performance of up to 91.5% and 94.4% accuracy, while leveraging domain credibility scores along with short or long texts, respectively. Finally, we assess the evidence provided by widely-used fact-checking datasets including LIAR-PLUS, MOCHEG, FACTIFY, NewsCLIPpings+ and VERITE, some of which exhibit concerning rates of leaked and unreliable evidence.

Physics-Informed Neural Networks (PINNs) have emerged as a robust framework for solving Partial Differential Equations (PDEs) by approximating their solutions via neural networks and imposing physics-based constraints on the loss function. Traditionally, Multilayer Perceptrons (MLPs) have been the neural network of choice, with significant progress made in optimizing their training. Recently, Kolmogorov-Arnold Networks (KANs) were introduced as a viable alternative, with the potential of offering better interpretability and efficiency while requiring fewer parameters. In this paper, we present a fast JAX-based implementation of grid-dependent Physics-Informed Kolmogorov-Arnold Networks (PIKANs) for solving PDEs, achieving up to 84 times faster training times than the original KAN implementation. We propose an adaptive training scheme for PIKANs, introducing an adaptive state transition technique to avoid loss function peaks between grid extensions, and a methodology for designing PIKANs with alternative basis functions. Through comparative experiments, we demonstrate that the adaptive features significantly enhance solution accuracy, decreasing the L^2 error relative to the reference solution by up to 43.02%. For the studied PDEs, our methodology approaches or surpasses the results obtained from architectures that utilize up to 8.5 times more parameters, highlighting the potential of adaptive, grid-dependent PIKANs as a superior alternative in scientific and engineering applications.

Generative AI technologies produce increasingly realistic imagery, which, despite its potential for creative applications, can also be misused to produce misleading and harmful content. This renders Synthetic Image Detection (SID) methods essential for identifying AI-generated content online. State-of-the-art SID methods typically resize or center-crop input images due to architectural or computational constraints, which hampers the detection of artifacts that appear in high-resolution images. To address this limitation, we propose TextureCrop, an image pre-processing component that can be plugged in any pre-trained SID model to improve its performance. By focusing on high-frequency image parts where generative artifacts are prevalent, TextureCrop enhances SID performance with manageable memory requirements. Experimental results demonstrate a consistent improvement in AUC across various detectors by 6.1% compared to center cropping and by 15% compared to resizing, across high-resolution images from the Forensynths, Synthbuster and TWIGMA datasets. Code available at https : //github.com/mever-team/texture-crop., Comment: 10 pages, 7 images

In the field of modern robotics, robots are proving to be useful in tackling high-risk situations, such as navigating hazardous environments like burning buildings, earthquake-stricken areas, or patrolling crime-ridden streets, as well as exploring uncharted caves. These scenarios share similarities with maze exploration problems in terms of complexity. While several methods have been proposed for single-agent systems, ranging from potential fields to flood-fill methods, recent research endeavors have focused on creating methods tailored for multiple agents to enhance the quality and efficiency of maze coverage. The contribution of this paper is the implementation of established maze exploration methods and their comparison with a new cost-utility algorithm designed for multiple agents, which combines the existing methodologies to optimize exploration outcomes. Through a comprehensive and comparative analysis, this paper evaluates the performance of the new approach against the implemented baseline methods from the literature, highlighting its efficacy and potential advantages in various scenarios. The code and experimental results supporting this study are available in the following repository (https://github.com/manouslinard/multiagent-exploration/)., Comment: 12 pages, 15 figures, Conference on Artificial Intelligence SETN 2024. arXiv admin note: text overlap with arXiv:2405.20232

Digital image manipulation has become increasingly accessible and realistic with the advent of generative AI technologies. Recent developments allow for text-guided inpainting, making sophisticated image edits possible with minimal effort. This poses new challenges for digital media forensics. For example, diffusion model-based approaches could either splice the inpainted region into the original image, or regenerate the entire image. In the latter case, traditional image forgery localization (IFL) methods typically fail. This paper introduces the Text-Guided Inpainting Forgery (TGIF) dataset, a comprehensive collection of images designed to support the training and evaluation of image forgery localization and synthetic image detection (SID) methods. The TGIF dataset includes approximately 75k forged images, originating from popular open-source and commercial methods, namely SD2, SDXL, and Adobe Firefly. We benchmark several state-of-the-art IFL and SID methods on TGIF. Whereas traditional IFL methods can detect spliced images, they fail to detect regenerated inpainted images. Moreover, traditional SID may detect the regenerated inpainted images to be fake, but cannot localize the inpainted area. Finally, both IFL and SID methods fail when exposed to stronger compression, while they are less robust to modern compression algorithms, such as WEBP. In conclusion, this work demonstrates the inefficiency of state-of-the-art detectors on local manipulations performed by modern generative approaches, and aspires to help with the development of more capable IFL and SID methods. The dataset and code can be downloaded at https://github.com/IDLabMedia/tgif-dataset., Comment: 6 pages, accepted at IEEE WIFS 2024

Our collective attention span is shortened by the flood of online information. With \textit{FarFetched}, we address the need for automated claim validation based on the aggregated evidence derived from multiple online news sources. We introduce an entity-centric reasoning framework in which latent connections between events, actions, or statements are revealed via entity mentions and represented in a graph database. Using entity linking and semantic similarity, we offer a way for collecting and combining information from diverse sources in order to generate evidence relevant to the user's claim. Then, we leverage textual entailment recognition to quantitatively determine whether this assertion is credible, based on the created evidence. Our approach tries to fill the gap in automated claim validation for less-resourced languages and is showcased on the Greek language, complemented by the training of relevant semantic textual similarity (STS) and natural language inference (NLI) models that are evaluated on translated versions of common benchmarks., Comment: DeepLo NAACL 2022

Broad Line Regions (BLRs) are known to contain gravitationally-bound gas within r~(few) 10^2-10^3 Schwarszchild radii (Rs) near supermassive black holes (SMBHs) in Active Galactic Nuclei (AGNs). Photo-ionized by strong non-stellar AGN continuum, this gas emits luminous ultraviolet/optical/near-infrared lines from ionized hydrogen (and other multi-ionized atoms) that have the widest velocity profiles observed in galaxies, uniquely indicating the deep gravitational wells of SMBHs. Nearly all BLR studies focus on its ionized gas phase (hereafter BLR+), with typical masses of only a few 10-100 M_Sun, despite strong indications of neutral BLR gas reservoirs (hereafter BLR0) with M_BLR0~10^{5-6} M_Sun. We used the photoionization code CLOUDY, with its chemistry augmented using three-body reactions, to explore 1-D models of dustless BLRs, focusing on the BLR0 conditions, and the abundances of its most prevalent neutral atoms and molecules. A neutral-atom-) and molecule-rich BLR0 gas phase is found underlying the BLR+, the latter occupying only a thin outer layer of AGN-irradiated gas column densities, while the former contains the bulk of the BLR gas mass. Atomic carbon and oxygen as well as the CO molecule can reach substantial abundances in the BLR0, while their lines at infrared and submillimeter wavelengths can yield new probes of the BLR physical conditions and dynamics, unhindered by the dust absorption from outer AGN tori that readily absorb the BLR+ optical/far-ultraviolet (FUV) lines. We find that neutral-atom-rich neutral-atom-rich and even molecule-rich gas can exist in the BLR0. The corresponding spectral lines from neutral atoms and molecules promise a new spectral window of gas dynamics in the vicinity of~SMBHs unhindered by dust absorption. This may even offer the prospect of conducting novel tests of general relativity in strongly curved spacetimes., Comment: Accepted for publication in A&A Letter after language correction

Image data augmentation constitutes a critical methodology in modern computer vision tasks, since it can facilitate towards enhancing the diversity and quality of training datasets; thereby, improving the performance and robustness of machine learning models in downstream tasks. In parallel, augmentation approaches can also be used for editing/modifying a given image in a context- and semantics-aware way. Diffusion Models (DMs), which comprise one of the most recent and highly promising classes of methods in the field of generative Artificial Intelligence (AI), have emerged as a powerful tool for image data augmentation, capable of generating realistic and diverse images by learning the underlying data distribution. The current study realizes a systematic, comprehensive and in-depth review of DM-based approaches for image augmentation, covering a wide range of strategies, tasks and applications. In particular, a comprehensive analysis of the fundamental principles, model architectures and training strategies of DMs is initially performed. Subsequently, a taxonomy of the relevant image augmentation methods is introduced, focusing on techniques regarding semantic manipulation, personalization and adaptation, and application-specific augmentation tasks. Then, performance assessment methodologies and respective evaluation metrics are analyzed. Finally, current challenges and future research directions in the field are discussed., Comment: 65 pages, 15 figures

Artificial intelligence systems often address fairness concerns by evaluating and mitigating measures of group discrimination, for example that indicate biases against certain genders or races. However, what constitutes group fairness depends on who is asked and the social context, whereas definitions are often relaxed to accept small deviations from the statistical constraints they set out to impose. Here we decouple definitions of group fairness both from the context and from relaxation-related uncertainty by expressing them in the axiomatic system of Basic fuzzy Logic (BL) with loosely understood predicates, like encountering group members. We then evaluate the definitions in subclasses of BL, such as Product or Lukasiewicz logics. Evaluation produces continuous instead of binary truth values by choosing the logic subclass and truth values for predicates that reflect uncertain context-specific beliefs, such as stakeholder opinions gathered through questionnaires. Internally, it follows logic-specific rules to compute the truth values of definitions. We show that commonly held propositions standardize the resulting mathematical formulas and we transcribe logic and truth value choices to layperson terms, so that anyone can answer them. We also use our framework to study several literature definitions of algorithmic fairness, for which we rationalize previous expedient practices that are non-probabilistic and show how to re-interpret their formulas and parameters in new contexts., Comment: preprint, 32 pages, 7 figures, 2 theorems, 6 appendices

This paper discusses four facets of the Knowledge Distillation (KD) process for Convolutional Neural Networks (CNNs) and Vision Transformer (ViT) architectures, particularly when executed on edge devices with constrained processing capabilities. First, we conduct a comparative analysis of the KD process between CNNs and ViT architectures, aiming to elucidate the feasibility and efficacy of employing different architectural configurations for the teacher and student, while assessing their performance and efficiency. Second, we explore the impact of varying the size of the student model on accuracy and inference speed, while maintaining a constant KD duration. Third, we examine the effects of employing higher resolution images on the accuracy, memory footprint and computational workload. Last, we examine the performance improvements obtained by fine-tuning the student model after KD to specific downstream tasks. Through empirical evaluations and analyses, this research provides AI practitioners with insights into optimal strategies for maximizing the effectiveness of the KD process on edge devices.