Search

In a laser, the control of its spectral emission depends on the physical dimensions of the optical resonator, limiting it to a set of discrete cavity modes at specific frequencies. Here, we overcome this fundamental limit by demonstrating a monolithic semiconductor laser with a continuously tunable repetition rate from 4 up to 16 GHz, by employing a microwave driving signal that induces a spatiotemporal gain modulation along the entire laser cavity, generating intracavity mode-locked pulses with a continuously tunable group velocity. At the output, frequency combs with continuously tunable mode spacings are generated in the frequency domain, and coherent pulse trains with continuously tunable repetition rates are generated in the time domain. Our results pave the way for fully tunable chip-scale lasers and frequency combs, advantageous for use in a diverse variety of fields, from fundamental studies to applications such as high-resolution and dual-comb spectroscopy., Comment: 9 pages, 5 figures

We present here a real-time analysis of diffraction images acquired at high frame-rate (925 Hz) and its application to macromolecular serial crystallography. The software uses a new signal separation algorithm, able to distinguish the amorphous (or powder diffraction) component from the diffraction signal originating from single crystals. It relies on the ability to work efficiently in azimuthal space and derives from the work performed on pyFAI, the fast azimuthal integration library. Two applications are built upon this separation algorithm: a lossy compression algorithm and a peak-picking algorithm; the performances of both is assessed by comparing data quality after reduction with XDS and CrystFEL., Comment: 43 pages, 12 figures

Within the context of the ALICE ITS3 collaboration, a set of MAPS small-scale test structures were developed using the 65 nm TPSCo CMOS imaging process with the upgrade of the ALICE inner tracking system as its primary focus. One such sensor, the Circuit Exploratoire 65 nm (CE-65), and its evolution the CE-65v2, were developed to explore charge collection properties for varying configurations including collection layer process (standard, blanket, modified with gap), pixel pitch (15, 18, \SI{22.5}{\micro\meter}), and pixel geometry (square vs hexagonal/staggered). In this work the characterisation of the CE-65v2 chip, based on $^{55}$Fe lab measurements and test beams at CERN SPS, is presented. Matrix gain uniformity up to the $\mathcal{O}$(5\%) level was demonstrated for all considered chip configurations. The CE-65v2 chip achieves a spatial resolution of under \SI{2}{\micro\meter} during beam tests. Process modifications allowing for faster charge collection and less charge sharing result in decreased spatial resolution, but a considerably wider range of operation, with both the \SI{15}{\micro\meter} and \SI{22.5}{\micro\meter} chips achieving over 99\% efficiency up to a $\sim$180 e$^{-}$ seed threshold. The results serve to validate the 65 nm TPSCo CMOS process, as well as to motivate design choices in future particle detection experiments., Comment: 7 pages, 12 figures; Proceedings for iWoRiD 2024 (Lisbon)

