A hybrid point cloud alignment method combining particle swarm optimization and iterative closest point method
نویسندگان
چکیده
منابع مشابه
HYBRID PARTICLE SWARM OPTIMIZATION, GRID SEARCH METHOD AND UNIVARIATE METHOD TO OPTIMALLY DESIGN STEEL FRAME STRUCTURES
This paper combines particle swarm optimization, grid search method and univariate method as a general optimization approach for any type of problems emphasizing on optimum design of steel frame structures. The new algorithm is denoted as the GSU-PSO. This method attempts to decrease the search space and only searches the space near the optimum point. To achieve this aim, the whole search space...
متن کاملAn Iterative Closest Point Method for Unsupervised Word Translation
Unsupervised word translation from nonparallel inter-lingual corpora has attracted much research interest. Very recently, neural network methods trained with adversarial loss functions achieved high accuracy on this task. Despite the impressive success of the recent techniques, they suffer from the typical drawbacks of generative adversarial models: sensitivity to hyper-parameters, long trainin...
متن کاملOPTIMAL DESIGN OF ARCH DAMS BY COMBINING PARTICLE SWARM OPTIMIZATION AND GROUP METHOD OF DATA HANDLING
Optimization techniques can be efficiently utilized to achieve an optimal shape for arch dams. This optimal design can consider the conditions of the economy and safety simultaneously. The main aim is to present an applicable and practical model and suggest an algorithm for optimization of concrete arch dams to enhance their seismic performance. To achieve this purpose, a preliminary optimizati...
متن کاملGroundwater remediation optimization using a point collocation method and particle swarm optimization
Groundwater contamination is a major problem in many parts of the world. Remediation of contaminated groundwater is a tedious, time consuming and expensive process. Pump and treat (PAT) is one of the commonly used techniques for groundwater remediation. Simulation-optimization (S/O) models are very useful in appropriate design of an effective PAT remediation system. Simulation models can be emp...
متن کاملA Common Fixed Point Theorem Using an Iterative Method
Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Manufacturing
سال: 2014
ISSN: 2095-3127,2195-3597
DOI: 10.1007/s40436-014-0059-0