Human Action Recognition in Compressed Domain using PBL-McRBFN Approach

Large variations in human actions lead to major challenges in computer vision research. Several algorithms are designed to solve the challenges. Algorithms that stand apart, help in solving the challenge in addition to performing faster and efficient manner. In this paper, we propose a human cognition inspired projection based learning for person-independent human action recognition in the H.264/AVC compressed domain and demonstrate a PBL-McRBEN based approach to help take the machine learning algorithms to the next level. Here, we use gradient image based feature extraction process where the motion vectors and quantization parameters are extracted and these are studied temporally to form several Group of Pictures (GoP). The GoP is then considered individually for two different bench mark data sets and the results are classified using person independent human action recognition. The functional relationship is studied using Projection Based Learning algorithm of the Meta-cognitive Radial Basis Function Network (PBL-McRBFN) which has a cognitive and meta-cognitive component. The cognitive component is a radial basis function network while the Meta-Cognitive Component(MCC) employs self regulation. The McC emulates human cognition like learning to achieve better performance. Performance of the proposed approach can handle sparse information in compressed video domain and provides more accuracy than other pixel domain counterparts. Performance of the feature extraction process achieved more than 90% accuracy using the PTIL-McRBFN which catalyzes the speed of the proposed high speed action recognition algorithm. We have conducted twenty random trials to find the performance in GoP. The results are also compared with other well known classifiers in machine learning literature.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

ABSOLUTE/CONVECTIVE INSTABILITY TRANSITION IN A BACKWARD FACING STEP COMBUSTOR: FUNDAMENTAL MECHANISM AND INFLUENCE OF DENSITY GRADIENT

Hydrodynamic instabilities of the flow field in lean premixed gas turbine combustors can generate velocity perturbations that wrinkle and distort the flame sheet over length scales that are smaller than the flame length. The resultant heat release oscillations can then potentially result in combustion instability. Thus, it is essential to understand the hydrodynamic instability characteristics of the combustor flow field in order to understand its overall influence on combustion instability characteristics. To this end, this paper elucidates the role of fluctuating vorticity production from a linear hydrodynamic stability analysis as the key mechanism promoting absolute/convective instability transitions in shear layers occurring in the flow behind a backward facing step. These results are obtained within the framework of an inviscid, incompressible, local temporal and spatio-temporal stability analysis. Vorticity fluctuations in this limit result from interaction between two competing mechanisms - (1) production from interaction between velocity perturbations and the base flow vorticity gradient and (2) baroclinic torque in the presence of base flow density gradients. This interaction has a significant effect on hydrodynamic instability characteristics when the base flow density and velocity gradients are co-located. Regions in the space of parameters characterizing the base flow velocity profile, i.e. shear layer thickness and ratio of forward to reverse flow velocity, corresponding to convective and absolute instability are identified. The implications of the present results on prior observations of flow instability in other flows such as heated jets and bluff-body stabilized flames is discussed.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Fuel-optimal G-MPSP Guidance for Powered Descent Phase of Soft Lunar Landing

A fuel optimal nonlinear sub-optimal guidance scheme is presented in this paper for soft landing of a lunar craft during the powered descent phase. The recently developed Generalized Model Predictive Static Programming (G-MPSP) is used to compute the required magnitude and angle of the thrust vector. Both terminal position and velocity vector are imposed as hard constraints, which ensures high position accuracy and facilitates initiation of vertical descent at the end of the powered descent phase. A key feature of the G-MPSP algorithm is that it converts the nonlinear dynamic programming problem into a low-dimensional static optimization problem (of the same dimension as the output vector). The control history update is done in closed form after computing a time-varying weighting matrix through a backward integration process. This feature makes the algorithm computationally efficient, which makes it suitable for on-board applications. The effectiveness of the proposed guidance algorithm is demonstrated through promising simulation results.

Gradient echo single scan inversion recovery: application to proton and fluorine relaxation studies

Single scan longitudinal relaxation measurement experiments enable rapid estimation of the spin-lattice relaxation time (T-1) as the time series of spin relaxation is encoded spatially in the sample at different slices resulting in an order of magnitude saving in time. We consider here a single scan inversion recovery pulse sequence that incorporates a gradient echo sequence. The proposed pulse sequence provides spectra with significantly enhanced signal to noise ratio leading to an accurate estimation of T-1 values. The method is applicable for measuring a range of T-1 values, thus indicating the possibility of routine use of the method for several systems. A comparative study of different single scan methods currently available is presented, and the advantage of the proposed sequence is highlighted. The possibility of the use of the method for the study of cross-correlation effects for the case of fluorine in a single shot is also demonstrated. Copyright (C) 2015 John Wiley & Sons, Ltd.

Gradient echo single scan inversion recovery: application to proton and fluorine relaxation studies

Single scan longitudinal relaxation measurement experiments enable rapid estimation of the spin-lattice relaxation time (T-1) as the time series of spin relaxation is encoded spatially in the sample at different slices resulting in an order of magnitude saving in time. We consider here a single scan inversion recovery pulse sequence that incorporates a gradient echo sequence. The proposed pulse sequence provides spectra with significantly enhanced signal to noise ratio leading to an accurate estimation of T-1 values. The method is applicable for measuring a range of T-1 values, thus indicating the possibility of routine use of the method for several systems. A comparative study of different single scan methods currently available is presented, and the advantage of the proposed sequence is highlighted. The possibility of the use of the method for the study of cross-correlation effects for the case of fluorine in a single shot is also demonstrated. Copyright (C) 2015 John Wiley & Sons, Ltd.