Subhankar Ghosh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Subhankar Ghosh has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Arun Sharma
University of Minnesota, Twin Cities, Minneapolis, Minnesota, USA
5 shared publications - Shashi Shekhar
University of Minnesota-Twin Cities, Minneapolis, Minnesota, USA
5 shared publications - Majid Farhadloo
University of Minnesota, Minneapolis, Minnesota, USA
3 shared publications - Mingzhou Yang
University of Minnesota, Minneapolis, Minnesota, USA
3 shared publications - Aneesh C. Subramanian
Department of Atmospheric and Oceanic Sciences University of Colorado Boulder Boulder CO USA
1 shared publication - Bharat Jayaprakash
Department of Mechanical Engineering, University of Minnesota Twin Cities, Minneapolis, USA
1 shared publication
Latest Publications
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-24
Towards Physics-informed Diffusion for Anomaly Detection in Trajectories: A Summary of Results
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-24
Open AccessTowards Physics-informed Diffusion for Anomaly Detection in Trajectories: A Summary of Results
- Open Access
- 2 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 57-69
Towards Surrogate Models with Hybrid Spatial Neural Networks: A Summary of Results
- 2 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 57-69
Open AccessTowards Surrogate Models with Hybrid Spatial Neural Networks: A Summary of Results
- Open Access
- 2 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Towards Physics-guided Generative Foundation Models
- 2 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessTowards Physics-guided Generative Foundation Models
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 372-383
Towards Kriging-informed Conditional Diffusion for Regional Sea-Level Data Downscaling: A Summary of Results
Given coarser-resolution projections from global climate models or satellite data, the downscaling problem aims to estimate finer-resolution regional climate data, capturing fine-scale spatial patterns and variability. Downscaling is any method to derive high-resolution data from low-resolution variables, often to provide more detailed and local predictions and analyses. This problem is societally crucial for effective adaptation, mitigation, and resilience against significant risks from climate change. The challenge arises from spatial heterogeneity and the need to recover finer-scale features while ensuring model generalization. Most downscaling methods [21] fail to capture the spatial dependencies at finer scales and underperform on real-world climate datasets, such as sea-level rise. We propose a novel Kriging-informed Conditional Diffusion Probabilistic Model (Ki-CDPM) to capture spatial variability while preserving fine-scale features. Experimental results on climate data show that our proposed method is more accurate than state-of-the-art downscaling techniques.
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 372-383
Open AccessTowards Kriging-informed Conditional Diffusion for Regional Sea-Level Data Downscaling: A Summary of Results
Given coarser-resolution projections from global climate models or satellite data, the downscaling problem aims to estimate finer-resolution regional climate data, capturing fine-scale spatial patterns and variability. Downscaling is any method to derive high-resolution data from low-resolution variables, often to provide more detailed and local predictions and analyses. This problem is societally crucial for effective adaptation, mitigation, and resilience against significant risks from climate change. The challenge arises from spatial heterogeneity and the need to recover finer-scale features while ensuring model generalization. Most downscaling methods [21] fail to capture the spatial dependencies at finer scales and underperform on real-world climate datasets, such as sea-level rise. We propose a novel Kriging-informed Conditional Diffusion Probabilistic Model (Ki-CDPM) to capture spatial variability while preserving fine-scale features. Experimental results on climate data show that our proposed method is more accurate than state-of-the-art downscaling techniques.
- Open Access
- 12 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 15 (5) , 1-31
Physics-Based Abnormal Trajectory Gap Detection
Given trajectories with gaps (i.e., missing data), we investigate algorithms to identify abnormal gaps in trajectories which occur when a given moving object did not report its location, but other moving objects in the same geographic region periodically did. The problem is important due to its societal applications, such as improving maritime safety and regulatory enforcement for global security concerns, such as illegal fishing, illegal oil transfers, and trans-shipments. The problem is challenging due to the difficulty of bounding the possible locations of the moving object during a trajectory gap, and the very high computational cost of detecting gaps in such a large volume of location data. The current literature on anomalous trajectory detection assumes linear interpolation within gaps, which may not be able to detect abnormal gaps since objects within a given region may have traveled away from their shortest path. In preliminary work, we introduced an abnormal gap measure that uses a classical space-time prism model to bound an object's possible movement during the trajectory gap and provided a scalable memoized gap detection algorithm (Memo-AGD). In this article, we propose a space time-aware gap detection (STAGD) approach to leverage space-time indexing and merging of trajectory gaps. We also incorporate a dynamic region merge-based (DRM) approach to efficiently compute gap abnormality scores. We provide theoretical proofs that both algorithms are correct and complete and also provide analysis of asymptotic time complexity. Experimental results on synthetic and real-world maritime trajectory data show that the proposed approach substantially improves computation time over the baseline technique.
- 12 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 15 (5) , 1-31
Open AccessPhysics-Based Abnormal Trajectory Gap Detection
Given trajectories with gaps (i.e., missing data), we investigate algorithms to identify abnormal gaps in trajectories which occur when a given moving object did not report its location, but other moving objects in the same geographic region periodically did. The problem is important due to its societal applications, such as improving maritime safety and regulatory enforcement for global security concerns, such as illegal fishing, illegal oil transfers, and trans-shipments. The problem is challenging due to the difficulty of bounding the possible locations of the moving object during a trajectory gap, and the very high computational cost of detecting gaps in such a large volume of location data. The current literature on anomalous trajectory detection assumes linear interpolation within gaps, which may not be able to detect abnormal gaps since objects within a given region may have traveled away from their shortest path. In preliminary work, we introduced an abnormal gap measure that uses a classical space-time prism model to bound an object's possible movement during the trajectory gap and provided a scalable memoized gap detection algorithm (Memo-AGD). In this article, we propose a space time-aware gap detection (STAGD) approach to leverage space-time indexing and merging of trajectory gaps. We also incorporate a dynamic region merge-based (DRM) approach to efficiently compute gap abnormality scores. We provide theoretical proofs that both algorithms are correct and complete and also provide analysis of asymptotic time complexity. Experimental results on synthetic and real-world maritime trajectory data show that the proposed approach substantially improves computation time over the baseline technique.