scholarly journals Linear Correction and Matching Method for 3D Line Structure Reconstruction

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Di Jia ◽  
Yuxiu Li ◽  
Si Wu ◽  
Ying Liu
Keyword(s):  
3D Reconstruction ◽  
Large Scale ◽  
Computational Cost ◽  
Small Neighborhood ◽  
Line Detection ◽  
Reconstruction Technique ◽  
Matching Method ◽  
Line Structure ◽  
Straight Line ◽  
Linear Correction

The 3D reconstruction technique using the straight-line segments as features has high precision and low computational cost. The method is especially suitable for large-scale urban datasets. However, the line matching step in the existing method has a mismatching problem. The two main reasons for this problem are the line detection result is not located at the true edge of the image and there is no consistency check of the matching pair. In order to solve this problem, a linear correction and matching method for 3D reconstruction of target line structure is proposed in this paper. Firstly, the edge features of the image are extracted to obtain a binarized edge map. Then, the extended gradient map is calculated using the edge map and the gradient to establish the gradient gravitational map. Secondly, the straight-line detection method is used to extract all the linear features used for the 3D reconstruction image, and the linear position is corrected by the gradient gravitational map. Finally, the point feature matching result is used to calculate the polar line, and the line matching results of the adjacent three images are used to determine the final partial check feature area. Then, random sampling is used to obtain the feature similarity check line matching result in the small neighborhood. The aforementioned steps can eliminate the mismatched lines. The experimental results demonstrate that the 3D model obtained using the proposed method has higher integrity and accuracy than the existing methods.

scholarly journals 3D Reconstruction with Single-Shot Structured Light RGB Line Pattern

Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4819
Author(s):  
Yikang Li ◽  
Zhenzhou Wang
Keyword(s):  
3D Reconstruction ◽  
Moving Objects ◽  
Structured Light ◽  
Color Space ◽  
Reconstruction Technique ◽  
Single Shot ◽  
Line Pattern ◽  
Hsv Color Space ◽  
Phase Map ◽  
Line Segmentation

Single-shot 3D reconstruction technique is very important for measuring moving and deforming objects. After many decades of study, a great number of interesting single-shot techniques have been proposed, yet the problem remains open. In this paper, a new approach is proposed to reconstruct deforming and moving objects with the structured light RGB line pattern. The structured light RGB line pattern is coded using parallel red, green, and blue lines with equal intervals to facilitate line segmentation and line indexing. A slope difference distribution (SDD)-based image segmentation method is proposed to segment the lines robustly in the HSV color space. A method of exclusion is proposed to index the red lines, the green lines, and the blue lines respectively and robustly. The indexed lines in different colors are fused to obtain a phase map for 3D depth calculation. The quantitative accuracies of measuring a calibration grid and a ball achieved by the proposed approach are 0.46 and 0.24 mm, respectively, which are significantly lower than those achieved by the compared state-of-the-art single-shot techniques.

Decentralized adaptive tracking control for high-order interconnected stochastic nonlinear time-varying delay systems with stochastic input-to-state stable inverse dynamics by neural networks

2019 ◽  
Vol 41 (13) ◽  
pp. 3612-3625 ◽  
Author(s):  
Wang Qian ◽  
Wang Qiangde ◽  
Wei Chunling ◽  
Zhang Zhengqiang
Keyword(s):  
Neural Networks ◽  
Tracking Control ◽  
Large Scale ◽  
Inverse Dynamics ◽  
Small Neighborhood ◽  
High Order ◽  
Interconnected Systems ◽  
Delay Systems ◽  
Rbf Neural Networks ◽  
Stochastic Input

The paper solves the problem of a decentralized adaptive state-feedback neural tracking control for a class of stochastic nonlinear high-order interconnected systems. Under the assumptions that the inverse dynamics of the subsystems are stochastic input-to-state stable (SISS) and for the controller design, Radial basis function (RBF) neural networks (NN) are used to cope with the packaged unknown system dynamics and stochastic uncertainties. Besides, the appropriate Lyapunov-Krosovskii functions and parameters are constructed for a class of large-scale high-order stochastic nonlinear strong interconnected systems with inverse dynamics. It has been proved that the actual controller can be designed so as to guarantee that all the signals in the closed-loop systems remain semi-globally uniformly ultimately bounded, and the tracking errors eventually converge in the small neighborhood of origin. Simulation example has been proposed to show the effectiveness of our results.

