Comparison of Image-Based and Time-of-Flight-Based Technologies for Three-Dimensional Reconstruction of Infrastructure

Image-based (i.e., photo/videogrammetry) and time-of-flight-based (i.e., laser scanning) technologies are typically used to collect spatial data of infrastructure. In order to help architecture, engineering, and construction (AEC) industries make cost-effective decisions in selecting between these two technologies with respect to their settings, this paper makes an attempt to measure the accuracy, quality, time efficiency, and cost of applying image-based and time-of-flight-based technologies to conduct as-built 3D reconstruction of infrastructure. In this paper, a novel comparison method is proposed, and preliminary experiments are conducted. The results reveal that if the accuracy and quality level desired for a particular application is not high (i.e., error < 10 cm, and completeness rate > 80%), image-based technologies constitute a good alternative for time-of-flight-based technologies and significantly reduce the time and cost needed for collecting the data on site.

Tomographic reconstruction of OH* chemiluminescence in two interacting turbulent flames

The tomographic reconstruction of OH* chemiluminescence was performed on two interacting turbulent premixed bluff-body stabilized flames under steady flow conditions and acoustic excitation. These measurements elucidate the complex three-dimensional (3D) vortex-flame interactions which have previously not been accessible. The experiment was performed using a single camera and intensifier, with multiple views acquired by repositioning the camera, permitting calculation of the mean and phase-averaged volumetric OH* distributions. The reconstructed flame structure and phase-averaged dynamics are compared with OH planar laser-induced fluorescence and flame surface density measurements for the first time. The volumetric data revealed that the large-scale vortex-flame structures formed along the shear layers of each flame collide when the two flames meet, resulting in complex 3D flame structures in between the two flames. With a fairly simple experimental setup, it is shown that the tomographic reconstruction of OH* chemiluminescence in forced flames is a powerful tool that can yield important physical insights into large-scale 3D flame dynamics that are important in combustion instability. © 2013 IOP Publishing Ltd.

Finite element analysis of compressor disc heat transfer using the transient conduction method with sparse boundary collocation points

Surface temperature measurements from two discs of a gas turbine compressor rig are used as boundary conditions for the transient conduction solution (inverse heat transfer analysis). The disc geometry is complex, and so the finite element method is used. There are often large radial temperature gradients on the discs, and the equations are therefore solved taking into account the dependence of thermal conductivity on temperature. The solution technique also makes use of a multigrid algorithm to reduce the solution time. This is particularly important since a large amount of data must be analyzed to obtain correlations of the heat transfer. The finite element grid is also used for a network analysis to calculate the radiant heat transfer in the cavity formed between the two compressor discs. The work discussed here proved particularly challenging as the disc temperatures were only measured at four different radial locations. Four methods of surface temperature interpolation are examined, together with their effect on the local heat fluxes. It is found that the choice of interpolation method depends on the available number of data points. Bessel interpolation gives the best results for four data points, whereas cubic splines are preferred when there are considerably more data points. The results from the analysis of the compressor rig data show that the heat transfer near the disc inner radius appears to be influenced by the central throughflow. However, for larger radii, the heat transfer from the discs and peripheral shroud is found to be consistent with that of a buoyancy-induced flow.

Robust network reconstruction in polynomial time

This paper presents an efficient algorithm for robust network reconstruction of Linear Time-Invariant (LTI) systems in the presence of noise, estimation errors and unmodelled nonlinearities. The method here builds on previous work [1] on robust reconstruction to provide a practical implementation with polynomial computational complexity. Following the same experimental protocol, the algorithm obtains a set of structurally-related candidate solutions spanning every level of sparsity. We prove the existence of a magnitude bound on the noise, which if satisfied, guarantees that one of these structures is the correct solution. A problem-specific model-selection procedure then selects a single solution from this set and provides a measure of confidence in that solution. Extensive simulations quantify the expected performance for different levels of noise and show that significantly more noise can be tolerated in comparison to the original method. © 2012 IEEE.

Dynamical structure function identifiability conditions enabling signal structure reconstruction

Networks of controlled dynamical systems exhibit a variety of interconnection patterns that could be interpreted as the structure of the system. One such interpretation of system structure is a system's signal structure, characterized as the open-loop causal dependencies among manifest variables and represented by its dynamical structure function. Although this notion of structure is among the weakest available, previous work has shown that if no a priori structural information is known about the system, not even the Boolean structure of the dynamical structure function is identifiable. Consequently, one method previously suggested for obtaining the necessary a priori structural information is to leverage knowledge about target specificity of the controlled inputs. This work extends these results to demonstrate precisely the a priori structural information that is both necessary and sufficient to reconstruct the network from input-output data. This extension is important because it significantly broadens the applicability of the identifiability conditions, enabling the design of network reconstruction experiments that were previously impossible due to practical constraints on the types of actuation mechanisms available to the engineer or scientist. The work is motivated by the proteomics problem of reconstructing the Per-Arnt-Sim Kinase pathway used in the metabolism of sugars. © 2012 IEEE.

Generalized power method for sparse principal component analysis

In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if the data matrix has many more columns (variables) than rows. We then propose and analyze a simple gradient method suited for the task. It appears that our algorithm has best convergence properties in the case when either the objective function or the feasible set are strongly convex, which is the case with our single-unit formulations and can be enforced in the block case. Finally, we demonstrate numerically on a set of random and gene expression test problems that our approach outperforms existing algorithms both in quality of the obtained solution and in computational speed. © 2010 Michel Journée, Yurii Nesterov, Peter Richtárik and Rodolphe Sepulchre.