Search

CHANCES, the CHileAN Cluster galaxy Evolution Survey, will study the evolution of galaxies in and around ${\sim}$150 massive galaxy clusters, from the local universe out to z=0.45. CHANCES will use the new 4MOST Spectroscopic Survey Facility on the VISTA 4m telescope to obtain spectra for ${\sim}$500,000 galaxies with magnitudes $r_\mathrm{AB} < 20.5$, providing comprehensive spectroscopic coverage of each cluster out to $5r_{200}$. Its wide and deep scope will trace massive and dwarf galaxies from the surrounding filaments and groups to the cores of galaxy clusters, enabling the study of galaxy pre-processing and the role of the evolving environment on galaxy evolution. In this paper we present and characterize the sample of clusters and superclusters to be targeted by CHANCES. We used literature catalogues based on X-ray emission and Sunyaev-Zel'dovich effect to define the cluster sample in a homogeneous way, with attention to cluster mass and redshift, as well as the availability of ancillary data. We calibrated literature mass estimates from various surveys against each other and provide an initial mass estimate for each cluster, which we used to define the radial extent of the 4MOST coverage. We also present an initial assessment of the structure surrounding these clusters based on the redMaPPer red-sequence algorithm as a preview of some of the science CHANCES will enable., Comment: 11 pages, 9 figures, plus references and appendix containing catalog tables, submitted to A&A

The rapid evolution of deep learning and its integration with autonomous driving systems have led to substantial advancements in 3D perception using multimodal sensors. Notably, radar sensors show greater robustness compared to cameras and lidar under adverse weather and varying illumination conditions. This study delves into the often-overlooked yet crucial issue of domain shift in 4D radar-based object detection, examining how varying environmental conditions, such as different weather patterns and road types, impact 3D object detection performance. Our findings highlight distinct domain shifts across various weather scenarios, revealing unique dataset sensitivities that underscore the critical role of radar point cloud generation. Additionally, we demonstrate that transitioning between different road types, especially from highways to urban settings, introduces notable domain shifts, emphasizing the necessity for diverse data collection across varied road environments. To the best of our knowledge, this is the first comprehensive analysis of domain shift effects on 4D radar-based object detection. We believe this empirical study contributes to understanding the complex nature of domain shifts in radar data and suggests paths forward for data collection strategy in the face of environmental variability., Comment: 6 pages, 5 figures, 3 tables, accepted in IEEE International Conference on Intelligent Transportation Systems (ITSC) 2024

The Southern Photometric Local Universe Survey (S-PLUS) is a project to map $\sim9300$ sq deg of the sky using twelve bands (seven narrow and five broadbands). Observations are performed with the T80-South telescope, a robotic telescope located at the Cerro Tololo Observatory in Chile. The survey footprint consists of several large contiguous areas, including fields at high and low galactic latitudes, and towards the Magellanic Clouds. S-PLUS uses fixed exposure times to reach point source depths of about $21$ mag in the $griz$ and $20$ mag in the $u$ and the narrow filters. This paper describes the S-PLUS Data Release 4 (DR4), which includes calibrated images and derived catalogues for over 3000 sq deg, covering the aforementioned area. The catalogues provide multi-band photometry performed with the tools \texttt{DoPHOT} and \texttt{SExtractor} -- point spread function (\PSF) and aperture photometry, respectively. In addition to the characterization, we also present the scientific potential of the data. We use statistical tools to present and compare the photometry obtained through different methods. Overall we find good agreement between the different methods, with a slight systematic offset of 0.05\,mag between our \PSF and aperture photometry. We show that the astrometry accuracy is equivalent to that obtained in previous S-PLUS data releases, even in very crowded fields where photometric extraction is challenging. The depths of main survey (MS) photometry for a minimum signal-to-noise ratio $S/N = 3$ reach from $\sim19.5$ for the bluer bands to $\sim21.5$ mag on the red. The range of magnitudes over which accurate \PSF photometry is obtained is shallower, reaching $\sim19$ to $\sim20.5$ mag depending on the filter. Based on these photometric data, we provide star-galaxy-quasar classification and photometric redshift for millions of objects., Comment: 26 pages, 17 figures, 14 tables, accepted for A&A