scholarly journals Renormalization group theory of molecular dynamics

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Daiji Ichishima ◽  
Yuya Matsumura
Keyword(s):  
Molecular Dynamics ◽  
Renormalization Group ◽  
Critical Exponent ◽  
Computational Efficiency ◽  
Large Scale ◽  
Dissipative Particle Dynamics ◽  
Computational Cost ◽  
Coarse Graining ◽  
Spatial Dimension ◽  
Deborah Number

AbstractLarge scale computation by molecular dynamics (MD) method is often challenging or even impractical due to its computational cost, in spite of its wide applications in a variety of fields. Although the recent advancement in parallel computing and introduction of coarse-graining methods have enabled large scale calculations, macroscopic analyses are still not realizable. Here, we present renormalized molecular dynamics (RMD), a renormalization group of MD in thermal equilibrium derived by using the Migdal–Kadanoff approximation. The RMD method improves the computational efficiency drastically while retaining the advantage of MD. The computational efficiency is improved by a factor of $$2^{n(D+1)}$$ 2 n ( D + 1 ) over conventional MD where D is the spatial dimension and n is the number of applied renormalization transforms. We verify RMD by conducting two simulations; melting of an aluminum slab and collision of aluminum spheres. Both problems show that the expectation values of physical quantities are in good agreement after the renormalization, whereas the consumption time is reduced as expected. To observe behavior of RMD near the critical point, the critical exponent of the Lennard-Jones potential is extracted by calculating specific heat on the mesoscale. The critical exponent is obtained as $$\nu =0.63\pm 0.01$$ ν = 0.63 ± 0.01 . In addition, the renormalization group of dissipative particle dynamics (DPD) is derived. Renormalized DPD is equivalent to RMD in isothermal systems under the condition such that Deborah number $$De\ll 1$$ D e ≪ 1 .

scholarly journals Selecting Optimal Combination of Data Channels for Semantic Segmentation in City Information Modelling (CIM)

2021 ◽  
Vol 13 (7) ◽  
pp. 1367
Author(s):  
Yuanzhi Cai ◽  
Hong Huang ◽  
Kaiyang Wang ◽  
Cheng Zhang ◽  
Lei Fan ◽  
...  
Keyword(s):  
Large Scale ◽  
Semantic Segmentation ◽  
Optimal Combination ◽  
Reconstruction Technique ◽  
Process Data ◽  
Redundant Data ◽  
Multiple Data ◽  
Information Models ◽  
Efficient Data

Over the last decade, a 3D reconstruction technique has been developed to present the latest as-is information for various objects and build the city information models. Meanwhile, deep learning based approaches are employed to add semantic information to the models. Studies have proved that the accuracy of the model could be improved by combining multiple data channels (e.g., XYZ, Intensity, D, and RGB). Nevertheless, the redundant data channels in large-scale datasets may cause high computation cost and time during data processing. Few researchers have addressed the question of which combination of channels is optimal in terms of overall accuracy (OA) and mean intersection over union (mIoU). Therefore, a framework is proposed to explore an efficient data fusion approach for semantic segmentation by selecting an optimal combination of data channels. In the framework, a total of 13 channel combinations are investigated to pre-process data and the encoder-to-decoder structure is utilized for network permutations. A case study is carried out to investigate the efficiency of the proposed approach by adopting a city-level benchmark dataset and applying nine networks. It is found that the combination of IRGB channels provide the best OA performance, while IRGBD channels provide the best mIoU performance.

3D RECONSTRUCTION OF BREAST CANCER FROM MAMMOGRAMS USING VOLUME RENDERING TECHNIQUES

