Miracle-dz/UniFAR-FTUs huggingface dataset:
Unsupervised Learning of 3D Point Set Registration

Point cloud registration is the process of aligning a pair of point sets via searching for a geometric transformation. Recent works leverage the power of deep learning for registering a pair of point sets. However, unfortunately, deep learning models often require a large number of ground truth labels for training. Moreover, for a pair of source and target point sets, existing deep learning mechanisms require explicitly designed encoders to extract both deep spatial features from unstructured point clouds and their spatial correlation representation, which is further fed to a decoder to regress the desired geometric transformation for point set alignment. To further enhance deep learning models for point set registration, this paper proposes Deep-3DAligner, a novel unsupervised registration framework based on a newly introduced deep Spatial Correlation Representation (SCR) feature. The SCR feature describes the geometric essence of the spatial correlation between source and target point sets in an encoding-free manner. More specifically, our method starts with optimizing a randomly initialized latent SCR feature, which is then decoded to a geometric transformation (i.e., rotation and translation) to align source and target point sets. Our Deep-3DAligner jointly updates the SCR feature and weights of the transformation decoder towards the minimization of an unsupervised alignment loss. We conducted experiments on the ModelNet40 datasets to validate the performance of our unsupervised Deep-3DAligner for point set registration. The results demonstrated that, even without ground truth and any assumption of a direct correspondence between source and target point sets for training, our proposed approach achieved comparative performance compared to most recent supervised state-of-the-art approaches.
JUVENILE HEIGHT GROWTH RATES AND SORTING OF THREE NOTHOFAGUS SPECIES ON AN ALTITUDINAL GRADIENT

Se ha postulado que, si la inversion de las especies arboreas en mecanismos de resistencia al frio es a costa de la tasa de crecimiento, entonces la distribucion de las especies a lo largo de los gradientes latitudinales de temperatura deberia ser determinada por un compromiso entre el crecimiento en altura y la resistencia al frio. Aplicando la misma logica a los gradientes altitudinales, se puede predecir que mientras los limites superiores de las especies seran fijados por su capacidad de resistir el frio, sus limites inferiores en el gradiente seran determinados por la competencia con especies de crecimiento mas rapido. Pusimos a prueba esta idea con un sistema modelo de tres especies de Nothofagus, en un gradiente altitudinal (1100 - 1700 m) cerca de Las Termas de Chillan, en las faldas occidentales de la Cordillera de los Andes. Utilizamos metodos retrospectivos para medir el crecimiento en altura durante la temporada anterior, en arboles juveniles en 12 sitios con condiciones abiertas. De acuerdo a nuestras expectativas, por lo general las tasas de crecimiento en altura disminuyeron con el aumento en altitud. Sin embargo, las relaciones entre altitud y tasa de crecimiento no difirieron estadisticamente entre especies. Dado que las tasas de crecimiento de N. obliqua, resistente al frio, fueron muy similares a las de sus congeneres mas termofilas N. obliqua y N. dombeyi, no se apoyo nuestra prediccion inicial. Por ende, nuestros datos no permiten explicar las causas del limite altitudinal inferior de N. pumilio
Forming an Electoral College for a Graph: a Heuristic Semi-supervised Learning Framework

Recently, graph-based algorithms have drawn much attention because of their impressive success in semi-supervised scenarios. For better model performance, previous studies learn to transform the topology of the input graph. However, these works only focus on optimizing the original nodes and edges, leaving the direction of augmenting existing data unexplored. In this paper, by simulating the generation process of graph signals, we propose a novel heuristic pre-processing technique, namely ELectoral COllege (ELCO), which automatically expands new nodes and edges to refine the label similarity within a dense subgraph. Substantially enlarging the original training set with high-quality generated labeled data, our framework can effectively benefit downstream models. To justify the generality and practicality of ELCO, we couple it with the popular Graph Convolution Network and Graph Attention Network to extensively perform semi-supervised learning evaluations on three standard datasets. In all setups tested, our method boosts the average score of base models by a large margin of 4 points, as well as consistently outperforms the state-of-the-art. Please find our code at this https URL.
Performance in the Courtroom: Automated Processing and Visualization of Appeal Court Decisions in France

Artificial Intelligence techniques are already popular and important in the legal domain. We extract legal indicators from judicial judgment to decrease the asymmetry of information of the legal system and the access-to-justice gap. We use NLP methods to extract interesting entities/data from judgments to construct networks of lawyers and judgments. We propose metrics to rank lawyers based on their experience, wins/loss ratio and their importance in the network of lawyers. We also perform community detection in the network of judgments and propose metrics to represent the difficulty of cases capitalising on communities features.
Stanza: A Nonlinear State Space Model for Probabilistic Inference in Non-Stationary Time Series

