Automated Computation of the Fundamental Matrix for Vision-Based Construction Site Applications

Estimating the fundamental matrix (F), to determine the epipolar geometry between a pair of images or video frames, is a basic step for a wide variety of vision-based functions used in construction operations, such as camera-pair calibration, automatic progress monitoring, and 3D reconstruction. Currently, robust methods (e.g., SIFT + normalized eight-point algorithm + RANSAC) are widely used in the construction community for this purpose. Although they can provide acceptable accuracy, the significant amount of required computational time impedes their adoption in real-time applications, especially video data analysis with many frames per second. Aiming to overcome this limitation, this paper presents and evaluates the accuracy of a solution to find F by combining the use of two speedy and consistent methods: SURF for the selection of a robust set of point correspondences and the normalized eight-point algorithm. This solution is tested extensively on construction site image pairs including changes in viewpoint, scale, illumination, rotation, and moving objects. The results demonstrate that this method can be used for real-time applications (5 image pairs per second with the resolution of 640 × 480) involving scenes of the built environment.

Probabilistic computation in human perception under variability in encoding precision.

A key function of the brain is to interpret noisy sensory information. To do so optimally, observers must, in many tasks, take into account knowledge of the precision with which stimuli are encoded. In an orientation change detection task, we find that encoding precision does not only depend on an experimentally controlled reliability parameter (shape), but also exhibits additional variability. In spite of variability in precision, human subjects seem to take into account precision near-optimally on a trial-to-trial and item-to-item basis. Our results offer a new conceptualization of the encoding of sensory information and highlight the brain's remarkable ability to incorporate knowledge of uncertainty during complex perceptual decision-making.

Computation of transient and steady turbulent isothermal flows with an impinging rectangular jet

The computation of both transient and steady turbulent incompressible isothermal flows is studied. The flow is very complex, having streamline curvature, large vortex structures and stagnation resulting from an impinging rectangular jet. For transient computations, the standard k-ε model is adopted. For steady flows, the k-ε, high and low Reynolds number k-l and mixing length models are tried. Zonal approaches combining the above turbulence models are also investigated. None of the models are found to give satisfactory agreement with velocity measurements.

Numerical computation of laminar flow in a heated rotating cavity with an axial throughflow of air

A heated rotating cavity with an axial throughflow of cooling air is used as a model for the flow in the cylindrical cavities between adjacent discs of a high-pressure gas-turbine compressor. In an engine the flow is expected to be turbulent, the limitations of this laminar study are fully realised but it is considered an essential step to understand the fundamental nature of the flow. The three-dimensional, time-dependent governing equations are solved using a code based on the finite volume technique and a multigrid algorithm. The computed flow structure shows that flow enters the cavity in one or more radial arms and then forms regions of cyclonic and anticyclonic circulation. This basic flow structure is consistent with existing experimental evidence obtained from flow visualization. The flow structure also undergoes cyclic changes with time. For example, a single radial arm, and pair of recirculation regions can commute to two radial arms and two pairs of recirculation regions and then revert back to one. The flow structure inside the cavity is found to be heavily influenced by the radial distribution of surface temperature imposed on the discs. As the radial location of the maximum disc temperature moves radially outward, this appears to increase the number of radial arms and pairs of recirculation regions (from one to three for the distributions considered here). If the peripheral shroud is also heated there appear to be many radial arms which exchange fluid with a strong cyclonic flow adjacent to the shroud. One surface temperature distribution is studied in detail and profiles of the relative tangential and radial velocities are presented. The disc heat transfer is also found to be influenced by the disc surface temperature distribution. It is also found that the computed Nusselt numbers are in reasonable accord over most of the disc surface with a correlation found from previous experimental measurements. © 1994, MCB UP Limited.

Airfoil flow and noise computation using monotonically integrated large eddy simulation and acoustic analogy: Effect of the grid resolution.

A new scalable Monotonically Integrated Large Eddy Simulation (MILES) method based on the Compact Accurately Boundary-Adjusting high-REsolution Technique (CABARET) has been applied for the simulation of unsteady flow around NACA0012 airfoil at Re = 400,000 and M = 0.058. The flow solution is coupled with the Ffowcs Williams-Hawkings formulation for far-field noise prediction. The computational modeling results are presented for several computational grid resolutions: 8, 16, and 32 million grid cells and compared with the experimental data available.

Approximate Bayesian Computation for Smoothing

