Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Imtiaz Ahmed 0002

dblp:79/8605-2 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
6since 2021 · last 2026
0000-0003-1577-7384ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
anomaly detection
1.122022
Graph Regularized Autoencoder and its Application in Unsupervised Anomaly Detection · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Neighborhood Structure Assisted Non-negative Matrix Factorization and Its Application in Unsupervised Point-wise Anomaly Detection · J. Mach. Learn. Res. 2021
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.612022
Graph Regularized Autoencoder and its Application in Unsupervised Anomaly Detection · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Machine learning › Representation and self-supervised learning › representation learning › neural network representation learning › deep representation learning
graph regularized autoencoder
0.612022
Graph Regularized Autoencoder and its Application in Unsupervised Anomaly Detection · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Data mining › anomaly detection
unsupervised anomaly detection
0.612022
Graph Regularized Autoencoder and its Application in Unsupervised Anomaly Detection · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Data mining
dimensionality reduction
0.512021
Neighborhood Structure Assisted Non-negative Matrix Factorization and Its Application in Unsupervised Point-wise Anomaly Detection · J. Mach. Learn. Res. 2021
Data mining › dimensionality reduction
nonnegative matrix factorization
0.512021
Neighborhood Structure Assisted Non-negative Matrix Factorization and Its Application in Unsupervised Point-wise Anomaly Detection · J. Mach. Learn. Res. 2021
Data mining
clustering
0.212022
Graph Regularized Autoencoder and its Application in Unsupervised Anomaly Detection · IEEE Trans. Pattern Anal. Mach. Intell. 2022

Methods — techniques the papers use, named apart from their topics

