Principal Variety Analysis

We introduce a novel computational framework, Principal Variety Analysis (PVA), for primarily nonlinear data modeling. PVA accommodates algebraic sets as the target subspace through which limitations of other existing approaches is dealt with. PVA power is demonstrated in this paper for learning kinematics of objects, as an important application. PVA takes recorded coordinates of some pre-specified features on the objects as input and outputs a lowest dimensional variety on which the feature coordinates jointly lie. Unlike existing object modeling methods, which require entire trajectories of objects, PVA requires much less information and provides more flexible and generalizable models, namely an analytical algebraic kinematic model of the objects, even in unstructured, uncertain environments. Moreover, it is not restricted to predetermined model templates and is capable of extracting much more general types of models. Besides finding the kinematic model of objects, PVA can be a powerful tool to estimate their corresponding degrees of freedom. PVA computational success depends on exploiting sparsity, in particular algebraic dimension minimization through replacement of intractable `0 norm (rank) with tractable `1 norm (nuclear norm). Complete characterization of the assumptions under which `0 and `1 norm minimizations yield virtually the same outcome is introduced as an important open problem in this paper.

[1]  A. Householder,et al.  Discussion of a set of points in terms of their mutual distances , 1938 .

[2]  Kilian Q. Weinberger,et al.  Unsupervised Learning of Image Manifolds by Semidefinite Programming , 2004, CVPR.

[3]  S. Shankar Sastry,et al.  Generalized principal component analysis (GPCA) , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  M.T. Manzuri-Shalmani,et al.  A New Fuzzy-Based Spatial Model for Robot Navigation among Dynamic Obstacles , 2007, 2007 IEEE International Conference on Control and Automation.

[5]  Holger Wendland,et al.  Scattered Data Approximation: Conditionally positive definite functions , 2004 .

[6]  Weiyu Xu,et al.  Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization , 2008, 2008 47th IEEE Conference on Decision and Control.

[7]  Jan Peters,et al.  Model Learning in Robotics: a Survey , 2011 .

[8]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[9]  Roi Livni,et al.  Vanishing Component Analysis , 2013, ICML.

[10]  Pablo A. Estévez,et al.  Geodesic Nonlinear Mapping Using the Neural Gas Network , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.

[11]  P. Olver.  On Multivariate Interpolation , 2006 .

[12]  Jeanny Hérault,et al.  Curvilinear component analysis: a self-organizing neural network for nonlinear mapping of data sets , 1997, IEEE Trans. Neural Networks.

[13]  Marco Vianello,et al.  A Numerical Study of the Xu Polynomial Interpolation Formula in Two Variables , 2005, Computing.

[14]  Hamidreza Chitsaz,et al.  NUROA: A numerical roadmap algorithm , 2014, 53rd IEEE Conference on Decision and Control.

[15]  Dominik Belter,et al.  Kinematically optimised predictions of object motion , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Teuvo Kohonen,et al.  Self-organized formation of topologically correct feature maps , 2004, Biological Cybernetics.

[17]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[18]  Alvise Sommariva,et al.  Padua2DM: fast interpolation and cubature at the Padua points in Matlab/Octave , 2010, Numerical Algorithms.

[19]  Franz J. Király,et al.  A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion , 2012, ICML.

[20]  Sanjoy Dasgupta,et al.  An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.

[21]  Christopher M. Bishop,et al.  GTM: A Principled Alternative to the Self-Organizing Map , 1996, NIPS.

[22]  Jürgen Sturm.  Approaches to Probabilistic Model Learning for Mobile Manipulation Robots , 2013, Springer Tracts in Advanced Robotics.

[23]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[24]  Kurt Konolige,et al.  Autonomous door opening and plugging in with a personal robot , 2010, 2010 IEEE International Conference on Robotics and Automation.

[25]  Franz J. Király,et al.  The algebraic combinatorial approach for low-rank matrix completion , 2012, J. Mach. Learn. Res..

[26]  Joshua B. Tenenbaum,et al.  Mapping a Manifold of Perceptual Observations , 1997, NIPS.

[27]  Mei Han An,et al.  accuracy and stability of numerical algorithms , 1991 .

[28]  John W. Sammon,et al.  A Nonlinear Mapping for Data Structure Analysis , 1969, IEEE Transactions on Computers.

[29]  Mohammad T. Manzuri Shalmani,et al.  AMF: A novel reactive approach for motion planning of mobile robots in unknown dynamic environments , 2009, 2009 IEEE International Conference on Robotics and Biomimetics (ROBIO).

[30]  J. Kruskal.  Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .

[31]  Oliver Brock,et al.  Extracting Planar Kinematic Models Using Interactive Perception , 2008 .

[32]  T. Sauer,et al.  On the history of multivariate polynomial interpolation , 2000 .

[33]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[34]  Michel Verleysen,et al.  Nonlinear Dimensionality Reduction , 2021, Computer Vision.

[35]  Sebastian Pokutta,et al.  Approximate computation of zero-dimensional polynomial ideals , 2009, J. Symb. Comput..

[36]  Michel Verleysen,et al.  Locally Linear Embedding versus Isotop , 2003, ESANN.

[37]  Stephen P. Boyd,et al.  A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[38]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[39]  Gunnar E. Carlsson,et al.  Topology and data , 2009 .

[40]  Michel Verleysen,et al.  A robust non-linear projection method , 2000, ESANN.

[41]  Mark Whitty,et al.  Robotics, Vision and Control. Fundamental Algorithms in MATLAB , 2012 .