We consider a method for approximate inference in hidden Markov models (HMMs). The method circumvents the need to evaluate conditional densities of observations given the hidden states. It may be considered an instance of Approximate Bayesian Computation (ABC) and it involves the introduction of auxiliary variables valued in the same space as the observations. The quality of the approximation may be controlled to arbitrary precision through a parameter ε > 0. We provide theoretical results which quantify, in terms of ε, the ABC error in approximation of expectations of additive functionals with respect to the smoothing distributions. Under regularity assumptions, this error is, where n is the number of time steps over which smoothing is performed. For numerical implementation, we adopt the forward-only sequential Monte Carlo (SMC) scheme of [14] and quantify the combined error from the ABC and SMC approximations. This forms some of the first quantitative results for ABC methods which jointly treat the ABC and simulation errors, with a finite number of data and simulated samples. © Taylor & Francis Group, LLC.

Global analysis of dynamical decision-making models through local computation around the hidden saddle

Bistable dynamical switches are frequently encountered in mathematical modeling of biological systems because binary decisions are at the core of many cellular processes. Bistable switches present two stable steady-states, each of them corresponding to a distinct decision. In response to a transient signal, the system can flip back and forth between these two stable steady-states, switching between both decisions. Understanding which parameters and states affect this switch between stable states may shed light on the mechanisms underlying the decision-making process. Yet, answering such a question involves analyzing the global dynamical (i.e., transient) behavior of a nonlinear, possibly high dimensional model. In this paper, we show how a local analysis at a particular equilibrium point of bistable systems is highly relevant to understand the global properties of the switching system. The local analysis is performed at the saddle point, an often disregarded equilibrium point of bistable models but which is shown to be a key ruler of the decision-making process. Results are illustrated on three previously published models of biological switches: two models of apoptosis, the programmed cell death and one model of long-term potentiation, a phenomenon underlying synaptic plasticity. © 2012 Trotta et al.

Cubically convergent iterations for invariant subspace computation

We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of ℝ n and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence. Moreover, we consider heuristics that greatly improve the global behavior of the iterations.

Riemannian geometry of Grassmann manifolds with a view on algorithmic computation

We give simple formulas for the canonical metric, gradient, Lie derivative, Riemannian connection, parallel translation, geodesics and distance on the Grassmann manifold of p-planes in ℝn. In these formulas, p-planes are represented as the column space of n × p matrices. The Newton method on abstract Riemannian manifolds proposed by Smith is made explicit on the Grassmann manifold. Two applications - computing an invariant subspace of a matrix and the mean of subspaces - are worked out.

A Newton algorithm for invariant subspace computation with large basins of attraction

We study the global behaviour of a Newton algorithm on the Grassmann manifold for invariant subspace computation. It is shown that the basins of attraction of the invariant subspaces may collapse in case of small eigenvalue gaps. A Levenberg-Marquardt-like modification of the algorithm with low numerical cost is proposed. A simple strategy for choosing the parameter is shown to dramatically enlarge the basins of attraction of the invariant subspaces while preserving the fast local convergence.

Morphological computation of multi-gaited robot locomotion based on free vibration.

In recent years, there has been increasing interest in the study of gait patterns in both animals and robots, because it allows us to systematically investigate the underlying mechanisms of energetics, dexterity, and autonomy of adaptive systems. In particular, for morphological computation research, the control of dynamic legged robots and their gait transitions provides additional insights into the guiding principles from a synthetic viewpoint for the emergence of sensible self-organizing behaviors in more-degrees-of-freedom systems. This article presents a novel approach to the study of gait patterns, which makes use of the intrinsic mechanical dynamics of robotic systems. Each of the robots consists of a U-shaped elastic beam and exploits free vibration to generate different locomotion patterns. We developed a simplified physics model of these robots, and through experiments in simulation and real-world robotic platforms, we show three distinctive mechanisms for generating different gait patterns in these robots.

Morphological computation for adaptive behavior and cognition

Traditionally, in robotics, artificial intelligence and neuroscience, there has been a focus on the study of the control or the neural system itself. Recently there has been an increasing interest in the notion of embodiment not only in robotics and artificial intelligence, but also in the neurosciences, psychology and philosophy. In this paper, we introduce the notion of morphological computation, and demonstrate how it can be exploited on the one hand for designing intelligent, adaptive robotic systems, and on the other hand for understanding natural systems. While embodiment has often been used in its trivial meaning, i.e. "intelligence requires a body", the concept has deeper and more important implications, concerned with the relation between physical and information (neural, control) processes. Morphological computation is about connecting body, brain and environment. A number of case studies are presented to illustrate the concept. We conclude with some speculations about potential lessons for neuroscience and robotics. © 2006 Elsevier B.V. All rights reserved.