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,738 papers · 148 categories

Trend · papers per month

14294357 · Jun 202019922001200920172026
48 results for clutter removal

A network removes irrelevant structures from chest radiographs for better analysis.

problem Clutter in chest radiographs hinders visual inspection and analysis.
method Fully Convolutional Network to suppress undesired visual structure.
result Improved classifier performance with limited training data.

Bayesian nonparametric models improve tracking in cluttered environments.

problem Robust tracking of moving targets in high clutter environments.
method Employing Bayesian nonparametric models to estimate target and clutter measurements.
result Improved tracking performance and effectiveness in high clutter environments.

PiVoT improves real-time multi-object detection and tracking in clutter.

problem Challenges in multi-object detection and tracking from noisy point clouds.
method Variational inference for fast, clutter-resilient multi-object tracking.
result Substantial performance improvement over existing Bayesian trackers.

Improved RL for grasping in cluttered scenes using state representation learning.

problem Poor performance of RL methods in grasping diverse objects from raw images.
method Employed state representation learning (SRL) with disentanglement of raw input images.
result Deep RL can learn grasping skills from varied visual inputs.

Paper uses VAEs to detect radar targets in complex noise.

problem Detecting radar targets in compound clutter and thermal noise.
method Proposes a VAE architecture to distinguish radar targets from various noise types.
result The VAE outperforms classical detectors in challenging noise conditions.

Novel unsupervised MIG detectors improve signal detection in cluttered environments.

problem Signal detection in nonhomogeneous clutter environments.
method Developed novel discriminative MIG detectors using HPD matrices and geometric measures.
result Improved signal detection performance compared to conventional methods.

CVAE detects weak complex signals in maritime radar, improving detection over classical methods.

problem Detecting weak complex-valued signals in non-Gaussian, range-varying interference.
method Complex-valued Variational AutoEncoder (CVAE) trained on clutter-plus-noise, whitening, ANMF fusion.
result CVAE yields higher detection probability Pd at matched false-alarm rate Pfa, especially with whitening.

Hybrid approach combines transformer and Bayesian filtering for robust multiple particle tracking.

problem Challenges in tracking multiple particles in noisy scenes due to combinatorial explosion of hypotheses.
method Attention-Bayesian hybrid framework using transformer for association and Bayesian filtering for pruning hypotheses.
result Improved tracking accuracy and robustness against spurious detections.

Discrete return (DR) Laser Detection and Ranging (Ladar) systems provide a series of echoes that reflect from objects in a scene. These can be first, last or multi-echo returns. In contrast, Full-Waveform (FW)-Ladar systems measure the intensity of light reflected from objects continuously over a period of time. In a c…

2016-02-17abs ↗pdf ↗

We present a representation for describing transition models in complex uncertain domains using relational rules. For any action, a rule selects a set of relevant objects and computes a distribution over properties of just those objects in the resulting state given their properties in the previous state. An iterative g…

2018-10-26abs ↗pdf ↗

Using a trimming approach, we investigate a k-means type method based on Bregman divergences for clustering data possibly corrupted with clutter noise. The main interest of Bregman divergences is that the standard Lloyd algorithm adapts to these distortion measures, and they are well-suited for clustering data sampled …

2018-12-11abs ↗pdf ↗

Good data stewardship requires removal of data at the request of the data's owner. This raises the question if and how a trained machine-learning model, which implicitly stores information about its training data, should be affected by such a removal request. Is it possible to "remove" data from a machine-learning mode…

2019-11-08abs ↗pdf ↗

Selective removal of data subsets can efficiently unlearn unwanted distributions.

problem Efficiently removing unwanted data subsets without losing important information.
method Formalized as distributional unlearning, using Kullback-Leibler divergence constraints to select a small subset of data.
result Proposed method achieves corresponding log-loss bounds and is quadratically more sample-efficient than random removal.

Binary determination of the presence of objects is one of the problems where humans perform extraordinarily better than computer vision systems, in terms of both speed and preciseness. One of the possible reasons is that humans can skip most of the clutter and attend only on salient regions. Recurrent attention models …

2019-05-29abs ↗pdf ↗

Proposes BN layers for neural networks on complex domains, improving training stability and accuracy.

problem Training stability and accuracy issues in neural networks on complex domains.
method Developed Riemannian batch normalization (BN) layers with connections to existing layers.
result Demonstrated improved performance on radar clutter classification, node classification, and action recognition.

The paper proves removable singularity for nonlocal minimal graphs.

problem Proving removable singularities for nonlocal minimal graphs.
method Analyzing (s,1)(s, 1)-capacity zero compact sets to ensure graphs are minimal in the entire domain.
result Nonlocal minimal graphs are removable in the entire domain if they are minimal in a set of (s,1)(s, 1)-capacity zero.

Removing spurious features can hurt model accuracy and disproportionately affect different groups.

problem Interference from spurious features in robust model performance across different groups.
method Characterization and analysis of spurious feature removal in noiseless overparameterized linear regression.
result Removal of spurious features can decrease accuracy and disproportionately affect different groups, even in balanced datasets.

Traditional recognition methods typically require large, artificially-balanced training classes, while few-shot learning methods are tested on artificially small ones. In contrast to both extremes, real world recognition problems exhibit heavy-tailed class distributions, with cluttered scenes and a mix of coarse and fi…

2019-04-09abs ↗pdf ↗

Applying convolutional neural networks to large images is computationally expensive because the amount of computation scales linearly with the number of image pixels. We present a novel recurrent neural network model that is capable of extracting information from an image or video by adaptively selecting a sequence of …

2014-06-24abs ↗pdf ↗

Machine learning confound removal biases results, leading to misleading predictions.

problem Common confound removal methods in machine learning lead to misleading predictions.
method Featurewise removal of confound variance by linear regression before applying ML.
result This common deconfounding approach can leak information, amplifying null or moderate effects.

Feature matters for salient object detection. Existing methods mainly focus on designing a sophisticated structure to incorporate multi-level features and filter out cluttered features. We present Progressive Feature Polishing Network (PFPN), a simple yet effective framework to progressively polish the multi-level feat…

2019-11-14abs ↗pdf ↗

PUMA augments models to remove unique data points without performance loss.

problem Preserving model performance while removing unique training data points.
method Explicitly models data influence, reweights remaining data optimally.
result PUMA effectively removes unique data points without performance degradation.

In this paper we prove a local removable singularity theorem for certain minimal laminations with isolated singularities in a Riemannian three-manifold. This removable singularity theorem is the key result used in our proof that a complete, embedded minimal surface in R3\mathbb{R}^3 with quadratic decay of curvature ha…

2013-08-29abs ↗pdf ↗

This paper proposes a novel Gaussian process approach to fault removal in time-series data. Fault removal does not delete the faulty signal data but, instead, massages the fault from the data. We assume that only one fault occurs at any one time and model the signal by two separate non-parametric Gaussian process model…

2015-07-02abs ↗pdf ↗