Search

A 3D chaos game is shown to be a useful way for encoding DNA sequences. Since matching subsequences in DNA converge in space in 3D chaos game encoding, a DNA sequence's 3D chaos game representation can be used to compare DNA sequences without prior alignment and without truncating or padding any of the sequences. Two proposed methods inspired by shape-similarity comparison techniques show that this form of encoding can perform as well as alignment-based techniques for building phylogenetic trees. The first method uses the volume overlap of intersecting spheres and the second uses shape signatures by summarizing the coordinates, oriented angles, and oriented distances of the 3D chaos game trajectory. The methods are tested using: (1) the first exon of the beta-globin gene for 11 species, (2) mitochondrial DNA from four groups of primates, and (3) a set of synthetic DNA sequences. Simulations show that the proposed methods produce distances that reflect the number of mutation events; additionally, on average, distances resulting from deletion mutations are comparable to those produced by substitution mutations.

This paper describes the many image decomposition models that allow to separate structures and textures or structures, textures, and noise. These models combined a total variation approach with different adapted functional spaces such as Besov or Contourlet spaces or a special oscillating function space based on the work of Yves Meyer. We propose a method to evaluate the performance of such algorithms to enhance understanding of the behavior of these models.

In this paper we present some theoretical results about a structures-textures image decomposition model which was proposed by the second author. We prove a theorem which gives the behavior of this model in different cases. Finally, as a consequence of the theorem we derive an algorithm for the detection of long and thin objects applied to a road networks detection application in aerial or satellite images.

This paper introduces a new way to correct the non-uniformity (NU) in uncooled infrared-type images. The main defect of these uncooled images is the lack of a column (resp. line) time-dependent cross-calibration, resulting in a strong column (resp. line) and time dependent noise. This problem can be considered as a 1D flicker of the columns inside each frame. Thus, classic movie deflickering algorithms can be adapted, to equalize the columns (resp. the lines). The proposed method therefore applies to the series formed by the columns of an infrared image a movie deflickering algorithm. The obtained single image method works on static images, and therefore requires no registration, no camera motion compensation, and no closed aperture sensor equalization. Thus, the method has only one camera dependent parameter, and is landscape independent. This simple method will be compared to a state of the art total variation single image correction on raw real and simulated images. The method is real time, requiring only two operations per pixel. It involves no test-pattern calibration and produces no "ghost artifacts"., Comment: arXiv admin note: substantial text overlap with arXiv:2411.03615

We propose a new way to correct for the non-uniformity (NU) and the noise in uncooled infrared-type images. This method works on static images, needs no registration, no camera motion and no model for the non uniformity. The proposed method uses an hybrid scheme including an automatic locally-adaptive contrast adjustment and a state-of-the-art image denoising method. It permits to correct for a fully non-linear NU and the noise efficiently using only one image. We compared it with total variation on real raw and simulated NU infrared images. The strength of this approach lies in its simplicity, low computational cost. It needs no test-pattern or calibration and produces no "ghost-artefact".

This paper considers cooperative control of robots involving two different testbed systems in remote locations with communication on the internet. This provides us the capability to exchange robots status like positions, velocities and directions needed for the swarming algorithm. The results show that all robots properly follow some leader defined one of the testbeds. Measurement of data exchange rates show no loss of packets, and average transfer delays stay within tolerance limits for practical applications. In our knowledge, the novelty of this paper concerns this kind of control over a large network like internet.

Grasp learning in noisy environments, such as occlusions, sensor noise, and out-of-distribution (OOD) objects, poses significant challenges. Recent learning-based approaches focus primarily on capturing aleatoric uncertainty from inherent data noise. The epistemic uncertainty, which represents the OOD recognition, is often addressed by ensembles with multiple forward paths, limiting real-time application. In this paper, we propose an uncertainty-aware approach for 6-DoF grasp detection using evidential learning to comprehensively capture both uncertainties in real-world robotic grasping. As a key contribution, we introduce vMF-Contact, a novel architecture for learning hierarchical contact grasp representations with probabilistic modeling of directional uncertainty as von Mises-Fisher (vMF) distribution. To achieve this, we derive and analyze the theoretical formulation of the second-order objective on the posterior parametrization, providing formal guarantees for the model's ability to quantify uncertainty and improve grasp prediction performance. Moreover, we enhance feature expressiveness by applying partial point reconstructions as an auxiliary task, improving the comprehension of uncertainty quantification as well as the generalization to unseen objects. In the real-world experiments, our method demonstrates a significant improvement by 39% in the overall clearance rate compared to the baselines. Video is under https://www.youtube.com/watch?v=4aQsrDgdV8Y&t=12s