The scope of this article includes the three preeminent descriptions of concentrated liquidity from Bancor (2020 and 2022), and Uniswap (2021), as well as three additional descriptions informed by trigonometric analysis of the same. The purpose of this contribution is to organize the seminal and derivative forms of this cornerstone DeFi technology, and algebraically and geometrically elaborate these descriptions to achieve an authoritative and near-exhaustive overview of the underlying theory powering the current state-of-the-art in decentralized exchange infrastructure. This material was created for the Token Engineering Academy Study Season 2024, a cohort-based online program scheduled for April-July 2024. The Study Season offers access to a bachelor-level online learning program, and complementary live tracks with the most influential practitioners and researchers in the sector - all provided as free, public goods., Comment: 85 pages, 346 equations, 55 figures, 1 table

Self-supervised monocular depth estimation methods aim to be used in critical applications such as autonomous vehicles for environment analysis. To circumvent the potential imperfections of these approaches, a quantification of the prediction confidence is crucial to guide decision-making systems that rely on depth estimation. In this paper, we propose MonoProb, a new unsupervised monocular depth estimation method that returns an interpretable uncertainty, which means that the uncertainty reflects the expected error of the network in its depth predictions. We rethink the stereo or the structure-from-motion paradigms used to train unsupervised monocular depth models as a probabilistic problem. Within a single forward pass inference, this model provides a depth prediction and a measure of its confidence, without increasing the inference time. We then improve the performance on depth and uncertainty with a novel self-distillation loss for which a student is supervised by a pseudo ground truth that is a probability distribution on depth output by a teacher. To quantify the performance of our models we design new metrics that, unlike traditional ones, measure the absolute performance of uncertainty predictions. Our experiments highlight enhancements achieved by our method on standard depth and uncertainty metrics as well as on our tailored metrics. https://github.com/CEA-LIST/MonoProb, Comment: Accepted at WACV 2024

For specialized and dense downstream tasks such as object detection, labeling data requires expertise and can be very expensive, making few-shot and semi-supervised models much more attractive alternatives. While in the few-shot setup we observe that transformer-based object detectors perform better than convolution-based two-stage models for a similar amount of parameters, they are not as effective when used with recent approaches in the semi-supervised setting. In this paper, we propose a semi-supervised method tailored for the current state-of-the-art object detector Deformable DETR in the few-annotation learning setup using a student-teacher architecture, which avoids relying on a sensitive post-processing of the pseudo-labels generated by the teacher model. We evaluate our method on the semi-supervised object detection benchmarks COCO and Pascal VOC, and it outperforms previous methods, especially when annotations are scarce. We believe that our contributions open new possibilities to adapt similar object detection methods in this setup as well., Comment: Published at WACV 2023

The use of pretrained deep neural networks represents an attractive way to achieve strong results with few data available. When specialized in dense problems such as object detection, learning local rather than global information in images has proven to be more efficient. However, for unsupervised pretraining, the popular contrastive learning requires a large batch size and, therefore, a lot of resources. To address this problem, we are interested in transformer-based object detectors that have recently gained traction in the community with good performance and with the particularity of generating many diverse object proposals. In this work, we present Proposal Selection Contrast (ProSeCo), a novel unsupervised overall pretraining approach that leverages this property. ProSeCo uses the large number of object proposals generated by the detector for contrastive learning, which allows the use of a smaller batch size, combined with object-level features to learn local information in the images. To improve the effectiveness of the contrastive loss, we introduce the object location information in the selection of positive examples to take into account multiple overlapping object proposals. When reusing pretrained backbone, we advocate for consistency in learning local information between the backbone and the detection head. We show that our method outperforms state of the art in unsupervised pretraining for object detection on standard and novel benchmarks in learning with fewer data., Comment: Published as a conference paper at ICLR 2023

