arXiv subjects

Sumit Mishra

Publications and source records attributed to Sumit Mishra.

6 recordsLinked to original sources

arXiv2023

Road Redesign Technique Achieving Enhanced Road Safety by Inpainting with a Diffusion Model

Road infrastructure can affect the occurrence of road accidents. Therefore, identifying roadway features with high accident probability is crucial. Here, we introduce image inpainting that can assist authorities in achieving safe roadway design with minimal intervention in the current roadway structure. Image inpainting is based on inpainting safe roadway elements in a roadway image, replacing accident-prone (AP) features by using a diffusion model. After object-level segmentation, the AP features identified by the properties of accident hotspots are masked by a human operator and safe roadway elements are inpainted. With only an average time of 2 min for image inpainting, the likelihood of an image being classified as an accident hotspot drops by an average of 11.85%. In addition, safe urban spaces can be designed considering human factors of commuters such as gaze saliency. Considering this, we introduce saliency enhancement that suggests chrominance alteration for a safe road view.

cs.CV↗

arXiv2022

Adaptive Traffic Signal Control for Developing Countries Using Fused Parameters Derived from Crowd-Source Data

Advancement of mobile technologies has enabled economical collection, storage, processing, and sharing of traffic data. These data are made accessible to intended users through various application program interfaces (API) and can be used to recognize and mitigate congestion in real time. In this paper, quantitative (time of arrival) and qualitative (color-coded congestion levels) data were acquired from the Google traffic APIs. New parameters that reflect heterogeneous traffic conditions were defined and utilized for real-time control of traffic signals while maintaining the green-to-red time ratio. The proposed method utilizes a congestion-avoiding principle commonly used in computer networking. Adaptive congestion levels were observed on three different intersections of Delhi (India), in peak hours. It showed good variation, hence sensitive for the control algorithm to act efficiently. Also, simulation study establishes that proposed control algorithm decreases waiting time and congestion. The proposed method provides an inexpensive alternative for traffic sensing and tracking technologies.

physics.soc-ph↗

arXiv2022

Sensing accident-prone features in urban scenes for proactive driving and accident prevention

In urban cities, visual information on and along roadways is likely to distract drivers and lead to missing traffic signs and other accident-prone (AP) features. To avoid accidents due to missing these visual cues, this paper proposes a visual notification of AP-features to drivers based on real-time images obtained via dashcam. For this purpose, Google Street View images around accident hotspots (areas of dense accident occurrence) identified by a real-accident dataset are used to train a novel attention module to classify a given urban scene into an accident hotspot or a non-hotspot (area of sparse accident occurrence). The proposed module leverages channel, point, and spatial-wise attention learning on top of different CNN backbones. This leads to better classification results and more certain AP-features with better contextual knowledge when compared with CNN backbones alone. Our proposed module achieves up to 92% classification accuracy. The capability of detecting AP-features by the proposed model were analyzed by a comparative study of three different class activation map (CAM) methods, which were used to inspect specific AP-features causing the classification decision. Outputs of CAM methods were processed by an image processing pipeline to extract only the AP-features that are explainable to drivers and notified using a visual notification system. Range of experiments was performed to prove the efficacy and AP-features of the system. Ablation of the AP-features taking 9.61%, on average, of the total area in each image increased the chance of a given area to be classified as a non-hotspot by up to 21.8%.

cs.CV↗

arXiv2022

RelMobNet: End-to-end relative camera pose estimation using a robust two-stage training

Relative camera pose estimation, i.e. estimating the translation and rotation vectors using a pair of images taken in different locations, is an important part of systems in augmented reality and robotics. In this paper, we present an end-to-end relative camera pose estimation network using a siamese architecture that is independent of camera parameters. The network is trained using the Cambridge Landmarks data with four individual scene datasets and a dataset combining the four scenes. To improve generalization, we propose a novel two-stage training that alleviates the need of a hyperparameter to balance the translation and rotation loss scale. The proposed method is compared with one-stage training CNN-based methods such as RPNet and RCPNet and demonstrate that the proposed model improves translation vector estimation by 16.11%, 28.88%, and 52.27% on the Kings College, Old Hospital, and St Marys Church scenes, respectively. For proving texture invariance, we investigate the generalization of the proposed method augmenting the datasets to different scene styles, as ablation studies, using generative adversarial networks. Also, we present a qualitative assessment of epipolar lines of our network predictions and ground truth poses.

cs.CV↗

arXiv2021

Socially acceptable route planning and trajectory behavior analysis of personal mobility device for mobility management with improved sensing

In urban cities, with increasing acceptability of shared spaces used by pedestrians and personal mobility devices (PMDs), there is need for pragmatic socially ac-ceptable path planning and navigation management policies. Hence, we propose a socially acceptable global route planner and assess the legibility of the resulting global route. Our approach proposed for choosing global route avoids streets penetrating shared spaces and main routes with high probability of dense usage. The experimental study shows that socially acceptable routes can be effectively found with an average of 10 % increment of route length with optimal hyperpa-rameters. This helps PMDs to reach the goal while taking a socially acceptable and safe route with minimal interaction of different PMDs and pedestrians. When PMDs interact with pedestrians and other types of PMDs in shared spaces, mi-cro-mobility simulations are of prime usage for acceptable and safe navigation policy. Social force models being state of the art for pedestrian simulation are cal-ibrated for capturing random movements of pedestrian behavior. Social force model with calibration can imitate the required behavior of PMDs in a pedestrian mix navigation scheme. Based on calibrated models, simulations on shared space links and gate structures are performed to assist policies related to deciding wait-ing and stopping time. Also, based on simulated PMDs interaction with pedestri-ans, location data with finer resolution can be obtained if the resolution of GPS sensor is 0.2 m or less. This will help in formalizing better modelling and hence better micro-mobility policies.

cs.RO↗

arXiv2015

Improved Solution to the Non-Domination Level Update Problem

Non-domination level update problem is to sort the non-dominated fronts after insertion or deletion of a solution. Generally the solution to this problem requires to perform the complete non-dominated sorting which is too expensive in terms of number of comparisons. Recently an Efficient Non-domination Level Update (ENLU) approach is proposed which does not perform the complete sorting. For this purpose, in this paper a space efficient version of ENLU approach is proposed without compromising the number of comparisons. However this approach does not work satisfactorily in all the cases. So we have also proposed another tree based approach for solving this non-domination level update problem. In case of insertion, the tree based approach always checks for same number of fronts unlike linear approach in which the number of fronts to be checked depends on the inserted solution. The result shows that in case where all the solutions are dominating in nature the maximum number of comparisons using tree based approach is $\mathcal{O}(\log N)$ as opposed to $\mathcal{O}(N)$ in ENLU approach. When all the solutions are equally divided into $K$ fronts such that each solution in a front is dominated by all the solutions in the previous front then the maximum number of comparisons to find a deleted solution in case of tree based approach is $K{-}\log K$ less than that of ENLU approach. Using these approaches an on-line sorting algorithm is also proposed and the competitive analysis of this algorithm is also presented.

cs.DS↗