Automatic Postprocessing of Topology Optimization Solutions by Using Support Vector Machines

Author(s):  
Niclas Strömberg

The postprocessing step from the density result in topology optimization to a parametric CAD model is typically most time consuming and usually involves several hands on maneuvers by an engineer. In this paper we propose an approach in order to automate this step by using soft non-linear support vector machines (SVM). Our idea is to generate the boundaries separating regions of material (elements with densities equal to one) and no material (elements with densities equal zero) obtained from topology optimization automatically by using SVM. The hyper-surface of the SVM can then in the long run be explicitly implemented in any CAD software. In this work we generate these hypersurfaces by solving the dual formulation of the SVM with soft penalization and nonlinear kernel functions using quadratic programming or the sequential minimal optimization approach. The proposed SVM-based postprocessing approach is studied on topology optimization results of orthotropic elastic design domains with mortar contact conditions studied most recently in a previous work. The potential energy of several bodies with nonmatching meshes is maximized. In such manner no extra adjoint equation is needed. Intermediate density values are penalized using SIMP or RAMP, and the regularization is obtained by applying sensitivity or density filters following the approaches of Sigmund and Bourdin. The study demonstrates that the SVM-based postprocessing approach automatically generates proper hypersurfaces which can be used efficiently in the CAD modelling.

This article presented in the context of 2D global facial recognition, using Gabor Wavelet's feature extraction algorithms, and facial recognition Support Vector Machines (SVM), the latter incorporating the kernel functions: linear, cubic and Gaussian. The models generated by these kernels were validated by the cross validation technique through the Matlab application. The objective is to observe the results of facial recognition in each case. An efficient technique is proposed that includes the mentioned algorithms for a database of 2D images. The technique has been processed in its training and testing phases, for the facial image databases FERET [1] and MUCT [2], and the models generated by the technique allowed to perform the tests, whose results achieved a facial recognition of individuals over 96%.


Author(s):  
Alina Lazar ◽  
Bradley A. Shellito

Support Vector Machines (SVM) are powerful tools for classification of data. This article describes the functionality of SVM including their design and operation. SVM have been shown to provide high classification accuracies and have good generalization capabilities. SVM can classify linearly separable data as well as nonlinearly separable data through the use of the kernel function. The advantages of using SVM are discussed along with the standard types of kernel functions. Furthermore, the effectiveness of applying SVM to large, spatial datasets derived from Geographic Information Systems (GIS) is also described. Future trends and applications are also discussed – the described extracted dataset contains seven independent variables related to urban development plus a class label which denotes the urban areas versus the rural areas. This large dataset, with over a million instances really proves the generalization capabilities of the SVM methods. Also, the spatial property allows experts to analyze the error signal.


2014 ◽  
Vol 511-512 ◽  
pp. 467-474
Author(s):  
Jun Tu ◽  
Cheng Liang Liu ◽  
Zhong Hua Miao

Feature selection plays an important role in terrain classification for outdoor robot navigation. For terrain classification, the image data usually have a large number of feature dimensions. The better selection of features usually results in higher labeling accuracy. In this work, a novel approach for terrain perception using Importance Factor based I-Relief algorithm and Feature Weighted Support Vector Machines (IFIR-FWSVM) is put forward. Firstly, the weight of each feature for classification is computed by using Importance Factor based I-Relief algorithm (IFIR) and the irrelevant features are eliminated. Then the weighted features are used to compute the kernel functions of SVM and trained the classifier. Finally, the trained SVM is employed to predict the terrain label in the far-field regions. Experimental results based on DARPA datasets show that the proposed method IFIR-FWSVM is superior over traditional SVM.


2014 ◽  
Vol 644-650 ◽  
pp. 4314-4318
Author(s):  
Xin You Wang ◽  
Ya Li Ning ◽  
Xi Ping He

In order to solve the problem of the conventional methods operated directly in the image, difficult to obtain good results because they are poor in high dimension performance. In this paper, a new method was proposed, which use the Least Squares Support Vector Machines in image segmentation. Furthermore, the parameters of kernel functions are also be optimized by Particle Swarm Optimization (PSO) algorithm. The practical application in various of standard data sets and color image segmentation experiment. The results show that, LS-SVM can use a variety of features in image, the experiments have achieved good results of image segmentation, and the time needed for segmentation is greatly reduced than standard SVM.


Author(s):  
Sadaaki Miyamoto ◽  
◽  
Youichi Nakayama ◽  

We discuss hard c-means clustering using a mapping into a high-dimensional space considered within the theory of support vector machines. Two types of iterative algorithms are developed. Effectiveness of the proposed method is shown by numerical examples.


2014 ◽  
Vol 281 ◽  
pp. 478-495 ◽  
Author(s):  
Helmuth Pree ◽  
Benjamin Herwig ◽  
Thiemo Gruber ◽  
Bernhard Sick ◽  
Klaus David ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document