In this paper we present a new approach to deblur the effect of atmospheric turbulence in the case of long range imaging. Our method is based on an analytical formulation, the Fried kernel, of the atmosphere modulation transfer function (MTF) and a framelet based deconvolution algorithm. An important parameter is the refractive index structure which requires specific measurements to be known. Then we propose a method which provides a good estimation of this parameter from the input blurred image. The final algorithms are very easy to implement and show very good results on both simulated blur and real images.

We recently developed a new approach to get a stabilized image from a sequence of frames acquired through atmospheric turbulence. The goal of this algorihtm is to remove the geometric distortions due by the atmosphere movements. This method is based on a variational formulation and is efficiently solved by the use of Bregman iterations and the operator splitting method. In this paper we propose to study the influence of the choice of the regularizing term in the model. Then we proposed to experiment some of the most used regularization constraints available in the litterature.

We introduce the physically based neural bidirectional reflectance distribution function (PBNBRDF), a novel, continuous representation for material appearance based on neural fields. Our model accurately reconstructs real-world materials while uniquely enforcing physical properties for realistic BRDFs, specifically Helmholtz reciprocity via reparametrization and energy passivity via efficient analytical integration. We conduct a systematic analysis demonstrating the benefits of adhering to these physical laws on the visual quality of reconstructed materials. Additionally, we enhance the color accuracy of neural BRDFs by introducing chromaticity enforcement supervising the norms of RGB channels. Through both qualitative and quantitative experiments on multiple databases of measured real-world BRDFs, we show that adhering to these physical constraints enables neural fields to more faithfully and stably represent the original data and achieve higher rendering quality.

A novel approach is presented to recover an image degraded by atmospheric turbulence. Given a sequence of frames affected by turbulence, we construct a variational model to characterize the static image. The optimization problem is solved by Bregman Iteration and the operator splitting method. Our algorithm is simple, efficient, and can be easily generalized for different scenarios.

In molecular systems, the ultrafast motion of electrons initiates the process of chemical change. Tracking this electronic motion across molecules requires coupling attosecond time resolution to atomic-scale spatial sensitivity. In this work, we employ a pair of attosecond x-ray pulses from an x-ray free-electron laser to follow electron motion resulting from the sudden removal of an electron from a prototypical aromatic system, para-aminophenol. X-ray absorption enables tracking this motion with atomic-site specificity. Our measurements are compared with state-of-the-art computational modeling, reproducing the observed response across multiple timescales. Sub-femtosecond dynamics are assigned to states undergoing non-radiative decay, while few-femtosecond oscillatory motion is associated with electronic wavepacket motion in stable cation states, that will eventually couple to nuclear motion. Our work provides insight on the ultrafast charge motion preceding and initiating chemical transformations in moderately complex systems, and provides a powerful benchmark for computational models of ultrafast charge motion in matter.

In this paper, we introduce WaKA (Wasserstein K-nearest neighbors Attribution), a novel attribution method that leverages principles from the LiRA (Likelihood Ratio Attack) framework and applies them to \( k \)-nearest neighbors classifiers (\( k \)-NN). WaKA efficiently measures the contribution of individual data points to the model's loss distribution, analyzing every possible \( k \)-NN that can be constructed using the training set, without requiring sampling or shadow model training. WaKA can be used \emph{a posteriori} as a membership inference attack (MIA) to assess privacy risks, and \emph{a priori} for data minimization and privacy influence measurement. Thus, WaKA can be seen as bridging the gap between data attribution and membership inference attack (MIA) literature by distinguishing between the value of a data point and its privacy risk. For instance, we show that self-attribution values are more strongly correlated with the attack success rate than the contribution of a point to model generalization. WaKA's different usages were also evaluated across diverse real-world datasets, demonstrating performance very close to LiRA when used as an MIA on \( k \)-NN classifiers, but with greater computational efficiency.

In this paper, we investigate theoretically the behavior of Meyer's image cartoon + texture decomposition model. Our main results is a new theorem which shows that, by combining the decomposition model and a well chosen Littlewood-Paley filter, it is possible to extract almost perfectly a certain class of textures. This theorem leads us to the construction of a parameterless multiscale texture separation algorithm. Finally, we propose to extend this algorithm into a directional multiscale texture separation algorithm by designing a directional Littlewood-Paley filter bank. Several experiments show the efficiency of the proposed method both on synthetic and real images.