In recent years, depth sensors have become more and more affordable and have found their way into a growing amount of robotic systems. However, mono- or multi-modal sensor registration, often a necessary step for further processing, faces many challenges on raw depth images or point clouds. This paper presents a method of converting depth data into images capable of visualizing spatial details that are basically hidden in traditional depth images. After noise removal, a neighborhood of points forms two normal vectors whose difference is encoded into this new conversion. Compared to Bearing Angle images, our method yields brighter, higher-contrast images with more visible contours and more details. We tested feature-based pose estimation of both conversions in a visual odometry task and RGB-D SLAM. For all tested features, AKAZE, ORB, SIFT, and SURF, our new Flexion images yield better results than Bearing Angle images and show great potential to bridge the gap between depth data and classical computer vision. Source code is available here: https://rlsch.github.io/depth-flexion-conversion., Comment: to be published in IROS 2023 conference proceedings

Secure software engineering is crucial but can be time-consuming; therefore, methods that could expedite the identification of software weaknesses without reducing the process efficacy would benefit the software engineering industry and thus benefit modern life. This research focuses on finding an efficient machine learning algorithm to identify software weaknesses from requirement specifications. The research uses the CWE repository and PROMISE exp dataset for training. Keywords extracted using latent semantic analysis help map the CWE categories to PROMISE_exp. Naive Bayes, support vector machine (SVM), decision trees, neural network, and convolutional neural network (CNN) algorithms were tested, with SVM and neural network producing reliable results. The research is unique contribution lies in the mapping technique and algorithm selection. It serves as a valuable reference for the secure software engineering community seeking to expedite the development lifecycle without compromising efficacy. Future work involves testing more algorithms, optimizing existing ones, and improving the training sets accuracy.

We present numerous natural algebraic examples without the so-called Canonical Base Property (CBP). We prove that every commutative unitary ring of finite Morley rank without finite-index proper ideals satisfies the CBP if and only if it is a field, a ring of positive characteristic or a finite direct product of these. In addition, we also construct a CM-trivial commutative local ring with a finite residue field without the CBP. Furthermore, we also show that finite-dimensional non-associative algebras over an algebraically closed field of characteristic $0$ give rise to triangular rings without the CBP. This also applies to Baudisch's $2$-step nilpotent Lie algebras, which yields the existence of a $2$-step nilpotent group of finite Morley rank whose theory, in the pure language of groups, is CM-trivial and does not satisfy the CBP.

Automated Market Makers (AMMs) are a class of smart contracts on Ethereum and other blockchains that "make markets" autonomously. In other words, AMMs stand ready to trade with other market participants that interact with them, at the conditions determined by the AMM. In this this paper, which relies on the existing and growing corpus of literature available, we review and present the key mathematical and quantitative finance aspects that underpin their operations, including the interesting relationship between AMMs and derivatives pricing and hedging.

Abnormal event detection in videos is a challenging problem, partly due to the multiplicity of abnormal patterns and the lack of their corresponding annotations. In this paper, we propose new constrained pretext tasks to learn object level normality patterns. Our approach consists in learning a mapping between down-scaled visual queries and their corresponding normal appearance and motion characteristics at the original resolution. The proposed tasks are more challenging than reconstruction and future frame prediction tasks which are widely used in the literature, since our model learns to jointly predict spatial and temporal features rather than reconstructing them. We believe that more constrained pretext tasks induce a better learning of normality patterns. Experiments on several benchmark datasets demonstrate the effectiveness of our approach to localize and track anomalies as it outperforms or reaches the current state-of-the-art on spatio-temporal evaluation metrics., Comment: Accepted at the 18th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS), 2022

This paper addresses video anomaly detection problem for videosurveillance. Due to the inherent rarity and heterogeneity of abnormal events, the problem is viewed as a normality modeling strategy, in which our model learns object-centric normal patterns without seeing anomalous samples during training. The main contributions consist in coupling pretrained object-level action features prototypes with a cosine distance-based anomaly estimation function, therefore extending previous methods by introducing additional constraints to the mainstream reconstruction-based strategy. Our framework leverages both appearance and motion information to learn object-level behavior and captures prototypical patterns within a memory module. Experiments on several well-known datasets demonstrate the effectiveness of our method as it outperforms current state-of-the-art on most relevant spatio-temporal evaluation metrics., Comment: Accepted at ICIP 2022

