Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The analysis of experimental data is at heart of science from its beginnings. But it was the advent of digital computers that allowed the execution of highly non-linear and increasingly complex data analysis procedures - methods that were completely unfeasible before. Non-linear curve fitting, clustering and machine learning belong to these modern techniques which are a further step towards computational intelligence. The goal of this book is to provide an interactive and illustrative guide to these topics. It concentrates on the road from two dimensional curve fitting to multidimensional clustering and machine learning with neural networks or support vector machines. Along the way topics like mathematical optimization or evolutionary algorithms are touched. All concepts and ideas are outlined in a clear cut manner with graphically depicted plausibility arguments and a little elementary mathematics. The major topics are extensively outlined with exploratory examples and applications. The primary goal is to be as illustrative as possible without hiding problems and pitfalls but to address them. The character of an illustrative cookbook is complemented with specific sections that address more fundamental questions like the relation between machine learning and human intelligence All topics are completely demonstrated with the aid of the commercial computing platform Mathematica and the Computational Intelligence Packages (CIP), a high-level function library developed with Mathematica's programming language on top of Mathematica's algorithms. CIP is open-source so the detailed code of every method is freely accessible. All examples and applications shown throughout the book may be used and customized by the reader without any restrictions.

Machine learning -- Periodicals. --- Machine learning. --- Computational intelligence --- Curve fitting --- Cluster analysis --- Engineering & Applied Sciences --- Computer Science --- Science --- Curve fitting. --- Computational intelligence. --- Statistical methods. --- Intelligence, Computational --- Learning, Machine --- Fitting, Curve --- Engineering. --- Artificial intelligence. --- Applied mathematics. --- Engineering mathematics. --- Computational Intelligence. --- Artificial Intelligence (incl. Robotics). --- Appl.Mathematics/Computational Methods of Engineering. --- Artificial intelligence --- Soft computing --- Engineering --- Engineering analysis --- Mathematical analysis --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Construction --- Industrial arts --- Technology --- Mathematics --- Numerical analysis --- Least squares --- Smoothing (Numerical analysis) --- Statistics --- Graphic methods --- Artificial Intelligence. --- Mathematical and Computational Engineering.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Due to the continuing progress of sensor technology, the availability of 3-D cameras is already foreseeable. These cameras are capable of generating a large set of measurement points within a very short time. There are a variety of 3-D camera applications in the fields of robotics, rapid product development and digital factories. In order to not only visualize the point cloud but also to recognize 3-D object models from the point cloud and then further process them in CAD systems, efficient and stable algorithms for 3-D information processing are required. For the automatic segmentation and recognition of such geometric primitives as plane, sphere, cylinder, cone and torus in a 3-D point cloud, efficient software has recently been developed at the Fraunhofer IPA by Sung Joon Ahn. This book describes in detail the complete set of ‘best-fit’ algorithms for general curves and surfaces in space which are employed in the Fraunhofer software.

