BiFormer for Scene Graph Generation Based on VisionNet With Taylor Hiking Optimization Algorithm

Scene Graph Generation (SGG) plays a vital role in determining the graph structure of an image by classifying objects based on their pairwise visual relationships. In the SGG, visually grouped graphs are generated by considering edges as visual relationships between objects and nodes as object classes. Various schemes have been developed to generate scene graphs; however, these techniques require significant computational resources and time for the SGG. In this study, a deep learning-based optimization model, VisionNet_Taylor Hiking Optimization Algorithm (VisionNet_THOA), was introduced to generate high-quality scene graphs from noisy samples. Here, objects were detected by performing semantic segmentation using dynamic routing. The attention areas and actions were determined using the BiFormer method. The nodes in the graph are signified as detected objects and the detected action is represented by edges. Prediction head classification was performed to measure the accuracy of predicting object labels and relationships using VisionNet. The superiority of VisionNet is increased by training the hyperparameters using the Taylor hiking optimization algorithm (THOA). Furthermore, extensive experimental results were obtained using VisionNet_THOA, where VisionNet_THOA attained an accuracy of 94.867%, a True Negative Rate (TNR) of 93.877%, and a True Positive Rate (TPR) of 96.654%, a Precision of 91.765%, and F-Measure of 94.146%.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3555230
Primary Topic
Geographic Information Systems Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

BiFormer for Scene Graph Generation Based on VisionNet With Taylor Hiking Optimization Algorithm

S Monesh
1 links
IEEE Access
Geographic Information Systems Studies
article

BiFormer for Scene Graph Generation Based on VisionNet With Taylor Hiking Optimization Algorithm

S Monesh
article en

Abstract

Scene Graph Generation (SGG) plays a vital role in determining the graph structure of an image by classifying objects based on their pairwise visual relationships. In the SGG, visually grouped graphs are generated by considering edges as visual relationships between objects and nodes as object classes. Various schemes have been developed to generate scene graphs; however, these techniques require significant computational resources and time for the SGG. In this study, a deep learning-based optimization model, VisionNet_Taylor Hiking Optimization Algorithm (VisionNet_THOA), was introduced to generate high-quality scene graphs from noisy samples. Here, objects were detected by performing semantic segmentation using dynamic routing. The attention areas and actions were determined using the BiFormer method. The nodes in the graph are signified as detected objects and the detected action is represented by edges. Prediction head classification was performed to measure the accuracy of predicting object labels and relationships using VisionNet. The superiority of VisionNet is increased by training the hyperparameters using the Taylor hiking optimization algorithm (THOA). Furthermore, extensive experimental results were obtained using VisionNet_THOA, where VisionNet_THOA attained an accuracy of 94.867%, a True Negative Rate (TNR) of 93.877%, and a True Positive Rate (TPR) of 96.654%, a Precision of 91.765%, and F-Measure of 94.146%.

IEEE AccessVol. 13
Vellore Institute of Technology University (IN)
Openalex Percentile: Top 93%
Geographic Information Systems Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.