Search results for "Time complexity"

Computation of the Multivariate Oja Median

2003

The multivariate Oja median (Oja, 1983) is an affine equivariant multivariate location estimate with high efficiency. This estimate has a bounded influence function but zero breakdown. The computation of the estimate appears to be highly intensive. We consider different, exact and stochastic, algorithms for the calculation of the value of the estimate. In the stochastic algorithms, the gradient of the objective function, the rank function, is estimated by sampling observation. hyperplanes. The estimated rank function with its estimated accuracy then yields a confidence region for the true sample Oja median, and the confidence region shrinks to the sample median with the increasing number of…

Multivariate Frequency Domain Analysis of Causal Interactions in Physiological Time Series

2011

A common way of obtaining information about a physiological system is to measure one or more signals from the system, consider their temporal evolution in the form of numerical time series, and obtain quantitative indexes through the application of time series analysis techniques. While historical approaches to time series analysis were addressed to the study of single signals, recent advances have made it possible to study collectively the behavior of several signals measured simultaneously from the considered system. In fact, multivariate (MV) time series analysis is nowadays extensively used to characterize interdependencies among multiple signals collected from dynamical physiological s…

Identification of Spatial-Temporal Muscle Synergies from EMG Epochs of Various Durations: A Time-Warped Tensor Decomposition

2018

Extraction of muscle synergies from electromyography (EMG) recordings relies on the analysis of multi-trial muscle activation data. To identify the underlying modular structure, dimensionality reduction algorithms are usually applied to the EMG signals. This process requires a rigid alignment of muscle activity across trials that is typically achieved by the normalization of the length of each trial. However, this time-normalization ignores important temporal variability that is present on single trials as result of neuromechanical processes or task demands. To overcome this limitation, we propose a novel method that simultaneously aligns muscle activity data and extracts spatial and tempor…

Greedy and K-Greedy algoritmhs for multidimensional data association

2011

[EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ is to match groups of $d$ objects in such a way that each measurement is associated with at most one track and each track is associated with at most one measurement from each list, optimizing a certain objective function. It is well known that the MDA problem is NP-hard for $d\geq3$. In this paper five new polynomial time heuristics to solve the MDA problem arising in MTT are presented. They are all based on the semi-greedy approach introduced in earlier research. Experimen…

Generalized person-by-person optimization in team problems with binary decisions

2008

In this paper, we extend the notion of person by person optimization to binary decision spaces. The novelty of our approach is the adaptation to a dynamic team context of notions borrowed from the pseudo-boolean optimization field as completely local-global or unimodal functions and sub- modularity. We also generalize the concept of pbp optimization to the case where the decision makers (DMs) make decisions sequentially in groups of m, we call it mbm optimization. The main contribution are certain sufficient conditions, verifiable in polynomial time, under which a pbp or an mbm optimization algorithm leads to the team-optimum. We also show that there exists a subclass of sub-modular team pr…

WITHDRAWN: Corrigendum to “Detection of change in persistence of a linear time series”: [J. Econom. 95 (2000) 97–116]

2001

Fast Direct Solver for a Time-harmonic Electromagnetic Problem with an Application

2003

A fast direct solution of a periodic problem derived from the time-harmonic Maxwell’s equations is considered. The problem is discretized by low order hexahedral finite elements proposed by Nedelec. The solver is based on the application of FFT, and it has the computational cost O(N log N). An application to scattering of an electromagnetic wave by a periodic structure is presented.

Optimal Impulse Control Problems and Linear Programming

2009

Optimal impulse control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions. In this paper, we identify a special class of optimal impulse control problems which are easy to solve. Easy to solve means that solution algorithms are polynomial in time and therefore suitable to the on-line implementation in real-time problems. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the optimal impulse control problem via a binary linear programming proble…

Convolutional Neural Network-Based Human Movement Recognition Algorithm in Sports Analysis

2021

In order to analyse the sports psychology of athletes and to identify the psychology of athletes in their movements, a human action recognition (HAR) algorithm has been designed in this study. First, a HAR model is established based on the convolutional neural network (CNN) to classify the current action state by analysing the action information of a task in the collected videos. Secondly, the psychology of basketball players displaying fake actions during the offensive and defensive process is investigated by combining with related sports psychological theories. Then, the psychology of athletes is also analysed through the collected videos, so as to predict the next response action of the …

Efficient computation of root mean square deviations under rigid transformations

2013

The computation of root mean square deviations (RMSD) is an important step in many bioinformatics applications. If approached naively, each RMSD computation takes time linear in the number of atoms. In addition, a careful implementation is required to achieve numerical stability, which further increases runtimes. In practice, the structural variations under consideration are often induced by rigid transformations of the protein, or are at least dominated by a rigid component. In this work, we show how RMSD values resulting from rigid transformations can be computed in constant time from the protein's covariance matrix, which can be precomputed in linear time. As a typical application scenar…