{"title":"A novel multi-metric scheme using dynamic time warping for similarity video clip search","authors":"Haomin Cui, Ming Zhu","doi":"10.1109/ICSPCC.2013.6663926","DOIUrl":null,"url":null,"abstract":"In this paper, we describe an approach to video retrieval based on a multi-metric scheme. The video clip is represented by an ordered list of global frame features with systematic sampling. Similarity is measured by the combination order of feature vectors, which can be well described by the dynamic time warping method. However, it is still computationally expensive to make pairwise comparison in huge databases. To improve the search efficiency, we propose the category rate and dispersion rate as additional metrics of similar vector points to describe converge of origin series and filter out irrelevant candidates. A cheap-to-compute low bound estimate of dynamic time warping with Jaccard distance is also used to prune off unpromising candidates in KNN similar video search process. Experimental results on two benchmark databases show the efficiency of proposed approach.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSPCC.2013.6663926","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, we describe an approach to video retrieval based on a multi-metric scheme. The video clip is represented by an ordered list of global frame features with systematic sampling. Similarity is measured by the combination order of feature vectors, which can be well described by the dynamic time warping method. However, it is still computationally expensive to make pairwise comparison in huge databases. To improve the search efficiency, we propose the category rate and dispersion rate as additional metrics of similar vector points to describe converge of origin series and filter out irrelevant candidates. A cheap-to-compute low bound estimate of dynamic time warping with Jaccard distance is also used to prune off unpromising candidates in KNN similar video search process. Experimental results on two benchmark databases show the efficiency of proposed approach.