Few people use the probability theory in order to achieve image segmentation with snake models. In this article, we are presenting an active contour algorithm based on a probability approach inspired by A. Blake work and P. R{\'e}fr{\'e}gier's team research in France. Our algorithm, both very fast and highly accurate as far as contour description is concerned, is easily adaptable to any specific application.

A novel approach is presented in this paper to improve images which are altered by atmospheric turbulence. Two new algorithms are presented based on two combinations of a blind deconvolution block, an elastic registration block and a temporal filter block. The algorithms are tested on real images acquired in the desert in New Mexico by the NATO RTG40 group.

This paper deals with the problem of infrared image database generation for ATR assessment purposes. Huge databases are required to have quantitative and objective performance evaluations. We propose a method which superimpose targets and occultants on background under image quality metrics constraints to generate realistic images. We also propose a method to generate target signatures with intrinsic thermal variability based on 3D models plated with real infrared textures., Comment: arXiv admin note: substantial text overlap with arXiv:2411.06695

In this communication, we propose a method which permits to simulate images of targets in infrared imagery by superimposition of vehicle signatures in background, eventually with occultants. We develop a principle which authorizes us to generate different thermal configurations of target signatures. This method enables us to easily generate huge datasets for ATR algorithms performance evaluation., Comment: in French language, GRETSI Symposium on Signal and Image Processing, Dijon, France, September 2009

These last years, algorithms allowing to decompose an image into its structures and textures components have emerged. In this paper, we present an application of this type of decomposition to the problem road network detection in aerial or satelite imagery. The algorithmic procedure involves the image decomposition (using a unique property), an alignment detection step based on the Gestalt theory, and a refinement step using statistical active contours., Comment: in French language

These last few years, image decomposition algorithms have been proposed to split an image into two parts: the structures and the textures. These algorithms are not adapted to the case of noisy images because the textures are corrupted by noise. In this paper, we propose a new model which decomposes an image into three parts (structures, textures and noise) based on a local regularization scheme. We compare our results with the recent work of Aujol and Chambolle. We finish by giving another model which combines the advantages of the two previous ones., Comment: arXiv admin note: text overlap with arXiv:2411.05265

This paper deals with two fields related to active imaging system. First, we begin to explore image processing algorithms to restore the artefacts like speckle, scintillation and image dancing caused by atmospheric turbulence. Next, we examine how to evaluate the performance of this kind of systems. To do this task, we propose a modified version of the german TRM3 metric which permits to get MTF-like measures. We use the database acquired during NATO-TG40 field trials to make our tests.

We demonstrate a quantum walk comb in synthetic frequency space formed by externally modulating a semiconductor optical amplifier operating in the telecommunication wavelength range in a unidirectional ring cavity. The ultrafast gain saturation dynamics of the gain medium and its operation at high current injections is responsible for the stabilization of the comb in a broad frequency modulated state. Our device produces a nearly flat broadband comb with a tunable repetition frequency reaching a bandwidth of 1.8THz at the fundamental repetition rate of 1GHz while remaining fully locked to the RF drive. Comb operation at harmonics of the repetition rate up to 14.1GHz is also demonstrated. This approach paves the way for next-generation optical frequency comb devices with potential applications in precision ranging and high-speed communications.

In this communication, we deal with the question of automatic target detection, recognition and tracking (ATD/R/T) algorithms performance assessment. We propose a complete methodology of evaluation which approaches objective image datasets development and adapted metrics definition for the different tasks (detection, recognition and tracking). We present some performance results which are currently processed in a French-MoD program called 2ACI (``Acquisition Automatique de Cibles par Imagerie``).

In this paper, we propose to improve image decomposition algorithms in the case of noisy images. In \cite{gilles1,aujoluvw}, the authors propose to separate structures, textures and noise from an image. Unfortunately, the use of separable wavelets shows some artefacts. In this paper, we propose to replace the wavelet transform by the contourlet transform which better approximate geometry in images. For that, we define contourlet spaces and their associated norms. Then, we get an iterative algorithm which we test on two noisy textured images., Comment: in French language, GRETSI Symposium on Signal and Image Processing, Dijon, France, September 2009

Detecting and tracking emerging trends and weak signals in large, evolving text corpora is vital for applications such as monitoring scientific literature, managing brand reputation, surveilling critical infrastructure and more generally to any kind of text-based event detection. Existing solutions often fail to capture the nuanced context or dynamically track evolving patterns over time. BERTrend, a novel method, addresses these limitations using neural topic modeling in an online setting. It introduces a new metric to quantify topic popularity over time by considering both the number of documents and update frequency. This metric classifies topics as noise, weak, or strong signals, flagging emerging, rapidly growing topics for further investigation. Experimentation on two large real-world datasets demonstrates BERTrend's ability to accurately detect and track meaningful weak signals while filtering out noise, offering a comprehensive solution for monitoring emerging trends in large-scale, evolving text corpora. The method can also be used for retrospective analysis of past events. In addition, the use of Large Language Models together with BERTrend offers efficient means for the interpretability of trends of events., Comment: 17 pages, 12 figures, FuturED 2024: Workshop on Future of Event Detection (CoLocated with EMNLP 2024)

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

In general, it is challenging to release differentially private versions of survey-weighted statistics with low error for acceptable privacy loss. This is because weighted statistics from complex sample survey data can be more sensitive to individual survey response and weight values than unweighted statistics, resulting in differentially private mechanisms that can add substantial noise to the unbiased estimate of the finite population quantity. On the other hand, simply disregarding the survey weights adds noise to a biased estimator, which also can result in an inaccurate estimate. Thus, the problem of releasing an accurate survey-weighted estimate essentially involves a trade-off among bias, precision, and privacy. We leverage this trade-off to develop a differentially private method for estimating finite population quantities. The key step is to privately estimate a hyperparameter that determines how much to regularize or shrink survey weights as a function of privacy loss. We illustrate the differentially private finite population estimation using the Panel Study of Income Dynamics. We show that optimal strategies for releasing DP survey-weighted mean income estimates require orders-of-magnitude less noise than naively using the original survey weights without modification., Comment: 28 pages, 10 figures, Submitted to HDSR

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.

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.

The need of atmospheric information with a higher spatial and temporal resolution drives the development of small satellites and satellite constellations to complement satellite flagship missions. Since optical systems are a main contributor to the satellite size, these are the prime candidate for their miniaturization. We present here a novel optical system where the complete spectrometer part of the optical system is compressed in one flat optical element. The element consists of an array of photonic crystals which is directly placed on a detector. The photonic crystals act as optical filters with a tunable spectral transmission response. From the integrated optical signals per filter and the atmosphere model, greenhouse gas concentrations are obtained using computational inversion. We present in this article the instrument concept, the manufacturing and measurement of the photonic crystals, methods for the filter array optimization, and discuss the predicted retrieval performance for the detection of methane and carbon dioxide., Comment: ICSO 2024

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 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.

Continuous cough monitors can greatly aid doctors in home monitoring and treatment of respiratory diseases. Although many algorithms have been proposed, they still face limitations in data privacy and short-term monitoring. Edge-AI offers a promising solution by processing privacy-sensitive data near the source, but challenges arise in deploying resource-intensive algorithms on constrained devices. From a suitable selection of audio and kinematic signals, our methodology aims at the optimal selection of features via Recursive Feature Elimination with Cross-Validation (RFECV), which exploits the explainability of the selected XGB model. Additionally, it analyzes the use of Mel spectrogram features, instead of the more common MFCC. Moreover, a set of hyperparameters for a multimodal implementation of the classifier is explored. Finally, it evaluates the performance based on clinically relevant event-based metrics. We apply our methodology to develop Cough-E, an energy-efficient, multimodal and edge AI cough detection algorithm. It exploits audio and kinematic data in two distinct classifiers, jointly cooperating for a balanced energy and performance trade-off. We demonstrate that our algorithm can be executed in real-time on an ARM Cortex M33 microcontroller. Cough-E achieves a 70.56\% energy saving when compared to the audio-only approach, at the cost of a 1.26\% relative performance drop, resulting in a 0.78 F1-score. Both Cough-E and the edge-aware model optimization methodology are publicly available as open-source code. This approach demonstrates the benefits of the proposed hardware-aware methodology to enable privacy-preserving cough monitors on the edge, paving the way to efficient cough monitoring., Comment: 14 pages, 10 figures

T2K is a long baseline neutrino experiment, entering Phase II with a Near Detector upgrade. The T2K near detector (ND280) upgrade consists of the installation of three new detector systems: a plastic scintillator neutrino active target (Super-FGD), two time projection chambers (HA-TPC) and a time of flight detector (TOF). The Super-FGD is composed of 2-million 1 cm-cube scintillating cubes read by almost 60 thousand wavelength-shifting (WLS) fibers coupled to an MPPC on one end. Given the large number of channels, the limited space inside magnetic environment, and the limited time from production to installation, the development and testing of the Front-end electronics boards (FEB) for the read-out of the Super-FGD channels represented a challenging task for the success of the upgrade. This work presents the performance tests confirming that the FEB aligns with detector requirements, and the hardware qualification of 240 FEBs through a custom QC test bench designed to detect and locate hardware failures to speed up the repairing process. Installation of the electronics in the detector took place in March 2024, one year after the beginning of the FEB mass production, and the first successful neutrino beam run took place in June of the same year., Comment: Topical Workshop on Electronics for Particle Physics - TWEPP 2024 - 30 September - 4 October, 2024 - Glasgow, Scotland

Radio propagation modeling is essential in telecommunication research, as radio channels result from complex interactions with environmental objects. Recently, Machine Learning has been attracting attention as a potential alternative to computationally demanding tools, like Ray Tracing, which can model these interactions in detail. However, existing Machine Learning approaches often attempt to learn directly specific channel characteristics, such as the coverage map, making them highly specific to the frequency and material properties and unable to fully capture the underlying propagation mechanisms. Hence, Ray Tracing, particularly the Point-to-Point variant, remains popular to accurately identify all possible paths between transmitter and receiver nodes. Still, path identification is computationally intensive because the number of paths to be tested grows exponentially while only a small fraction is valid. In this paper, we propose a Machine Learning-aided Ray Tracing approach to efficiently sample potential ray paths, significantly reducing the computational load while maintaining high accuracy. Our model dynamically learns to prioritize potentially valid paths among all possible paths and scales linearly with scene complexity. Unlike recent alternatives, our approach is invariant with translation, scaling, or rotation of the geometry, and avoids dependency on specific environment characteristics., Comment: 6 pages, 6 figures, submitted to IEEE ICMLCN 2025

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.

The advent of next-generation radio interferometers like the Square Kilometer Array promises to revolutionise our radio astronomy observational capabilities. The unprecedented volume of data these devices generate requires fast and accurate image reconstruction algorithms to solve the ill-posed radio interferometric imaging problem. Most state-of-the-art reconstruction methods lack trustworthy and scalable uncertainty quantification, which is critical for the rigorous scientific interpretation of radio observations. We propose an unsupervised technique based on a conformalized version of a radio-augmented equivariant bootstrapping method, which allows us to quantify uncertainties for fast reconstruction methods. Noticeably, we rely on reconstructions from ultra-fast unrolled algorithms. The proposed method brings more reliable uncertainty estimations to our problem than existing alternatives., Comment: 14 pages, 7 figures. Accepted at the Machine Learning and the Physical Sciences Workshop, NeurIPS 2024

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.

This work investigates the political biases and personality traits of ChatGPT, specifically comparing GPT-3.5 to GPT-4. In addition, the ability of the models to emulate political viewpoints (e.g., liberal or conservative positions) is analyzed. The Political Compass Test and the Big Five Personality Test were employed 100 times for each scenario, providing statistically significant results and an insight into the results correlations. The responses were analyzed by computing averages, standard deviations, and performing significance tests to investigate differences between GPT-3.5 and GPT-4. Correlations were found for traits that have been shown to be interdependent in human studies. Both models showed a progressive and libertarian political bias, with GPT-4's biases being slightly, but negligibly, less pronounced. Specifically, on the Political Compass, GPT-3.5 scored -6.59 on the economic axis and -6.07 on the social axis, whereas GPT-4 scored -5.40 and -4.73. In contrast to GPT-3.5, GPT-4 showed a remarkable capacity to emulate assigned political viewpoints, accurately reflecting the assigned quadrant (libertarian-left, libertarian-right, authoritarian-left, authoritarian-right) in all four tested instances. On the Big Five Personality Test, GPT-3.5 showed highly pronounced Openness and Agreeableness traits (O: 85.9%, A: 84.6%). Such pronounced traits correlate with libertarian views in human studies. While GPT-4 overall exhibited less pronounced Big Five personality traits, it did show a notably higher Neuroticism score. Assigned political orientations influenced Openness, Agreeableness, and Conscientiousness, again reflecting interdependencies observed in human studies. Finally, we observed that test sequencing affected ChatGPT's responses and the observed correlations, indicating a form of contextual memory.

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.

Over the past decade, several millimeter interferometer programs have mapped the nearby star-forming galaxy M51 at a spatial resolution of ${\le}170$ pc. This study combines observations from three major programs: the PdBI Arcsecond Whirlpool Survey (PAWS), the SMA M51 large program (SMA-PAWS), and the Surveying the Whirlpool at Arcseconds with NOEMA (SWAN). The dataset includes the (1-0) and (2-1) rotational transitions of $^{12}$CO, $^{13}$CO, and C$^{18}$O isotopologues. The observations cover the $r{<}\rm 3\,kpc$ region including center and part of the disk, thereby ensuring strong detections of the weaker $^{13}$CO and C$^{18}$O lines. All observations are convolved in this analysis to an angular resolution of 4$''$, corresponding to a physical scale of ${\sim}$170 pc. We investigate empirical line ratio relations and quantitatively evaluate molecular gas conditions such as temperature, density, and the CO-to-H$_2$ conversion factor ($\alpha_{\rm CO}$). We employ two approaches to study the molecular gas conditions: (i) assuming local thermal equilibrium (LTE) to analytically determine the CO column density and $\alpha_{\rm CO}$, and (ii) using non-LTE modeling with RADEX to fit physical conditions to observed CO isotopologue intensities. We find that the $\alpha_{\rm CO}$ values {in the center and along the inner spiral arm} are $\sim$0.5 dex (LTE) and ${\sim}$0.1 dex (non-LTE) below the Milky Way inner disk value. The average non-LTE $\alpha_{\rm CO}$ is $2.4{\pm}0.5$ M$_\odot$ pc$^{-2}$ (K km s$^{-1}$)$^{-1}$. While both methods show dispersion due to underlying assumptions, the scatter is larger for LTE-derived values. This study underscores the necessity for robust CO line modeling to accurately constrain the molecular ISM's physical and chemical conditions in nearby galaxies., Comment: accepted for publication in AJ; 31 pages, 16 figures, 7 tables

We present skwdro, a Python library for training robust machine learning models. The library is based on distributionally robust optimization using optimal transport distances. For ease of use, it features both scikit-learn compatible estimators for popular objectives, as well as a wrapper for PyTorch modules, enabling researchers and practitioners to use it in a wide range of models with minimal code changes. Its implementation relies on an entropic smoothing of the original robust objective in order to ensure maximal model flexibility. The library is available at https://github.com/iutzeler/skwdro, Comment: 6 pages 1 figure

Laser-Wakefield Accelerators (LWFA) running at kHz repetition rates hold great potential for applications. They typically operate with low-energy, highly compressed laser pulses focused in high-pressure gas targets. Experiments have shown that the best-quality electron beams are achieved using Hydrogen gas targets. However, continuous operation with Hydrogen requires a dedicated pumping system. In this work, we present a method for designing a differential pumping system, which we successfully implemented in our experiments. This enabled the first demonstration of continuous operation of a kHz LWFA using a high-pressure Hydrogen gas jet. The system effectively maintained a pressure below 3e-4 mbar, even with a free-flowing gas jet operating at 140 bar backing pressure. Numerical fluid dynamics and optical simulations were used to guide and validate the system's design., Comment: 10 pages, 9 figures

We miniaturize a vertically-coupled in-plane whispering gallery mode cavity incorporating a quantum cascade gain medium, aiming to realize the mid-infrared counterpart to the vertical cavity surface emitting laser (VCSEL). Building on previous work with linear microcavities, we introduce a new type of quantum cascade surface emitting laser (QCSEL) by miniaturizing a buried heterostructure ring cavity. At wavelengths of 4.5 ${\mu}$m and 8 ${\mu}$m, we investigate the optical losses for decreasing ring diameters while benchmarking the device performance against linear microcavities. We achieve an equivalent mirror reflectivity of 0.95 and demonstrate lasing with ring diameters as small as 50 ${\mu}$m. Finally, we report a continuous-wave threshold power dissipation of 274mW for a 100 ${\mu}$m diameter ring QCSEL, characterized on wafer level at 20 ${^\circ}$C.

Lagrangian descriptors (LDs) based on the arc length of orbits previously demonstrated their utility in delineating structures governing the dynamics. Recently, a chaos indicator based on the second derivatives of the LDs, referred to as $\vert\vert \Delta \rm{LD} \vert\vert$, has been introduced to distinguish regular and chaotic trajectories. Thus far, the derivatives are numerically approximated using finite differences on fine meshes of initial conditions. In this paper, we instead use the differential algebra (DA) framework as a form of automatic differentiation to introduce and compute $\vert\vert \Delta \rm{LD} \vert\vert$ up to machine precision. We discuss and exemplify benefits of this framework, such as the determination of reliable thresholds to distinguish ordered from chaotic trajectories. Our extensive parametric study quantitatively assesses the accuracy and sensitivity of both the finite differences and differential arithmetic approaches by focusing on paradigmatic discrete models of Hamiltonian chaos, namely the Chirikov's standard map and coupled $4$-dimensional variants. Our results demonstrate that finite difference techniques for $\vert\vert \Delta \rm{LD} \vert\vert$ might lead to significant misclassification rate, up to $20\%$ when the phase space supports thin resonant webs, due to the difficulty to determine appropriate thresholds. On the contrary, $\vert\vert \Delta \rm{LD} \vert\vert$ computed through DA arithmetic leads to clear bimodal distributions which in turn lead to robust thresholds. As a consequence, the DA framework reveals as sensitive as established first order tangent map based indicators, independently of the underlying dynamical regime. Finally, the benefits of the DA framework are also highlighted for non-uniform depleted meshes of initial conditions., Comment: Submitted to PhysicaD. 22 pages, 11 figures. Comments and feedback are welcome

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.