一种改进的活动轮廓图像分割技术

图像分割是由图像处理到图像分析的关键步骤，也是一种基本的计算机视觉技术。针对传统的活动轮廓外力模型均存在一些难以克服的缺点，提出了一种改进的活动轮廓图像分割技术，并首先介绍了用活动轮廓进行目标分割的基本原理，即一条曲线在其内部能量和外部能量的共同作用下，可以移动到所期望的位置，并且当曲线到达目标位置的时候，活动曲线所具有的能量达到最小。在传统的活动轮廓中，外部能量通常由目标点的梯度势能场给出，但是由于梯度势能场存在着一些难以克服的缺点，即不能够很好地指导曲线的移动，为此，对其进行了改进，即采用一种梯度向量流场作为外部能量场的方法，从而有效地克服了传统梯度势能场捕捉范围小以及难以处理凹平面的缺点，并通过实验证明了该方法的有效性。     

融合无监督和监督学习策略生成的多分类决策树

提出了一种融合无监督和监督两种学习策略生成多分类决策树的方法．它首先利用无监督聚类方法能够发现待分类样本之问的内在联系和规律的特点，确定出最为符合多类样本分布特征的决策树的树型，继而利用监督学习支持向量机的方法对样本进行准确的分类，通过采用核函数和不对称的Lagrangian系数限制条件，支持向量机很好的解决了样本特征空间上的线性不可分性和决策树型确定过程中出现的训练样本不对称性的影响、该方法具有较高的计算效率和准确性，在实验申取得了比较好的结果．     

基于聚类、粗糙集和支持向量机的故障诊断

故障诊断有多种方法,利用支持向量机进行故障诊断是其中一种比较有效的方法。但是,故障征兆往往有多个,很难确定哪些征兆是关键的,哪些征兆是冗余的,这样就要搜集处理大量的数据,使支持向量机的结构变得复杂,诊断效率不高。为了提高故障诊断的效率,文中提出一种将K均值聚类、粗糙集、支持向量机相结合进行故障诊断的方法。这种方法首先利用K均值聚类对数据进行预处理,然后利用粗糙集对属性进行约简,最后再用支持向量机进行故障诊断。这样可以充分发挥粗糙集与支持向量机各自的优势,实例证明它可以提高故障诊断的速度和精确度,是一种较好的故障诊断方法。     

Normal vector compression of 3D mesh model based on clustering and relative indexing

As the transmission of 3D shape models through Internet becomes more important, the compression issue of shape models gets more critical. While the compressions of topology and geometry have been explored significantly, the same issue for normal vectors has not yet been studied as much as it deserves.

Presented in this paper is an approach to compress the normal vectors of a 3D mesh model using the concept of clustering and relative indexing. The model is assumed to be manifold triangular mesh model with normal vectors associated with vertices. The proposed scheme clusters the normal vectors of given model and the representative normal vector of each cluster is referred to via a mixed use of relative as well as absolute indexing concepts. It turns out that the proposed approach achieves a significant compression ratio (less than 10% of the original VRML model files) without a serious sacrifice of the visual quality.     

Isotropic Energies, Filters and Splines for Vector Field Regularization

The aim of this paper is to propose new regularization and filtering techniques for dense and sparse vector fields, and to focus on their application to non-rigid registration. Indeed, most of the regularization energies used in non-rigid registration operate independently on each coordinate of the transformation. The only common exception is the linear elastic energy, which enables cross-effects between coordinates. Cross-effects are yet essential to give realistic deformations in the uniform parts of the image, where displacements are interpolated.In this paper, we propose to find isotropic quadratic differential forms operating on a vector field, using a known theorem on isotropic tensors, and we give results for differentials of order 1 and 2. The quadratic approximation induced by these energies yields a new class of vectorial filters, applied numerically in the Fourier domain. We also propose a class of separable isotropic filters generalizing Gaussian filtering to vector fields, which enables fast smoothing in the spatial domain. Then we deduce splines in the context of interpolation or approximation of sparse displacements. These splines generalize scalar Laplacian splines, such as thin-plate splines, to vector interpolation. Finally, we propose to solve the problem of approximating a dense and a sparse displacement field at the same time. This last formulation enables us to introduce sparse geometrical constraints in intensity based non-rigid registration algorithms, illustrated here on intersubject brain registration.     

Detecting image orientation based on low-level visual content

Accurately and automatically detecting image orientation is of great importance in intelligent image processing. In this paper, we present automatic image orientation detection algorithms based on both the luminance (structural) and chrominance (color) low-level content features. The statistical learning support vector machines (SVMs) are used in our approach as the classifiers. The different sources of the extracted image features, as well as the binary classification nature of SVM, require our system to be able to integrate the outputs from multiple classifiers. Both static combiner (averaging) and trainable combiner (also based on SVMs) are proposed and evaluated in this work. Furthermore, two rejection options (regular and re-enforced ambiguity rejections) are employed to improve orientation detection accuracy by sieving out images with low confidence values during the classification. Large amounts of experiments have been conducted on a database of more than 14,000 images to validate our approaches. Discussions and future directions for this work are also addressed at the end of the paper.     

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.     

单芯片交流伺服电动机速度控制器的实现

采用磁场定向矢量控制(FOC)和空间矢量脉宽调制方式(SVPWM),通过模块化的EDA设计方法在单个FPGA芯片内综合了包括:FOC、SVPWM、电流环、速度环PI调节器、通讯接口等复杂的控制模块。介绍了相关控制模块的控制原理和设计思想,并给出了EDA设计的仿真结果,最后给出了速度控制实验波形。由于采用了矢量控制,与VVVF感应电动机速率伺服系统相比具有更好的线性调速特性和动态性能。     

用神经网络实现对感应电动机的转速估计

根据感应电动机数学模型,介绍了一种利用神经网络进行感应电动机转速估计的新方法,在该方法中采用一个三层神经网络作为速度估计器来估计转速。仿真结果表明这种基于人工神经网络的转速估计模型可以准确地跟踪感应电动机转速的变化,具有良好的动态跟随性能。     

采用矢量细分的异步电动机直接转矩控制系统

介绍了一种采用矢量细分和SVPWM调制的直接转矩控制方法,实现对电机转矩的控制。将该控制方法应用到异步电动机调速系统,通过系统仿真实验验证,该控制方法的输出转矩脉动小、电流谐波低、开关频率固定,调速系统有着良好的动态性能和调速精度。