Discrete groups. --- Numeric Computing. --- Computer Graphics. --- Image Processing and Computer Vision. --- Convex and Discrete Geometry. --- Curves, Orthogonal --- Surfaces, Orthogonal --- Curves, Orthogonal. --- Surfaces, Orthogonal. --- Orthogonal surfaces --- Orthogonal curves --- Fitting, Curve --- Computer science. --- Computers. --- Algorithms. --- Numerical analysis. --- Computer graphics. --- Mathematics. --- Algebra. --- Computer Science. --- Theory of Computation. --- Mathematics, general. --- Algorithm Analysis and Problem Complexity. --- Mathematics --- Mathematical analysis --- Math --- Science --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Algorism --- Algebra --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Informatics --- Digital techniques --- Foundations --- Curve fitting. --- Least squares --- Computer programs. --- Curves, Algebraic --- Numerical analysis --- Smoothing (Numerical analysis) --- Statistics --- Graphic methods --- Curve fitting --- Computer programs --- Information theory. --- Electronic data processing. --- Computer software. --- Software, Computer --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Communication theory --- Communication --- Automation

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Curve fitting --- Least squares --- #KVIV --- 519.6 --- 681.3*G12 --- 681.3*G4 --- 681.3*G4 Mathematical software: algorithm analysis; certification and testing; efficiency; portability; reliability and robustness; verification --- Mathematical software: algorithm analysis; certification and testing; efficiency; portability; reliability and robustness; verification --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Method of least squares --- Squares, Least --- Geodesy --- Mathematical statistics --- Mathematics --- Probabilities --- Triangulation --- Fitting, Curve --- Numerical analysis --- Smoothing (Numerical analysis) --- Statistics --- Data processing --- Graphic methods --- Numerical approximation theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Splines, both interpolatory and smoothing, have a long and rich history that has largely been application driven. This book unifies these constructions in a comprehensive and accessible way, drawing from the latest methods and applications to show how they arise naturally in the theory of linear control systems. Magnus Egerstedt and Clyde Martin are leading innovators in the use of control theoretic splines to bring together many diverse applications within a common framework. In this book, they begin with a series of problems ranging from path planning to statistics to approximation. Using the tools of optimization over vector spaces, Egerstedt and Martin demonstrate how all of these problems are part of the same general mathematical framework, and how they are all, to a certain degree, a consequence of the optimization problem of finding the shortest distance from a point to an affine subspace in a Hilbert space. They cover periodic splines, monotone splines, and splines with inequality constraints, and explain how any finite number of linear constraints can be added. This book reveals how the many natural connections between control theory, numerical analysis, and statistics can be used to generate powerful mathematical and analytical tools. This book is an excellent resource for students and professionals in control theory, robotics, engineering, computer graphics, econometrics, and any area that requires the construction of curves based on sets of raw data.

Interpolation. --- Smoothing (Numerical analysis) --- Smoothing (Statistics) --- Curve fitting. --- Splines. --- Spline theory. --- Spline functions --- Approximation theory --- Interpolation --- Joints (Engineering) --- Mechanical movements --- Harmonic drives --- Fitting, Curve --- Numerical analysis --- Least squares --- Statistics --- Curve fitting --- Graduation (Statistics) --- Roundoff errors --- Graphic methods --- Accuracy and precision. --- Affine space. --- Affine variety. --- Algorithm. --- Approximation. --- Arbitrarily large. --- B-spline. --- Banach space. --- Bernstein polynomial. --- Bifurcation theory. --- Big O notation. --- Birkhoff interpolation. --- Boundary value problem. --- Bézier curve. --- Chaos theory. --- Computation. --- Computational problem. --- Condition number. --- Constrained optimization. --- Continuous function (set theory). --- Continuous function. --- Control function (econometrics). --- Control theory. --- Controllability. --- Convex optimization. --- Convolution. --- Cubic Hermite spline. --- Data set. --- Derivative. --- Differentiable function. --- Differential equation. --- Dimension (vector space). --- Directional derivative. --- Discrete mathematics. --- Dynamic programming. --- Equation. --- Estimation. --- Filtering problem (stochastic processes). --- Gaussian quadrature. --- Gradient descent. --- Gramian matrix. --- Growth curve (statistics). --- Hermite interpolation. --- Hermite polynomials. --- Hilbert projection theorem. --- Hilbert space. --- Initial condition. --- Initial value problem. --- Integral equation. --- Iterative method. --- Karush–Kuhn–Tucker conditions. --- Kernel method. --- Lagrange polynomial. --- Law of large numbers. --- Least squares. --- Linear algebra. --- Linear combination. --- Linear filter. --- Linear map. --- Mathematical optimization. --- Mathematics. --- Maxima and minima. --- Monotonic function. --- Nonlinear programming. --- Nonlinear system. --- Normal distribution. --- Numerical analysis. --- Numerical stability. --- Optimal control. --- Optimization problem. --- Ordinary differential equation. --- Orthogonal polynomials. --- Parameter. --- Piecewise. --- Pointwise. --- Polynomial interpolation. --- Polynomial. --- Probability distribution. --- Quadratic programming. --- Random variable. --- Rate of convergence. --- Ratio test. --- Riccati equation. --- Simpson's rule. --- Simultaneous equations. --- Smoothing spline. --- Smoothing. --- Smoothness. --- Special case. --- Spline (mathematics). --- Spline interpolation. --- Statistic. --- Stochastic calculus. --- Stochastic. --- Telemetry. --- Theorem. --- Trapezoidal rule. --- Waypoint. --- Weight function. --- Without loss of generality.