Gabor Szucs

Dr. Gabor Szucs

Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, 1117 Budapest, Hungary

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 January 2024 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
LWLongjian Wang
Longjian Wang
SZShuichao Zhang
Shuichao Zhang
Gabor SzucsGabor Szucs
Gabor Szucs
YWYonggang Wang
Yonggang Wang

1 March 2019 in Cybernetics and Information Technologies
Verified
Journal Article
Open access
PDF file
BGBálint Pál Gyires-Tóth
Bálint Pál Gyires-Tóth
MOMárton Osváth
Márton Osváth
DPDávid Papp
Dávid Papp
Gabor SzucsGabor Szucs
Gabor Szucs
The main goal of the present research is to classify images of plants to species with deep learning. We used convolutional neural network architectures for feature learning and fully connected layers with logsoftmax output for classification. Pretrained models on ImageNet were used, and transfer learning was applied. In the current research image sets published in the scope of the PlantCLEF 2015 challenge were used. The proposed system surpasses the results of all top competitors of the challenge by 8% and 7% at observation and image levels, respectively. Our secondary goal was to satisfy the users’ needs in content-based image retrieval to give relevant hits during species search task. We optimized the length of the returned lists in order to maximize MAP (Mean Average Precision), which is critical to the performance of image retrieval. Thus, we achieved more than 50% improvement of MAP in the test set compared to the baseline.

14 December 2022 in Transportation Letters
Verified
Journal Article
Closed access
HPHengyan Pan
Hengyan Pan
YWYonggang Wang
Yonggang Wang
Gabor SzucsGabor Szucs
Gabor Szucs
As a product of China’s transportation development in the last decade, the issue of road traffic crashes among ride-hailing drivers has become a growing concern for public safety. This study aims to investigate the human factors contributing to traffic crashes among traditional taxi and ride-hailing drivers, and to compare the similarities and differences between the two groups of drivers. The data was collected from 877 taxi drivers and 906 full-time ride-hailing drivers through a self-reported survey. The structural equation model was used to investigate structural interrelationships between the financial burden, work-related fatigue (WRF), road safety attitude, aberrant driving behaviors (ADBs) of the drivers and their influences on work-traffic crashes. Relevant results showed that there were significant differences in the work status between the two groups of drivers. The heavy economic burden increased the perception of WRF among taxi drivers and contributed to traffic crashes. Ride-hailing drivers had a more positive attitude toward road safety and controlled their ADBs better. These results will help formulate policy recommendations aimed at improving road safety among taxi and ride-hailing drivers.

19 October 2023 in Multimedia Tools and Applications
Verified
Journal Article
Open access
PDF file
Gabor SzucsGabor Szucs
Gabor Szucs
RBRegő Borsodi
Regő Borsodi
DPDávid Papp
Dávid Papp
The fast improvement of deep learning methods resulted in breakthroughs in image classification, object detection, and object tracking. Autonomous driving and traffic monitoring systems, especially the on-premise installed fixed position multi-camera configurations, benefit greatly from recent advances. In this paper, we propose a Multi-Camera Multi-Target (MCMT) vehicle tracking system using a constrained hierarchical clustering solution, which improves trajectory matching, and thus provides a more robust tracking of objects transitioning between cameras. YOLOv5, ByteTrack, and ResNet50-IBN ReID networks are used for vehicle detection and tracking. Static attributes such as vehicle type and vehicle color are determined from ReID features with SVM. The proposed ReID feature-based attribute categorization shows better performance, than its pure CNN counterpart. Single-camera trajectories (SCTs) are combined into multi-camera trajectories (MCTs) using hierarchical agglomerative clustering (HAC) with time and space constraints (our proposed algorithm is denoted by MCT#MAC). Similarities between SCTs are measured by comparing the mean ReID features cumulated on the trajectory. The system was evaluated on more datasets, and our experiments demonstrate that constraining HAC by manipulating the proximity matrix greatly improves the multi-camera IDF1 score.

12 July 2024 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
RKRichárd Kiss
Richárd Kiss
Gabor SzucsGabor Szucs
Gabor Szucs
Network science has witnessed a surge in popularity, driven by the transformative power of node representation learning for diverse applications like social network analysis and biological modeling. While shallow embedding algorithms excel at capturing network structure, they face a critical limitation—failing to generalize to unseen nodes. This paper addresses this challenge by introducing Inductive Shallow Node Embedding—as a main contribution—pioneering a novel approach that extends shallow embeddings to the realm of inductive learning. It has a novel encoder architecture that captures the local neighborhood structure of each node, enabling effective generalization to unseen nodes. In the generalization, robustness is essential to avoid degradation of performance arising from noise in the dataset. It has been theoretically proven that the covariance of the additive noise term in the proposed model is inversely proportional to the cardinality of a node’s neighbors. Another contribution is a mathematical lower bound to quantify the robustness of node embeddings, confirming its advantage over traditional shallow embedding methods, particularly in the presence of parameter noise. The proposed method demonstrably excels in dynamic networks, consistently achieving over 90% performance on previously unseen nodes compared to nodes encountered during training on various benchmarks. The empirical evaluation concludes that our method outperforms competing methods on the vast majority of datasets in both transductive and inductive tasks.

31 December 2017 in Informatica
Verified
Journal Article
Closed access
DPDávid Papp
Dávid Papp
Gabor SzucsGabor Szucs
Gabor Szucs