Time series with long-term structure arise in a variety of contexts and capturing this temporal structure is a critical challenge in time series analysis for both inference and forecasting settings. Traditionally, state space models have been successful in providing uncertainty estimates of trajectories in the latent space. More recently, deep learning, attention-based approaches have achieved state of the art performance for sequence modeling, though often require large amounts of data and parameters to do so. We propose Stanza, a nonlinear, non-stationary state space model as an intermediate approach to fill the gap between traditional models and modern deep learning approaches for complex time series. Stanza strikes a balance between competitive forecasting accuracy and probabilistic, interpretable inference for highly structured time series. In particular, Stanza achieves forecasting accuracy competitive with deep LSTMs on real-world datasets, especially for multi-step ahead forecasting.
On the Composition of Two Spherical Twists

Segal [17] proved that any autoequivalence of an enhanced triangulated category can be realised as a spherical twist. However, when exhibiting an autoequivalence as a spherical twist one has various choices for the source category of the spherical functor. We describe a construction that realises the composition of two spherical twists as the twist around a single spherical functor whose source category semi-orthogonally decomposes into the source categories for the spherical functors we started with. We give a description of the cotwist for this spherical functor and prove, in the special case when our starting twists are around spherical objects, that the cotwist is the Serre functor (up to a shift). We finish with an explicit treatment for the case of $\mathbb {P}$-objects.
Modeling Human Driving Behavior Through Generative Adversarial Imitation Learning

An open problem in autonomous vehicle safety validation is building reliable models of human driving behavior in simulation. This work presents an approach to learn neural driving policies from real world driving demonstration data. We model human driving as a sequential decision making problem that is characterized by non-linearity and stochasticity, and unknown underlying cost functions. Imitation learning is an approach for generating intelligent behavior when the cost function is unknown or difficult to specify. Building upon work in inverse reinforcement learning (IRL), Generative Adversarial Imitation Learning (GAIL) aims to provide effective imitation even for problems with large or continuous state and action spaces, such as modeling human driving. This article describes the use of GAIL for learning-based driver modeling. Because driver modeling is inherently a multi-agent problem, where the interaction between agents needs to be modeled, this paper describes a parameter-sharing extension of GAIL called PS-GAIL to tackle multi-agent driver modeling. In addition, GAIL is domain agnostic, making it difficult to encode specific knowledge relevant to driving in the learning process. This paper describes Reward Augmented Imitation Learning (RAIL), which modifies the reward signal to provide domain-specific knowledge to the agent. Finally, human demonstrations are dependent upon latent factors that may not be captured by GAIL. This paper describes Burn-InfoGAIL, which allows for disentanglement of latent variability in demonstrations. Imitation learning experiments are performed using NGSIM, a real-world highway driving dataset. Experiments show that these modifications to GAIL can successfully model highway driving behavior, accurately replicating human demonstrations and generating realistic, emergent behavior in the traffic flow arising from the interaction between driving agents.
Protecting Against Image Translation Deepfakes by Leaking Universal Perturbations from Black-Box Neural Networks

In this work, we develop efficient disruptions of black-box image translation deepfake generation systems. We are the first to demonstrate black-box deepfake generation disruption by presenting image translation formulations of attacks initially proposed for classification models. Nevertheless, a naive adaptation of classification black-box attacks results in a prohibitive number of queries for image translation systems in the real-world. We present a frustratingly simple yet highly effective algorithm Leaking Universal Perturbations (LUP), that significantly reduces the number of queries needed to attack an image. LUP consists of two phases: (1) a short leaking phase where we attack the network using traditional black-box attacks and gather information on successful attacks on a small dataset and (2) and an exploitation phase where we leverage said information to subsequently attack the network with improved efficiency. Our attack reduces the total number of queries necessary to attack GANimation and StarGAN by 30%.
Review : The Immediate-Early Gene Response and Neuronal Death and Regeneration

The induction of the cellular immediate-early gene (cIEG) response is the earliest known transcriptional con sequence of neuronal excitation. It is believed that the products of the cIEGs (such as c-fos and c- jun) serve to bring about persistent changes in neuronal phenotype by altering gene expression and modifying signal transduction pathways. This has led, on the one hand, to the burgeoning use of Fos immunohistochemistry as a surrogate form of neuronal activity mapping and, on the other hand, to a quest for the biochemical functions of individual cIEG products in the nervous system. Recent studies of neuronal death and regen eration have contributed substantially to our vision of the molecular and biological characteristics of the cIEG response. Indeed, they have challenged some of its long-held tenets. Therefore, we will use these results to illustrate our most contemporary view of the cIEG response in the nervous system. The Neuroscientist 1:68- 75,1995
DSU-net: Dense SegU-net for automatic head-and-neck tumor segmentation in MR images

Precise and accurate segmentation of the most common head-and-neck tumor, nasopharyngeal carcinoma (NPC), in MRI sheds light on treatment and regulatory decisions making. However, the large variations in the lesion size and shape of NPC, boundary ambiguity, as well as the limited available annotated samples conspire NPC segmentation in MRI towards a challenging task. In this paper, we propose a Dense SegU-net (DSU-net) framework for automatic NPC segmentation in MRI. Our contribution is threefold. First, different from the traditional decoder in U-net using upconvolution for upsamling, we argue that the restoration from low resolution features to high resolution output should be capable of preserving information significant for precise boundary localization. Hence, we use unpooling to unsample and propose SegU-net. Second, to combat the potential vanishing-gradient problem, we introduce dense blocks which can facilitate feature propagation and reuse. Third, using only cross entropy (CE) as loss function may bring about troubles such as miss-prediction, therefore we propose to use a loss function comprised of both CE loss and Dice loss to train the network. Quantitative and qualitative comparisons are carried out extensively on in-house datasets, the experimental results show that our proposed architecture outperforms the existing state-of-the-art segmentation networks.
Autonomous Driving with Deep Learning: A Survey of State-of-Art Technologies

Since DARPA Grand Challenges (rural) in 2004/05 and Urban Challenges in 2007, autonomous driving has been the most active field of AI applications. Almost at the same time, deep learning has made breakthrough by several pioneers, three of them (also called fathers of deep learning), Hinton, Bengio and LeCun, won ACM Turin Award in 2019. This is a survey of autonomous driving technologies with deep learning methods. We investigate the major fields of self-driving systems, such as perception, mapping and localization, prediction, planning and control, simulation, V2X and safety etc. Due to the limited space, we focus the analysis on several key areas, i.e. 2D and 3D object detection in perception, depth estimation from cameras, multiple sensor fusion on the data, feature and task level respectively, behavior modelling and prediction of vehicle driving and pedestrian trajectories.
Fast Coherent Point Drift

Nonrigid point set registration is widely applied in the tasks of computer vision and pattern recognition. Coherent point drift (CPD) is a classical method for nonrigid point set registration. However, to solve spatial transformation functions, CPD has to compute inversion of a M*M matrix per iteration with time complexity O(M3). By introducing a simple corresponding constraint, we develop a fast implementation of CPD. The most advantage of our method is to avoid matrix-inverse operation. Before the iteration begins, our method requires to take eigenvalue decomposition of a M*M matrix once. After iteration begins, our method only needs to update a diagonal matrix with linear computational complexity, and perform matrix multiplication operation with time complexity approximately O(M2) in each iteration. Besides, our method can be further accelerated by the low-rank matrix approximation. Experimental results in 3D point cloud data show that our method can significantly reduce computation burden of the registration process, and keep comparable performance with CPD on accuracy.
Fall Detector Adapted to Nursing Home Needs through an Optical-Flow based CNN

Fall detection in specialized homes for the elderly is challenging. Vision-based fall detection solutions have a significant advantage over sensor-based ones as they do not instrument the resident who can suffer from mental diseases. This work is part of a project intended to deploy fall detection solutions in nursing homes. The proposed solution, based on Deep Learning, is built on a Convolutional Neural Network (CNN) trained to maximize a sensitivity-based metric. This work presents the requirements from the medical side and how it impacts the tuning of a CNN. Results highlight the importance of the temporal aspect of a fall. Therefore, a custom metric adapted to this use case and an implementation of a decision-making process are proposed in order to best meet the medical teams requirements.Clinical relevance This work presents a fall detection solution enabled to detect 86.2% of falls while producing only 11.6% of false alarms in average on the considered databases.
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)

There has been a recent surge of interest in the study of asymptotic reconstruction performance in various cases of generalized linear estimation problems in the teacher-student setting, especially for the case of i.i. d standard normal matrices. Here, we go beyond these matrices, and prove an analytical formula for the reconstruction performance of convex generalized linear models with rotationally-invariant data matrices with arbitrary bounded spectrum, rigorously confirming, under suitable assumptions, a conjecture originally derived using the replica method from statistical physics. The proof is achieved by leveraging on message passing algorithms and the statistical properties of their iterates, allowing to characterize the asymptotic empirical distribution of the estimator. For sufficiently strongly convex problems, we show that the two-layer vector approximate message passing algorithm (2-MLVAMP) converges, where the convergence analysis is done by checking the stability of an equivalent dynamical system, which gives the result for such problems. We then show that, under a concentration assumption, an analytical continuation may be carried out to extend the result to convex (non-strongly) problems. We illustrate our claim with numerical examples on mainstream learning methods such as sparse logistic regression and linear support vector classifiers, showing excellent agreement between moderate size simulation and the asymptotic prediction.
Revolutionizing Future Healthcare using Wireless on the Walls (WoW)

