在时间序列比对中整合先验知识:先验优化时间翘曲

Xiaoguang Yan, W. Gage, A. Eckford
{"title":"在时间序列比对中整合先验知识:先验优化时间翘曲","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":"{\"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}","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

摘要

在本文中,我们提出了先验优化时间翘曲(POTW)算法,该算法允许用户通过从要对齐的序列中标记出匹配的子序列对来整合先验知识。为了减轻用户保证标记完全准确的任务,还可以为每个标记对指定反映匹配确定性的确定性系数。然后,POTW将根据两个序列和给定的匹配对寻找最佳对齐。POTW是现有对齐算法的扩展,在没有先验知识的情况下,能够独立地找到两个序列的最佳对齐。我们将该算法应用于来自CMU运动捕捉数据库的行走序列,以及UJI笔字符数据集,以证明其能够轻松有效地集成先验知识。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Integrating prior knowledge in time series alignment: Prior Optimized Time Warping
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信