SearcharxivSearch

arXiv subjects

Vladislav Makarov

Publications and source records attributed to Vladislav Makarov.

7 recordsLinked to original sources

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.

cs.CV

Bounded Languages Described by GF(2)-grammars

GF(2)-grammars are a recently introduced grammar family with some unusual algebraic properties. They are closely connected to unambiguous grammars. By using the method of formal power series, we establish strong conditions that are necessary for subsets of a^* b^* and a^* b^* c^* to be described by some GF(2)-grammar. By further applying the established results, we settle the long-standing open question of proving inherent ambiguity of the language {a^n b^m c^k | n != m or m != k}$, as well as give a new purely algebraic proof of the inherent ambiguity of the language {a^n b^m c^k}{n = m or m = k}.

cs.FL

Finer characterization of bounded languages described by GF(2)-grammars

GF(2)-grammars are a somewhat recently introduced grammar family that have some unusual algebraic properties and are closely connected to unambiguous grammars. In "Bounded languages described by GF(2)-grammars", Makarov proved a necessary condition for subsets of $a_1^* a_2^* \cdots a_k^*$ to be described by some GF(2)-grammar. By extending these methods further, we prove an even stronger upper bound for these languages. Moreover, we establish a lower bound that closely matches the proven upper bound. Also, we prove the exact characterization for the special case of linear GF(2)-grammars. Finally, by using the previous result, we show that the class of languages described by linear GF(2)-grammars is not closed under GF(2)-concatenation

cs.FL

Why the equivalence problem for unambiguous grammars has not been solved back in 1966?

In 1966, Semenov, by using a technique based on power series, suggested an algorithm that tells apart the languages described by an unambiguous grammar and a DFA. At the first glance, it may appear that the algorithm can be easily modified to yield a full solution of the equivalence problem for unambiguous grammars. This article shows why this hunch is, in fact, incorrect.

cs.FL

Cocke--Younger--Kasami--Schwartz--Zippel algorithm and relatives

The equivalence problem for unambiguous grammars is an important, but very difficult open question in formal language theory. Consider the \emph{limited} equivalence problem for unambiguous grammars -- for two unambiguous grammars $G_1$ and $G_2$, tell whether or not they describe the same set of words of length $n$. Obviously, the naive approach requires exponential time with respect to $n$. By combining two classic algorithmic ideas, I introduce a $O({\rm poly}(n, |G_1|, |G_2|))$ algorithm for this problem. Moreover, the ideas behind the algorithm prove useful in various other scenarious.

cs.FL

Counting ternary square-free words quickly

An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.

cs.FL

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 $n$, there is an automaton with $2^n \cdot \mathrm{poly}(n)$ states which defeats every $n$-state automaton, in the sense that it wins all rounds except for finitely many. Moreover, every such automaton has at least $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.

cs.GT