A feedback-based algorithm forMotion analysis with application to object tracking

We present a motion detection algorithm which detects direction of motion at sufficient number of points and thus segregates the edge image into clusters of coherently moving points. Unlike most algorithms for motion analysis, we do not estimate magnitude of velocity vectors or obtain dense motion maps. The motivation is that motion direction information at a number of points seems to be sufficient to evoke perception of motion and hence should be useful in many image processing tasks requiring motion analysis. The algorithm essentially updates the motion at previous time using the current image frame as input in a dynamic fashion. One of the novel features of the algorithm is the use of some feedback mechanism for evidence segregation. This kind of motion analysis can identify regions in the image that are moving together coherently, and such information could be sufficient for many applications that utilize motion such as segmentation, compression, and tracking. We present an algorithm for tracking objects using our motion information to demonstrate the potential of this motion detection algorithm.

Boundary-layer effects on internal flow choking in dual-thrust solid rocket motors

Theoretical studies have been carried out to examine internal flow choking in the inert simulators of a dual-thrust motor. Using a two-dimensional k-omega turbulence model, detailed parametric studies have been carried out to examine aerodynamic choking and the existence of a fluid throat at the transition region during the startup transient of dual-thrust motors. This code solves standard k-omega turbulence equations with shear flow corrections using a coupled second-order-implicit unsteady formulation. In the numerical study, a fully implicit finite volume scheme of the compressible, Reynolds-averaged, Navier-Stokes equations is employed. It was observed that, at the subsonic inflow conditions, there is a possibility of the occurrence of internal flow choking in dual-thrust motors due to the formation of a fluid throat at the beginning of the transition region induced by area blockage caused by boundary-layer-displacement thickness. It has been observed that a 55% increase in the upstream port area of the dual-thrust motor contributes to a 25% reduction in blockage factor at the transition region, which could negate the internal How choking and supplement with an early choking of the dual-thrust motor nozzle. If the height of the upstream port relative to the motor length is too small, the developing boundary layers from either side of the port can interact, leading to a choked,flow. On the other hand, if the developing boundary layers are far enough apart, then choking does not occur. The blockage factor is greater in magnitude for the choked case than for the unchoked case. More tangible explanations are presented in this paper for the boundary-layer blockage and the internal flow choking in dual-thrust motors, which hitherto has been unexplored.

Operationalising and measuring flow in video games

This paper explores the obstacles associated with designing video game levels for the purpose of objectively measuring flow. We sought to create three video game levels capable of inducing a flow state, an overload state (low-flow), and a boredom state (low-flow). A pilot study, in which participants self-reported levels of flow after playing all three game levels, was undertaken. Unexpected results point to the challenges of operationalising flow in video game research, obstacles in experimental design for invoking flow and low-flow, concerns about flow as a construct for measuring video game enjoyment, the applicability of self-report flow scales, and the experience of flow in video game play despite substantial challenge-skill differences.

Flow during individual and co-operative gameplay

This study aims to further research in the field of video games by examining flow during individual and co-operative gameplay. Using a puzzle game called Droppit, we examined differences in flow based on two modes of play: single player vs. co-operative gameplay. Co-operative gameplay was found to induce greater flow in participants than single player gameplay. Additionally, co-operative gameplay participants had increased feelings of Challenge-Skill Balance, Unambiguous Feedback, Transformation of Time and Autotelic Experience. Our findings suggest that co-operative gameplay, involving puzzle-based problems, may result in increased flow during video game play.

Constitutive equation for elevated temperature flow behavior of plain carbon steels using dimensional analysis

Dimensional analysis using π-theorem is applied to the variables associated with plastic deformation. The dimensionless groups thus obtained are then related and rewritten to obtain the constitutive equation. The constants in the constitutive equation are obtained using published flow stress data for carbon steels. The validity of the constitutive equation is tested for steels with up to 1.54 wt%C at temperatures: 850–1200 °C and strain rates: 6 × 10−6–2 × 10−2 s−1. The calculated flow stress agrees favorably with experimental data.

Kernel-based spatial-color modeling for fast moving object tracking

Visual tracking has been a challenging problem in computer vision over the decades. The applications of Visual Tracking are far-reaching, ranging from surveillance and monitoring to smart rooms. Mean-shift (MS) tracker, which gained more attention recently, is known for tracking objects in a cluttered environment and its low computational complexity. The major problem encountered in histogram-based MS is its inability to track rapidly moving objects. In order to track fast moving objects, we propose a new robust mean-shift tracker that uses both spatial similarity measure and color histogram-based similarity measure. The inability of MS tracker to handle large displacements is circumvented by the spatial similarity-based tracking module, which lacks robustness to object's appearance change. The performance of the proposed tracker is better than the individual trackers for tracking fast-moving objects with better accuracy.

Gaussian mixture model based switched split vector quantization of LSF parameters