2015 ◽  
Vol 75 (2) ◽  
Author(s):  
Ho Wei Yong ◽  
Abdullah Bade ◽  
Rajesh Kumar Muniandy
Keyword(s):  
Breast Cancer ◽  
3D Reconstruction ◽  
Computational Cost ◽  
Reconstruction Method ◽  
Cancer Model ◽  
Volume Reconstruction ◽  
The Past ◽  
Breast Cancer Model ◽  
Reconstruction Software ◽  
To Come

Over the past thirty years, a number of researchers have investigated on 3D organ reconstruction from medical images and there are a few 3D reconstruction software available on the market. However, not many researcheshave focused on3D reconstruction of breast cancer’s tumours. Due to the method complexity, most 3D breast cancer’s tumours reconstruction were done based on MRI slices dataeven though mammogram is the current clinical practice for breast cancer screening. Therefore, this research will investigate the process of creating a method that will be able to reconstruct 3D breast cancer’s tumours from mammograms effectively.  Several steps were proposed for this research which includes data acquisition, volume reconstruction, andvolume rendering. The expected output from this research is the 3D breast cancer’s tumours model that is generated from correctly registered mammograms. The main purpose of this research is to come up with a 3D reconstruction method that can produce good breast cancer model from mammograms while using minimal computational cost.

scholarly journals A Parallel-Computing Approach for Vector Road-Network Matching Using GPU Architecture

2018 ◽  
Vol 7 (12) ◽  
pp. 472 ◽  
Author(s):  
Bo Wan ◽  
Lin Yang ◽  
Shunping Zhou ◽  
Run Wang ◽  
Dezhi Wang ◽  
...  
Keyword(s):  
Road Network ◽  
Large Scale ◽  
Graphics Processing Unit ◽  
Road Networks ◽  
Processing Unit ◽  
Data Partition ◽  
Matching Method ◽  
The Road ◽  
Central Processing ◽  
Relaxation Matching

The road-network matching method is an effective tool for map integration, fusion, and update. Due to the complexity of road networks in the real world, matching methods often contain a series of complicated processes to identify homonymous roads and deal with their intricate relationship. However, traditional road-network matching algorithms, which are mainly central processing unit (CPU)-based approaches, may have performance bottleneck problems when facing big data. We developed a particle-swarm optimization (PSO)-based parallel road-network matching method on graphics-processing unit (GPU). Based on the characteristics of the two main stages (similarity computation and matching-relationship identification), data-partition and task-partition strategies were utilized, respectively, to fully use GPU threads. Experiments were conducted on datasets with 14 different scales. Results indicate that the parallel PSO-based matching algorithm (PSOM) could correctly identify most matching relationships with an average accuracy of 84.44%, which was at the same level as the accuracy of a benchmark—the probability-relaxation-matching (PRM) method. The PSOM approach significantly reduced the road-network matching time in dealing with large amounts of data in comparison with the PRM method. This paper provides a common parallel algorithm framework for road-network matching algorithms and contributes to integration and update of large-scale road-networks.

scholarly journals Live Collaborative Large-Scale Dense 3D Reconstruction Using Consumer-Grade Hardware

2018 ◽  
Author(s):  
Stuart Golodetz ◽  
Tommaso Cavallari ◽  
Nicholas A. Lord ◽  
Victor A. Prisacariu ◽  
David W. Murray ◽  
...  
Keyword(s):  
3D Reconstruction ◽  
Large Scale ◽  
Dense 3D Reconstruction

An Efficient Preconditioner for Linear System Solution in Multi-Domain Modeling of the Circulatory System

2013 ◽  
Author(s):  
Mahdi Esmaily Moghadam ◽  
Yuri Bazilevs ◽  
Tain-Yen Hsia ◽  
Alison Marsden
Keyword(s):  
Strong Coupling ◽  
Large Scale ◽  
Computational Cost ◽  
Circulatory System ◽  
Flow Simulation ◽  
Global Dynamics ◽  
Domain Modeling ◽  
Computationally Efficient ◽  
Lumped Parameter ◽  
System Solution

