Video Similarity Measurement Based on Attributed Relational Graph Matching
نویسندگان
چکیده
In this paper, an original scheme for video similarity detection is proposed in order to establish correspondence between two video sequences. This scheme consists first to summarize the visual contents of a video sequence in a small set of images. Each image is then modeled, by an Attributed Relational Graph (ARG), as the composition of salient objects with specific spatial relationship. Matching two video sequences is thereby reduced to the ARG similarity problem. The proposed approach offers a principled way to define the ARG similarity that accounts for both the attribute and topological differences of the two considered ARGs. Indeed, we proposed herein a cost-efficient solution to find the best alignment between two ARGs. This consists to the minimization of a similarity measure between the two graphs using dynamic programming. This measure can be considered as a matching rate which can be very useful for Content Based Video Retrieval (CBVR) applications. The suggested scheme was preliminary tested on real-world databases and very promising results were observed.
منابع مشابه
Stochastic Attributed Relational Graph Matching for Image Near-Duplicate Detection
Attributed Relational Graph (ARG) is a useful model for representing many real-world relational patterns. Computing the similarity of ARGs is a fundamental problem for ARG based modelling. This report presents a novel stochastic framework for computing the similarity of ARGs, which defines the ARG similarity as the likelihood ratio of the stochastic process that transforms one ARG to the other....
متن کاملFast Matching of Hierarchical Attributed Relational Graphs for an Application to Similarity-Based Image Retrieval
This paper describes the fast matching of hierarchical attributed relational graphs with the aim of applying the method to similarity-based image retrieval. Best-first search algorithm, admissible heuristic function, and maximum permissible cost are proposed to speed up the computation of graph matching. By means of these methods, the average computation time of graph matching speeds up about t...
متن کاملEfficient Matching and Indexing of Graph Models in Content-Based Retrieval
ÐIn retrieval from image databases, evaluation of similarity, based both on the appearance of spatial entities and on their mutual relationships, depends on content representation based on Attributed Relational Graphs. This kind of modeling entails complex matching and indexing, which presently prevents its usage within comprehensive applications. In this paper, we provide a graphtheoretical fo...
متن کاملEvaluation of Spatial Similarity Methods for Image Retrieval
Similarity retrieval by spatial content (i.e., using multiple objects and their interelationships) in Image DataBases (IDBs) is still an open problem and has received considerable attention in the literature. In this work, we focus our attention on “queries by example” image and we study methods for answering such queries including the well accepted “editing distance” on Attributed Relational G...
متن کاملAn efficient graph-based recognizer for hand-drawn symbols
We describe a trainable, multi-stroke symbol recognizer for pen-based user interfaces. The approach is insensitive to orientation, nonuniform scaling, and drawing order. Symbols are represented internally as attributed relational graphs describing both the geometry and topology of the symbols. Symbol definitions are statistical models, which makes the approach robust to variations common in han...
متن کامل