2,174 research outputs found

    Efficient moving point handling for incremental 3D manifold reconstruction

    Get PDF
    As incremental Structure from Motion algorithms become effective, a good sparse point cloud representing the map of the scene becomes available frame-by-frame. From the 3D Delaunay triangulation of these points, state-of-the-art algorithms build a manifold rough model of the scene. These algorithms integrate incrementally new points to the 3D reconstruction only if their position estimate does not change. Indeed, whenever a point moves in a 3D Delaunay triangulation, for instance because its estimation gets refined, a set of tetrahedra have to be removed and replaced with new ones to maintain the Delaunay property; the management of the manifold reconstruction becomes thus complex and it entails a potentially big overhead. In this paper we investigate different approaches and we propose an efficient policy to deal with moving points in the manifold estimation process. We tested our approach with four sequences of the KITTI dataset and we show the effectiveness of our proposal in comparison with state-of-the-art approaches.Comment: Accepted in International Conference on Image Analysis and Processing (ICIAP 2015

    Computational/experimental analysis of three low sonic boom configurations with design modifications

    Get PDF
    The Euler code, designated AIRPLANE, which uses an unstructured tetrahedral mesh was used to compute near-field sonic boom pressure signatures on three modern low sonic boom configurations: the Mach 2, Mach 3, and Haglund models. The TEAM code which uses a multi-zoned structured grid was used to calculate pressure signatures for the Mach 2 model. The computational pressure signatures for the Mach 2 and Mach 3 models are compared with recent experimental data. The computed pressure signatures were extracted at distances less than one body length below the configuration and extrapolated to the experimental distance. The Mach 2 model was found to have larger overpressures off-ground-track than on-ground-track in both computational and experimental results. The correlations with the experiment were acceptable where the signatures were not contaminated by instrumentation and model-support hardware. AIRPLANE was used to study selected modifications to improve the overpressures of the Mach 2 model

    Tracing the Dark Matter Sheet in Phase Space

    Full text link
    The primordial velocity dispersion of dark matter is small compared to the velocities attained during structure formation. The initial density distribution is close to uniform and it occupies an initial sheet in phase space that is single valued in velocity space. Because of gravitational forces this three dimensional manifold evolves in phase space without ever tearing, conserving phase-space volume and preserving the connectivity of nearby points. N-body simulations already follow the motion of this sheet in phase space. This fact can be used to extract full fine-grained phase-space-structure information from existing cosmological N-body simulations. Particles are considered as the vertices of an unstructured three dimensional mesh, moving in six dimensional phase-space. On this mesh, mass density and momentum are uniquely defined. We show how to obtain the space density of the fluid, detect caustics, and count the number of streams as well as their individual contributions to any point in configuration-space. We calculate the bulk velocity, local velocity dispersions, and densities from the sheet - all without averaging over control volumes. This gives a wealth of new information about dark matter fluid flow which had previously been thought of as inaccessible to N-body simulations. We outline how this mapping may be used to create new accurate collisionless fluid simulation codes that may be able to overcome the sparse sampling and unphysical two-body effects that plague current N-body techniques.Comment: MNRAS submitted; 17 pages, 19 figures; revised in line with referee's comments, results unchange

    Noiseless Gravitational Lensing Simulations

    Full text link
    The microphysical properties of the DM particle can, in principle, be constrained by the properties and abundance of substructures in DM halos, as measured through strong gravitational lensing. Unfortunately, there is a lack of accurate theoretical predictions for the lensing signal of substructures, mainly because of the discreteness noise inherent to N-body simulations. Here we present Recursive-TCM, a method that is able to provide lensing predictions with an arbitrarily low discreteness noise, without any free parameters or smoothing scale. This solution is based on a novel way of interpreting the results of N-body simulations, where particles simply trace the evolution and distortion of Lagrangian phase-space volume elements. We discuss the advantages of this method over the widely used cloud-in-cells and adaptive-kernel smoothing density estimators. Applying the new method to a cluster-sized DM halo simulated in warm and cold DM scenarios, we show how the expected differences in their substructure population translate into differences in the convergence and magnification maps. We anticipate that our method will provide the high-precision theoretical predictions required to interpret and fully exploit strong gravitational lensing observations.Comment: 13 pages, 13 figures. Updated fig 12, references adde

    Performance Evaluation of Vision-Based Algorithms for MAVs

    Get PDF
    An important focus of current research in the field of Micro Aerial Vehicles (MAVs) is to increase the safety of their operation in general unstructured environments. Especially indoors, where GPS cannot be used for localization, reliable algorithms for localization and mapping of the environment are necessary in order to keep an MAV airborne safely. In this paper, we compare vision-based real-time capable methods for localization and mapping and point out their strengths and weaknesses. Additionally, we describe algorithms for state estimation, control and navigation, which use the localization and mapping results of our vision-based algorithms as input.Comment: Presented at OAGM Workshop, 2015 (arXiv:1505.01065
    corecore