316,419 research outputs found
Contextual anomaly detection in crowded surveillance scenes
AbstractThis work addresses the problem of detecting human behavioural anomalies in crowded surveillance environments. We focus in particular on the problem of detecting subtle anomalies in a behaviourally heterogeneous surveillance scene. To reach this goal we implement a novel unsupervised context-aware process. We propose and evaluate a method of utilising social context and scene context to improve behaviour analysis. We find that in a crowded scene the application of Mutual Information based social context permits the ability to prevent self-justifying groups and propagate anomalies in a social network, granting a greater anomaly detection capability. Scene context uniformly improves the detection of anomalies in both datasets. The strength of our contextual features is demonstrated by the detection of subtly abnormal behaviours, which otherwise remain indistinguishable from normal behaviour
Gains in Power from Structured Two-Sample Tests of Means on Graphs
We consider multivariate two-sample tests of means, where the location shift
between the two populations is expected to be related to a known graph
structure. An important application of such tests is the detection of
differentially expressed genes between two patient populations, as shifts in
expression levels are expected to be coherent with the structure of graphs
reflecting gene properties such as biological process, molecular function,
regulation, or metabolism. For a fixed graph of interest, we demonstrate that
accounting for graph structure can yield more powerful tests under the
assumption of smooth distribution shift on the graph. We also investigate the
identification of non-homogeneous subgraphs of a given large graph, which poses
both computational and multiple testing problems. The relevance and benefits of
the proposed approach are illustrated on synthetic data and on breast cancer
gene expression data analyzed in context of KEGG pathways
Socially Constrained Structural Learning for Groups Detection in Crowd
Modern crowd theories agree that collective behavior is the result of the
underlying interactions among small groups of individuals. In this work, we
propose a novel algorithm for detecting social groups in crowds by means of a
Correlation Clustering procedure on people trajectories. The affinity between
crowd members is learned through an online formulation of the Structural SVM
framework and a set of specifically designed features characterizing both their
physical and social identity, inspired by Proxemic theory, Granger causality,
DTW and Heat-maps. To adhere to sociological observations, we introduce a loss
function (G-MITRE) able to deal with the complexity of evaluating group
detection performances. We show our algorithm achieves state-of-the-art results
when relying on both ground truth trajectories and tracklets previously
extracted by available detector/tracker systems
The Effects of Aging on Orientation Discrimination
Visual perception relies on low-level encoding of local orientation. Recent studies show
an age-dependent impairment in orientation discrimination of stimuli embedded in
external noise, suggesting that encoding of orientation is inefficient in older adults. In
the present study we ask whether aging also reduces decoding, i.e., selecting the
neural representations of target orientation while discarding those conflicting with it.
We compared younger and older participants capability (mean age 24 and 68 years
respectively) in discriminating whether the orientation of a Gabor target was left or right
from the vertical. We measured (d0), an index of discrimination sensitivity, for orientation
offset ranging from 1 to 12. In the isolated target condition, d0 was reduced by
aging and, in the older group, did not increase with orientation offset, thus resulting
in a larger group difference at large than small orientation offsets from the vertical.
Moreover, oriented elements in the background impaired more discrimination in the
older group. However, distractors reduced more d0 when target-background orientation
offset was large than when target and flanker had similar orientation, indicating that
the effect of the background was not local, i.e., due to target inhibition by similarly
oriented flankers. Altogether, these results indicate that aging reduces the efficiency in
discarding the response to orientations differing from the target. Our results suggest
that neural decision-making mechanisms, involving not only signal enhancement but
also non-signal inhibition, become inefficient with age. This suggestion is consistent
with the neurophysiological evidence of inefficient visual cortical inhibition in aging
Structured Sparsity: Discrete and Convex approaches
Compressive sensing (CS) exploits sparsity to recover sparse or compressible
signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity
is also used to enhance interpretability in machine learning and statistics
applications: While the ambient dimension is vast in modern data analysis
problems, the relevant information therein typically resides in a much lower
dimensional space. However, many solutions proposed nowadays do not leverage
the true underlying structure. Recent results in CS extend the simple sparsity
idea to more sophisticated {\em structured} sparsity models, which describe the
interdependency between the nonzero components of a signal, allowing to
increase the interpretability of the results and lead to better recovery
performance. In order to better understand the impact of structured sparsity,
in this chapter we analyze the connections between the discrete models and
their convex relaxations, highlighting their relative advantages. We start with
the general group sparse model and then elaborate on two important special
cases: the dispersive and the hierarchical models. For each, we present the
models in their discrete nature, discuss how to solve the ensuing discrete
problems and then describe convex relaxations. We also consider more general
structures as defined by set functions and present their convex proxies.
Further, we discuss efficient optimization solutions for structured sparsity
problems and illustrate structured sparsity in action via three applications.Comment: 30 pages, 18 figure
- …