Automated detection of chemical plumes presents a segmentation challenge. The segmentation problem for gas plumes is difficult due to the diffusive nature of the cloud. The advantage of considering hyperspectral images in the gas plume detection problem over the conventional RGB imagery is the presence of non-visual data, allowing for a richer representation of information. In this paper we present an effective method of visualizing hyperspectral video sequences containing chemical plumes and investigate the effectiveness of segmentation techniques on these post-processed videos. Our approach uses a combination of dimension reduction and histogram equalization to prepare the hyperspectral videos for segmentation. First, Principal Components Analysis (PCA) is used to reduce the dimension of the entire video sequence. This is done by projecting each pixel onto the first few Principal Components resulting in a type of spectral filter. Next, a Midway method for histogram equalization is used. These methods redistribute the intensity values in order to reduce flicker between frames. This properly prepares these high-dimensional video sequences for more traditional segmentation techniques. We compare the ability of various clustering techniques to properly segment the chemical plume. These include K-means, spectral clustering, and the Ginzburg-Landau functional.

Concurrent EEG-fMRI recordings are advantageous over serial recordings, as they offer the ability to explore the relationship between both signals without the compounded effects of nonstationarity in the brain. Nonetheless, analysis of simultaneous recordings is challenging given that a number of noise sources are introduced into the EEG signal even after MR gradient artifact removal with balistocardiogram artifact being highly prominent. Here, we present an algorithm for automatically removing residual noise sources from the EEG signal in a single process using low rank + sparse decomposition (LR+SD). We apply this method to both experimental and simulated EEG data, where in the latter case the true EEG signature is known. The experimental data consisted of EEG data collected concurrently with fMRI (EEG-fMRI) as well as alone outside the scanning environment while subjects viewed Gabor flashes, a perceptual task known to produce event related power diminutions in the alpha spectral band. On the simulated data, the LR+SD method was able to recover the pure EEG signal and separate it from artifact with up to three EEG sources. On the experimental data, LR+SD was able to recover the diminution in alpha spectral power that follows light flashes in concurrent EEG-fMRI data, which was not detectable prior to artifact removal. At the group level, we found that the signal-to-noise ratio was increased ~34\% following LR+SD cleaning, as compared independent component analysis (ICA) in concurrently collected EEG-fMRI data. We anticipate that this method will be highly useful for analyzing simultaneously collected EEG-fMRI data, and downstream for exploring the coupling between these two modalities.

A recently developed new approach, called ``Empirical Wavelet Transform'', aims to build 1D adaptive wavelet frames accordingly to the analyzed signal. In this paper, we present several extensions of this approach to 2D signals (images). We revisit some well-known transforms (tensor wavelets, Littlewood-Paley wavelets, ridgelets and curvelets) and show that it is possible to build their empirical counterpart. We prove that such constructions lead to different adaptive frames which show some promising properties for image analysis and processing.

Some recent methods, like the Empirical Mode Decomposition (EMD), propose to decompose a signal accordingly to its contained information. Even though its adaptability seems useful for many applications, the main issue with this approach is its lack of theory. This paper presents a new approach to build adaptive wavelets. The main idea is to extract the different modes of a signal by designing an appropriate wavelet filter bank. This construction leads us to a new wavelet transform, called the empirical wavelet transform. Many experiments are presented showing the usefulness of this method compared to the classic EMD.

In this paper, we investigate the extension of the recently proposed weighted Fourier burst accumulation (FBA) method into the wavelet domain. The purpose of FBA is to reconstruct a clean and sharp image from a sequence of blurred frames. This concept lies in the construction of weights to amplify dominant frequencies in the Fourier spectrum of each frame. The reconstructed image is then obtained by taking the inverse Fourier transform of the average of all processed spectra. In this paper, we first suggest to replace the rigid registration step used in the original algorithm by a non-rigid registration in order to be able to process sequences acquired through atmospheric turbulence. Second, we propose to work in a wavelet domain instead of the Fourier one. This leads us to the construction of two types of algorithms. Finally, we propose an alternative approach to replace the weighting idea by an approach promoting the sparsity in the used space. Several experiments are provided to illustrate the efficiency of the proposed methods.

Long distance imaging is subject to the impact of the turbulent atmosphere. This results into geometric distortions and some blur effect in the observed frames. Despite the existence of several turbulence mitigation algorithms in the literature, no common dataset exists to objectively evaluate their efficiency. In this paper, we describe a new dataset called OTIS (Open Turbulent Images Set) which contains several sequences (either static or dynamic) acquired through the turbulent atmosphere. For almost all sequences, we provide the corresponding groundtruth in order to make the comparison between algorithms easier. We also discuss possible metrics to perform such comparisons.

