Results 211 to 220 of about 10,550 (260)

Arti4D: Statistical Analysis and Modelling of the Spatio‐temporal Variability in Articulated 4D Shapes

open access: yesComputer Graphics Forum, EarlyView.
Abstract We propose a novel framework for the statistical modeling and analysis of the spatio‐temporal shape variability in articulated 4D (i.e., 3D + time) shapes such as human bodies and animals. We treat articulated 3D shapes, represented using parametric models such as SMPL or its variants, as elements of the product space of shape and pose ...
Z. Li, A. Amrani, S. Rai, H. Laga
wiley   +1 more source

CuRast: Cuda‐Based Software Rasterization for Billions of Triangles

open access: yesComputer Graphics Forum, EarlyView.
Abstract This paper presents a CUDA‐based software rasterizer capable of rendering up to a billion unique triangles, or up to 4 billion instanced triangles, in real time at 60 fps on an RTX 5090. By specifically targeting dense, opaque meshes, our approach is able to outperform the native GPU rasterization pipeline in these scenarios.
M. Schütz   +3 more
wiley   +1 more source

Weighted dynamic time warping for time series classification

Pattern Recognition, 2011
Dynamic time warping (DTW), which finds the minimum path by providing non-linear alignments between two time series, has been widely used as a distance measure for time series classification and clustering. However, DTW does not account for the relative importance regarding the phase difference between a reference point and a testing point.
Myong K Jeong, Young-Seon Jeong
exaly   +3 more sources

Weighted Dynamic Time Warping for Time Series

International Journal of Bifurcation and Chaos, 2023
Recurrence network is a typical time series analysis method. However, irregular sampling may overshadow the dynamic features characterized by traditional recurrence network method, which makes the method ineffective. This paper introduces dynamic time warping method to determine the distance between time series segments.
Guangyu Yang, Shuyan Xia
openaire   +2 more sources

Dynamic time warping in hardware

Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services, 2012
The Dynamic Time Warping (DTW) algorithm is a commonly used algorithm in matching time sequence data in many applications that require some kind of similarity measure. Though effective, DTW is computationally intensive, and therefore is not suitable for real-time situations. In the past 30 years, there has been some research work on implementing DTW in
Kin Fun Li, James Shueyen Tai
openaire   +1 more source

DYNAMIC POSITIONAL WARPING: DYNAMIC TIME WARPING FOR ONLINE HANDWRITING

International Journal of Pattern Recognition and Artificial Intelligence, 2009
This paper addresses the problem of dynamic time warping (DTW) causing unintended matching correspondences when it is employed for online two-dimensional (2D) handwriting signals, and proposes the concept of dynamic positional warping (DPW) in conjunction with DTW for online handwriting matching problems. The proposed DPW allows subsignal translations
Won-Du Chang, Jungpil Shin 0001
openaire   +1 more source

Clustering Paths With Dynamic Time Warping

2020 Working Conference on Software Visualization (VISSOFT), 2020
Studying software visualization often includes the evaluation of paths collected from participants of a study (e.g., eye tracking or movements in virtual worlds). In this paper, we explore clustering techniques to automate the process of grouping similar paths.
Rainer Koschke, Marcel Steinbeck
openaire   +1 more source

Quaternion Dynamic Time Warping

IEEE Transactions on Signal Processing, 2012
Dynamic time warping (DTW) is used for the comparison and processing of nonlinear signals and constitutes a widely researched field of study. The method has been initially designed for, and applied to, signals representing audio data. Afterwords it has been successfully modified and applied to many other fields of study.
openaire   +1 more source

Exact indexing of dynamic time warping

Knowledge and Information Systems, 2005
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has been forcefully shown that the Euclidean distance is a very brittle distance measure.
Eamonn J. Keogh   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy