Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

54109163217 · Jun 202019922001200920172026
48 results for lane change recognition

This paper compares machine learning methods for recognizing lane change intentions from vehicle trajectories.

problem Accurately detecting and predicting lane change processes in autonomous vehicles.
method Comparison of different machine learning methods on high-dimensional time series data.
result Ensemble methods reduce Type II and Type III classification errors, while LightGBM outperforms XGBoost in training efficiency.

The vision of automated driving is to increase both road safety and efficiency, while offering passengers a convenient travel experience. This requires that autonomous systems correctly estimate the current traffic scene and its likely evolution. In highway scenarios early recognition of cut-in maneuvers is essential f…

2019-07-25abs ↗pdf ↗

Long-term lane change prediction model predicts maneuvers with 75% accuracy.

problem Predicting long-term lane changes for safer autonomous driving.
method Introduced three models: logistic regression, MLP, and RNN. Used NGSIM dataset with new labeling scheme.
result Developed model predicts 75% of lane changes with an average advanced time of 8.05 seconds.

We derive a monotonicity formula and classify finite Morse index solutions (positive or sign-changing, radial or not) to the following triharmonic Lane-Emden equation: \begin{equation}\nonumber (-Δ)^3 u=|u|^{p-1}u \hbox{ in } \mathbb{R}^n, \end{equation} where pp is below the Joseph-Lundgren exponent. As a byproduct w…

2016-07-16abs ↗pdf ↗

Adaptive framework generates challenging adversarial scenarios for autonomous vehicles.

problem Lack of efficient and adaptable evaluation methods for autonomous vehicles.
method Adaptive evaluation framework using ensemble models and nonparametric Bayesian clustering.
result Adversarial scenarios significantly degrade tested autonomous vehicles' performance.

Paper presents a self-supervised method to infer road lane networks.

problem Difficult and costly to create lane maps for autonomous vehicles.
method Self-supervised learning using neural and search-based model.
result Model can generalize to new road layouts, unlike previous approaches.

Detecting the intention of drivers is an essential task in self-driving, necessary to anticipate sudden events like lane changes and stops. Turn signals and emergency flashers communicate such intentions, providing seconds of potentially critical reaction time. In this paper, we propose to detect these signals in video…

2019-05-03abs ↗pdf ↗

This paper improves anomaly detection in lane rendering images for safer navigation.

problem Anomalies in lane rendering images can mislead drivers, posing safety risks.
method Proposes a four-phase pipeline using Transformer models, self-supervised pre-training, and fine-tuning.
result The pipeline enhances detection accuracy and reduces training time.

Study on radial solutions of Lane-Emden system on Cartan-Hadamard manifolds.

problem Existence and qualitative properties of radial solutions on Cartan-Hadamard manifolds.
method Analytical and asymptotic analysis of radial solutions, focusing on critical and supercritical exponents.
result Existence of one-parameter family of radial solutions for critical or supercritical exponents, with different dimensions of existence regions based on stochastic completeness.

Study on Lane-Emden equation on curved spaces, revealing new existence and non-existence phenomena.

problem Existence and non-existence of positive solutions for the Lane-Emden equation on Riemannian models.
method Analysis of the subcritical Lane-Emden equation on various Riemannian manifolds with polynomial volume growth.
result Subcritical regime divides into three ranges with distinct existence and non-existence phenomena.

Paper introduces a novel framework for recognizing dynamic ranking structures in preference-based data.

problem Complex and noisy preference-based data often hide underlying homogeneous structures.
method Developed an approach to identify dynamic ranking groups using temporal penalties and spectral estimation. Introduced an objective function for detecting structural changes.
result Consistent recognition of ranking groups and structural changes in preference-based data.

We study existence, uniqueness and stability of radial solutions of the Lane-Emden-Fowler equation Δgu=up1u-Δ_g u=|u|^{p-1}u in a class of Riemannian models (M,g)(M,g) of dimension n3n\ge 3 which includes the classical hyperbolic space Hn\mathbb H^n as well as manifolds with sectional curvatures unbounded below. Sign properties…

2012-11-08abs ↗pdf ↗

Fawkes protects images from unauthorized facial recognition models.

problem Unauthorized training of facial recognition models poses privacy risks.
method Fawkes adds imperceptible pixel-level changes (cloaks) to images before release.
result Fawkes can protect images from misidentification by 95% and 80% even when clean images are leaked.

Proposes a new model for predicting future motion of road actors in autonomous vehicles.

