Anton Sergeev

Anton Sergeev


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
30 July 2025
Verified
Book Chapter
Closed access
PDF file
ASAnton Sergeev
Anton Sergeev
IPIlya Petrovanov
Ilya Petrovanov
EKEugine Krouk
Eugine Krouk

20 April 2023
Verified
Book Chapter
Closed access
PDF file
ASAnton Sergeev
Anton Sergeev
RSRostislav Shaniiazov
Rostislav Shaniiazov


15 November 2024 in arXiv
Verified
Preprint
Open access
PDF file
ASAnton Sergeev
Anton Sergeev
VMVictor Minchenkov
Victor Minchenkov
ASAleksei Soldatov
Aleksei Soldatov
VKVasiliy Kakurin
Vasiliy Kakurin
YMYaroslav Mazikov
Yaroslav Mazikov
Various technologies, including computer vision models, are employed for the automatic monitoring of manual assembly processes in production. These models detect and classify events such as the presence of components in an assembly area or the connection of components. A major challenge with detection and classification algorithms is their susceptibility to variations in environmental conditions and unpredictable behavior when processing objects that are not included in the training dataset. As it is impractical to add all possible subjects in the training sample, an alternative solution is necessary. This study proposes a model that simultaneously performs classification and anomaly detection, employing metric learning to generate vector representations of images in a multidimensional space, followed by classification using cross-entropy. For experimentation, a dataset of over 327,000 images was prepared. Experiments were conducted with various computer vision model architectures, and the outcomes of each approach were compared.

20 December 2025 in arXiv
Verified
Preprint
Open access
PDF file
IPIlya Petrovanov
Ilya Petrovanov
ASAnton Sergeev
Anton Sergeev
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: $k$ original packets are encoded into $n\ge k$ coded packets, and the message is reconstructed after the first $k$ successful deliveries, effectively shifting latency from the maximum packet delay to the $k$-th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including a multi-hop Kleinrock-type network, FIFO queues, exponential service and link delays, and explicit receiver-side reconstruction that records message delay and deadline violations. Using paired uncoded ($n{=}k$) and coded ($n{>}k$) configurations at the same message generation rate, we compare delay, reliability, and saturation effects across code rates and input loads. Simulation results show consistent reductions of average delay and late-delivery probability for moderate redundancy, while keeping the saturation throughput close to the uncoded baseline. The proposed model provides a transparent bridge between analytical transport-coding formulas and executable simulation for tuning redundancy in low-latency services.