In this paper, we design a very simple algorithm based on Split Bregman iterations to numerically solve the cartoon + textures decomposition model of Meyer. This results in a significant gain in speed compared to Chambolle's nonlinear projectors.

Topologically protected states can be found in physical systems, that show singularities in some energy contour diagram. These singularities can be characterized by winding numbers, defined on a classification surface, which maps physical state parameters. We have found a classification surface, which applies for three-band hamiltonian systems in the same way than standard Bloch surface does for two-band ones. This generalized Bloch surface is universal in the sense that it classifies a very large class of three-band systems, which we have exhaustively studied, finding specific classification surfaces, applying for each one., Comment: 20 pages, 19 figures

A variety of neural networks architectures are being studied to tackle blur in images and videos caused by a non-steady camera and objects being captured. In this paper, we present an overview of these existing networks and perform experiments to remove the blur caused by atmospheric turbulence. Our experiments aim to examine the reusability of existing networks and identify desirable aspects of the architecture in a system that is geared specifically towards atmospheric turbulence mitigation. We compare five different architectures, including a network trained in an end-to-end fashion, thereby removing the need for a stabilization step.

In this work, we extract the optical flow field corresponding to moving objects from an image sequence of a scene impacted by atmospheric turbulence \emph{and} captured from a moving camera. Our procedure first computes the optical flow field and creates a motion model to compensate for the flow field induced by camera motion. After subtracting the motion model from the optical flow, we proceed with our previous work, Gilles et al~\cite{gilles2018detection}, where a spatial-temporal cartoon+texture inspired decomposition is performed on the motion-compensated flow field in order to separate flows corresponding to atmospheric turbulence and object motion. Finally, the geometric component is processed with the detection and tracking method and is compared against a ground truth. All of the sequences and code used in this work are open source and are available by contacting the authors.

In this paper, we propose a new approach to perform supervised texture classification/segmentation. The proposed idea is to feed a Fully Convolutional Network with specific texture descriptors. These texture features are extracted from images by using an empirical curvelet transform. We propose a method to build a unique empirical curvelet filter bank adapted to a given dictionary of textures. We then show that the output of these filters can be used to build efficient texture descriptors utilized to finally feed deep learning networks. Our approach is finally evaluated on several datasets and compare the results to various state-of-the-art algorithms and show that the proposed method dramatically outperform all existing ones.

In this paper, we investigate how moving objects can be detected when images are impacted by atmospheric turbulence. We present a geometric spatio-temporal point of view to the problem and show that it is possible to distinguish movement due to the turbulence vs. moving objects. To perform this task, we propose an extension of 2D cartoon+texture decomposition algorithms to 3D vector fields. Our algorithm is based on curvelet spaces which permit to better characterize the movement flow geometry. We present experiments on real data which illustrate the efficiency of the proposed method.

Wavelet-based segmentation approaches are widely used for texture segmentation purposes because of their ability to characterize different textures. In this paper, we assess the influence of the chosen wavelet and propose to use the recently introduced empirical wavelets. We show that the adaptability of the empirical wavelet permits to reach better results than classic wavelets. In order to focus only on the textural information, we also propose to perform a cartoon + texture decomposition step before applying the segmentation algorithm. The proposed method is tested on six classic benchmarks, based on several popular texture images.

The empirical wavelet transform is an adaptive multiresolution analysis tool based on the idea of building filters on a data-driven partition of the Fourier domain. However, existing 2D extensions are constrained by the shape of the detected partitioning. In this paper, we provide theoretical results that permits us to build 2D empirical wavelet filters based on an arbitrary partitioning of the frequency domain. We also propose an algorithm to detect such partitioning from an image spectrum by combining a scale-space representation to estimate the position of dominant harmonic modes and a watershed transform to find the boundaries of the different supports making the expected partition. This whole process allows us to define the empirical watershed wavelet transform. We illustrate the effectiveness and the advantages of such adaptive transform, first visually on toy images, and next on both unsupervised texture segmentation and image deconvolution applications.

The recently proposed empirical wavelet transform was based on a particular type of filter. In this paper, we aim to propose a general framework for the construction of empirical wavelet systems in the continuous case. We define a well-suited formalism and then investigate some general properties of empirical wavelet systems. In particular, we provide some sufficient conditions to the existence of a reconstruction formula. In the second part of the paper, we propose the construction of empirical wavelet systems based on some classic mother wavelets.

