On combining support vector machines and simulated annealing in stereovision matching

This paper outlines a method for solving the stereovision matching problem using edge segments as the primitives. In stereovision matching, the following constraints are commonly used: epipolar, similarity, smoothness, ordering, and uniqueness. We propose a new strategy in which such constraints are sequentially combined. The goal is to achieve high performance in terms of correct matches by combining several strategies. The contributions of this paper are reflected in the development of a similarity measure through a support vector machines classification approach; the transformation of the smoothness, ordering and epipolar constraints into the form of an energy function, through an optimization simulated annealing approach, whose minimum value corresponds to a good matching solution and by introducing specific conditions to overcome the violation of the smoothness and ordering constraints. The performance of the proposed method is illustrated by comparative analysis against some recent global matching methods.     

Software process representation and analysis for framework instantiation

Object-oriented frameworks are currently regarded as a promising technology for reusing designs and implementations. However, developers find there is still a steep learning curve when extracting the design rationale and understanding the framework documentation during framework instantiation. Thus, instantiation is a costly process in terms of time, people, and other resources. These problems raise a number of questions including: "How can we raise the level of abstraction in which the framework instantiation is expressed, reasoned about and implemented?" "How can the same high-level design abstractions that were used to develop the framework be used during framework instantiation instead of using source code as is done currently?" "How can we define extended design abstractions that can allow framework instantiation to be explicitly represented and validated?" We present an approach to framework instantiation based on software processes that addresses these issues. Our main goal is to represent the framework design models in an explicit and declarative way, and support changes to this design based on explicit instantiation tasks based on software processes while maintaining system integrity, invariants, and general constraints. In this way, the framework instantiation can be performed in a valid and controlled way.     

Synchronized world embedding in virtual environments

We introduce a novel distributed approach that lets users copy a given CVE section and keep it consistent with all its other copies and its original CVE area. Although 3D world modeling tools such as Alias' Maya and Discreet's 3DS Max already use object embedding, our method is the first to introduce it in a functioning CVE system. We also expand the traditional object-embedding concept by introducing a mutual synchronization function between the source and destination worlds. The mutual synchronization scheme propagates events $such as changes in an object's color, shape, or position - to other copies of a world. This synchronized world embedding thus offers a new way to expand worlds. Our method is built on existing CVE functionality, which lets us deploy it without significantly interfering with existing CVE designs. We've also altered the method so that it's usable when consistency needs are more relaxed.     

Outlier Detection and Data Cleaning in Multivariate Non-Normal Samples: The PAELLA Algorithm

A new method of outlier detection and data cleaning for both normal and non-normal multivariate data sets is proposed. It is based on an iterated local fit without a priori metric assumptions. We propose a new approach supported by finite mixture clustering which provides good results with large data sets. A multi-step structure, consisting of three phases, is developed. The importance of outlier detection in industrial modeling for open-loop control prediction is also described. The described algorithm gives good results both in simulations runs with artificial data sets and with experimental data sets recorded in a rubber factory. Finally, some discussion about this methodology is exposed.     

Benchmarking Least Squares Support Vector Machine Classifiers

In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LS-SVMs), a least squares cost function is proposed so as to obtain a linear set of equations in the dual space. While the SVM classifier has a large margin interpretation, the LS-SVM formulation is related in this paper to a ridge regression approach for classification with binary targets and to Fisher's linear discriminant analysis in the feature space. Multiclass categorization problems are represented by a set of binary classifiers using different output coding schemes. While regularization is used to control the effective number of parameters of the LS-SVM classifier, the sparseness property of SVMs is lost due to the choice of the 2-norm. Sparseness can be imposed in a second stage by gradually pruning the support value spectrum and optimizing the hyperparameters during the sparse approximation procedure. In this paper, twenty public domain benchmark datasets are used to evaluate the test set performance of LS-SVM classifiers with linear, polynomial and radial basis function (RBF) kernels. Both the SVM and LS-SVM classifier with RBF kernel in combination with standard cross-validation procedures for hyperparameter selection achieve comparable test set performances. These SVM and LS-SVM performances are consistently very good when compared to a variety of methods described in the literature including decision tree based algorithms, statistical algorithms and instance based learning methods. We show on ten UCI datasets that the LS-SVM sparse approximation procedure can be successfully applied.     

散斑检测技术及其应用

综述了散斑计量中的主要检测技术。主题包括散斑照相技术、散斑干涉技术、电子散斑干涉技术、数字散斑相关技术和时间序列散斑检测技术。介绍了散斑计量在科学和工程研究中的一些重要应用。     

缩短全精馏提氩设备调试投产时间的操作

简介粗氩塔投运条件 ,主塔工况对粗氩塔的影响与调整 ,粗氩塔的调整与投运     

Three‐dimensional finite element computations for frictional contact problems with non‐associated sliding rule

This paper presents an algorithm for solving anisotropic frictional contact problems where the sliding rule is non‐associated.The algorithm is based on a variational formulation of the complex interface model that combine the classical unilateral contact law and an anisotropic friction model with a non‐associated slip rule. Both the friction condition and the sliding potential are elliptical and have the same principal axes but with different semi‐axes ratio. The frictional contact law and its inverse are derived from a single non‐differentiable scalar‐valued function, called a bi‐potential. The convexity properties of the bi‐potential permit to associate stationary principles with initial/boundary value problems. With the present formulation, the time‐integration of the frictional contact law takes the form of a projection onto a convex set and only one predictor–corrector step addresses all cases (sticking, sliding, no‐contact). A solution algorithm is presented and tested on a simple example that shows the strong influence of the slip rule on the frictional behaviour. Copyright 2004 John Wiley & Sons, Ltd.     

On error estimator and p‐adaptivity in the generalized finite element method

This paper addresses the issue of a p‐adaptive version of the generalized finite element method (GFEM). The technique adopted here is the equilibrated element residual method, but presented under the GFEM approach, i.e., by taking into account the typical nodal enrichment scheme of the method. Such scheme consists of multiplying the partition of unity functions by a set of enrichment functions. These functions, in the case of the element residual method are monomials, and can be used to build the polynomial space, one degree higher than the one of the solution, in which the error functions is approximated. Global and local measures are defined and used as error estimator and indicators, respectively. The error indicators, calculated on the element patches that surrounds each node, are used to control a refinement procedure. Numerical examples in plane elasticity are presented, outlining in particular the effectivity index of the error estimator proposed. Finally, the ‐adaptive procedure is described and its good performance is illustrated by the last numerical example. Copyright © 2004 John Wiley & Sons, Ltd.     

Algorithms for the analysis of 3D finite strain contact problems

From the constraint imposition aspects in 3D to friction regularization, various ideas are exposed in this paper. A variation of the Rockafellar Lagrangian is proposed which results in continuous second‐order derivatives if Lagrange multiplier estimates are greater or equal than one. This fact allows the adoption of a full second‐order (i.e. Lagrange–Newton) method avoiding sequential unconstrained minimization techniques. An algorithm for global and local contact detection is presented which is developed for dealing with large step sizes typical of implicit methods. A modified constraint definition to deal with non‐smooth situations is presented. Aspects of friction implementation, including a regularization scheme which ensures stepwise objectivity, are detailed. Finally, several illustrative examples are carried out with success. Copyright © 2004 John Wiley & Sons, Ltd.