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.

169,341 papers · 148 categories

Trend · papers per month

4284126168 · Jun 202019922001200920182026
48 results for forgery detection

Handwritten signature verification remains challenging, especially offline.

problem Discriminate genuine from forged signatures in static scenarios.
method Review of past research and analysis of recent advancements in Deep Learning.
result Deep Learning has shown promise in feature representation learning from signature images.

Deep CNNs improve signature verification performance.

problem Improving signature verification against skilled forgeries.
method Used Deep Convolutional Neural Networks (CNNs) to learn features from signature images.
result Achieved an Equal Error Rate of 2.74% on GPDS-160 dataset, significantly better than previous literature.

Adapting deep learning for object detection to detect mixed image tampering.

problem Detecting mixed image tampering without prior knowledge of the method.
method Adapting deep learning for object detection to learn from a large database of various image types, using a Multi-stream Faster RCNN network with fused features from ELA and BAG error maps.
result Improved accuracy in detecting mixed image tampering.

Deep CNN learns writer-independent features for signature verification.

problem Building classifiers that can distinguish between genuine and forged signatures.
method Used Deep Convolutional Neural Networks to learn writer-independent features.
result Features learned from one set of users are discriminative for other users, including across different datasets.

The study tackles forgery in machine unlearning, showing that forging is limited and can be detected.

problem Adversarial crafting of data to mimic model behavior without removing information.
method Developed a framework to analyze εε-forging sets and proved their measure decay.
result The forging set measure decays as ε(dr)/2ε^{(d-r)/2}, providing evidence against false unlearning claims.

Paper proposes an ensemble model for writer-independent offline signature verification using deep learning.

problem Difficulty in distinguishing genuine signatures from skilled forgeries in writer-independent offline signature verification.
method Used an ensemble model with two CNNs for feature extraction, RGBT for classification, and stacking for final prediction.
result Achieved state-of-the-art performance on various datasets.

Improves authorship attribution accuracy and robustness against adversarial attacks.

problem Vulnerability of authorship attribution approaches to adversarial attacks.
method Formulated a relational adversary threat model and presented a novel learning framework, normalize-and-predict (N&P).
result Improves accuracy on adversarial inputs by up to 70% and robust accuracy by 45%.

Paper tackles fixed-size representation learning for variable-sized signatures.

problem Learning feature representations for signatures of varying sizes.
method Modified Spatial Pyramid Pooling to learn fixed-sized representations from variable-sized signatures.
result Comparable performance to state-of-the-art on GPDS dataset, removing size constraint.

Deep transfer learning from Persian handwriting improves offline signature verification.

problem Challenges in offline signature verification, especially with skilled forgeries and limited training data.
method Transfer learning approach from Persian handwriting to multi-language OSV, using Residual CNNs for feature learning and SVMs for verification.
result Significant improvement in Equal Error Rate (EER) on UT-Sig dataset (9.80% EER), surpassing state-of-the-art methods.

Study improves offline signature verification by combining multiple loss functions in CNNs.

problem Challenges in offline signature verification, especially forgeries.
method Examined and integrated cross entropy, Cauchy-Schwarz divergence, and hinge loss into a dynamic multi-loss function.
result Substantial improvements in EERs for writer-dependent OSV protocols.

Deep learning improves combustor anomaly detection in gas turbines.

problem Improving anomaly detection performance in gas turbine combustors.
method Hierarchically learned features from exhaust gas temperature sensor measurements using deep learning.
result Deep learning-based anomaly detection significantly improved combustor anomaly detection performance.

Graph energy helps detect communities in networks better than traditional methods.

problem Detecting communities in sparse networks where traditional methods fail.
method Using graph energy based on the full spectrum of adjacency matrices.
result The difference in graph energy between a planted partition model and an Erdős--Rényi network has a distinct transition at the detectability threshold.

New method detects change points in multi-dimensional sequences, controlling false detection.

problem Detecting change points in sequences with multiple dimensions.
method Two-stage approach: select relevant dimensions and CPs, using selective inference.
result Exact inference possible for a class of CP detection methods.

New ML-based detection improves PMH signal detection in load-modulated MIMO systems.

problem Detecting PMH signals without prior CSI is challenging and computationally expensive.
method Proposes HEM-ML and HEM-KD schemes using EM and KD-tree for efficient detection.
result Achieves comparable detection results to optimal ML detector with reduced complexity.