We address the issue of rate-distortion (R/D) performance optimality of the recently proposed switched split vector quantization (SSVQ) method. The distribution of the source is modeled using Gaussian mixture density and thus, the non-parametric SSVQ is analyzed in a parametric model based framework for achieving optimum R/D performance. Using high rate quantization theory, we derive the optimum bit allocation formulae for the intra-cluster split vector quantizer (SVQ) and the inter-cluster switching. For the wide-band speech line spectrum frequency (LSF) parameter quantization, it is shown that the Gaussian mixture model (GMM) based parametric SSVQ method provides 1 bit/vector advantage over the non-parametric SSVQ method.

Computationally efficient optimum weighting function for vector quantization of LSF parameters

We propose a new weighting function which is computationally simple and an approximation to the theoretically derived optimum weighting function shown in the literature. The proposed weighting function is perceptually motivated and provides improved vector quantization performance compared to several weighting functions proposed so far, for line spectrum frequency (LSF) parameter quantization of both clean and noisy speech data.

Cluster based training for scaling non-linear support vector machines

Support Vector Machines(SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involving more than a few thousands of data points. In this paper we propose a novel kernel based incremental data clustering approach and its use for scaling Non-linear Support Vector Machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of Support Vector Machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense.

Continuous-Flow Surface Aeration Systems

An aeration process in ail activated sludge plant is a continuous-flow system. In this system, there is a steady input flow (flow from the primary clarifier or settling tank with some part from the secondary clarifier or secondary settling tank) and output flow connection to the secondary clarifier or settling tank. The experimental and numerical results obtained through batch systems can not be relied on and applied for the designing of a continuous aeration tank. In order to scale up laboratory results for field application, it is imperative to know the geometric parameters of a continuous system. Geometric parameters have a greater influence on the mass transfer process of surface aeration systems. The present work establishes the optimal geometric configuration of a continuous-flow surface aeration system. It is found that the maintenance of these optimal geometric parameters systems result in maximum aeration efficiency. By maintaining the obtained optimal geometric parameters, further experiments are conducted in continuous-flow surface aerators with three different sizes in order to develop design curves correlating the oxygen transfer coefficient and power number with the rotor speed. The design methodology to implement the presently developed optimal geometric parameters and correlation equations for field application is discussed.

Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA

Context sensitive pointer analyses based on Whaley and Lam’s bddbddb system have been shown to scale to large Java programs. We provide a technique to incorporate flow sensitivity for Java fields into one such analysis and obtain an escape analysis based on it. First, we express an intraprocedural field flow sensitive analysis, using Fink et al.’s Heap Array SSA form in Datalog. We then extend this analysis interprocedurally by introducing two new φ functions for Heap Array SSA Form and adding deduction rules corresponding to them. Adding a few more rules gives us an escape analysis. We describe two types of field flow sensitivity: partial (PFFS) and full (FFFS), the former without strong updates to fields and the latter with strong updates. We compare these analyses with two different (field flow insensitive) versions of Whaley-Lam analysis: one of which is flow sensitive for locals (FS) and the other, flow insensitive for locals (FIS). We have implemented this analysis on the bddbddb system while using the SOOT open source framework as a front end. We have run our analysis on a set of 15 Java programs. Our experimental results show that the time taken by our field flow sensitive analyses is comparable to that of the field flow insensitive versions while doing much better in some cases. Our PFFS analysis achieves average reductions of about 23% and 30% in the size of the points-to sets at load and store statements respectively and discovers 71% more “caller-captured” objects than FIS.

Numerical Simulation of Groundwater Flow with Gradually Increasing Heterogeneity due to Clogging

Well injection replenishes depleting water levels in a well field. Observation well water levels some distance away from the injection well are the indicators of the success of a well injection program. Simulation of the observation well response, located a few tens of meters from the injection well, is likely to be affected by the effects of nonhomogeneous medium, inclined initial water table, and aquifer clogging. Existing algorithms, such as the U.S. Geological Survey groundwater flow software MODFLOW, are capable of handling the first two conditions, whereas time-dependent clogging effects are yet to be introduced in the groundwater flow models. Elsewhere, aquifer clogging is extensively researched in theory of filtration; scope for its application in a well field is a potential research problem. In the present paper, coupling of one such filtration theory to MODFLOW is introduced. Simulation of clogging effects during “Hansol” well recharge in the parts of western India is found to be encouraging.

OCR Prediction Using Support Vector Machine Based on Piezocone Data

The determination of the overconsolidation ratio (OCR) of clay deposits is an important task in geotechnical engineering practice. This paper examines the potential of a support vector machine (SVM) for predicting the OCR of clays from piezocone penetration test data. SVM is a statistical learning theory based on a structural risk minimization principle that minimizes both error and weight terms. The five input variables used for the SVM model for prediction of OCR are the corrected cone resistance (qt), vertical total stress (sigmav), hydrostatic pore pressure (u0), pore pressure at the cone tip (u1), and the pore pressure just above the cone base (u2). Sensitivity analysis has been performed to investigate the relative importance of each of the input parameters. From the sensitivity analysis, it is clear that qt=primary in situ data influenced by OCR followed by sigmav, u0, u2, and u1. Comparison between SVM and some of the traditional interpretation methods is also presented. The results of this study have shown that the SVM approach has the potential to be a practical tool for determination of OCR.

Network flow-control using asynchronous stochastic approximation

We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.