Manoj Babu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Manoj Babu has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Dariusz Ceglarek
Warwick Manufacturing Group (WMG), University of Warwick, Coventry CV4 7AL, UK
5 shared publications - Prashant Shekhar
Department of Mathematics, Embry-Riddle Aeronautical University, Daytona Beach, FL, USA
4 shared publications Pasquale Franciosa
3 shared publications- Pasquale Franciosa
Warwick Manufacturing Group (WMG), University of Warwick, Coventry CV4 7AL, UK
2 shared publications - Saurabh Pratap
Indian Institute of Technology BHU
2 shared publications - Abani Patra
Data Intensive Studies Center, Tufts University, Medford, MA 02155, USA
1 shared publication
Latest Publications
- Open Access
Cross-Model Transferability of Adversarial Patches in Real-time Segmentation for Autonomous Driving
Adversarial attacks pose a significant threat to deep learning models, particularly in safety-critical applications like healthcare and autonomous driving. Recently, patch based attacks have demonstrated effectiveness in real-time inference scenarios owing to their 'drag and drop' nature. Following this idea for Semantic Segmentation (SS), here we propose a novel Expectation Over Transformation (EOT) based adversarial patch attack that is more realistic for autonomous vehicles. To effectively train this attack we also propose a 'simplified' loss function that is easy to analyze and implement. Using this attack as our basis, we investigate whether adversarial patches once optimized on a specific SS model, can fool other models or architectures. We conduct a comprehensive cross-model transferability analysis of adversarial patches trained on SOTA Convolutional Neural Network (CNN) models such PIDNet-S, PIDNet-M and PIDNet-L, among others. Additionally, we also include the Segformer model to study transferability to Vision Transformers (ViTs). All of our analysis is conducted on the widely used Cityscapes dataset. Our study reveals key insights into how model architectures (CNN vs CNN or CNN vs. Transformer-based) influence attack susceptibility. In particular, we conclude that although the transferability (effectiveness) of attacks on unseen images of any dimension is really high, the attacks trained against one particular model are minimally effective on other models. And this was found to be true for both ViT and CNN based models. Additionally our results also indicate that for CNN-based models, the repercussions of patch attacks are local, unlike ViTs. Per-class analysis reveals that simple-classes like 'sky' suffer less misclassification than others. The code for the project is available at: https://github.com/p-shekhar/adversarial-patch-transferability
Open AccessCross-Model Transferability of Adversarial Patches in Real-time Segmentation for Autonomous Driving
Adversarial attacks pose a significant threat to deep learning models, particularly in safety-critical applications like healthcare and autonomous driving. Recently, patch based attacks have demonstrated effectiveness in real-time inference scenarios owing to their 'drag and drop' nature. Following this idea for Semantic Segmentation (SS), here we propose a novel Expectation Over Transformation (EOT) based adversarial patch attack that is more realistic for autonomous vehicles. To effectively train this attack we also propose a 'simplified' loss function that is easy to analyze and implement. Using this attack as our basis, we investigate whether adversarial patches once optimized on a specific SS model, can fool other models or architectures. We conduct a comprehensive cross-model transferability analysis of adversarial patches trained on SOTA Convolutional Neural Network (CNN) models such PIDNet-S, PIDNet-M and PIDNet-L, among others. Additionally, we also include the Segformer model to study transferability to Vision Transformers (ViTs). All of our analysis is conducted on the widely used Cityscapes dataset. Our study reveals key insights into how model architectures (CNN vs CNN or CNN vs. Transformer-based) influence attack susceptibility. In particular, we conclude that although the transferability (effectiveness) of attacks on unseen images of any dimension is really high, the attacks trained against one particular model are minimally effective on other models. And this was found to be true for both ViT and CNN based models. Additionally our results also indicate that for CNN-based models, the repercussions of patch attacks are local, unlike ViTs. Per-class analysis reveals that simple-classes like 'sky' suffer less misclassification than others. The code for the project is available at: https://github.com/p-shekhar/adversarial-patch-transferability
- Open Access
- 20 January 2023
- Published by Elsevier in Computer-Aided Design
- Vol. 158
Object Shape Error Modelling and Simulation During Early Design Phase by Morphing Gaussian Random Fields
- 20 January 2023
- Published by Elsevier in Computer-Aided Design
- Vol. 158
Open AccessObject Shape Error Modelling and Simulation During Early Design Phase by Morphing Gaussian Random Fields
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Foundations of Data Science
- Vol. 5 (4) , 520-557
Hierarchical regularization networks for sparsification based learning on noisy datasets
We propose a hierarchical learning strategy aimed at generating sparse representations and associated models for noisy datasets. The hierarchy follows from approximation spaces identified at successively finer scales. For promoting model generalization at each scale, we also introduce a novel, projection-based penalty operator across multiple dimension, using permutation operators for incorporating proximity and ordering information. The paper presents a detailed analysis of stability and approximation properties in the reconstruction Reproducing Kernel Hilbert Spaces (RKHS) with emphasis on optimality and consistency of predictions, and behavior of error functionals associated with the produced sparse representations. Results show the data reduction and modeling capabilities of our approach on both synthetic (univariate and multivariate) and multivariate real datasets. For demonstrating the quality of our results, we compare the performance with multiple variants of Gaussian Processes with respect to performance measures of optimal smoothing and generalization. Being a sparsity driven approach, we also compare our results with widely successful sparse algorithms such as Relevance Vector Machines (RVM) and greedy approaches like Orthogonal Matching Pursuit (OMP). The superior performance of our approach on majority of experiments, as compared to the optimized implementation of these widely used algorithms, clearly justify the usefulness of the proposed approach.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Foundations of Data Science
- Vol. 5 (4) , 520-557
Hierarchical regularization networks for sparsification based learning on noisy datasets
We propose a hierarchical learning strategy aimed at generating sparse representations and associated models for noisy datasets. The hierarchy follows from approximation spaces identified at successively finer scales. For promoting model generalization at each scale, we also introduce a novel, projection-based penalty operator across multiple dimension, using permutation operators for incorporating proximity and ordering information. The paper presents a detailed analysis of stability and approximation properties in the reconstruction Reproducing Kernel Hilbert Spaces (RKHS) with emphasis on optimality and consistency of predictions, and behavior of error functionals associated with the produced sparse representations. Results show the data reduction and modeling capabilities of our approach on both synthetic (univariate and multivariate) and multivariate real datasets. For demonstrating the quality of our results, we compare the performance with multiple variants of Gaussian Processes with respect to performance measures of optimal smoothing and generalization. Being a sparsity driven approach, we also compare our results with widely successful sparse algorithms such as Relevance Vector Machines (RVM) and greedy approaches like Orthogonal Matching Pursuit (OMP). The superior performance of our approach on majority of experiments, as compared to the optimized implementation of these widely used algorithms, clearly justify the usefulness of the proposed approach.
- Open Access
Object shape error modelling and simulation during early design stage by morphing Gaussian Random Fields
Geometric and dimensional variations in objects are caused by inevitable uncertainties in manufacturing processes and often lead to product quality issues. Failing to model the effect object shape errors, i.e., geometric and dimensional errors of parts, early during design phase inhibits the ability to predict such quality issues; consequently leading to expensive design changes after freezing of design. State-of-Art methodologies for modelling and simulating object shape error have limited defect fidelity, data versatility, and designer centricity that prevent their effective application during early design phase. Overcoming these limitations a novel Morphing Gaussian Random Field (MGRF) methodology for object shape error modelling and simulation is presented in this paper. The MGRF methodology has (i) high defect fidelity and is capable of simulating various part defects including local and global deformations, and technological patterns; (ii) high data versatility and can effectively simulate non-ideal parts under the constraint of limited data availability and can utilise historical non-ideal part data; (iii) designer centric capabilities such as performing `what if?' analysis of practically relevant defects; and (iv) capability to generate non-ideal parts conforming to statistical form tolerance specification. The aforementioned capabilities enable MGRF methodology to accurately model and simulate the effect of object shape variations on product quality during the early design phase. This is achieved by first, modelling the spatial correlation in the deviations of the part from its design nominal using Gaussian Random Field and then, utilising the modelled spatial correlations to generate non-ideal parts by conditional simulations. Practical applications of developed MGRF methodology and its advantages are demonstrated using sport-utility-vehicle door parts.
Open AccessObject shape error modelling and simulation during early design stage by morphing Gaussian Random Fields
Geometric and dimensional variations in objects are caused by inevitable uncertainties in manufacturing processes and often lead to product quality issues. Failing to model the effect object shape errors, i.e., geometric and dimensional errors of parts, early during design phase inhibits the ability to predict such quality issues; consequently leading to expensive design changes after freezing of design. State-of-Art methodologies for modelling and simulating object shape error have limited defect fidelity, data versatility, and designer centricity that prevent their effective application during early design phase. Overcoming these limitations a novel Morphing Gaussian Random Field (MGRF) methodology for object shape error modelling and simulation is presented in this paper. The MGRF methodology has (i) high defect fidelity and is capable of simulating various part defects including local and global deformations, and technological patterns; (ii) high data versatility and can effectively simulate non-ideal parts under the constraint of limited data availability and can utilise historical non-ideal part data; (iii) designer centric capabilities such as performing `what if?' analysis of practically relevant defects; and (iv) capability to generate non-ideal parts conforming to statistical form tolerance specification. The aforementioned capabilities enable MGRF methodology to accurately model and simulate the effect of object shape variations on product quality during the early design phase. This is achieved by first, modelling the spatial correlation in the deviations of the part from its design nominal using Gaussian Random Field and then, utilising the modelled spatial correlations to generate non-ideal parts by conditional simulations. Practical applications of developed MGRF methodology and its advantages are demonstrated using sport-utility-vehicle door parts.
- Open Access
- 1 October 2019
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 53, 93-108
Spatio-Temporal Adaptive Sampling for effective coverage measurement planning during quality inspection of free form surfaces using robotic 3D optical scanner
- 1 October 2019
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 53, 93-108
Open AccessSpatio-Temporal Adaptive Sampling for effective coverage measurement planning during quality inspection of free form surfaces using robotic 3D optical scanner
- Open Access
- 1 January 2018
- Published by Elsevier in Procedia CIRP
- Vol. 75, 279-284
Shape Error Modelling and Analysis by Conditional Simulations of Gaussian Random Fields for Compliant Non-Ideal Sheet Metal Parts
- 1 January 2018
- Published by Elsevier in Procedia CIRP
- Vol. 75, 279-284
Open AccessShape Error Modelling and Analysis by Conditional Simulations of Gaussian Random Fields for Compliant Non-Ideal Sheet Metal Parts
- Open Access
- 1 January 2017
- Published by Elsevier in Procedia CIRP
- Vol. 60, 26-31
Adaptive Measurement and Modelling Methodology for In-line 3D Surface Metrology Scanners
- 1 January 2017
- Published by Elsevier in Procedia CIRP
- Vol. 60, 26-31
Open AccessAdaptive Measurement and Modelling Methodology for In-line 3D Surface Metrology Scanners
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1174-1178
The robust quay crane allocation for a discrete bulk material handling port
This study investigates the quay crane allocation problem with respect to vessel assigned to a particular discrete berth at a bulk material handling port. In the proposed model,vessels at the anchorage are berthed on a First in, first out (FIFO) basis at the port, and then the quay cranes are assigned to the berth dynamically before berthing and during unloading of the vessel. To solve the model, we used the Block Based Genetic Algorithm (BBGA) and Genetic Algorithm (GA). Computational study is conducted using the real data provided by a port located on theEastern Coast of India.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1174-1178
The robust quay crane allocation for a discrete bulk material handling port
This study investigates the quay crane allocation problem with respect to vessel assigned to a particular discrete berth at a bulk material handling port. In the proposed model,vessels at the anchorage are berthed on a First in, first out (FIFO) basis at the port, and then the quay cranes are assigned to the berth dynamically before berthing and during unloading of the vessel. To solve the model, we used the Block Based Genetic Algorithm (BBGA) and Genetic Algorithm (GA). Computational study is conducted using the real data provided by a port located on theEastern Coast of India.
- 25 November 2015
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (14) , 4182-4204
Integrated scheduling of rake and stockyard management with ship berthing: a block based evolutionary algorithm
An integrated problem of optimising the operations at a commercial bulk material port terminal is studied in this paper. We simultaneously optimise the stockyard operations and rake schedule for outbound cargo, in conjunction with the arriving vessels and the status of the stockyards at the port. A mixed integer linear programming model for the problem is developed while incorporating the inherent complexities of the integrated model. To solve the real-life instances, two heuristic methods are proposed specifically for the considered problem. Firstly, genetic algorithm coupled with a greedy heuristic and later, block-based evolutionary algorithm (BBEA) is employed. After applying both techniques, we obtain the optimised schedule for loading of rakes and allotment of stockyard space for vessels as well as rakes at the terminal. Finally, we test the results of both models in three traffic scenarios between themselves and with real-life data from a port situated along the Eastern coast of India. The study resulted in significant reduction of turnaround time for rakes at the port terminal, which in turn lead to monetary savings. The model also automates the day to day operational decision-making at the port.
- 25 November 2015
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (14) , 4182-4204
Integrated scheduling of rake and stockyard management with ship berthing: a block based evolutionary algorithm
An integrated problem of optimising the operations at a commercial bulk material port terminal is studied in this paper. We simultaneously optimise the stockyard operations and rake schedule for outbound cargo, in conjunction with the arriving vessels and the status of the stockyards at the port. A mixed integer linear programming model for the problem is developed while incorporating the inherent complexities of the integrated model. To solve the real-life instances, two heuristic methods are proposed specifically for the considered problem. Firstly, genetic algorithm coupled with a greedy heuristic and later, block-based evolutionary algorithm (BBEA) is employed. After applying both techniques, we obtain the optimised schedule for loading of rakes and allotment of stockyard space for vessels as well as rakes at the terminal. Finally, we test the results of both models in three traffic scenarios between themselves and with real-life data from a port situated along the Eastern coast of India. The study resulted in significant reduction of turnaround time for rakes at the port terminal, which in turn lead to monetary savings. The model also automates the day to day operational decision-making at the port.