基于测地回归模型的颅面复原

颅面复原是指根据一个未知颅骨的特征预测出对应的面貌,在考古研究、医学整容、刑事案件调查等领域有重要应用.为解决颅面复原过程中存在着数据量大、需要大量标定特征点的手工工作及颅面特征点定义困难的问题,针对三角网格表示的三维颅骨和面皮模型,将颅面模型用从鼻尖出发的一组测地线表示,提出了基于测地回归的颅面复原方法.该方法首先从...     

Robust Regularized Kernel Regression

Robust regression techniques are critical to fitting data with noise in real-world applications. Most previous work of robust kernel regression is usually formulated into a dual form, which is then solved by some quadratic program solver consequently. In this correspondence, we propose a new formulation for robust regularized kernel regression under the theoretical framework of regularization networks and then tackle the optimization problem directly in the primal. We show that the primal and dual approaches are equivalent to achieving similar regression performance, but the primal formulation is more efficient and easier to be implemented than the dual one. Different from previous work, our approach also optimizes the bias term. In addition, we show that the proposed solution can be easily extended to other noise-reliable loss function, including the Huber-$ epsilon$ insensitive loss function. Finally, we conduct a set of experiments on both artificial and real data sets, in which promising results show that the proposed method is effective and more efficient than traditional approaches.      

鲁棒联合稀疏不相关回归

常见的无监督特征选择方法考虑的只是选择具有判别性的特征,而忽略了特征的冗余性,并且没有考虑到小类问题,故而影响到分类性能.基于此背景,提出鲁棒不相关回归算法.首先,对不相关回归进行研究,使用不相关正交约束,以便找出不相关但具有判别性的特征,不相关约束使得数据结构保持在Stiefel流形中,使模型具有封闭解,避免了传统的...     

Geodesic Regression and the Theory of Least Squares on Riemannian Manifolds

This paper develops the theory of geodesic regression and least-squares estimation on Riemannian manifolds. Geodesic regression is a method for finding the relationship between a real-valued independent variable and a manifold-valued dependent random variable, where this relationship is modeled as a geodesic curve on the manifold. Least-squares estimation is formulated intrinsically as a minimization of the sum-of-squared geodesic distances of the data to the estimated model. Geodesic regression is a direct generalization of linear regression to the manifold setting, and it provides a simple parameterization of the estimated relationship as an initial point and velocity, analogous to the intercept and slope. A nonparametric permutation test for determining the significance of the trend is also given. For the case of symmetric spaces, two main theoretical results are established. First, conditions for existence and uniqueness of the least-squares problem are provided. Second, a maximum likelihood criteria is developed for a suitable definition of Gaussian errors on the manifold. While the method can be generally applied to data on any manifold, specific examples are given for a set of synthetically generated rotation data and an application to analyzing shape changes in the corpus callosum due to age.     

Facial Shape-from-shading and Recognition Using Principal Geodesic Analysis and Robust Statistics

The aim in this paper is to use principal geodesic analysis to model the statistical variations for sets of facial needle maps. We commence by showing how to represent the distribution of surface normals using the exponential map. Shape deformations are described using principal geodesic analysis on the exponential map. Using ideas from robust statistics we show how this deformable model may be fitted to facial images in which there is significant self-shadowing. Moreover, we demonstrate that the resulting shape-from-shading algorithm can be used to recover accurate facial shape and albedo from real world images. In particular, the algorithm can effectively fill-in the facial surface when more than 30% of its area is subject to self-shadowing. To investigate the utility of the shape parameters delivered by the method, we conduct experiments with illumination insensitive face recognition. We present a novel recognition strategy in which similarity is measured in the space of the principal geodesic parameters. We also use the recovered shape information to generate illumination normalized prototype images on which recognition can be performed. Finally we show that, from a single input image, we are able to generate the basis images employed by a number of well known illumination-insensitive recognition algorithms. We also demonstrate that the principal geodesics provide an efficient parameterization of the space of harmonic basis images.     