This work addresses the problem of exact schedulability assessment in uniprocessor mixed-criticality real-time systems with sporadic task sets. We model the problem by means of a finite automaton that has to be explored in order to check for schedulability. To mitigate the state explosion problem, we provide a generic algorithm which is parameterised by several techniques called oracles and simulation relations. These techniques leverage results from the scheduling literature as "plug-ins" that make the algorithm more efficient in practice. Our approach achieves up to a 99.998% reduction in the search space required for exact schedulability testing, making it practical for a range of task sets, up to 8 tasks or maximum periods of 350. This method enables to challenge the pessimism of an existing schedulability test and to derive a new dynamic-priority scheduler, demonstrating its good performance. This is the full version of an RTNS 2024 paper., Comment: In the proceedings of 32nd International Conference on Real-Time Networks and Systems, RTNS24, ACM, 2024

Pulsar Timing Array (PTA) collaborations gather high-precision timing measurements of pulsars with the aim of detecting gravitational wave (GW) signals. A major challenge lies in the identification and characterization of the different sources of noise that may hamper their sensitivity to GWs. The presence of time-correlated noise that resembles the target signal might give rise to degeneracies that can directly impact the detection statistics. In this work, we focus on the covariance that exists between a "chromatic" dispersion measure (DM) noise and an "achromatic" stochastic gravitational wave background (GWB). "Chromatic" associated to the DM noise means that its amplitude depends on the frequency of the incoming pulsar photons measured by the radio-telescope. Several frequency channels are then required to accurately characterise its chromatic features and when the coverage of incoming frequency is poor, it becomes impossible to disentangle chromatic and achromatic noise contributions. In this paper, we explore this situation by injecting realistic GWB into 100 realizations of two mock versions of the second data release (DR2) of the European PTA (EPTA), characterized by different frequency coverage. The first dataset is a faithful copy of DR2, in which the first half of the data is dominated by only one frequency channel of observation; the second one is identical except for a more homogeneous frequency coverage across the full dataset. We show that for 91% of the injections, a better frequency coverage leads to an improved statistical significance (~1.3dex higher log Bayes factor on average) of the GWB and a better characterization of its properties. We propose a metric to quantify the degeneracy between DM and GWB parameters and show that it is correlated with a loss of significance for the recovered GWB and an increase in the GWB bias towards a higher and flatter spectral shape.

Current large open vision models could be useful for one and few-shot object recognition. Nevertheless, gradient-based re-training solutions are costly. On the other hand, open-vocabulary object detection models bring closer visual and textual concepts in the same latent space, allowing zero-shot detection via prompting at small computational cost. We propose a lightweight method to turn the latter into a one-shot or few-shot object recognition models without requiring textual descriptions. Our experiments on the TEgO dataset using the YOLO-World model as a base show that performance increases with the model size, the number of examples and the use of image augmentation.

In this paper, we develop the notion of a Morse sequence, which provides an alternative approach to discrete Morse theory, and which is both simple and effective. A Morse sequence on a finite simplicial complex is a sequence composed solely of two elementary operations, that is, expansions (the inverse of a collapse), and fillings (the inverse of a perforation). In a dual manner, a Morse sequence may be obtained by considering only collapses and perforations. Such a sequence is another way to represent the gradient vector field of an arbitrary discrete Morse function. To each Morse sequence, we assign a reference map and an extension map. A reference map associates a set of critical simplexes to each simplex of a given complex, and an extension map associates a set of simplexes to each critical simplex. By considering the boundary of each critical simplex, we obtain a chain complex from these maps, which corresponds precisely to the Morse complex. We show that, when restricted to homology, an extension map is the inverse of a reference map. Also we show that these two maps allow us to recover directly the isomorphism theorem between the homology of an object and the homology of its Morse complex. At last, we introduce the notion of a flow complex, which is based solely on extension maps. We prove that this notion is equivalent to the classical one based on gradient flows.

One of our main goals in this paper is to understand the behavior of limit sets of a diverging sequence of Schottky groups in the group of isometries of the N-dimensional hyperbolic space. This leads us to a generalization of a classical theorem of Bowen on variations of Hausdorff dimension of limit sets; and to a method of transforming a diverging sequence of Schottky groups into an almost converging sequence in the group of isometries of the infinite dimensional hyperbolic space. Our results apply in particular to an example of McMullen and generalize a previous work by Mehmeti and Dang.

