资源论文Learning Intrinsic Video Content Using Levenshtein Distance in Graph Partitioning

Learning Intrinsic Video Content Using Levenshtein Distance in Graph Partitioning

2020-03-23 | |  67 |   45 |   0

Abstract

We present a novel approach for automatically learning mod- els of temporal tra jectories extracted from video data. Instead of using a representation of linearly time-normalised vectors of fixed-length, our approach makes use of Dynamic Time Warp distance as a similarity measure to capture the underlying ordered structure of variable-length temporal data while removing the non-linear warping of the time scale. We reformulate the structure learning problem as an optimal graph- partitioning of the dataset to solely exploit Dynamic Time Warp simi- larity weights without the need for intermediate cluster centroid repre- sentations. We extend the graph partitioning method and in particular, the Normalised Cut model originally introduced for static image seg- mentation to unsupervised clustering of temporal tra jectories with fully automated model order selection. By computing hierarchical average Dy- namic Time Warp for each cluster, we learn warp-free tra jectory models and recover the time warp profiles and structural variance in the data. We demonstrate the approach on modelling tra jectories of continuous hand-gestures and moving ob jects in an indoor environment.

上一篇:A Robust PCA Algorithm for Building Representations from Panoramic Images

下一篇:Linear Multi View Reconstruction with Missing Data

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...