{"title":"Integrating prior knowledge in time series alignment: Prior Optimized Time Warping","authors":"Xiaoguang Yan, W. Gage, A. Eckford","doi":"10.1109/CWIT.2013.6621621","DOIUrl":null,"url":null,"abstract":"In this paper, we propose Prior Optimized Time Warping (POTW) algorithm, which allows user to integrate prior knowledge by marking out pairs of matching sub-sequences from the sequences to be aligned. To relieve users of the task of guaranteeing the full accuracy of the marking, a certainty coefficient reflecting the certainty of the matching can also be specified for each marked pairs. POTW will then look for the best alignment based on the two sequences and the given matching pairs. POTW is an extension of existing align algorithm, and in the absence of prior knowledge, is able to independently find the best alignment of two sequences. We apply our algorithm to walk sequences from CMU motion capture database, as well as UJI pen characters dataset to demonstrate its ability to allow easy and effective integration of prior knowledge.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2013.6621621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose Prior Optimized Time Warping (POTW) algorithm, which allows user to integrate prior knowledge by marking out pairs of matching sub-sequences from the sequences to be aligned. To relieve users of the task of guaranteeing the full accuracy of the marking, a certainty coefficient reflecting the certainty of the matching can also be specified for each marked pairs. POTW will then look for the best alignment based on the two sequences and the given matching pairs. POTW is an extension of existing align algorithm, and in the absence of prior knowledge, is able to independently find the best alignment of two sequences. We apply our algorithm to walk sequences from CMU motion capture database, as well as UJI pen characters dataset to demonstrate its ability to allow easy and effective integration of prior knowledge.