High performance is achieved by performing parallel computations for multiple pixels within a macroblock, as well as computing several candidate motion vector (MV) positions in parallel.
The particle filter (PF) approach was not used in our work for two reasons: first, it is difficult to obtain a reasonable computation time for multiple targets (up to 18 in our application) and our prototypes had difficulty maintaining tracks for multiple close targets.
The method is motivated by applications to modelling the fabrication process for microstructured optical fibres (MOFs), also known as "holey fibres", and is therefore tailored for the computation of multiple interacting free boundaries.
In this paper, a generalization of a formula proposed by Van Loan [Computing integrals involving the matrix exponential, IEEE Trans. Automat. Control 23 (1978) 395 404] for the computation of multiple integrals of exponential matrices is introduced.
An exemplary R script for the computation of multiple isotopic signatures is given in the Electronic Supplementary Material.
Furthermore, our method can be applied to efficient computation of multiple Hamming distance values for secure pattern matching (see [20]).
There are two problems with this approach: (1) different evolutionary models can lead to different results, and (2) the computation time required for multiple alignments makes it impossible to analyse the phylogeny of a whole genome.
Comparisons were made with the Mann-Whitney U test with a Benjamini-Hochberg procedure used for false discovery rate computation to correct for multiple hypothesis testing.