problem Forecasting the long-term future motion of road actors for safe autonomous driving.
method Recurrent graph-based attentional approach with interpretable geometric and social relationships.
result Can produce diverse predictions conditioned on hypothetical or 'what-if' scenarios.

This study identifies RwD crash patterns on rural two-lane highways under different lighting conditions.

problem Insufficient investigation of RwD crashes under varying lighting conditions.
method Data mining using association rules mining (ARM) on crash database.
result Interesting crash patterns and risk factors identified under different lighting conditions.

Study shows emotion affects speaker recognition and vice versa.

problem Dependencies between emotion and speaker recognition.
method Transfer learning and fine-tuning for emotion classification.
result Fine-tuning improves emotion recognition performance by 30.40% on IEMOCAP, 7.99% on MSP-Podcast, and 8.61% on Crema-D.

ViewFool identifies adversarial viewpoints to test image recognition robustness.

problem Lack of robustness to viewpoint changes in visual recognition models.
method Neural Radiance Fields (NeRF) and entropic regularizer to find adversarial viewpoints.
result Common image classifiers are highly vulnerable to generated adversarial viewpoints.

Traditional activity recognition systems work on the basis of training, taking a fixed set of sensors into account. In this article, we focus on the question how pattern recognition can leverage new information sources without any, or with minimal user input. Thus, we present an approach for opportunistic activity reco…

2017-01-30abs ↗pdf ↗

Enhances activity recognition in wearable computing with context awareness and uncertainty quantification.

problem Context-dependent activity recognition and unknown contexts in wearable computing.
method Developed the α-{eta} network coupled with uncertainty quantification (UQ) based on maximum entropy.
result Improved accuracy and F-score by 10% through high-level context identification.

Paper proposes semi-supervised learning using change points for sequence classification.

problem Limited labeled data for sequential sensor data classification.
method Change point detection for identifying class changes, semi-supervised learning with labeled and unlabeled data.
result Improved classification performance on human activity recognition datasets.

The paper shows non-aspherical path components in G2-moduli spaces.

problem Characterizing non-aspherical path components in G2-moduli spaces.
method Using generalised Kummer construction and resolving singularities with Eguchi-Hanson spaces, the authors establish a fibration over each path component with Eilenberg Mac Lane spaces as fibres.
result The comparison map is a fibration over each path component with Eilenberg Mac Lane spaces as fibres, indicating non-trivial families of G2-manifolds.

Let X be a subcomplex of the standard CW-decomposition of the n-dimensional torus. We exhibit an explicit optimal motion planning algorithm for X. This construction is used to calculate the topological complexity of complements of general position arrangements and Eilenberg-Mac Lane spaces associated to right-angled Ar…

2007-03-02abs ↗pdf ↗

We present a systematic algorithm testing for the existence of collective self-organization in the behavior of agents in social systems, with a concrete empirical implementation on the Dow Jones Industrial Average index (DJIA) over the 20th century and on Hong Kong Hang Seng composite index (HSI) since 1969. The algori…

2003-04-26abs ↗pdf ↗

Robust ASR model removes fast-changing features to resist attacks.

problem Vulnerability of ASR systems to adversarial attacks.
method Removing fast-changing features using slow feature analysis or low-pass filtering.
result Hybrid ASR models are more than four times more robust against targeted attacks.

Deep learning improves material recognition in construction monitoring.

problem Varying illuminations and low accuracy rates in material classification.
method Deep learning methods, including convolutional neural networks, were used to classify and recognize materials in construction sites.
result Achieved 97.35% accuracy rate for material classification.

VFDS selects dynamic features for efficient HAR tasks, optimizing performance-cost trade-offs.

problem Optimizing feature selection for varying costs and dynamic contexts in machine learning tasks.
method Bayesian learning framework with variational dynamic selection policy.
result VFDS selects different features under changing contexts, saving sensory costs while maintaining HAR accuracy.

In a remark in his seminal 1987 paper, Jones describes a way to define the Burau matrix of a positive braid using a metaphor of bowling a ball down a bowling alley with braided lanes. We extend this definition to allow multiple bowling balls to be bowled simultaneously. We obtain the Iwahori-Hecke algebra and a cabled …

2014-09-14abs ↗pdf ↗

An almost-direct product of free groups is an iterated semidirect product of finitely generated free groups in which the action of the constituent free groups on the homology of one another is trivial. We determine the structure of the cohomology ring of such a group. This is used to analyze the topological complexity …

2008-11-09abs ↗pdf ↗