Source author record

Yasin Yilmaz

Yasin Yilmaz appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

23works
19topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

23 published item(s)

preprint2026arXiv

Detecting Adversarial Data via Provable Adversarial Noise Amplification

The nonuniform and growing impact of adversarial noise across the layers of deep neural networks has been used in the literature, without a formal mathematical justification, to detect adversarial inputs and improve robustness. In this work, we study this phenomenon in detail and present a formal adversarial noise amplification theorem. We specify a set of sufficient conditions under which the adversarial noise amplification is mathematically guaranteed. Based on theoretical observations, we propose a novel training methodology with a custom spectral loss function and a specific architectural design to enhance the amplification signal for detecting adversarial data. Finally, we introduce a new, lightweight detection mechanism that leverages the enhanced amplification signal and operates entirely at inference time. To validate our approach, we demonstrate the detector's efficacy against both state-of-the-art attacks and a purpose-built adaptive attack, confirming that enhanced amplification can serve as a robust and reliable signal for adversarial defense.

preprint2026arXiv

Is Video Anomaly Detection Misframed? Evidence from LLM-Based and Multi-Scene Models

Recent video anomaly detection research has expanded rapidly with an emphasis on general models of normality intended to work across many different scenes. While this focus has led to improvements in scalability and multi-scene generalization, it has also shifted the field away from modeling the scene-specific and context-dependent nature of normal behavior. Contemporary approaches frequently rely on video-level weak supervision and opaque pretrained representations from multi-modal large language models (MLLMs), which encourage models to respond to familiar semantic anomaly categories rather than to deviations from the normal patterns of a particular environment. This trend suppresses spatial localization, introduces semantic bias, and reduces anomaly detection to a form of action recognition. In this paper, we examine whether these prevailing formulations align with the core requirements of real-world VAD, which is typically performed within a single scene where normality is determined by local geometry, semantics, and activity patterns. Through targeted visual analyses and empirical evaluations, we demonstrate the practical consequences of these limitations and show that meaningful progress in VAD requires renewed focus on single-scene, spatially-aware, and explainable formulations that capture the nuanced structure of normality within individual environments.

preprint2022arXiv

Adversarial Machine Learning Attacks Against Video Anomaly Detection Systems

Anomaly detection in videos is an important computer vision problem with various applications including automated video surveillance. Although adversarial attacks on image understanding models have been heavily investigated, there is not much work on adversarial machine learning targeting video understanding models and no previous work which focuses on video anomaly detection. To this end, we investigate an adversarial machine learning attack against video anomaly detection systems, that can be implemented via an easy-to-perform cyber-attack. Since surveillance cameras are usually connected to the server running the anomaly detection model through a wireless network, they are prone to cyber-attacks targeting the wireless connection. We demonstrate how Wi-Fi deauthentication attack, a notoriously easy-to-perform and effective denial-of-service (DoS) attack, can be utilized to generate adversarial data for video anomaly detection systems. Specifically, we apply several effects caused by the Wi-Fi deauthentication attack on video quality (e.g., slow down, freeze, fast forward, low resolution) to the popular benchmark datasets for video anomaly detection. Our experiments with several state-of-the-art anomaly detection models show that the attackers can significantly undermine the reliability of video anomaly detection systems by causing frequent false alarms and hiding physical anomalies from the surveillance system.

preprint2022arXiv

RSU-Based Online Intrusion Detection and Mitigation for VANET

Secure vehicular communication is a critical factor for secure traffic management. Effective security in intelligent transportation systems (ITS) requires effective and timely intrusion detection systems (IDS). In this paper, we consider false data injection attacks and distributed denial-of-service (DDoS) attacks, especially the stealthy DDoS attacks, targeting the integrity and availability, respectively, in vehicular ad-hoc networks (VANET). Novel statistical intrusion detection and mitigation techniques based on centralized communications through roadside units (RSU) are proposed for the considered attacks. The performance of the proposed methods are evaluated using a traffic simulator and a real traffic dataset. Comparisons with the state-of-the-art solutions clearly demonstrate the superior performance of the proposed methods in terms of quick and accurate detection and localization of cyberattacks.

preprint2022arXiv

TiSAT: Time Series Anomaly Transformer