加权稳健支撑向量回归方法

给出一类基于奇异值软剔除的加权稳健支撑向量回归方法(WRSVR)．该方法的基本思想是首先由支撑向量回归方法(SVR)得到一个近似支撑向量回归函数,基于这个近似模型给出了加权SVR目标函数并利用高效的SVR求解技巧得到一个新的近似模型,然后再利用这个新的近似模型重新给出一个加权SVR目标函数并求解得到一个更为精确的近似模型,重复这一过程直至收敛．加权的目的是为了对奇异值进行软剔除．该方法具有思路简捷、稳健性强、容易实现等优点．实验表明,新算法WRSVR比标准SVR方法、稳健支撑向量网(RSVR)方法和加权最小二乘支撑向量机方法(WLS—SVM)更加稳健,算法的逼近精度受奇异值的影响远小于SVM、RSVR和WLS—SVM算法．     

Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow

This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but require careful and tedious input from the user. Others need little user input however they are sensitive to user input and need a postprocessing step to smooth the generated jaggy cutting contours. The popular geometric snake can be used to optimize the cutting contour, but it cannot deal with the topology change. In this paper, we propose a geodesic curvature flow based framework to overcome all these problems. Since in many cases the meaningful cutting contour on a 3D mesh is locally shortest in the sense of some weighted curve length, the geodesic curvature flow is an ideal tool for our problem. It evolves the cutting contour to the nearby local minimum. We should mention that the previous numerical scheme, discretized geodesic curvature flow (dGCF) is too slow and has not been applied to mesh segmentation. With a careful observation to dGCF, we devise here a fast computation scheme called fast geodesic curvature flow (FGCF), which only needs to solve a smaller and easier problem. The initial cutting contour is generated by a variant of random walks algorithm, which is very fast and gives reasonable cutting result with little user input. Experiment results on the benchmark mesh segmentation data set show that our proposed framework is robust to user input and capable of producing good results reflecting geometric features and human shape perception.     

Maximum Likelihood Robust Regression by Mixture Models

In this paper, we will consider a robust estimator, which was proposed earlier by the authors, in a general non-linear regression framework. The basic idea of the estimator is, instead of trying to classify the observations to good and false, to model the residual distribution of the contaminants, determine the probability for each observation to be a good sample, and finally perform weighted fitting. The main contributions of this paper are: (1) We show now that the estimator is consistent with the true parameter values that simply means optimality regardless of the problematical outliers in the observations. (2) We propose how robust uncertainty computations and robust model selection can be performed in the similar, consistent manner. (3) We derive the expectation maximisation algorithm for the estimator and (4) extend the estimator to handle unknown outlier residual distributions. (5) We finally give some experiments with real data, where robustness in model fitting is needed. Sami Brandt received the degree of Master of Science in Technology from the department of Engineering Physics and Mathematics in Helsinki University of Technology, Finland, in September 1999 and the degree of Doctor of Science in Technology at the Laboratory of Computational Engineering, Helsinki University of Technology, in October 2002. After serving one year as a research scientist in Instrumentarium Corporation Imaging Division and two years as a post-doc at LCE, he is currently jointly affiliated at LCE and Information Processing Laboratory, University of Oulu, Finland; and he focuses research on bio-medical imaging and 3D vision. He is a member of the IEEE and IEEE Computer Society, member of the Pattern Recognition Society of Finland, member of the International Association for Pattern Recognition (IAPR), and member of the Finnish Inverse Problems Society.     

Robust Optical Flow Computation Based on Least-Median-of-Squares Regression

