Searcharxiv⌕ Search

arXiv subjects

Belkacem Zouilekh

Publications and source records attributed to Belkacem Zouilekh.

2 recordsLinked to original sources

Evaluating Synthetic Data for Baggage Trolley Detection in Airport Logistics

Efficient luggage trolley management is critical for reducing congestion and ensuring asset availability in modern airports. Automated detection systems face two main challenges. First, strict security and privacy regulations limit large-scale data collection. Second, existing public datasets lack the diversity, scale, and annotation quality needed to handle dense, overlapping trolley arrangements typical of real-world operations. To address these limitations, we introduce a synthetic data generation pipeline based on a high-fidelity Digital Twin of Algiers International Airport using NVIDIA Omniverse. The pipeline produces richly annotated data with oriented bounding boxes, capturing complex trolley formations, including tightly nested chains. We evaluate YOLO-OBB using five training strategies: real-only, synthetic-only, linear probing, full fine-tuning, and mixed training. This allows us to assess how synthetic data can complement limited real-world annotations. Our results show that mixed training with synthetic data and only 40 percent of real annotations matches or exceeds the full real-data baseline, achieving 0.94 mAP@50 and 0.77 mAP@50-95, while reducing annotation effort by 25 to 35 percent. Multi-seed experiments confirm strong reproducibility with a standard deviation below 0.01 on mAP@50, demonstrating the practical effectiveness of synthetic data for automated trolley detection.

cs.CV↗

Hybrid cuckoo search algorithm for the minimum dominating set problem

The notions of dominating sets of graphs began almost 400 years ago with the game of chess, which sparked the analysis of dominating sets of graphs, at first relatively loosely until the beginnings of the 1960s, when the issue was given mathematical description. It's among the most important problems in graph theory, as well as an NP-Complete problem that can't be solved in polynomial time. As a result, we describe a new hybrid cuckoo search technique to tackle the MDS problem in this work. Cuckoo search is a well-known metaheuristic famed for its capacity for exploring a large area of the search space, making it useful for diversification. However, to enhance performance, we incorporated intensification techniques in addition to the genetic crossover operator in the suggested approach. The comparison of our method with the corresponding state-of-the-art techniques from the literature is presented in an exhaustive experimental test. The suggested algorithm outperforms the present state of the art, according to the obtained results.

cs.NE↗