Develops a method to detect changes in linear systems with temporal correlations.

problem Detect abrupt changes in time series data with temporal correlations.
method Data-dependent threshold for online change point detection in linear dynamical systems.
result Achieves a pre-specified upper bound on the probability of false alarms and provides a finite-sample-based bound for detection probability.

Tackles the computational hardness of HPC detection, conjecturing equivalence to PC detection.

problem Computational hardness of hypergraphic planted clique detection.
method No specific method mentioned; focuses on conjecturing equivalence.
result Equivalence of computational hardness between HPC and PC detection.

Study on detecting hierarchical community structures in networks.

problem Detecting hierarchical community structures in networks.
method Analysis of planted hierarchies of partitions in networks, identifying additional detectability phases.
result There are additional phases in which the presence of multiple consistent partitions can either help or hinder detection of hierarchical structures.

Detects change-points in similarity networks to identify anomalous nodes.

problem Detecting changes in network structure that affect node similarity.
method Sequential node-wise average similarity measures for change detection; community detection for anomaly isolation.
result Simple sequential procedure effectively identifies change-points and anomalous nodes.

Deep object detection improves mitotic nucleus detection in breast cancer biopsies.

problem Challenges in automated mitotic nucleus detection in breast cancer histopathological images.
method Adapted Mask R-CNN for deep object detection, initially selects candidate regions with maximum recall, refines them with multi-object loss function.
result Improved discrimination ability (F-score of 0.86) and significant precision (0.86) for mitotic nuclei compared to two-stage models.

ECAD detects anomalies without data exchangeability, improving traffic flow detection.

problem Detecting anomalies in spatio-temporal data with missing values.
method ECAD uses conformal prediction to wrap around any regression algorithm, controlling Type-I error without data exchangeability.
result ECAD outperforms other methods in detecting anomalous traffic flow.

This paper offers a distribution-free method for post-detection changepoint localization.

problem Locating the exact time of a change in distribution after a sequential detection procedure.
method A distribution-free framework using conformal test martingales for sequential change detection and post-detection inference.
result Valid post-detection coverage guarantees and non-asymptotic bounds on confidence set size.

Paper develops an algorithm with PAC guarantees for detecting alien categories.

problem Detecting alien categories not seen in training data reliably.
method Develops an algorithm with PAC-style guarantees for alien detection under known upper bounds on alien fraction.
result Empirical results show the algorithm's effectiveness in detecting aliens.

Research tackles novelty detection for mixed-type data, proposing probabilistic methods.

problem Detect anomalies in mixed-type datasets like numerical and categorical data.
method Experimental comparison of methods, probabilistic nonparametric model, autoencoder-based model.
result Developed robust methods for mixed-type data novelty detection.

Detects data drift in deep learning models using neural embeddings.

problem Detecting changes in data distribution in deep learning models.
method Formulates drift detection in a sequential decision framework and introduces a loss function to balance false alarms and quick detection.
result Demonstrates improved ability to balance false alarms and quick detection in change detection.

End-to-end method learns geometry and appearance for multi-view object detection.

problem Challenges in multi-view object detection, including viewpoint, lighting, and scale variability.
method Jointly learns multi-view geometry and warping for robust cross-view object detection.
result Superior performance compared to baselines on a new street-level panorama data set.

Detecting changes in high-dimensional datastreams is harder than in low-dimensional ones.

problem Difficulty in detecting changes in multivariate datastreams as dimension increases.
method Comparing log-likelihood distributions over different time windows to measure changes.
result The detectability of changes worsens with higher data dimension, a phenomenon called detectability loss.

This research identifies flaws in drift detection methods and creates adversarial data streams to exploit them.

problem The challenge of detecting data distribution changes (drift) in real-time systems.
method Developed adversarial data streams to show weaknesses in existing drift detection schemes.
result Demonstrated that common drift detection methods can be fooled by adversarial data streams.

It follows from earlier work of Silver-Williams and the authors that twisted Alexander polynomials detect the unknot and the Hopf link. We now show that twisted Alexander polynomials also detect the trefoil and the figure-8 knot, that twisted Alexander polynomials detect whether a link is split and that twisted Alexand…

2013-06-14abs ↗pdf ↗

New method detects OOD samples using neural network trajectories.

problem Lack of comprehensive layer exploration in OOD detection.
method Functional data perspective, analyzing sample trajectories through multi-layer classifier.
result Empirically validated as effective compared to state-of-the-art methods.