Search

Multi-view Stereo (MVS) meshes suffer from occlusions or missing data, making most surface reconstruction methods invalid. Due to data imperfections, existing methods, just like PolyFit, have made a trade-off between reconstruction accuracy and time consumption. We propose a novel approach that automatically reconstructs a building surface model from raw triangular mesh with data incompleteness. Unlike existing methods that extract high-quality primitives, our method focuses on assemblies of primitives to control the level of geometric detail in the reconstructed models. We design a topological relationship of the primitives to form a plane connection graph. To be precise, we first combine the scalability of shapes with plane primitives. Then strong and soft connections between primitives are constructed by calculating the confidence of the plane intersection in space. Furthermore, the topological relations of all primitives are encoded into an undirected graph. Finally, a watertight and manifold model is extracted from the faces of a candidate set by energy minimization. Experiments on the Helsinki 3D dataset demonstrate the superiority of our method in time consumption and reconstruction error, as measured by Hausdorff distance. Our method outperforms other primitive-based algorithms in handling non-planar structures. Even when dealing with imperfect data, a watertight model is still obtained. [Display omitted] • Due to the occlusion caused by various reasons such as trees, we designed a lightweight data structure and general strategy to rectify the building data defects. A confidence strategy combining graph structure is proposed, which reduces the time consumption compared with the state-of-art methods and captures more accurate geometric details within the reconstruction pipeline to generate building models with higher levels of detail. [ABSTRACT FROM AUTHOR]

In this work we continue the investigation of different approaches to conception and modelling of composite materials. The global method we focus on, is called ‘stochastic homogenization’. In this approach, the classical deterministic homogenization techniques and procedures are used to compute the macroscopic parameters of a composite starting from its microscopic properties. The stochastic part is due to averaging over some series of samples, and the fact that these samples fit into the concept of RVE (Representative Volume Element) in order to reduce the variance effect. In this article, we present a novel method for computation of effective electric properties of composites – it is based on the analysis of the connectivity graph (and the respective adjacency matrix) for each sample of a composite material. We describe how this matrix is constructed in order to take into account complex microscopic geometry. We also explain what we mean by homogenization procedure for electrical conductivity, and how the constructed matrix is related to the problem. The developed method is applied to a test study of the influence of micromorphology of composites materials on their conductivity. [ABSTRACT FROM AUTHOR]

Globalization, densification, and the urban growth require the establishment of an interdisciplinary set of tools, which will allow the analysis of the morphological, spatial, social and functional qualities of the city. Space Syntax in the urban design is applied in the modelling of the human behaviour by the examination of the spatial configuration of the urban systems. Analysis of the spatial integration, connectivity and visual exposure of open spaces and paths in combination with the land use patterns indicates the areas, which facilitate the social and commercial activities. This approach is implemented on the four residential complexes of the city of Tirana. Results show the correlation between the type and location of the activities and the spatial and visual integration. The applied methodology is suitable for the preliminary comprehension of the social dimension of the urban projects at the design stage. The insights from the study are appropriate to be used as the urban planning policies in the developing countries of the Global South. • The study is focused on the exploration of socio-spatial parameters of four neighbourhoods using the Space Syntax analysis. • Integration and visual exposure analysis indicates the areas, which encourage the social and commercial activities. • Space hierarchy, intelligible street network and well-integrated large open space facilitate the liveable built environment. • Physical, social and syntactic assessment of the residential development should be prioritised by the urban policies. [ABSTRACT FROM AUTHOR]

Abstract: The main aim of the detailed facility layout is to calculate the obstacle-avoiding Manhattan shortest path (OAMSP) between facilities. We propose a connectivity graph generation approach for OAMSP calculation. The proposed approach makes full use of the characteristics of Manhattan distance, which are different from Euclidean distance. The proposed connectivity graph contains O(N log N) vertices and edges, where N is the total number of all facilities vertices. We give two examples to compare the proposed approach and two classical graph theoretic approaches. The results showed that the proposed connectivity graph possessed less vertices and edges, and the generation time of the proposed approach is also shorter than other two methods. Thus, the proposed approach can shorten the time of shortest distance calculation in detailed layout. Furthermore, the proposed graph can be valuable reference to the transport routing planning. [Copyright &y& Elsevier]

Abstract: Probability hypothesis density (PHD) filter and cardinalized PHD (CPHD) filter have proved to be promising algorithms for tracking an unknown number of targets in real time. However, they do not provide the identities of the individual estimated targets, so the target tracks cannot be obtained. To solve this problem, we propose a new track maintenance algorithm based on the cross entropy (CE) technique. Firstly, the particle filter PHD (PF-PHD) algorithm is used to estimate the target states and the target number. Then, the results of the estimation are used as vertexes to construct a connectivity graph with associated weights, and the CE technique is employed as a global optimization scheme to calculate the optimal feasible associated events. Furthermore, due to the advantages of the CPHD filter and the Rao-Blackwellized particle filter (RBPF), we propose another track maintenance algorithm based on the CE technique, named the RBPF–CPHD tracker, which can further improve the track maintenance performance due to the more accurate state estimates and their number estimates. Simulation results show that the proposed algorithms can effectively achieve the track continuity, with stronger robustness and greater anti-jamming capability. [Copyright &y& Elsevier]