While anomaly detection in time series has been an active area of research for several years, most recent approaches employ an inadequate evaluation criterion leading to an inflated F1 score. We show that a rudimentary Random Guess method can outperform state-of-the-art detectors in terms of this popular but faulty evaluation criterion. In this work, we propose a proper evaluation metric that measures the timeliness and precision of detecting sequential anomalies. Moreover, most existing approaches are unable to capture temporal features from long sequences. Self-attention based approaches, such as transformers, have been demonstrated to be particularly efficient in capturing long-range dependencies while being computationally efficient during training and inference. We also propose an efficient transformer approach for anomaly detection in time series and extensively evaluate our proposed approach on several popular benchmark datasets.

preprint2020arXiv

Any-Shot Sequential Anomaly Detection in Surveillance Videos

Anomaly detection in surveillance videos has been recently gaining attention. Even though the performance of state-of-the-art methods on publicly available data sets has been competitive, they demand a massive amount of training data. Also, they lack a concrete approach for continuously updating the trained model once new data is available. Furthermore, online decision making is an important but mostly neglected factor in this domain. Motivated by these research gaps, we propose an online anomaly detection method for surveillance videos using transfer learning and any-shot learning, which in turn significantly reduces the training complexity and provides a mechanism that can detect anomalies using only a few labeled nominal examples. Our proposed algorithm leverages the feature extraction power of neural network-based models for transfer learning and the any-shot learning capability of statistical detection methods.

preprint2020arXiv

Continual Learning for Anomaly Detection in Surveillance Videos

Anomaly detection in surveillance videos has been recently gaining attention. A challenging aspect of high-dimensional applications such as video surveillance is continual learning. While current state-of-the-art deep learning approaches perform well on existing public datasets, they fail to work in a continual learning framework due to computational and storage issues. Furthermore, online decision making is an important but mostly neglected factor in this domain. Motivated by these research gaps, we propose an online anomaly detection method for surveillance videos using transfer learning and continual learning, which in turn significantly reduces the training complexity and provides a mechanism for continually learning from recent data without suffering from catastrophic forgetting. Our proposed algorithm leverages the feature extraction power of neural network-based models for transfer learning, and the continual learning capability of statistical detection methods.

preprint2020arXiv

Deep Reinforcement Learning for Intelligent Transportation Systems: A Survey

Latest technological improvements increased the quality of transportation. New data-driven approaches bring out a new research direction for all control-based systems, e.g., in transportation, robotics, IoT and power systems. Combining data-driven applications with transportation systems plays a key role in recent transportation applications. In this paper, the latest deep reinforcement learning (RL) based traffic control applications are surveyed. Specifically, traffic signal control (TSC) applications based on (deep) RL, which have been studied extensively in the literature, are discussed in detail. Different problem formulations, RL parameters, and simulation environments for TSC are discussed comprehensively. In the literature, there are also several autonomous driving applications studied with deep RL models. Our survey extensively summarizes existing works in this field by categorizing them with respect to application types, control models and studied algorithms. In the end, we discuss the challenges and open questions regarding deep RL-based transportation applications.

preprint2020arXiv

Online Multivariate Anomaly Detection and Localization for High-dimensional Settings

This paper considers the real-time detection of anomalies in high-dimensional systems. The goal is to detect anomalies quickly and accurately so that the appropriate countermeasures could be taken in time, before the system possibly gets harmed. We propose a sequential and multivariate anomaly detection method that scales well to high-dimensional datasets. The proposed method follows a nonparametric, i.e., data-driven, and semi-supervised approach, i.e., trains only on nominal data. Thus, it is applicable to a wide range of applications and data types. Thanks to its multivariate nature, it can quickly and accurately detect challenging anomalies, such as changes in the correlation structure and stealth low-rate cyberattacks. Its asymptotic optimality and computational complexity are comprehensively analyzed. In conjunction with the detection method, an effective technique for localizing the anomalous data dimensions is also proposed. We further extend the proposed detection and localization methods to a supervised setup where an additional anomaly dataset is available, and combine the proposed semi-supervised and supervised algorithms to obtain an online learning algorithm under the semi-supervised framework. The practical use of proposed algorithms are demonstrated in DDoS attack mitigation, and their performances are evaluated using a real IoT-botnet dataset and simulations.

preprint2020arXiv

Real-Time Nonparametric Anomaly Detection in High-Dimensional Settings