We present an elastic simulator for domains defined as evolving implicit functions, which is efficient, robust, and differentiable with respect to both shape and material. This simulator is motivated by applications in 3D reconstruction: it is increasingly effective to recover geometry from observed images as implicit functions, but physical applications require accurately simulating and optimizing-for the behavior of such shapes under deformation, which has remained challenging. Our key technical innovation is to train a small neural network to fit quadrature points for robust numerical integration on implicit grid cells. When coupled with a Mixed Finite Element formulation, this yields a smooth, fully differentiable simulation model connecting the evolution of the underlying implicit surface to its elastic response. We demonstrate the efficacy of our approach on forward simulation of implicits, direct simulation of 3D shapes during editing, and novel physics-based shape and topology optimizations in conjunction with differentiable rendering., Comment: 16 pages, 21 figures

Motivated by the study of the propagation of convexity by semi-groups of stochastic differential equations and convex comparison between the distributions of solutions of two such equations, we study the comparison for the convex order between a Gaussian distribution and a Gaussian mixture. We give and discuss intrinsic necessary and sufficient conditions for convex ordering. On the examples that we have worked out, the two conditions appear to be closely related.

We show that, in finite dimensions, around any $m$-partite product state $\rho_{\rm prod}=\rho_1\otimes...\otimes\rho_m$, there exists an ellipsoid of separable states centered around $\rho_{\rm prod}$. The volume of this separable ellipsoid is typically exponentially larger than that of the separable ball proposed in previous works, due to the large hierarchy of eigenvalues occurring in typical states. We further refine this ellipsoidal criterion to a trace formula, generalize it to characterize the separable region around all separable states, and further study biseparability. Our criterion will help numerical procedures to rigorously detect separability. We apply the procedure for separability detection on three-qubit X state in a dephasing environment, and the 1d transverse field Ising model at finite temperature to illustrate the power of our procedure for understanding entanglement in physical systems., Comment: 6 pages, 1 figure

Distributed beamforming is a key enabler to provide power wirelessly to a massive amount of energy-neutral devices (ENDs). However, without prior information and fully depleted ENDs, initially powering these devices efficiently is an open question. This work investigates and assesses the feasibility of harvesting sufficient energy to transmit a backscatter pilot signal from the END, which can be then used for coherent downlink transmission. We experimentally evaluated adaptive single-tone and multi-tone signals during initial charging. The results indicate that the response time for ENDs with unknown locations can extend to several tens of seconds. Notably, the adaptive single-tone excitation shows, among others, better performance at lower transmit power levels, providing a faster response. These findings underscore the potential of adaptive single-tone signals in optimizing power delivery to END in future networks., Comment: 1st International Workshop on Energy Neutral and Sustainable IoT Devices and Infrastructure (EN-IoT 2024)

We present the largest Galactic neutral hydrogen HI absorption survey to date, utilizing the Australian SKA Pathfinder Telescope at an unprecedented spatial resolution of 30''. This survey, GASKAP-HI, unbiasedly targets 2,714 continuum background sources over 250 square degrees in the direction of the Magellanic Clouds, a significant increase compared to a total of 373 sources observed by previous Galactic absorption surveys across the entire Milky Way. We aim to investigate the physical properties of cold (CNM) and warm (WNM) neutral atomic gas in the Milky Way foreground, characterized by two prominent filaments at high Galactic latitudes (between $-45^{\circ}$ and $-25^{\circ}$). We detected strong HI absorption along 462 lines of sight above the 3$\sigma$ threshold, achieving an absorption detection rate of 17%. GASKAP-HI's unprecedented angular resolution allows for simultaneous absorption and emission measurements to sample almost the same gas clouds along a line of sight. A joint Gaussian decomposition is then applied to absorption-emission spectra to provide direct estimates of HI optical depths, temperatures, and column densities for the CNM and WNM components. The thermal properties of CNM components are consistent with those previously observed along a wide range of Solar neighborhood environments, indicating that cold HI properties are widely prevalent throughout the local interstellar medium. Across our region of interest, CNM accounts for ~30% of the total HI gas, with the CNM fraction increasing with column density toward the two filaments. Our analysis reveals an anti-correlation between CNM temperature and its optical depth, which implies that CNM with lower optical depth leads to a higher temperature., Comment: Largest Galactic HI Absorption Survey To Date (GASKAP-HI): Cold Atomic Gas in the Magellanic Cloud foreground using Australian SKA Pathfinder. This paper has 19 pages, 17 figures. This paper has been accepted for publication in Monthly Notices of the Royal Astronomical Society Main Journal

