arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.08058cs.CV

Learning a Fast 3D Spectral Approach to Object Segmentation and Tracking over Space and Time

Bitdefender(比特梵德);University of Bucharest(布加勒斯特大学);Institute of Mathematics of the Romanian Academy(罗马尼亚科学院数学研究所);Politehnica University of Bucharest(布加勒斯特理工大学)

Elena Burceanu, Marius Leordeanu

英文摘要:

We pose video object segmentation as spectral graph clustering in space and time, with one graph node for each pixel and edges forming local space-time neighborhoods. We claim that the strongest cluster in this video graph represents the salient object. We start by introducing a novel and efficient method based on 3D filtering for approximating the spectral solution, as the principal eigenvector of the graph's adjacency matrix, without explicitly building the matrix. This key property allows us to have a fast parallel implementation on GPU, orders of magnitude faster than classical approaches for computing the eigenvector. Our motivation for a spectral space-time clustering approach, unique in video semantic segmentation literature, is that such clustering is dedicated to preserving object consistency over time, which we evaluate using our novel segmentation consistency measure. Further on, we show how to efficiently learn the solution over multiple input feature channels. Finally, we extend the formulation of our approach beyond the segmentation task, into the realm of object tracking. In extensive experiments we show significant improvements over top methods, as well as over powerful ensembles that combine them, achieving state-of-the-art on multiple benchmarks, both for tracking and segmentation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