Student Work
Improved Two-Dimensional Warping
PúblicoContenido Descargable
open in viewerThe well-known dynamic programming time warping algorithm (DTW) provides an optimal matching between 1-dimensional sequences in polynomial time. Finding an optimal 2-dimensional warping is an NP-complete problem. Hence, only approximate non-exponential time 2-dimensional warping algorithms currently exist. A polynomial time 2-dimensional approximation algorithm was proposed recently. This project provides a thorough analytical and experimental study of this algorithm. Its time complexity is improved from O(N^6) to O(N^4). An extension of the algorithm to 3D and potential higher-dimensional applications are described.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Creator
- Publisher
- Identifier
- E-project-082405-130422
- Advisor
- Year
- 2005
- Date created
- 2005-08-24
- Resource type
- Major
- Rights statement
Las relaciones
- En Collection:
Elementos
Elementos
Miniatura | Título | Visibilidad | Embargo Release Date | Acciones |
---|---|---|---|---|
mqp-piotrm.pdf | Público | Descargar |
Permanent link to this page: https://digital.wpi.edu/show/6q182m903