Bayesian calibration is an effective approach for ensuring that numerical simulations accurately reflect the behavior of physical systems. However, because numerical models are never perfect, a discrepancy known as model error exists between the model outputs and the observed data, and must be quantified. Conventional methods can not be implemented in transposition situations, such as when a model has multiple outputs but only one is experimentally observed. To account for the model error in this context, we propose augmenting the calibration process by introducing additional input numerical parameters through a hierarchical Bayesian model, which includes hyperparameters for the prior distribution of the calibration variables. Importance sampling estimators are used to avoid increasing computational costs. Performance metrics are introduced to assess the proposed probabilistic model and the accuracy of its predictions. The method is applied on a computer code with three outputs that models the Taylor cylinder impact test. The outputs are considered as the observed variables one at a time, to work with three different transposition situations. The proposed method is compared with other approaches that embed model errors to demonstrate the significance of the hierarchical formulation., Comment: Submitted to International Journal for Uncertainty Quantification

The altermagnet candidate Mn5Si3 has attracted wide attention in the context of non-relativistic spin physics, due to its composition of light elements. However, the presumed structure of the altermagnetic phase had yet to be demonstrated. In this study, we demonstrate a hallmark of altermagnetism in Mn5Si3 thin films, namely the three options, or variants, for the checkerboard distribution of the magnetic Mn atoms. The magnetic symmetries were altered by field-rotation of the N\'eel vector along relevant crystal directions, resulting in anomalous Hall effect anisotropy. The experimental results in nanoscale devices were corroborated by a theoretical model involving atomic site dependent anisotropy and bulk Dzyaloshinskii-Moriya interaction for a single variant.

Standard cosmological analysis, which relies on two-point statistics, fails to extract the full information of the data. This limits our ability to constrain with precision cosmological parameters. Thus, recent years have seen a paradigm shift from analytical likelihood-based to simulation-based inference. However, such methods require a large number of costly simulations. We focus on full-field inference, considered the optimal form of inference. Our objective is to benchmark several ways of conducting full-field inference to gain insight into the number of simulations required for each method. We make a distinction between explicit and implicit full-field inference. Moreover, as it is crucial for explicit full-field inference to use a differentiable forward model, we aim to discuss the advantages of having this property for the implicit approach. We use the sbi_lens package which provides a fast and differentiable log-normal forward model. This forward model enables us to compare explicit and implicit full-field inference with and without gradient. The former is achieved by sampling the forward model through the No U-Turns sampler. The latter starts by compressing the data into sufficient statistics and uses the Neural Likelihood Estimation algorithm and the one augmented with gradient. We perform a full-field analysis on LSST Y10 like weak lensing simulated mass maps. We show that explicit and implicit full-field inference yield consistent constraints. Explicit inference requires 630 000 simulations with our particular sampler corresponding to 400 independent samples. Implicit inference requires a maximum of 101 000 simulations split into 100 000 simulations to build sufficient statistics (this number is not fine tuned) and 1 000 simulations to perform inference. Additionally, we show that our way of exploiting the gradients does not significantly help implicit inference., Comment: 20 pages, 16 figures, submitted to A&A

Recent constraints on neutron star mass and radius have advanced our understanding of the equation of state of cold dense matter. Some of them have been obtained by modeling the pulses of three millisecond X-ray pulsars observed by the Neutron Star Interior Composition Explorer (NICER). Here, we present a Bayesian parameter inference for a fourth pulsar, PSR J1231-1411, using the same technique with NICER and XMM-Newton data. When applying a broad mass-inclination prior from radio timing measurements and the emission region geometry model that can best explain the data, we find likely-converged results only when using a limited radius prior. If limiting the radius to be consistent with the previous observational constraints and equation of state analyses, we infer the radius to be $12.6 \pm 0.3$ km and the mass to be $1.04_{-0.03}^{+0.05}$ $M_\odot$, each reported as the posterior credible interval bounded by the $16\,\%$ and $84\,\%$ quantiles. If using an uninformative prior but limited between $10$ and $14$ km, we find otherwise similar results, but $R_{\mathrm{eq}} = 13.5_{-0.5}^{+0.3}$ km for the radius. In both cases, we find a non-antipodal hot region geometry where one emitting spot is at the equator or slightly above, surrounded by a large colder region, and where a non-circular hot region lies close to southern rotational pole. If using a wider radius prior, we only find solutions that fit the data significantly worse. We discuss the challenges in finding the better fitting solutions, possibly related to the weak interpulse feature in the pulse profile., Comment: 22 pages, 13 figures (2 of which are figure sets), 3 tables, accepted for publication in ApJ