An optical flow estimation technique is presented which is based on the least-median-of-squares (LMedS) robust regression algorithm enabling more accurate flow estimates to be computed in the vicinity of motion discontinuities. The flow is computed in a blockwise fashion using an affine model. Through the use of overlapping blocks coupled with a block shifting strategy, redundancy is introduced into the computation of the flow. This eliminates blocking effects common in most other techniques based on blockwise processing and also allows flow to be accurately computed in regions containing three distinct motions.A multiresolution version of the technique is also presented, again based on LMedS regression, which enables image sequences containing large motions to be effectively handled.An extensive set of quantitative comparisons with a wide range of previously published methods are carried out using synthetic, realistic (computer generated images of natural scenes with known flow) and natural images. Both angular and absolute flow errors are calculated for those sequences with known optical flow. Displaced frame difference error, used extensively in video compression, is used for those natural scenes with unknown flow. In all of the sequences tested, a comparison with those methods that result in a dense flow field (greater than 80% spatial coverage), show that the LMedS technique produces the least error irrespective of the error measure used.     

基于低秩表示的鲁棒回归模型

现有的线性回归方法不能有效处理噪声和异常数据。针对这一问题,结合低秩表示和鲁棒回归方法构建模型LR-RRM。利用低秩表示方法以有监督的方式检测数据内的噪声和异常值,从原始数据的低维子空间中恢复数据干净部分,并将其应用于线性回归分类,从而提升回归性能。在Extend YaleB、AR、ORL和PIE人脸数据集上的实验结果表明,与标准线性回归、基于鲁棒主成分分析和低秩表示的线性回归模型相比,该模型在4种原始数据集以及添加随机噪声后的数据集上分类准确率和鲁棒性均较优。     

Bounded Influence Support Vector Regression for Robust Single-Model Estimation

Support vector regression (SVR) is now a well-established method for estimating real-valued functions. However, the standard SVR is not effective to deal with severe outlier contamination of both response and predictor variables commonly encountered in numerous real applications. In this paper, we present a bounded influence SVR, which downweights the influence of outliers in all the regression variables. The proposed approach adopts an adaptive weighting strategy, which is based on both a robust adaptive scale estimator for large regression residuals and the statistic of a “kernelized” hat matrix for leverage point removal. Thus, our algorithm has the ability to accurately extract the dominant subset in corrupted data sets. Simulated linear and nonlinear data sets show the robustness of our algorithm against outliers. Last, chemical and astronomical data sets that exhibit severe outlier contamination are used to demonstrate the performance of the proposed approach in real situations.      

一类非平坦函数的多核最小二乘支持向量机的鲁棒回归算法

给出了标准最小二乘支持向量机的数学回归模型,并提出了多核最小二乘支持向量机算法,用于提高非平坦函数的回归精度.运用谱系聚类方法解决多核最小二乘支持向量机的解缺乏稀疏性的问题.利用偏最小二乘回归方法对多核最小二乘支持向量机进行了鲁棒回归.通过仿真实例证实了所提方法的有效性.     

Learning Regression and Verification Networks for Robust Long-term Tracking

International Journal of Computer Vision - This paper proposes a new visual tracking algorithm, which leverages the merits of both template matching approaches and classification models for...     

Robust Spectral Subspace Clustering Based on Least Square Regression

In recent years, graph based subspace clustering has attracted considerable attentions in computer vision, as its capability of clustering data efficiently. However, the graph weights built by using representation coefficients are not the exact ones as the traditional definition. That is, the two steps are conducted in independent manner such that an overall optimal result cannot be guaranteed. To this end, in this paper, a novel subspace clustering via learning an adaptive graph affinity matrix is proposed, where the soft label and the representation coefficients of data are learned in an unified framework. First, the proposed method learns a robust representation for the data through least square regression, which reveals the subspace structure within data and captures various noises inside. Second, the segmentation is sought by conducting spectral clustering simultaneously. Most importantly, during the optimization process, the segmentation is utilized to iteratively enhance the block-diagonal structure of the learned representation to further assist the clustering process. Experimental results on several famous databases demonstrate that the proposed method performs better against the state-of-the-art approaches, in clustering.     