Timely detection of abrupt anomalies is crucial for real-time monitoring and security of modern systems producing high-dimensional data. With this goal, we propose effective and scalable algorithms. Proposed algorithms are nonparametric as both the nominal and anomalous multivariate data distributions are assumed unknown. We extract useful univariate summary statistics and perform anomaly detection in a single-dimensional space. We model anomalies as persistent outliers and propose to detect them via a cumulative sum-like algorithm. In case the observed data have a low intrinsic dimensionality, we learn a submanifold in which the nominal data are embedded and evaluate whether the sequentially acquired data persistently deviate from the nominal submanifold. Further, in the general case, we learn an acceptance region for nominal data via Geometric Entropy Minimization and evaluate whether the sequentially observed data persistently fall outside the acceptance region. We provide an asymptotic lower bound and an asymptotic approximation for the average false alarm period of the proposed algorithm. Moreover, we provide a sufficient condition to asymptotically guarantee that the decision statistic of the proposed algorithm does not diverge in the absence of anomalies. Experiments illustrate the effectiveness of the proposed schemes in quick and accurate anomaly detection in high-dimensional settings.

preprint2020arXiv

Timely Detection and Mitigation of Stealthy DDoS Attacks via IoT Networks

Internet of Things (IoT) networks consist of sensors, actuators, mobile and wearable devices that can connect to the Internet. With billions of such devices already in the market which have significant vulnerabilities, there is a dangerous threat to the Internet services and also some cyber-physical systems that are also connected to the Internet. Specifically, due to their existing vulnerabilities IoT devices are susceptible to being compromised and being part of a new type of stealthy Distributed Denial of Service (DDoS) attack, called Mongolian DDoS, which is characterized by its widely distributed nature and small attack size from each source. This study proposes a novel anomaly-based Intrusion Detection System (IDS) that is capable of timely detecting and mitigating this emerging type of DDoS attacks. The proposed IDS's capability of detecting and mitigating stealthy DDoS attacks with even very low attack size per source is demonstrated through numerical and testbed experiments.

preprint2016arXiv

Multimodal Event Detection in Twitter Hashtag Networks

Event detection in a multimodal Twitter dataset is considered. We treat the hashtags in the dataset as instances with two modes: text and geolocation features. The text feature consists of a bag-of-words representation. The geolocation feature consists of geotags (i.e., geographical coordinates) of the tweets. Fusing the multimodal data we aim to detect, in terms of topic and geolocation, the interesting events and the associated hashtags. To this end, a generative latent variable model is assumed, and a generalized expectation-maximization (EM) algorithm is derived to learn the model parameters. The proposed method is computationally efficient, and lends itself to big datasets. Experimental results on a Twitter dataset from August 2014 show the efficacy of the proposed method.

preprint2016arXiv

Online Diversion Detection in Nuclear Fuel Cycles via Multimodal Observations

In nuclear fuel cycles, an enrichment facility typically provides low enriched uranium (LEU) to a number of customers. We consider monitoring an enrichment facility to timely detect a possible diversion of highly enriched uranium (HEU). To increase the the detection accuracy it is important to efficiently use the available information diversity. In this work, it is assumed that the shipment times and the power consumption of the enrichment facility are observed for each shipment of enriched uranium. We propose to initially learn the statistical patterns of the enrichment facility through the bimodal observations in a training period, that is known to be free of diversions. Then, for the goal of timely diversion detection, we propose to use an online detection algorithm which sequentially compares each set of new observations in the test period, which possibly includes diversions, to the learned patterns, and raises a diversion alarm when a significant statistical deviation is detected. The efficacy of the proposed method is shown by comparing its detection performance to those of the traditional detection methods in the Statistics literature.

preprint2015arXiv

Multimodal Factor Analysis

A multimodal system with Poisson, Gaussian, and multinomial observations is considered. A generative graphical model that combines multiple modalities through common factor loadings is proposed. In this model, latent factors are like summary objects that has latent factor scores in each modality, and the observed objects are represented in terms of such summary objects. This potentially brings about a significant dimensionality reduction. It also naturally enables a powerful means of clustering based on a diverse set of observations. An expectation-maximization (EM) algorithm to find the model parameters is provided. The algorithm is tested on a Twitter dataset which consists of the counts and geographical coordinates of hashtag occurrences, together with the bag of words for each hashtag. The resultant factors successfully localizes the hashtags in all dimensions: counts, coordinates, topics. The algorithm is also extended to accommodate von Mises-Fisher distribution, which is used to model the spherical coordinates.

preprint2014arXiv

Sequential and Decentralized Estimation of Linear Regression Parameters in Wireless Sensor Networks