minimum spanning tree · 1.6geodesic distance · 1.1generative adversarial network · 1.1autoencoder · 1.1online optimization · 0.5non-negative matrix factorization · 0.5
YearPublicationVenuePosition
2026 Towards efficient real-time video motion transfer via generative time series modeling
abstract
Motion Transfer is an Artificial Intelligence (AI) technique that synthesizes videos by transferring motion dynamics from a driving video to a source image. In this work we propose a deep learning-based framework to enable real-time video motion transfer which is critical for enabling bandwidth-efficient applications such as video conferencing, remote health monitoring, virtual reality interaction, and vision-based anomaly detection. This is done using keypoints which serve as semantically meaningful, compact representations of motion across time, and are extracted from every video frame via a self-supervised detector. To enable bandwidth savings during video transmission we perform forecasting of keypoints using two generative time series models–Variational Recurrent Neural Networks (VRNN) and Gated Recurrent Units with Normalizing Flows (GRU-NF)–enabling both single and diverse future prediction modes. The predicted keypoints are transformed into realistic video frames using an optical flow-based module paired with a generator network, thereby facilitating accurate video forecasting and enabling efficient, low-frame-rate video transmission. Based on the application this allows the framework to either generate a deterministic future sequence or sample a diverse set of plausible futures. Experimental results across three benchmark video datasets using state-of-the-art quality and diversity metrics for video animation and reconstruction tasks demonstrate that VRNN achieves the best point-forecast fidelity (lowest MAE) in the majority of evaluated settings in applications requiring stable and accurate multi-step forecasting (e.g., video conferencing, remote patient monitoring) and is particularly competitive in higher-uncertainty, multi-modal settings. This is achieved by utilizing the superior reconstruction property of the Variational Autoencoder and by introducing recurrently conditioned stochastic latent variables that carry past contexts to capture uncertainty and temporal variation. On the other hand the GRU-NF model enables richer diversity of generated videos while maintaining high visual quality to better support tasks like AI-driven anomaly detection. This is realized by learning an invertible, exact-likelihood mapping between the keypoints and their latent representations which supports rich and controllable sampling of diverse yet coherent keypoint sequences. Our work lays the foundation for next-generation AI systems that require real-time, bandwidth-efficient, and semantically controllable video generation, with broad implications for communication, health, and manufacturing applications. The code is available at: https://github.com/Tasmiah1408028/RealtimeVideoMotionTransfer
Tasmiah Haque, Md. Asif Bin Syed, Byungheon Jeong, Sumit Mohan, Somdyuti Paul, Imtiaz Ahmed 0002, Srinjoy Das
Multim. Tools Appl.7
2025 Toward Futuristic Autonomous Experimentation - A Surprise-Reacting Sequential Experiment Policy
abstract
An autonomous experimentation platform in manufacturing is supposedly capable of conducting a sequential search for finding suitable manufacturing conditions by itself or even for discovering new materials with minimal human intervention. The core of the intelligent control of such platforms is a policy to decide where to conduct the next experiment based on what has been done thus far. Such policy inevitably trades off between exploitation and exploration. Currently, the prevailing approach is to use various acquisition functions in the Bayesian optimization framework. We discuss whether it is beneficial to trade off exploitation versus exploration by measuring the element and degree of surprise associated with the immediate past observation. We devise a surprise-reacting policy using two existing surprise metrics, known as the Shannon surprise and Bayesian surprise. Our analysis shows that the surprise-reacting policy appears to be better suited for quickly characterizing the overall landscape of a response surface under resource constraints. We do not claim that we have a fully autonomous experimentation system but believe that the surprise-reacting capability benefits the automation of sequential decisions in autonomous experimentation.Note to Practitioners Autonomous systems should be able to go beyond repetitive automatic actions that are generally pre-programmed through a recipe. To decide what to do next on the fly differentiates autonomy from automation. Arguably, autonomy is the highest form of automation. To endow a manufacturing with autonomy, one necessary capability is for it to react properly to the “unexpected,” which are those observations disagreeing with its model’s anticipation. Are these bad measurements, an anomaly, or an indicator of model inadequacy? Should the observations be discarded or should the model be updated using the new observation? If latter, should model be updated gradually overtime or radically altered? Figuratively, upon observing the unexpected, we say that a manufacturing control system is “surprised” and ask the question of how it should react. Our investigation shares our current insights on this question.
Imtiaz Ahmed 0002, Satish T. S. Bukkapatnam, Bhaskar Botcha, Yu Ding 0002
IEEE Trans Autom. Sci. Eng.1
2024 Aerial drone fleet deployment optimization with endogenous battery replacements for direct delivery of time-sensitive products
Tanveer Hossain Bhuiyan, Victor Walker, Mohammad S. Roni, Imtiaz Ahmed 0002
Expert Syst. Appl.4
2022 Graph Regularized Autoencoder and its Application in Unsupervised Anomaly Detection
abstract
Dimensionality reduction is a crucial first step for many unsupervised learning tasks including anomaly detection and clustering. Autoencoder is a popular mechanism to accomplish dimensionality reduction. In order to make dimensionality reduction effective for high-dimensional data embedding nonlinear low-dimensional manifold, it is understood that some sort of geodesic distance metric should be used to discriminate the data samples. Inspired by the success of geodesic distance approximators such as ISOMAP, we propose to use a minimum spanning tree (MST), a graph-based algorithm, to approximate the local neighborhood structure and generate structure-preserving distances among data points. We use this MST-based distance metric to replace the euclidean distance metric in the embedding function of autoencoders and develop a new graph regularized autoencoder, which outperforms a wide range of alternative methods over 20 benchmark anomaly detection datasets. We further incorporate the MST regularizer into two generative adversarial networks and find that using the MST regularizer improves the performance of anomaly detection substantially for both generative adversarial networks. We also test our MST regularized autoencoder on two datasets in a clustering application and witness its superior performance as well.
Imtiaz Ahmed 0002, Travis Galoppo, Xia Ben Hu, Yu Ding 0002
IEEE Trans. Pattern Anal. Mach. Intell.1
2022 A Spatio-Temporal Track Association Algorithm Based on Marine Vessel Automatic Identification System Data
abstract
Tracking multiple moving objects in real-time in a dynamic threat environment is an important element in national security and surveillance system. It helps pinpoint and distinguish potential candidates posing threats from other normal objects and monitor the anomalous trajectories until intervention. To locate the anomalous pattern of movements, one needs to have an accurate data association algorithm that can associate the sequential observations of locations and motion with the underlying moving objects, and therefore, build the trajectories of the objects as the objects are moving. In this work, we develop a spatio-temporal approach for tracking maritime vessels as the vessel’s location and motion observations are collected by an Automatic Identification System. The proposed approach is developed as an effort to address a data association challenge in which the number of vessels as well as the vessel identification are purposely withheld and time gaps are created in the datasets to mimic the real-life operational complexities under a threat environment. Three training datasets and five test sets are provided in the challenge and a set of quantitative performance metrics is devised by the data challenge organizer for evaluating and comparing resulting methods developed by participants. When our proposed track association algorithm is applied to the five test sets, the algorithm scores a very competitive performance.
Imtiaz Ahmed 0002, Mikyoung Jun, Yu Ding 0002
IEEE Trans. Intell. Transp. Syst.1
2021 Neighborhood Structure Assisted Non-negative Matrix Factorization and Its Application in Unsupervised Point-wise Anomaly Detection
abstract
Dimensionality reduction is considered as an important step for ensuring competitive performance in unsupervised learning such as anomaly detection. Non-negative matrix factorization (NMF) is a widely used method to accomplish this goal. But NMF do not have the provision to include the neighborhood structure information and, as a result, may fail to provide satisfactory performance in presence of nonlinear manifold structure. To address this shortcoming, we propose to consider the neighborhood structural similarity information within the NMF framework and do so by modeling the data through a minimum spanning tree. We label the resulting method as the neighborhood structure-assisted NMF. We further develop both offline and online algorithms for implementing the proposed method. Empirical comparisons using twenty benchmark data sets as well as an industrial data set extracted from a hydropower plant demonstrate the superiority of the neighborhood structure-assisted NMF. Looking closer into the formulation and properties of the proposed NMF method and comparing it with several NMF variants reveal that inclusion of the MST-based neighborhood structure plays a key role in attaining the enhanced performance in anomaly detection.
Imtiaz Ahmed 0002, Xia Ben Hu, Mithun Acharya, Yu Ding 0002
J. Mach. Learn. Res.1
2019 Unsupervised Anomaly Detection Based on Minimum Spanning Tree Approximated Distance Measures and its Application to Hydropower Turbines
abstract
Anomalies are data points or a cluster of data points that lie away from the neighboring points or clusters and are inconsistent with the overall pattern of the data. Anomaly detection techniques help distinguish the anomalous observations from the regular ones, and thus provide the basis for developing a standard performance guideline for process control. The process of identifying anomalies becomes complicated in the absence of labeled training data as in supervised learning. Moreover, Euclidean distance between two points is less likely able to reflect the intrinsic structural distance imposed by the underlying manifold structure. In this paper, the authors propose a minimum spanning tree (MST)-based anomaly detection method. The merit of the method is that an MST provides a new distance measure, capable of capturing the relative connectedness of data points/clusters in a complicated manifold, and could be a better (dis)similarity metric, than the simple Euclidean distance, to identify anomalies in unsupervised learning settings. The proposed method is compared with 13 popular anomaly detection methods on 20 benchmark data sets, demonstrating a considerable improvement in its ability of identifying anomalies. Furthermore, the MST-based anomaly detection is applied to the data set from a hydropower turbine and demonstrates remarkable detection competence.
Imtiaz Ahmed 0002, Aldo Dagnino, Yu Ding 0002
IEEE Trans Autom. Sci. Eng.1