35929
Robust Head Tracking with Particles Based on Multiple Cues Fusion
This paper presents a fully automatic and highly robust head tracking algorithm based on the latest advances in real-time multi-view face detection techniques and multiple cues fusion under particle filter framework. Visual cues designed for general object tracking problem hardly suffice for robust head tracking under diverse or even severe circumstances, making it a necessity to utilize higher level information which is object-specific. To this end we introduce a vector-boosted multi-view face detector [2] as the “face cue” in addition to two other general visual cues targeting the entire head, color spatiogram[3] and contour gradient. Data fusion is done by an extended particle filter which supports multiple distinct yet interrelated state vectors (referring to face and head in our tracking context). Furthermore, pose information provided by the face cue is exploited to help achieve improved accuracy and efficiency in the fusion. Experiments show that our algorithm is highly robust against target position, size and pose change as well as unfavorable conditions such as occlusion, poor illumination and cluttered background.
10776344
Robust Head Tracking Based on a Multi-State Particle Filter
This paper proposes a novel method for robust and automatic realtime head tracking by fusing face and head cues within a multi-state particle filter. Due to large appearance variability of human head, most existing head tracking methods use little object-specific prior knowledge, resulting in limited discriminant power. In contrast, face is a distinct pattern much easier to capture, which motivates us to incorporate a vector-boosted multi-view face detector (C. Huang, et al., 2005) to lend strong aid to general head observation cues including color and contour edge. To simultaneously and collaboratively perform temporal inference of both the face state and the head state, a Markov-network-based particle filter is constructed using sequential belief propagation Monte Carlo (G. Hua, et al., 2004). Our approach is tested on sequences used by previous researchers as well as on new data sets which includes many challenging real-world cases, and shows robustness against various unfavorable conditions
16081168
Sample dependence correction for order selection in fMRI analysis
Multivariate analysis methods such as independent component analysis (ICA) have been applied to the analysis of functional magnetic resonance imaging (fMRI) data to study the brain function. The selection of the proper number of signals of interest is an important step in the analysis to reduce the risk of over/underfilling. The inherent sample dependence in the spatial or temporal dimension of the fMRI data violates the assumption of independent and identically distributed (i.i.d.) samples and limits the usefulness of the practical formulations of information-theoretic order selection criteria. We propose a novel method using an entropy rate matching principle to mitigate the effects of such sample dependence in order selection. We perform order selection experiments on the simulated fMRI data and show that the incorporation of the proposed method significantly improves the accuracy of the order selection by different criteria. We also use the proposed method to estimate the number of latent sources in fMRI data acquired from multiple subjects performing a visuomotor paradigm. We show that the proposed method improves the order selection by alleviating the over-estimation due to the intrinsic smoothness and the effect of smooth preprocessing on the fMRI data
1164650
Constructing Facial Identity Surfaces for Recognition
We present a novel approach to face recognition by constructing facial identity structures across views and over time, referred to as identity surfaces, in a Kernel Discriminant Analysis (KDA) feature space. This approach is aimed at addressing three challenging problems in face recognition: modelling faces across multiple views, extracting non-linear discriminatory features, and recognising faces over time. First, a multi-view face model is designed which can be automatically fitted to face images and sequences to extract the normalised facial texture patterns. This model is capable of dealing with faces with large pose variation. Second, KDA is developed to compute the most significant non-linear basis vectors with the intention of maximising the between-class variance and minimising the within-class variance. We applied KDA to the problem of multi-view face recognition, and a significant improvement has been achieved in reliability and accuracy. Third, identity surfaces are constructed in a pose-parameterised discriminatory feature space. Dynamic face recognition is then performed by matching the object trajectory computed from a video input and model trajectories constructed on the identity surfaces. These two types of trajectories encode the spatio-temporal dynamics of moving faces.
18701856
Protecting RFID communications in supply chains
Recent years have seen much growing attention on RFID security. However, little work has been performed to address the security issues in the context of supply chain management, which is exactly the major field for RFID applications. Existing RFID solutions cannot be applied directly in this field because of a set of special RFID security requirements to be addressed for supply chain management. The major contribution of this paper is to identify the unique set of security requirements in supply chains and to propose a practical design of RFID communication protocols that satisfy the security requirements.
206964202
Asymptotic Upper Bounds for Ramsey Functions
Abstract. We show that for any graph G with N vertices and average degree d, if the average degree of any neighborhood induced subgraph is at most a, then the independence number of G is at least Nfa+1(d), where fa+1(d)=∫01(((1−t)1/(a+1))/(a+1+(d−a−1)t))dt. Based on this result, we prove that for any fixed k and l, there holds r(Kk+l,Kn)≤ (l+o(1))nk/(logn)k−1. In particular, r(Kk, Kn)≤(1+o(1))nk−1/(log n)k−2.
6625111
On incremental and robust subspace learning
Principal Component Analysis (PCA) has been of great interest in computer vision and pattern recognition. In particular, incrementally learning a PCA model, which is computationally efficient for large-scale problems as well as adaptable to reflect the variable state of a dynamic system, is an attractive research topic with numerous applications such as adaptive background modelling and active object recognition. In addition, the conventional PCA, in the sense of least mean squared error minimisation, is susceptible to outlying measurements. To address these two important issues, we present a novel algorithm of incremental PCA, and then extend it to robust PCA. Compared with the previous studies on robust PCA, our algorithm is computationally more efficient. We demonstrate the performance of these algorithms with experimental results on dynamic background modelling and multi-view face modelling.