35 resultados para updates
Resumo:
H. 264/advanced video coding surveillance video encoders use the Skip mode specified by the standard to reduce bandwidth. They also use multiple frames as reference for motion-compensated prediction. In this paper, we propose two techniques to reduce the bandwidth and computational cost of static camera surveillance video encoders without affecting detection and recognition performance. A spatial sampler is proposed to sample pixels that are segmented using a Gaussian mixture model. Modified weight updates are derived for the parameters of the mixture model to reduce floating point computations. A storage pattern of the parameters in memory is also modified to improve cache performance. Skip selection is performed using the segmentation results of the sampled pixels. The second contribution is a low computational cost algorithm to choose the reference frames. The proposed reference frame selection algorithm reduces the cost of coding uncovered background regions. We also study the number of reference frames required to achieve good coding efficiency. Distortion over foreground pixels is measured to quantify the performance of the proposed techniques. Experimental results show bit rate savings of up to 94.5% over methods proposed in literature on video surveillance data sets. The proposed techniques also provide up to 74.5% reduction in compression complexity without increasing the distortion over the foreground regions in the video sequence.
Resumo:
Seasonal epidemics caused by influenza A (H1 and H3 subtypes) and B viruses are a major global health threat. The traditional, trivalent influenza vaccines have limited efficacy because of rapid antigenic evolution of the circulating viruses. This antigenic variability mediates viral escape from the host immune responses, necessitating annual vaccine updates. Influenza vaccines elicit a protective antibody response, primarily targeting the viral surface glycoprotein hemagglutinin (HA). However, the predominant humoral response is against the hypervariable head domain of HA, thereby restricting the breadth of protection. In contrast, the conserved, subdominant stem domain of HA is a potential ``universal'' vaccine candidate. We designed an HA stem-fragment immunogen from the 1968 pandemic H3N2 strain (A/Hong Kong/1/68) guided by a comprehensive H3 HA sequence conservation analysis. The biophysical properties of the designed immunogen were further improved by C-terminal fusion of a trimerization motif, ``isoleucine-zipper'', or ``foldon''. These immunogens elicited cross-reactive, antiviral antibodies and conferred partial protection against a lethal, homologous HK68 virus challenge in vivo. Furthermore, bacterial expression of these immunogens is economical and facilitates rapid scale-up.
Resumo:
A divergence-free velocity field is usually sought in numerical simulations of incompressible fluids. We show that the particle methods that compute a divergence-free velocity field to achieve incompressibility suffer from a volume conservation issue when a finite time-step position update scheme is used. Further, we propose a deformation gradient based approach to arrive at a velocity field that reduces the volume conservation issues in free surface flows and maintains density uniformity in internal flows while retaining the simplicity of first order time updates. (C) 2015 Elsevier Inc. All rights reserved.
Resumo:
Optimal control of traffic lights at junctions or traffic signal control (TSC) is essential for reducing the average delay experienced by the road users amidst the rapid increase in the usage of vehicles. In this paper, we formulate the TSC problem as a discounted cost Markov decision process (MDP) and apply multi-agent reinforcement learning (MARL) algorithms to obtain dynamic TSC policies. We model each traffic signal junction as an independent agent. An agent decides the signal duration of its phases in a round-robin (RR) manner using multi-agent Q-learning with either is an element of-greedy or UCB 3] based exploration strategies. It updates its Q-factors based on the cost feedback signal received from its neighbouring agents. This feedback signal can be easily constructed and is shown to be effective in minimizing the average delay of the vehicles in the network. We show through simulations over VISSIM that our algorithms perform significantly better than both the standard fixed signal timing (FST) algorithm and the saturation balancing (SAT) algorithm 15] over two real road networks.
Resumo:
The problem of cooperative beamforming for maximizing the achievable data rate of an energy constrained two-hop amplify-and-forward (AF) network is considered. Assuming perfect channel state information (CSI) of all the nodes, we evaluate the optimal scaling factor for the relay nodes. Along with individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. The proposed iterative algorithm initially solves a set of relaxed problems with weighted sum power constraint and then updates the solution to accommodate individual constraints. These relaxed problems in turn are solved using a sequence of Quadratic Eigenvalue Problems (QEP). The key contribution of this letter is the generalization of cooperative beamforming to incorporate both the individual and weighted sum constraint. Furthermore, we have proposed a novel algorithm based on Quadratic Eigenvalue Problem (QEP) and discussed its convergence.