Following the standardization and deployment of fifth generation (5G) network, researchers have shifted their focus to beyond 5G communication. Existing technologies have brought forth a plethora of applications that could not have been imagined in the past years. Beyond 5G will enable us to rethink the capability, it will offer in various sectors including agriculture, search and rescue and more specifically in the delivery of health care services. Unobtrusive and non-invasive measurements using radio frequency (RF) sensing, monitoring and control of wearable medical devices are the areas that would potentially benefit from beyond 5G. Applications such as RF sensing, device charging and remote patient monitoring will be a key challenge using millimetre (mmWave) communication. The mmWaves experience multi-path induced fading, where the rate of attenuation is larger as compared to the microwaves. Eventually, mmWave communication systems would require range extenders and guided surfaces. A proposed solution is the use of intelligent reflective surfaces, which will have the ability to manipulate electromagnetic (EM) signals. These intelligent surfaces mounted and/or coated on walls aka - Intelligent Walls are planar and active surfaces, which will be a key element in beyond 5G and 6G communication. These intelligent walls equipped with machine learning algorithm and computation power would have the ability to manipulate EM waves and act as gateways in the heterogeneous network environment. The article presents the application and vision of intelligent walls for next-generation healthcare in the era of beyond 5G.
Distributed Reinforcement Learning in Multi-Agent Networked Systems

We study distributed reinforcement learning (RL) for a network of agents. The objective is to find localized policies that maximize the (discounted) global reward. In general, scalability is a challenge in this setting because the size of the global state/action space can be exponential in the number of agents. Scalable algorithms are only known in cases where dependencies are local, e.g., between neighbors. In this work, we propose a Scalable Actor Critic framework that applies in settings where the dependencies are non-local and provide a finite-time error bound that shows how the convergence rate depends on the depth of the dependencies in the network. Additionally, as a byproduct of our analysis, we obtain novel finite-time convergence results for a general stochastic approximation scheme and for temporal difference learning with state aggregation that apply beyond the setting of RL in networked systems.
Seasonal patterns of photosynthesis and respiration of red spruce saplings from two elevations in declining southern Appalachian stands.

Exploratory studies were initiated at two high-elevation red spruce (Picearubens Sarg.) stands in the Great Smoky Mountains of western North Carolina to document the magnitude and physiological basis of differences in tree growth at the two sites. Increment core data indicate that conditions have become relatively less favorable for mature trees at the upper site during the past 20 years and that annual height growth of sapling trees has been 40% less at that site compared with a similar site at an elevation 215 m lower. Seasonal measurements of net photosynthesis and dark respiration rates of saplings indicated that differences in sapling growth rates at the upper site were associated with increases in dark respiration and less favorable net photosynthesis:dark respiration ratios. Basal diameter increment was most closely associated with differences in current net photosynthesis rates among trees at the upper site, whereas height and diameter growth of the upper canopy related most closely to the net pho.
Modeling Shared Responses in Neuroimaging Studies through MultiView ICA

Group studies involving large cohorts of subjects are important to draw general conclusions about brain functional organization. However, the aggregation of data coming from multiple subjects is challenging, since it requires accounting for large variability in anatomy, functional topography and stimulus response across individuals. Data modeling is especially hard for ecologically relevant conditions such as movie watching, where the experimental setup does not imply well-defined cognitive operations. We propose a novel MultiView Independent Component Analysis (ICA) model for group studies, where data from each subject are modeled as a linear combination of shared independent sources plus noise. Contrary to most group-ICA procedures, the likelihood of the model is available in closed form. We develop an alternate quasi-Newton method for maximizing the likelihood, which is robust and converges quickly. We demonstrate the usefulness of our approach first on fMRI data, where our model demonstrates improved sensitivity in identifying common sources among subjects. Moreover, the sources recovered by our model exhibit lower between-session variability than other methods.On magnetoencephalography (MEG) data, our method yields more accurate source localization on phantom data. Applied on 200 subjects from the Cam-CAN dataset it reveals a clear sequence of evoked activity in sensor and source space. The code is freely available at this https URL.