Sequential estimation of a vector of linear regression coefficients is considered under both centralized and decentralized setups. In sequential estimation, the number of observations used for estimation is determined by the observed samples, hence is random, as opposed to fixed-sample-size estimation. Specifically, after receiving a new sample, if a target accuracy level is reached, we stop and estimate using the samples collected so far; otherwise we continue to receive another sample. It is known that finding an optimum sequential estimator, which minimizes the average sample number for a given target accuracy level, is an intractable problem with a general stopping rule that depends on the complete observation history. By properly restricting the search space to stopping rules that depend on a specific subset of the complete observation history, we derive the optimum sequential estimator in the centralized case via optimal stopping theory. However, finding the optimum stopping rule in this case requires numerical computations that {\em quadratically} scales with the number of parameters to be estimated. For the decentralized setup with stringent energy constraints, under an alternative problem formulation that is conditional on the observed regressors, we first derive a simple optimum scheme whose computational complexity is {\em constant} with respect to the number of parameters. Then, following this simple optimum scheme we propose a decentralized sequential estimator whose computational complexity and energy consumption scales {\em linearly} with the number of parameters. Specifically, in the proposed decentralized scheme a close-to-optimum average stopping time performance is achieved by infrequently transmitting a single pulse with very short duration.

preprint2014arXiv

Sequential Distributed Detection in Energy-Constrained Wireless Sensor Networks

The recently proposed sequential distributed detector based on level-triggered sampling operates as simple as the decision fusion techniques and at the same time performs as well as the data fusion techniques. Hence, it is well suited for resource-constrained wireless sensor networks. However, in practical cases where sensors observe discrete-time signals, the random overshoot above or below the sampling thresholds considerably degrades the performance of the considered detector. We propose, for systems with stringent energy constraints, a novel approach to tackle this problem by encoding the overshoot into the time delay between the sampling time and the transmission time. Specifically, each sensor computes the local log-likelihood ratio (LLR) and samples it using level-triggered sampling. Then, it transmits a single pulse to the fusion center (FC) after a transmission delay that is proportional to the overshoot, as in pulse position modulation (PPM). The FC, upon receiving a bit decodes the corresponding overshoot and recovers the transmitted LLR value. It then updates the approximate global LLR and compares it with two threshold to either make a decision or to continue the sequential process. We analyze the asymptotic average detection delay performance of the proposed scheme. We then apply the proposed sequential scheme to target detection in wireless sensor networks under the four Swerling fluctuating target models. It is seen that the proposed sequential distributed detector offers significant performance advantage over conventional decision fusion techniques.

preprint2014arXiv

Sequential Joint Detection and Estimation: Optimum Tests and Applications

We treat the statistical inference problems in which one needs to detect and estimate simultaneously using as small number of samples as possible. Conventional methods treat the detection and estimation subproblems separately, ignoring the intrinsic coupling between them. However, a joint detection and estimation problem should be solved to maximize the overall performance. We address the sample size concern through a sequential and Bayesian setup. Specifically, we seek the optimum triplet of stopping time, detector, and estimator(s) that minimizes the number of samples subject to a constraint on the combined detection and estimation cost. A general framework for optimum sequential joint detection and estimation is developed. The resulting optimum detector and estimator(s) are strongly coupled with each other, proving that the separate treatment is strictly sub-optimum. The theoretical results derived for a quite general model are then applied to several problems with linear quadratic Gaussian (LQG) models, including dynamic spectrum access in cognitive radio, and state estimation in smart grid with topological uncertainty. Numerical results corroborate the superior overall detection and estimation performance of the proposed schemes over the conventional methods that handle the subproblems separately.

preprint2014arXiv

Sequential Joint Spectrum Sensing and Channel Estimation for Dynamic Spectrum Access

Dynamic spectrum access under channel uncertainties is considered. With the goal of maximizing the secondary user (SU) throughput subject to constraints on the primary user (PU) outage probability we formulate a joint problem of spectrum sensing and channel state estimation. The problem is cast into a sequential framework since sensing time minimization is crucial for throughput maximization. In the optimum solution, the sensing decision rule is coupled with the channel estimator, making the separate treatment of the sensing and channel estimation strictly suboptimal. Using such a joint structure for spectrum sensing and channel estimation we propose a distributed (cooperative) dynamic spectrum access scheme under statistical channel state information (CSI). In the proposed scheme, the SUs report their sufficient statistics to a fusion center (FC) via level-triggered sampling, a nonuniform sampling technique that is known to be bandwidth-and-energy efficient. Then, the FC makes a sequential spectrum sensing decision using local statistics and channel estimates, and selects the SU with the best transmission opportunity. The selected SU, using the sensing decision and its channel estimates, computes the transmit power and starts data transmission. Simulation results demonstrate that the proposed scheme significantly outperforms its conventional counterparts, under the same PU outage constraints, in terms of the achievable SU throughput.