A closed-loop lumped parameter network (LPN) coupled to a 3D domain is a powerful tool that can be used to model the global dynamics of the circulatory system. Coupling a 0D LPN to a 3D CFD domain is a numerically challenging problem, often associated with instabilities, extra computational cost, and loss of modularity. A computationally efficient finite element framework has been recently proposed that achieves numerical stability without sacrificing modularity [1]. This type of coupling introduces new challenges in the linear algebraic equation solver (LS), producing an strong coupling between flow and pressure that leads to an ill-conditioned tangent matrix. In this paper we exploit this strong coupling to obtain a novel and efficient algorithm for the linear solver (LS). We illustrate the efficiency of this method on several large-scale cardiovascular blood flow simulation problems.

scholarly journals Event-Driven Simulation Scheme for Spiking Neural Networks Using Lookup Tables to Characterize Neuronal Dynamics

2006 ◽  
Vol 18 (12) ◽  
pp. 2959-2993 ◽  
Author(s):  
Eduardo Ros ◽  
Richard Carrillo ◽  
Eva M. Ortigosa ◽  
Boris Barbour ◽  
Rodrigo Agís
Keyword(s):  
Synaptic Plasticity ◽  
High Speed ◽  
Large Scale ◽  
Computational Cost ◽  
Brain Structures ◽  
Spike Timing ◽  
Neuronal Dynamics ◽  
Event Driven ◽  
Synaptic Dynamics

Nearly all neuronal information processing and interneuronal communication in the brain involves action potentials, or spikes, which drive the short-term synaptic dynamics of neurons, but also their long-term dynamics, via synaptic plasticity. In many brain structures, action potential activity is considered to be sparse. This sparseness of activity has been exploited to reduce the computational cost of large-scale network simulations, through the development of event-driven simulation schemes. However, existing event-driven simulations schemes use extremely simplified neuronal models. Here, we implement and evaluate critically an event-driven algorithm (ED-LUT) that uses precalculated look-up tables to characterize synaptic and neuronal dynamics. This approach enables the use of more complex (and realistic) neuronal models or data in representing the neurons, while retaining the advantage of high-speed simulation. We demonstrate the method's application for neurons containing exponential synaptic conductances, thereby implementing shunting inhibition, a phenomenon that is critical to cellular computation. We also introduce an improved two-stage event-queue algorithm, which allows the simulations to scale efficiently to highly connected networks with arbitrary propagation delays. Finally, the scheme readily accommodates implementation of synaptic plasticity mechanisms that depend on spike timing, enabling future simulations to explore issues of long-term learning and adaptation in large-scale networks.

scholarly journals A study of computational methods for wake structure and base pressure prediction of a generic SUV model with fixed and rotating wheels

2017 ◽  
Vol 231 (9) ◽  
pp. 1222-1238 ◽  
Author(s):  
David Forbes ◽  
Gary Page ◽  
Martin Passmore ◽  
Adrian Gaylard
Keyword(s):  
Experimental Data ◽  
Computational Methods ◽  
Large Scale ◽  
Ground Plane ◽  
Computational Cost ◽  
Rear Wheel ◽  
Base Pressure ◽  
Detached Eddy Simulation ◽  
Wake Structure ◽  
Wake Interactions

This study is an evaluation of the computational methods in reproducing experimental data for a generic sports utility vehicle (SUV) geometry and an assessment on the influence of fixed and rotating wheels for this geometry. Initially, comparisons are made in the wake structure and base pressures between several CFD codes and experimental data. It was shown that steady-state RANS methods are unsuitable for this geometry due to a large scale unsteadiness in the wake caused by separation at the sharp trailing edge and rear wheel wake interactions. unsteady RANS (URANS) offered no improvements in wake prediction despite a significant increase in computational cost. The detached-eddy simulation (DES) and Lattice–Boltzmann methods showed the best agreement with the experimental results in both the wake structure and base pressure, with LBM running in approximately a fifth of the time for DES. The study then continues by analysing the influence of rotating wheels and a moving ground plane over a fixed wheel and ground plane arrangement. The introduction of wheel rotation and a moving ground was shown to increase the base pressure and reduce the drag acting on the vehicle when compared to the fixed case. However, when compared to the experimental standoff case, variations in drag and lift coefficients were minimal but misleading, as significant variations to the surface pressures were present.

Sign in / Sign up

Export Citation Format

Share Document