The empirical wavelet transform is a fully adaptive time-scale representation that has been widely used in the last decade. Inspired by the empirical mode decomposition, it consists of filter banks based on harmonic mode supports. Recently, it has been generalized to build the filter banks from any generating function using mappings. In practice, the harmonic mode supports can have low constrained shape in 2D, leading to numerical difficulties to compute the mappings and therefore the related wavelet filters. This work aims to propose an efficient numerical scheme to compute empirical wavelet coefficients using the demons registration algorithm. Results show that the proposed approach gives a numerically robust wavelet transform. An application to texture segmentation of scanning tunnelling microscope images is also presented.

In a parallel with the 20 questions game, we present a method to determine whether two large language models (LLMs), placed in a black-box context, are the same or not. The goal is to use a small set of (benign) binary questions, typically under 20. We formalize the problem and first establish a baseline using a random selection of questions from known benchmark datasets, achieving an accuracy of nearly 100% within 20 questions. After showing optimal bounds for this problem, we introduce two effective questioning heuristics able to discriminate 22 LLMs by using half as many questions for the same task. These methods offer significant advantages in terms of stealth and are thus of interest to auditors or copyright owners facing suspicions of model leaks.

Online object segmentation and tracking in Lidar point clouds enables autonomous agents to understand their surroundings and make safe decisions. Unfortunately, manual annotations for these tasks are prohibitively costly. We tackle this problem with the task of class-agnostic unsupervised online instance segmentation and tracking. To that end, we leverage an instance segmentation backbone and propose a new training recipe that enables the online tracking of objects. Our network is trained on pseudo-labels, eliminating the need for manual annotations. We conduct an evaluation using metrics adapted for temporal instance segmentation. Computing these metrics requires temporally-consistent instance labels. When unavailable, we construct these labels using the available 3D bounding boxes and semantic labels in the dataset. We compare our method against strong baselines and demonstrate its superiority across two different outdoor Lidar datasets.

Lifelike visualizations in design, cinematography, and gaming rely on precise physics simulations, typically requiring extensive computational resources and detailed physical input. This paper presents a method that can infer a system's physical properties from a short video, eliminating the need for explicit parameter input, provided it is close to the training condition. The learned representation is then used within a Graph Network-based Simulator to emulate the trajectories of physical systems. We demonstrate that the video-derived encodings effectively capture the physical properties of the system and showcase a linear dependence between some of the encodings and the system's motion.

The rise of powerful multimodal LLMs has enhanced the viability of building web agents which can, with increasing levels of autonomy, assist users to retrieve information and complete tasks on various human-computer interfaces. It is hence necessary to build challenging benchmarks that span a wide-variety of use cases reflecting real-world usage. In this work, we present WebQuest, a multi-page question-answering dataset that requires reasoning across multiple related web pages. In contrast to existing UI benchmarks that focus on multi-step web navigation and task completion, our dataset evaluates information extraction, multimodal retrieval and composition of information from many web pages. WebQuest includes three question categories: single-screen QA, multi-screen QA, and QA based on navigation traces. We evaluate leading proprietary multimodal models like GPT-4V, Gemini Flash, Claude 3, and open source models like InstructBLIP, PaliGemma on our dataset, revealing a significant gap between single-screen and multi-screen reasoning. Finally, we investigate inference time techniques like Chain-of-Thought prompting to improve model capabilities on multi-screen reasoning.

The multiplication of platforms offering open data has facilitated access to information that can be used for research, innovation, and decision-making. Providing transparency and availability, open data is regularly updated, allowing us to observe their evolution over time. We are particularly interested in the evolution of urban data that allows stakeholders to better understand dynamics and propose solutions to improve the quality of life of citizens. In this context, we are interested in the management of evolving data, especially urban data and the ability to query these data across the available versions. In order to have the ability to understand our urban heritage and propose new scenarios, we must be able to search for knowledge through concurrent versions of urban knowledge graphs. In this work, we present the ConVer-G (Concurrent Versioning of knowledge Graphs) system for storage and querying through multiple concurrent versions of graphs., Comment: 5 pages

The continuous evolution of cities poses significant challenges in terms of managing and understanding their complex dynamics. With the increasing demand for transparency and the growing availability of open urban data, it has become important to ensure the reproducibility of scientific research and computations in urban planning. To understand past decisions and other possible scenarios, we require solutions that go beyond the management of urban knowledge graphs. In this work, we explore existing solutions and their limits and explain the need and possible approaches for querying across multiple graph versions., Comment: 2 pages