preprint2013arXiv

Optimal Sequential Joint Detection and Estimation

This paper has been withdrawn by the authors. Please see arXiv:1302.6058. We consider the sequential joint detection and estimation problem. Minimizing the average stopping time subject to a combination of detection and estimation constraints we obtain the optimal triplet of stopping time, detector and estimator. In the joint detection and estimation problem the primary goal is to detect and estimate together, as opposed to the conventional testing of composite hypotheses where the primary goal is to detect only. For the first time in the literature we develop optimal solution to the sequential joint detection and estimation problem. In the sequential version of the problem, different from the fixed sample size version, optimal stopping time is also sought, complicating the solution considerably.

preprint2013arXiv

Sequential Decentralized Parameter Estimation under Randomly Observed Fisher Information

We consider the problem of decentralized estimation using wireless sensor networks. Specifically, we propose a novel framework based on level-triggered sampling, a non-uniform sampling strategy, and sequential estimation. The proposed estimator can be used as an asymptotically optimal fixed-sample-size decentralized estimator under non-fading listening channels (through which sensors collect their observations), as an alternative to the one-shot estimators commonly found in the literature. It can also be used as an asymptotically optimal sequential decentralized estimator under fading listening channels. We show that the optimal centralized estimator under Gaussian noise is characterized by two processes, namely the observed Fisher information U_t, and the observed correlation V_t. It is noted that under non-fading listening channels only V_t is random, whereas under fading listening channels both U_t and V_t are random. In the proposed scheme, each sensor computes its local random process(es), and sends a single bit to the fusion center (FC) whenever the local random process(es) pass(es) certain predefined levels. The FC, upon receiving a bit from a sensor, updates its approximation to the corresponding global random process, and accordingly its estimate. The sequential estimation process terminates when the observed Fisher information (or the approximation to it) reaches a target value. We provide an asymptotic analysis for the proposed estimator and also the one based on conventional uniform-in-time sampling under both non-fading and fading channels; and determine the conditions under which they are asymptotically optimal, consistent, and asymptotically unbiased. Analytical results, together with simulation results, demonstrate the superiority of the proposed estimator based on level-triggered sampling over the traditional decentralized estimator based on uniform sampling.

preprint2013arXiv

Sequential Joint Detection and Estimation

We consider the problem of simultaneous detection and estimation under a sequential framework. In particular we are interested in sequential tests that distinguish between the null and the alternative hypothesis and every time the decision is in favor of the alternative they provide an estimate of a random parameter. As we demonstrate with our analysis treating the two subproblems separately with the corresponding optimal strategies does not result in the best possible performance. To enjoy optimality one needs to take into account the optimum estimator during the hypothesis testing phase.

preprint2012arXiv

Channel-aware Decentralized Detection via Level-triggered Sampling

We consider decentralized detection through distributed sensors that perform level-triggered sampling and communicate with a fusion center via noisy channels. Each sensor computes its local log-likelihood ratio (LLR), samples it using the level-triggered sampling, and upon sampling transmits a single bit to the FC. Upon receiving a bit from a sensor, the FC updates the global LLR and performs a sequential probability ratio test (SPRT) step. We derive the fusion rules under various types of channels. We further provide an asymptotic analysis on the average detection delay for the proposed channel-aware scheme, and show that the asymptotic detection delay is characterized by a KL information number. The delay analysis facilitates the choice of appropriate signaling schemes under different channel types for sending the 1-bit information from sensors to the FC.

preprint2012arXiv

Cooperative Sequential Spectrum Sensing Based on Level-triggered Sampling

We propose a new framework for cooperative spectrum sensing in cognitive radio networks, that is based on a novel class of non-uniform samplers, called the event-triggered samplers, and sequential detection. In the proposed scheme, each secondary user computes its local sensing decision statistic based on its own channel output; and whenever such decision statistic crosses certain predefined threshold values, the secondary user will send one (or several) bit of information to the fusion center. The fusion center asynchronously receives the bits from different secondary users and updates the global sensing decision statistic to perform a sequential probability ratio test (SPRT), to reach a sensing decision. We provide an asymptotic analysis for the above scheme, and under different conditions, we compare it against the cooperative sensing scheme that is based on traditional uniform sampling and sequential detection. Simulation results show that the proposed scheme, using even 1 bit, can outperform its uniform sampling counterpart that uses infinite number of bits under changing target error probabilities, SNR values, and number of SUs.