In video surveillance applications, person search is a challenging task consisting in detecting people and extracting features from their silhouette for re-identification (re-ID) purpose. We propose a new end-to-end model that jointly computes detection and feature extraction steps through a single deep Convolutional Neural Network architecture. Sharing feature maps between the two tasks for jointly describing people commonalities and specificities allows faster runtime, which is valuable in real-world applications. In addition to reaching state-of-the-art accuracy, this multi-task model can be sequentially trained task-by-task, which results in a broader acceptance of input dataset types. Indeed, we show that aggregating more pedestrian detection datasets without costly identity annotations makes the shared feature maps more generic, and improves re-ID precision. Moreover, these boosted shared feature maps result in re-ID features more robust to a cross-dataset scenario., Comment: 5 pages

Several computer vision applications such as person search or online fashion rely on human description. The use of instance-level human parsing (HP) is therefore relevant since it localizes semantic attributes and body parts within a person. But how to characterize these attributes? To our knowledge, only some single-HP datasets describe attributes with some color, size and/or pattern characteristics. There is a lack of dataset for multi-HP in the wild with such characteristics. In this article, we propose the dataset CCIHP based on the multi-HP dataset CIHP, with 20 new labels covering these 3 kinds of characteristics. In addition, we propose HPTR, a new bottom-up multi-task method based on transformers as a fast and scalable baseline. It is the fastest method of multi-HP state of the art while having precision comparable to the most precise bottom-up method. We hope this will encourage research for fast and accurate methods of precise human descriptions., Comment: 5 pages

The use of pseudo-labels prevails in order to tackle Unsupervised Domain Adaptive (UDA) Re-Identification (re-ID) with the best performance. Indeed, this family of approaches has given rise to several UDA re-ID specific frameworks, which are effective. In these works, research directions to improve Pseudo-Labeling UDA re-ID performance are varied and mostly based on intuition and experiments: refining pseudo-labels, reducing the impact of errors in pseudo-labels... It can be hard to deduce from them general good practices, which can be implemented in any Pseudo-Labeling method, to consistently improve its performance. To address this key question, a new theoretical view on Pseudo-Labeling UDA re-ID is proposed. The contributions are threefold: (i) A novel theoretical framework for Pseudo-Labeling UDA re-ID, formalized through a new general learning upper-bound on the UDA re-ID performance. (ii) General good practices for Pseudo-Labeling, directly deduced from the interpretation of the proposed theoretical framework, in order to improve the target re-ID performance. (iii) Extensive experiments on challenging person and vehicle cross-dataset re-ID tasks, showing consistent performance improvements for various state-of-the-art methods and various proposed implementations of good practices., Comment: This paper is a preprint under submission at CVIU for review

Motivation: We consider continuous-time Markov chains that describe the stochastic evolution of a dynamical system by a transition-rate matrix $Q$ which depends on a parameter $\theta$. Computing the probability distribution over states at time $t$ requires the matrix exponential $\exp(tQ)$, and inferring $\theta$ from data requires its derivative $\partial\exp\!(tQ)/\partial\theta$. Both are challenging to compute when the state space and hence the size of $Q$ is huge. This can happen when the state space consists of all combinations of the values of several interacting discrete variables. Often it is even impossible to store $Q$. However, when $Q$ can be written as a sum of tensor products, computing $\exp(tQ)$ becomes feasible by the uniformization method, which does not require explicit storage of $Q$. Results: Here we provide an analogous algorithm for computing $\partial\exp\!(tQ)/\partial\theta$, the differentiated uniformization method. We demonstrate our algorithm for the stochastic SIR model of epidemic spread, for which we show that $Q$ can be written as a sum of tensor products. We estimate monthly infection and recovery rates during the first wave of the COVID-19 pandemic in Austria and quantify their uncertainty in a full Bayesian analysis. Availability: Implementation and data are available at https://github.com/spang-lab/TenSIR.

