Evaluation of probabilistic occupancy map people detection for surveillance systems

In this paper, we evaluate the Probabilistic Occupancy Map (POM) pedestrian detection algorithm on the PETS 2009 benchmark dataset. POM is a multi-camera generative detection method, which estimates ground plane occupancy from multiple background subtraction views. Occupancy probabilities are iteratively estimated by fitting a synthetic model of the background subtraction to the binary foreground motion. Furthermore, we test the integration of this algorithm into a larger framework designed for understanding human activities in real environments. We demonstrate accurate detection and localization on the PETS dataset, despite suboptimal calibration and foreground motion segmentation input.

Simple adaptive momentum: new algorithm for training multilayer perceptrons

The speed of convergence while training is an important consideration in the use of neural nets. The authors outline a new training algorithm which reduces both the number of iterations and training time required for convergence of multilayer perceptrons, compared to standard back-propagation and conjugate gradient descent algorithms.

Generalised Dirichelt-to-Neumann map in time dependent domains

We study the heat, linear Schrodinger and linear KdV equations in the domain l(t) < x < ∞, 0 < t < T, with prescribed initial and boundary conditions and with l(t) a given differentiable function. For the first two equations, we show that the unknown Neumann or Dirichlet boundary value can be computed as the solution of a linear Volterra integral equation with an explicit weakly singular kernel. This integral equation can be derived from the formal Fourier integral representation of the solution. For the linear KdV equation we show that the two unknown boundary values can be computed as the solution of a system of linear Volterra integral equations with explicit weakly singular kernels. The derivation in this case makes crucial use of analyticity and certain invariance properties in the complex spectral plane. The above Volterra equations are shown to admit a unique solution.

The plastic self organising map

A novel extension to Kohonen's self-organising map, called the plastic self organising map (PSOM), is presented. PSOM is unlike any other network because it only has one phase of operation. The PSOM does not go through a training cycle before testing, like the SOM does and its variants. Each pattern is thus treated identically for all time. The algorithm uses a graph structure to represent data and can add or remove neurons to learn dynamic nonstationary pattern sets. The network is tested on a real world radar application and an artificial nonstationary problem.

Reduction of invasive tests in chagasic patients with a modified self-organizing map

The applicability of AI methods to the Chagas' disease diagnosis is carried out by the use of Kohonen's self-organizing feature maps. Electrodiagnosis indicators calculated from ECG records are used as features in input vectors to train the network. Cross-validation results are used to modify the maps, providing an outstanding improvement to the interpretation of the resulting output. As a result, the map might be used to reduce the need for invasive explorations in chronic Chagas' disease.

The Dirichlet-to-Neumann map for the elliptic sine Gordon

We analyse the Dirichlet problem for the elliptic sine Gordon equation in the upper half plane. We express the solution $q(x,y)$ in terms of a Riemann-Hilbert problem whose jump matrix is uniquely defined by a certain function $b(\la)$, $\la\in\R$, explicitly expressed in terms of the given Dirichlet data $g_0(x)=q(x,0)$ and the unknown Neumann boundary value $g_1(x)=q_y(x,0)$, where $g_0(x)$ and $g_1(x)$ are related via the global relation $\{b(\la)=0$, $\la\geq 0\}$. Furthermore, we show that the latter relation can be used to characterise the Dirichlet to Neumann map, i.e. to express $g_1(x)$ in terms of $g_0(x)$. It appears that this provides the first case that such a map is explicitly characterised for a nonlinear integrable {\em elliptic} PDE, as opposed to an {\em evolution} PDE.

A genetic linkage map of an apple rootstock progeny anchored to the Malus genome sequence

An apple rootstock progeny raised from the cross between the very dwarfing ‘M.27’ and the more vigorous ‘M.116’ (‘M.M.106’ × ‘M.27’) was used for the construction of a linkage map comprising a total of 324 loci: 252 previously mapped SSRs, 71 newly characterised or previously unmapped SSR loci (including 36 amplified by 33 out of the 35 novel markers reported here), and the self-incompatibility locus. The map spanned the 17 linkage groups (LG) expected for apple covering a genetic distance of 1,229.5 cM, an estimated 91% of the Malus genome. Linkage groups were well populated and, although marker density ranged from 2.3 to 6.2 cM/SSR, just 15 gaps of more than 15 cM were observed. Moreover, only 17.5% of markers displayed segregation distortion and, unsurprisingly in a semi-compatible backcross, distortion was particularly pronounced surrounding the self-incompatibility locus (S) at the bottom of LG17. DNA sequences of 273 SSR markers and the S locus, representing a total of 314 loci in this investigation, were used to anchor to the ‘Golden Delicious’ genome sequence. More than 260 of these loci were located on the expected pseudo-chromosome on the ‘Golden Delicious’ genome or on its homeologous pseudo-chromosome. In total, 282.4 Mbp of sequence from 142 genome sequence scaffolds of the Malus genome were anchored to the ‘M.27’ × ‘M.116’ map, providing an interface between the marker data and the underlying genome sequence. This will be exploited for the identification of genes responsible for traits of agronomic importance such as dwarfing and water use efficiency.