380 research outputs found

    Texture-based crowd detection and localisation

    Get PDF
    This paper presents a crowd detection system based on texture analysis. The state-of-the-art techniques based on co-occurrence matrix have been revisited and a novel set of features proposed. These features provide a richer description of the co-occurrence matrix, and can be exploited to obtain stronger classification results, especially when smaller portions of the image are considered. This is extremely useful for crowd localisation: acquired images are divided into smaller regions in order to perform a classification on each one. A thorough evaluation of the proposed system on a real world data set is also presented: this validates the improvements in reliability of the crowd detection and localisation

    Emotional memory in the lab: Using the Trier Social Stress Test to induce a sensory-rich and personally meaningful episodic experience

    Get PDF
    A myriad of clinical theories places emotional memory or mental representations at the root of mental disorders. Various cognitive-behavioural interventions are based on the assumption that targeting the underlying emotional memory is the working mechanism of treatment efficacy. To test the assumptions about the role of emotional memory in the development, maintenance, and treatment of mental disorders, we first need to establish ecologically valid paradigms that can induce emotional memory in the lab. For this, we used the Trier Social Stress Test (TSST), a standardized protocol to elicit social distress, paired with a neutral unfamiliar ambient odour, to create a sensory-rich and personally meaningful episodic experience. Seven days later, participants (N = 132) reactivated the memory of the TSST with the aid of auditory, olfactory, and visual retrieval cues, during which their heart rate and self-reported affective responses were collected. Although increases in heart rate were only observed during encoding, and not at retrieval, self-report ratings showed that cues which directly referred to the aversive experience evoked more negative valence, arousal, and feelings of lack of control during memory reactivation compared to control cues across sensory modalities. These findings are indicative of successful memory induction and corroborate the utility of ambient odours as retrieval aids. Moreover, the self-reported response to the reactivated emotional memory correlated with individual differences in indices of (social) anxiety and depression. Thereby, we provide preliminary evidence of the translational significance of this paradigm that offers potential for being a model to induce ecologically valid emotional memory in the lab

    Projective re-normalization for improving the behavior of a homogeneous conic linear system

    Get PDF
    In this paper we study the homogeneous conic system F : Ax = 0, x ∈ C \ {0}. We choose a point ÂŻs ∈ intC∗ that serves as a normalizer and consider computational properties of the normalized system FÂŻs : Ax = 0, ÂŻsT x = 1, x ∈ C. We show that the computational complexity of solving F via an interior-point method depends only on the complexity value ϑ of the barrier for C and on the symmetry of the origin in the image set HÂŻs := {Ax : ÂŻsT x = 1, x ∈ C}, where the symmetry of 0 in HÂŻs is sym(0,HÂŻs) := max{α : y ∈ HÂŻs -->−αy ∈ HÂŻs} .We show that a solution of F can be computed in O(sqrtϑ ln(ϑ/sym(0,HÂŻs)) interior-point iterations. In order to improve the theoretical and practical computation of a solution of F, we next present a general theory for projective re-normalization of the feasible region FÂŻs and the image set HÂŻs and prove the existence of a normalizer ÂŻs such that sym(0,HÂŻs) ≄ 1/m provided that F has an interior solution. We develop a methodology for constructing a normalizer ÂŻs such that sym(0,HÂŻs) ≄ 1/m with high probability, based on sampling on a geometric random walk with associated probabilistic complexity analysis. While such a normalizer is not itself computable in strongly-polynomialtime, the normalizer will yield a conic system that is solvable in O(sqrtϑ ln(mϑ)) iterations, which is strongly-polynomialtime. Finally, we implement this methodology on randomly generated homogeneous linear programming feasibility problems, constructed to be poorly behaved. Our computational results indicate that the projective re-normalization methodology holds the promise to markedly reduce the overall computation time for conic feasibility problems; for instance we observe a 46% decrease in average IPM iterations for 100 randomly generated poorly-behaved problem instances of dimension 1000 × 5000.Singapore-MIT Allianc

    Going chiral: overlap versus twisted mass fermions

    Full text link
    We compare the behavior of overlap fermions, which are chirally invariant, and of Wilson twisted mass fermions at full twist in the approach to the chiral limit. Our quenched simulations reveal that with both formulations of lattice fermions pion masses of O(250 MeV) can be reached in practical applications. Our comparison is done at a fixed value of the lattice spacing a=0.123 fm. A number of quantities are measured such as hadron masses, pseudoscalar decay constants and quark masses obtained from Ward identities. We also determine the axial vector renormalization constants in the case of overlap fermions.Comment: 22 pages, 10 figure

    Integrable Structure of Conformal Field Theory, Quantum KdV Theory and Thermodynamic Bethe Ansatz

    Full text link
    We construct the quantum versions of the monodromy matrices of KdV theory. The traces of these quantum monodromy matrices, which will be called as ``T{\bf T}-operators'', act in highest weight Virasoro modules. The T{\bf T}-operators depend on the spectral parameter λ\lambda and their expansion around λ=∞\lambda = \infty generates an infinite set of commuting Hamiltonians of the quantum KdV system. The T{\bf T}-operators can be viewed as the continuous field theory versions of the commuting transfer-matrices of integrable lattice theory. In particular, we show that for the values c=1−3(2n+1)22n+3,n=1,2,3,...c=1-3{{(2n+1)^2}\over {2n+3}} , n=1,2,3,... of the Virasoro central charge the eigenvalues of the T{\bf T}-operators satisfy a closed system of functional equations sufficient for determining the spectrum. For the ground-state eigenvalue these functional equations are equivalent to those of massless Thermodynamic Bethe Ansatz for the minimal conformal field theory M2,2n+3{\cal M}_{2,2n+3}; in general they provide a way to generalize the technique of Thermodynamic Bethe Ansatz to the excited states. We discuss a generalization of our approach to the cases of massive field theories obtained by perturbing these Conformal Field Theories with the operator Ί1,3\Phi_{1,3}. The relation of these T{\bf T}-operators to the boundary states is also briefly described.Comment: 24 page

    Red Queen Coevolution on Fitness Landscapes

    Full text link
    Species do not merely evolve, they also coevolve with other organisms. Coevolution is a major force driving interacting species to continuously evolve ex- ploring their fitness landscapes. Coevolution involves the coupling of species fit- ness landscapes, linking species genetic changes with their inter-specific ecological interactions. Here we first introduce the Red Queen hypothesis of evolution com- menting on some theoretical aspects and empirical evidences. As an introduction to the fitness landscape concept, we review key issues on evolution on simple and rugged fitness landscapes. Then we present key modeling examples of coevolution on different fitness landscapes at different scales, from RNA viruses to complex ecosystems and macroevolution.Comment: 40 pages, 12 figures. To appear in "Recent Advances in the Theory and Application of Fitness Landscapes" (H. Richter and A. Engelbrecht, eds.). Springer Series in Emergence, Complexity, and Computation, 201

    Multiple Traits for People Identification

    Get PDF
    Present biometric systems mostly rely on a single physical or behavioral feature for either identification or verification. However, day to day use of single biometries in massive or uncontrolled scenarios still has several shortcomings. These can be due to complex or unstable hardware settings, to changing environmental conditions or even to immature software procedures: some classification problems are intrinsically hard to solve. Possible spoofing of single biometric features is an additional issue. Last but not least, some features may occasionally lack the requisite of universality. As a consequence, biometric systems based on a single feature often have poor reliability, especially in applications where high security is needed. Multimodal systems, i.e., systems that concurrently exploit multiple features, are a possible way to achieve improved effectiveness and reliability. There are several issues that must be addressed when designing such a system, including the choice of the set of biometric features, the normalization method, the integration schema and the fusion process, and the use of a measure of reliability for each subsystem on a single response basis. This chapter describes the state of the art regarding such issues and sketches some suggestions for future work
    • 

    corecore