Source author record

Vladislav Makarov

Explore this author’s publications, collaborators and research topics. This catalog record has not been claimed by its author.

ResearcherUnclaimed source record

Catalog footprint

Research overview

2works
3topics
2close collaborators

Published work

2 publications

preprint2026arXiv

SceneGraphVLM: Dynamic Scene Graph Generation from Video with Vision-Language Models

Scene graph generation provides a compact structured representation for visual perception, but accurate and fast graph prediction from images and videos remains challenging. Recent VLM-based methods can generate scene graphs end-to-end as structured text, yet often produce long outputs with irrelevant objects and relations. We present SceneGraphVLM, a compact method for image and video scene graph generation with small visual language models. SceneGraphVLM serializes graphs in a token-efficient TOON format and trains the model in two stages: supervised fine-tuning followed by reinforcement learning with hallucination-aware rewards that balance relation coverage and precision while penalizing unsupported objects and relations. For videos, the model can optionally condition each frame on the previously generated graph, providing lightweight short-term context without tracking or post-processing. We evaluate SceneGraphVLM on PSG, PVSG, and Action Genome. With compact VLMs and vLLM-accelerated decoding, SceneGraphVLM achieves a strong quality-speed trade-off, improves precision-oriented SGG metrics while preserving reasonable recall, and generates complete scene graphs with approximately one-second latency. Code and implementation details are available at: https://github.com/markus0440/SceneGraphVLM.git.

preprint2020arXiv

Playing odds and evens with finite automata

This paper is concerned with asymptotic behaviour of a repeated game of "odds and evens", with strategies of both players represented by finite automata. It is proved that, for every nn, there is an automaton with 2n⋅poly(n)2^n \cdot \mathrm{poly}(n) states which defeats every nn-state automaton, in the sense that it wins all rounds except for finitely many. Moreover, every such automaton has at least 2n⋅(1−o(1))2^n \cdot (1 - o(1)) states, meaning that the upper bound is tight up to polynomial factors. This is a significant improvement over a classic result of Ben-Porath in the special case of "odds and evens". Moreover, I conjecture that the approach can be generalised to arbitrary zero-sum games.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.