基于稳健回归的AFM图像水平矫正算法

 AFM（Atomic Force Microscope,原子力显微镜）图像经常会出现背景倾斜或弯曲。背景倾斜的原因源于探针和样本表面的倾角或XYZ扫描仪带来的弯曲。本文将稳健的MM估计算法应用到AFM图像二维背景拟合中,消除背景的倾斜,并利用fast-s估计算法作为初始化,以缩短计算时间。实验结果表明,与传统方法相比,本方法的AFM图像水平矫正效果更好。     

回归模型中变点识别的一种稳健方法

变点识别是数据分析中一个非常重要的研究内容.文中针对目前变点识别研究中忽略了方法的稳健性,未能充分考虑异常值的影响的不足,提出利用一种高度稳健的回归类混合分解算法来识别变点.该方法从混合回归模型的角度,将含有变点的回归模型看作回归类的混合,通过逐步挖掘数据集中的回归类,并对排序后的回归类进行分析,进而确定变点的位置及个数.数值模拟表明,在识别变点的过程中无须预先指定变点的数目,并且具有高度的稳健性和有效性.     

基于多元线性回归的锂动力电池荷电状态鲁棒预测

目前广泛使用的锂电池荷电状态(state-of-charge, SOC)预测方法的训练数据需要通过大量的仿真实验获取,而电动汽车在充电过程中产生的大量的充电记录数据并没有得到合理利用。为了能有效利用这些充电记录数据,将多元线性回归算法应用到SOC预测中。多元线性回归方法将电压、电流、电容等物理量作为与SOC直接相关的输入变量从而对SOC进行回归预测。由于SOC的时序特征,将SOC预测分为多个子预测过程,不断迭代计算,循环预测SOC的下一时刻输出值。同时为了克服异常样本对SOC预测精度的影响,采用两种常见的鲁棒回归算法(Theil-sen算法与RANSAC算法)来进行SOC预测。实验结果表明,鲁棒回归算法及多元线性回归算法能够很好地捕捉到SOC的增长规律,相比之下,Theil-sen算法精度更高,误差约1.398%,能够很好地满足SOC预测的实际需求。     

Geodesic Active Contours

A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the image. The evolving contours naturally split and merge, allowing the simultaneous detection of several objects and both interior and exterior boundaries. The proposed approach is based on the relation between active contours and the computation of geodesics or minimal distance curves. The minimal distance curve lays in a Riemannian space whose metric is defined by the image content. This geodesic approach for object segmentation allows to connect classical snakes based on energy minimization and geometric active contours based on the theory of curve evolution. Previous models of geometric active contours are improved, allowing stable boundary detection when their gradients suffer from large variations, including gaps. Formal results concerning existence, uniqueness, stability, and correctness of the evolution are presented as well. The scheme was implemented using an efficient algorithm for curve evolution. Experimental results of applying the scheme to real images including objects with holes and medical data imagery demonstrate its power. The results may be extended to 3D object segmentation as well.     

鲁棒SVR在金融时间序列预测中的应用

针对标准支持向量机对噪声和异常值比较敏感的问题,通过限定噪声和异常值的损失上界,提出一种基于不对称Ramp损失函数的鲁棒支持向量回归机模型,应用凹凸过程将其由非凸优化问题转化为凸优化问题并利用牛顿法进行求解.对上证指数和香港恒生指数收盘价的预测结果表明,该模型能在一定程度上抑制噪声和异常值的影响,从而提高预测精度及减少...     

Geodesic Order Types

The geodesic between two points a and b in the interior of a simple polygon P is the shortest polygonal path inside P that connects a to b. It is thus the natural generalization of straight line segments on unconstrained point sets to polygonal environments. In this paper we use this extension to generalize the concept of the order type of a set of points in the Euclidean plane to geodesic order types. In particular, we show that, for any set S of points and an ordered subset \(\mathcal {B} \subseteq S\) of at least four points, one can always construct a polygon P such that the points of \(\mathcal {B} \) define the geodesic hull of S w.r.t. P, in the specified order. Moreover, we show that an abstract order type derived from the dual of the Pappus arrangement can be realized as a geodesic order type.