AMMs are autonomous smart contracts deployed on a blockchain that make markets between different assets that live on that chain. In this paper we are examining a specific class of AMMs called Constant Function Market Makers whose trading profile, ignoring fees, is determined by their bonding curve. This class of AMM suffers from what is commonly referred to as Impermanent Loss, which we have previously identified as the Gamma component of the associated self-financing trading strategy and which is the risk that LP providers wager against potential fee earnings. The recent Uniswap v3 release has popularized the concept of leveraged liquidity provision - wherein the trading range in which liquidity is provided is reduced and achieves a higher degree of capital efficiency through elimination of unused collateral. This leverage increases the fees earned, but it also increases the risk taken, ie the IL. Fee levels on Uniswap v3 are well publicized so, in this paper, we focus on calculating the IL. We found that for the 17 pools we analyzed, covering 43% of TVL and chosen by size, composite tokens and data availability, total fees earned since inception until the cut-off date was $199.3m. We also found that the total IL suffered by LPs during this period was USD 260.1m, meaning that in aggregate those LPs would have been better off by USD 60.8m had they simply HODLd.

Unsupervised Domain Adaptation (UDA) for re-identification (re-ID) is a challenging task: to avoid a costly annotation of additional data, it aims at transferring knowledge from a domain with annotated data to a domain of interest with only unlabeled data. Pseudo-labeling approaches have proven to be effective for UDA re-ID. However, the effectiveness of these approaches heavily depends on the choice of some hyperparameters (HP) that affect the generation of pseudo-labels by clustering. The lack of annotation in the domain of interest makes this choice non-trivial. Current approaches simply reuse the same empirical value for all adaptation tasks and regardless of the target data representation that changes through pseudo-labeling training phases. As this simplistic choice may limit their performance, we aim at addressing this issue. We propose new theoretical grounds on HP selection for clustering UDA re-ID as well as method of automatic and cyclic HP tuning for pseudo-labeling UDA clustering: HyPASS. HyPASS consists in incorporating two modules in pseudo-labeling methods: (i) HP selection based on a labeled source validation set and (ii) conditional domain alignment of feature discriminativeness to improve HP selection based on source samples. Experiments on commonly used person re-ID and vehicle re-ID datasets show that our proposed HyPASS consistently improves the best state-of-the-art methods in re-ID compared to the commonly used empirical HP setting., Comment: Preprint version. Accepted in IEEE Access (see IEEE Access for final version)

In this short note, we introduce a generalization of the canonical base property, called transfer of internality on quotients. A structural study of groups definable in theories with this property yields as a consequence infinitely many new uncountably categorical additive covers of the complex numbers without the canonical base property., Comment: Added: Elimination of finite imaginaries in a cover of a group of Lascar rank one yields a connection to the canonical base property

Deep learning classifiers are now known to have flaws in the representations of their class. Adversarial attacks can find a human-imperceptible perturbation for a given image that will mislead a trained model. The most effective methods to defend against such attacks trains on generated adversarial examples to learn their distribution. Previous work aimed to align original and adversarial image representations in the same way as domain adaptation to improve robustness. Yet, they partially align the representations using approaches that do not reflect the geometry of space and distribution. In addition, it is difficult to accurately compare robustness between defended models. Until now, they have been evaluated using a fixed perturbation size. However, defended models may react differently to variations of this perturbation size. In this paper, the analogy of domain adaptation is taken a step further by exploiting optimal transport theory. We propose to use a loss between distributions that faithfully reflect the ground distance. This leads to SAT (Sinkhorn Adversarial Training), a more robust defense against adversarial attacks. Then, we propose to quantify more precisely the robustness of a model to adversarial attacks over a wide range of perturbation sizes using a different metric, the Area Under the Accuracy Curve (AUAC). We perform extensive experiments on both CIFAR-10 and CIFAR-100 datasets and show that our defense is globally more robust than the state-of-the-art., Comment: Accepted at ICPR2020. Code is available at https://github.com/CEA-LIST/adv-sat