A Variational Model for Data Fitting on Manifolds by Minimizing the Acceleration of a Bézier Curve
|
|
- Erika Phelps
- 5 years ago
- Views:
Transcription
1 A Variational Model for Data Fitting on Manifolds by Minimizing the Acceleration of a Bézier Curve Ronny Bergmann a Technische Universität Chemnitz Kolloquium, Department Mathematik, FAU Erlangen-Nürnberg, Erlangen, December 11, 2018 a joint work with P.-Y. Gousenbourger, UCLouvain, Louvain-la-Neuve, Belgium.
2 Moin. 1. Riemannian Manifolds & Optimization 2. Data Fitting on Riemannian Manifolds 3. Bézier Curves and Generalized Bézier Curves 4. Discretized Acceleration of a Bézier Curve 5. Gradient Descent on a Manifold 6. Numerical Examples 1
3 An m-dimensional Riemannian Manifold M ξ x T x M log x x exp x ν x log x g( ; x, y) PT x y (ν) y M A d-dimensional Riemannian manifold can be informally defined as a set M covered with a suitable collection of charts, that identify subsets of M with open subsets of R d and a continously varying inner product on the tangential spaces. [Absil, Mahony, Sepulchre, 2008] 2
4 An m-dimensional Riemannian Manifold M ξ x T x M log x x exp x ν x log x g( ; x, y) PT x y (ν) y M Geodesic g( ; x, y) shortest path (on M) between x, y M Tangent space T x M at x, with inner product, x Logarithmic map log x y = ġ(0; x, y) speed towards y Exponential map exp x ξ x = g(1), where g(0) = x, ġ(0) = ξ x Parallel transport PT x y (ν) of ν T x M along g( ; x, y) 2
5 Optimization on Manifolds Let N be a Riemannian manifold and E : N R. We aim to solve argmin E(x) x N often: product manifold N = M n for n N 2 : manifold-valued image processing highdimensional problem locally: convexity defined via geodesics 3
6 Variational Methods on Manifolds Variational methods model a trade-off between staying close to the data and minimizing a certain property E(x) = D(x; f) + αr(x) α > 0 is a weight f N is given Data data or similarity term D(x; f) regularizer / prior R(x) 4
7 Differential and Gradient The differential D x f = Df : T M R of a real-valued function f : M R is the push-forward of f. Intuition: Given x M and ξ T x M, then Df(x)[ξ] is the directional derivative of f. The gradient f : M T M is the tangent vector fulfilling M f(x), η x = Df(x)[η] for all η T x M gradient descent (with e.g. Armijo s rule) 5
8 Data Fitting on Manifolds Given data points d 0,..., d n on a Riemannian manifold M and time points t i I, find a nice curve γ : I M, γ Γ, such that γ(t i ) = d i (interpolation) or γ(t i ) d i (approximation). Γ set of geodesics & approximation: geodesic regression [Rentmeesters, 11; Fletcher, 13; Boumal 13] Γ Sobolev space of curves: Inifinite-dimensional problem [Samir et. al., 12] Γ composite Bézier curves; LSs in tangent spaces [Arnould et. al. 15; Gousenbourger, Massart, Absil, 18] Discretized curve, Γ = M N, [Boumal, Absil, 11] This talk nice means minimal (discretized) acceleration ( as straight as possible ) for Γ the set of composite Bézier curves. In Euclidean space: Natural cubic splines as closed form solution. 6
9 (Euclidean) Bézier Curves Definition [Bézier, 62] A Bézier curve β K of degree K N 0 is a function β K : [0, 1] R d parametrized by control points b 0,..., b K R n and defined by β K (t; b 0,..., b K ) := K b j B j,k (t), j=0 [Bernstein, 1912] where B j,k = ( K j ) t j (1 t) K j are the Bernstein polynomials of degree K. Evaluation via Casteljau s algorithm. [de Casteljau, 59] 7
10 Illustration of de Casteljau s Algorithm b 1 b 2 b 0 The set of control points b 0, b 1, b 2, b 3. b 3 8
11 Illustration of de Casteljau s Algorithm b 1 x [1] 1 b 2 x [1] 0 x [1] 2 b 0 Evaluate line segments at t = 1 4, obtain x[1] 0, x[1] 1, x[1] 2. 8 b 3
12 Illustration of de Casteljau s Algorithm b 1 x [1] 1 x [2] 1 b 2 x [1] 0 x [2] 0 x [1] 2 b 0 Repeat evaluation for new line segments to obtain x [2] 0, x[2] 1. 8 b 3
13 Illustration of de Casteljau s Algorithm b 1 x [1] 1 x [2] 1 b 2 x [1] 0 x [2] 0 x [3] 0 x [1] 2 b 0 Repeat for the last segment to obtain β 3 ( 1 4 ; b 0, b 1, b 2, b 3 ) = x [3] 0. 8 b 3
14 Illustration of de Casteljau s Algorithm x [1] 0 b 1 x [2] 0 x [1] 1 x [3] 0 x [2] 1 b 2 x [1] 2 b 0 Same procedure for evaluation of β 3 ( 1 2 ; b 0, b 1, b 2, b 3 ). b 3 8
15 Illustration of de Casteljau s Algorithm b 1 x [1] 0 x [2] 0 x [1] 1 b 2 x [3] 0 x [2] 1 b 0 x [1] 2 Same procedure for evaluation of β 3 ( 3 4 ; b 0, b 1, b 2, b 3 ). b 3 8
16 Illustration of de Casteljau s Algorithm b 1 b 2 b 0 Complete curve β 3 (t; b 0, b 1, b 2, b 3 ). b 3 8
17 Composite Bézier Curves Definition A composite Bezier curve B : [0, n] R d is defined as β K (t; b 0 0 B(t) :=,..., b0 K ) if t [0, 1], β K (t i; b i 0,..., bi K ), if t (i, i + 1], i = 1,..., n 1. 9
18 Composite Bézier Curves Definition A composite Bezier curve B : [0, n] R d is defined as β K (t; b 0 0 B(t) :=,..., b0 K ) if t [0, 1], β K (t i; b i 0,..., bi K ), if t (i, i + 1], i = 1,..., n 1. Denote ith segment by B i (t) = β K (t; b i 0,..., bi K ) and p i = b i 0. b 0 2 b 2 2 p 3 b 3 1 p 1 b 1 1 b 0 1 b 0 0 = p 0 p 2 b 2 1 p 4 b 1 2 b 4 2 B 0 B 1 B 2 B 3 B 4 b 3 2 b 4 1 p 5 = b 4 3 9
19 Composite Bézier Curves Definition A composite Bezier curve B : [0, n] R d is defined as β K (t; b 0 0 B(t) :=,..., b0 K ) if t [0, 1], β K (t i; b i 0,..., bi K ), if t (i, i + 1], i = 1,..., n 1. Denote ith segment by B i (t) = β K (t; b i 0,..., bi K ) and p i = b i 0. continuous iff B i 1 (1) = B i (0), i = 1,..., n 1 b i 1 K = bi 0 = p i, i = 1,..., n 1 continuously differentiable iff p i = 1 2 (bi 1 K 1 + bi 1 ) 9
20 Bézier Curves on a Manifold Definition. Let M be a Riemannian manifold and b 0,..., b K M, K N. [Park, Ravani, 1995; Popiel, Noakes, 2007] The (generalized) Bézier curve of degree k, k K, is defined as β k (t; b 0,..., b k ) = g(t; β k 1 (t; b 0,..., b k 1 ), β k 1 (t; b 1,..., b k )), if k > 0, and β 0 (t; b 0 ) = b 0. 10
21 Bézier Curves on a Manifold Definition. Let M be a Riemannian manifold and b 0,..., b K M, K N. [Park, Ravani, 1995; Popiel, Noakes, 2007] The (generalized) Bézier curve of degree k, k K, is defined as β k (t; b 0,..., b k ) = g(t; β k 1 (t; b 0,..., b k 1 ), β k 1 (t; b 1,..., b k )), if k > 0, and β 0 (t; b 0 ) = b 0. Bézier curves β 1 (t; b 0, b 1 ) = g(t; b 0, b 1 ) are geodesics. composite Bézier curves B : [0, n] M completely analogue (using geodesics for line segments) 10
22 Bézier Curves on a Manifold Definition. Let M be a Riemannian manifold and b 0,..., b K M, K N. [Park, Ravani, 1995; Popiel, Noakes, 2007] The (generalized) Bézier curve of degree k, k K, is defined as β k (t; b 0,..., b k ) = g(t; β k 1 (t; b 0,..., b k 1 ), β k 1 (t; b 1,..., b k )), if k > 0, and β 0 (t; b 0 ) = b 0. The Riemannian composite Bezier curve B(t) is continuous iff B i 1 (1) = B i (0), i = 1,..., n 1 b i 1 K = bi 0 =: p i, i = 1,..., n 1 continuously differentiable iff p i = g ( 1 2 ; bi 1 K 1, 1) bi or b i 1 K 1 = g( 2; b i 1, p ) i 10
23 Illustration of a Composite Bézier Curve on the Sphere S 2 The directions, e.g. log pj b 1 j, are now tangent vectors. 11
24 A Variational Model for Data Fitting Let d 0,..., d n M. A model for data fitting reads E(B) = λ 2 n d 2 M(B(k), d k ) + k=0 n 0 D2 B(t) 2 dt 2 B(t), dt λ > 0, where B Γ is from the set of continuously differentiable composite Bezier curve of degree K with n segments. Goal: find minimizer B Γ finite dimensional optimization problem in the control points b i j, i.e. on ML with L = n(k 1) + 2 λ yields interpolation (p k = d k ) L = n(k 2) + 1 On M = R m : closed form solution, natural (cubic) splines 12
25 Interlude: Second Order Differences on Manifolds Second order difference: [RB et al., 2014; RB, Weinmann, 2016; Bačák et al., 2016] d 2 (x, y, z) := min c C x,z d M (c, y), x, y, z M, 1 C x,z mid point(s) of geodesic(s) g( ; x, z) 2 x 2y + z 2 = 1 2 (x + z) y 2 y min d M (c, y) c C x,z y c x c(x, z) z x c(x, z) z M = S 2 13
26 Discretizing the Data Fitting Model We discretize the absolute second order covariant derivative n 0 D2 B(t) 2 dt 2 N 1 dt γ(t) k=1 s d 2 2 [B(s i 1), B(s i ), B(s i+1 )] 4. s on equidistant points s 0,..., s N with step size s = s 1 s 0. Evaluating E(B) consists of evaluation of geodesics and squared (Riemannian) distances (N + 1)K geodesics to evaluate the Bézier segments N geodesics to evaluate the mid points N squared distances to obtain the second order absolute finite differences squared 14
27 Gradient and Chain Rule on a Manifold The gradient M f(x) T x M of f : M R, x M, is defined as the tangent vector that fulfills M f(x), ξ x = Df(x)[ξ] for all ξ T x M. For a composition F (x) = (g h)(x) = g(h(x)) of two functions g, h: M M the chain rule reads for x M and ξ T x M as D x F [ξ] = D h(x) g [ D x h[ξ] ], where D x h[ξ] T h(x) M and D x F [ξ] T F (x) M. 15
28 The Differential of a Geodesic w.r.t. its Start Point The geodesic variation Γ g,ξ (s, t) := exp γx,ξ (s)(tζ(s)), s ( ε, ε), t [0, 1], ε > 0. is used to define the Jacobi field J g,ξ (t) = s Γ g,ξ(s, t) s=0. y g(t; x, y) J g,ξ (t) g( ; x, y) J g,ξ ζ(0) ζ(ŝ) x ξ = J g,ξ (0) Γ g,ξ (ŝ, 0) Γ g,ξ (s, t) Γ g,ξ (s, 0) = γ x,ξ (s) Then the differential reads D x g(t,, y)[ξ] = J g,ξ (t). 16
29 Implementing Jacobi Fields on Symmetric Spaces A manifold is symmetric if for every geodesic g and avery x M the mapping g(t) g( t) is an isometry at least locally around x = g(0). Then one can diagonalize the curvature tensor R, let κ l denote its eigenvalues. let {ξ 1,..., ξ m } T x M be an ONB of eigenvalues with ξ 1 = log x y. parallel transport Ξ j (t) = PT x g(t;x,y) ξ j, j = 1,..., m 17
30 Implementing Jacobi Fields on Symmetric Spaces II Decompose η = m η l ξl. Then i=1 D x g(t; x, y)[η] = J g,η (t) = m η l J g,ξl (t), l=1 with sinh (d ) g(1 t) κ l sinh(d g κl Ξ l (t) if κ l < 0, J g,ξl (t) = sin (d ) g(1 t) κ l sin( κ l d g) Ξ l (t) if κ l > 0, (1 t)ξ l (t) if κ l = 0. 18
31 Implementing the Gradient using adjoint Jacobi Fields. The adjoint Jacobi fields Jg, (t): T g(t) M T x M are characterized by J g,ξ (t), η g(t) = ξ, Jg,η(t) x, for all ξ T x M, η T g(t;x,y) M. can be computed without extra efforts, i.e. the same ODEs occur. can be used to calculate the gradient the gradient of iterated evaluations of geodesics can be computed by composition of (adjoint) Jacobi fields 19
32 Gradient Descent on a Manifold Let N = M L be the product manifold of M, Input. f : N R, its gradient N f, initial data x (0) = b N step sizes s k > 0, k N. Output: ˆx N k 0 repeat x (k+1) exp x (k) ( sk N f(x (k) ) ) k k + 1 until a stopping criterion is reached return ˆx := x (k) 20
33 Armijo Step Size Rule Let x = x (k) be an iterate from the gradient descent algorithm, β, σ (0, 1), α > 0. Let m be the smallest positive integer such that f(x) f ( exp x ( β m α N f(x)) ) σβ m α N f(x) x Set the step size s k := β m α. 21
34 Minimizing with Known Minimizer Original Minimized Absolute first order differences log B(ti) B(t i+1 ) B(ti)
35 Interpolation by Bézier Curves with Minimal Acceleration. A comp. Bezier curve (black) and its mnimizer (blue). 23
36 Approximation by Bézier Curves with Minimal Acceleration. In the following video λ is slowly decreased from 10 to 0. The initial setting, λ =
37 Approximation by Bézier Curves with Minimal Acceleration. In the following video λ is slowly decreased from 10 to 0. Summary of the video. 24
38 Comparison to Previous Approach [Gousenbourger, Massart, Absil, 2018] This curve (dashed) is too global to be solved in a tangent space (dotted) correctly, while our method (blue) still works. 25
39 An Example of Rotations M = SO(3) Initialization with approach from composite splines [Gousenbourger, Massart, Absil, 2018] Our method outperforms the approach of solving linear systems in tangent spaces, but their approach can serve as an initialization. 26
40 Summary Data fitting on manifolds with Bézier curves minimizing their acceleration computed the gradient with respect to control points employed Jacobi fields and their adjoints. implemented within the MVIR toolbox (available soon) ronnybergmann.net/mvirt/ a Julia implementation in preparation (Manopt.jl) 27
41 Literature M. Bačák, R. Bergmann, G. Steidl, and A. Weinmann. A Second Order Non-Smooth Variational Model for Restoring Manifold-Valued Images. In: SIAM Journal on Scientific Computing 38.1 (2016), A567 A597. doi: /15M101988X. R. Bergmann and P.-Y. Gousenbourger. A variational model for data fitting on manifolds by minimizing the acceleration of a Bézier curve. In: Frontiers in Applied Mathematics and Statistics (2018). doi: /fams arxiv: P.-A. Absil, R. Mahony, and R. Sepulchre. Optimization Algorithms on Matrix Manifolds. Princeton University Press, doi: / P.-Y. Gousenbourger, E. Massart, and P.-A. Absil. Data fitting on manifolds with composite Bézier-like curves and blended cubic splines. In: Journal of Mathematical Imaging and Vision (2018). accepted. doi: /s ronnybergmann.net/talks/2018-dresden-institutsseminar-accbezier.pdf 28
A Second Order Non-smooth Variational Model for Restoring Manifold-valued Images
A Second Order Non-smooth Variational Model for Restoring Manifold-valued Images Ronny Bergmann Mathematical Image Processing and Data Analysis Department of Mathematics University of Kaiserslautern July
More informationPiecewise-Bézier C 1 interpolation on Riemannian manifolds with application to 2D shape morphing
Piecewise-Bézier C 1 interpolation on Riemannian manifolds with application to 2D shape morphing Pierre-Yves Gousenbourger Department of Mathematical Engineering ICTEAM Institute Université catholique
More informationA few words about the MTW tensor
A few words about the Ma-Trudinger-Wang tensor Université Nice - Sophia Antipolis & Institut Universitaire de France Salah Baouendi Memorial Conference (Tunis, March 2014) The Ma-Trudinger-Wang tensor
More informationDISCRETE CURVE FITTING ON MANIFOLDS
Université catholique de Louvain Pôle d ingénierie mathématique (INMA) Travail de fin d études Promoteur : Prof. Pierre-Antoine Absil DISCRETE CURVE FITTING ON MANIFOLDS NICOLAS BOUMAL Louvain-la-Neuve,
More informationCALCULUS ON MANIFOLDS. 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M =
CALCULUS ON MANIFOLDS 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M = a M T am, called the tangent bundle, is itself a smooth manifold, dim T M = 2n. Example 1.
More information2 The De Casteljau algorithm revisited
A new geometric algorithm to generate spline curves Rui C. Rodrigues Departamento de Física e Matemática Instituto Superior de Engenharia 3030-199 Coimbra, Portugal ruicr@isec.pt F. Silva Leite Departamento
More informationA Second Order Non-Smooth Variational Model for Restoring Manifold-Valued Images
A Second Order Non-Smooth Variational Model for Restoring Manifold-Valued Images Miroslav Bačák Ronny Bergmann Gabriele Steidl Andreas Weinmann September 28, 2018 arxiv:1506.02409v2 [math.na] 4 Sep 2015
More informationTransport Continuity Property
On Riemannian manifolds satisfying the Transport Continuity Property Université de Nice - Sophia Antipolis (Joint work with A. Figalli and C. Villani) I. Statement of the problem Optimal transport on Riemannian
More informationA Gradient-Descent Method for Curve Fitting on Riemannian Manifolds
A Gradient-Descent Method for Curve Fitting on Riemannian Manifolds Chafik Samir, P.-A. Absil, Anuj Srivastava, Eric Klassen To cite this version: Chafik Samir, P.-A. Absil, Anuj Srivastava, Eric Klassen.
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationOPTIMALITY CONDITIONS FOR GLOBAL MINIMA OF NONCONVEX FUNCTIONS ON RIEMANNIAN MANIFOLDS
OPTIMALITY CONDITIONS FOR GLOBAL MINIMA OF NONCONVEX FUNCTIONS ON RIEMANNIAN MANIFOLDS S. HOSSEINI Abstract. A version of Lagrange multipliers rule for locally Lipschitz functions is presented. Using Lagrange
More informationIntroduction to Computer Graphics. Modeling (1) April 13, 2017 Kenshi Takayama
Introduction to Computer Graphics Modeling (1) April 13, 2017 Kenshi Takayama Parametric curves X & Y coordinates defined by parameter t ( time) Example: Cycloid x t = t sin t y t = 1 cos t Tangent (aka.
More informationApproximation of Circular Arcs by Parametric Polynomials
Approximation of Circular Arcs by Parametric Polynomials Emil Žagar Lecture on Geometric Modelling at Charles University in Prague December 6th 2017 1 / 44 Outline Introduction Standard Reprezentations
More informationPolynomial Regression on Riemannian Manifolds
Polynomial Regression on Riemannian Manifolds Jacob Hinkle, Tom Fletcher, Sarang Joshi May 11, 212 arxiv:121.2395 Nonparametric Regression Number of parameters tied to amount of data present Example: kernel
More informationA Riemannian Limited-Memory BFGS Algorithm for Computing the Matrix Geometric Mean
This space is reserved for the Procedia header, do not use it A Riemannian Limited-Memory BFGS Algorithm for Computing the Matrix Geometric Mean Xinru Yuan 1, Wen Huang, P.-A. Absil, and K. A. Gallivan
More informationHamiltonian Systems of Negative Curvature are Hyperbolic
Hamiltonian Systems of Negative Curvature are Hyperbolic A. A. Agrachev N. N. Chtcherbakova Abstract The curvature and the reduced curvature are basic differential invariants of the pair: Hamiltonian system,
More informationChapter 3. Riemannian Manifolds - I. The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves
Chapter 3 Riemannian Manifolds - I The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves embedded in Riemannian manifolds. A Riemannian manifold is an abstraction
More informationDIFFERENTIAL GEOMETRY. LECTURE 12-13,
DIFFERENTIAL GEOMETRY. LECTURE 12-13, 3.07.08 5. Riemannian metrics. Examples. Connections 5.1. Length of a curve. Let γ : [a, b] R n be a parametried curve. Its length can be calculated as the limit of
More informationDIFFERENTIAL GEOMETRY, LECTURE 16-17, JULY 14-17
DIFFERENTIAL GEOMETRY, LECTURE 16-17, JULY 14-17 6. Geodesics A parametrized line γ : [a, b] R n in R n is straight (and the parametrization is uniform) if the vector γ (t) does not depend on t. Thus,
More informationArsène Pérard-Gayot (Slides by Piotr Danilewski)
Computer Graphics - Splines - Arsène Pérard-Gayot (Slides by Piotr Danilewski) CURVES Curves Explicit y = f x f: R R γ = x, f x y = 1 x 2 Implicit F x, y = 0 F: R 2 R γ = x, y : F x, y = 0 x 2 + y 2 =
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 (Many figures from C. M. Bishop, "Pattern Recognition and ") 1of 254 Part V
More informationSample Exam 1 KEY NAME: 1. CS 557 Sample Exam 1 KEY. These are some sample problems taken from exams in previous years. roughly ten questions.
Sample Exam 1 KEY NAME: 1 CS 557 Sample Exam 1 KEY These are some sample problems taken from exams in previous years. roughly ten questions. Your exam will have 1. (0 points) Circle T or T T Any curve
More informationPart IB Geometry. Theorems. Based on lectures by A. G. Kovalev Notes taken by Dexter Chua. Lent 2016
Part IB Geometry Theorems Based on lectures by A. G. Kovalev Notes taken by Dexter Chua Lent 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationM2R IVR, October 12th Mathematical tools 1 - Session 2
Mathematical tools 1 Session 2 Franck HÉTROY M2R IVR, October 12th 2006 First session reminder Basic definitions Motivation: interpolate or approximate an ordered list of 2D points P i n Definition: spline
More informationA TWO-STEP ALGORITHM OF SMOOTH SPLINE GENERATION ON RIEMANNIAN MANIFOLDS
Pré-Publicações do Departamento de Matemática Universidade de Coimbra Preprint Number 04 38 A TWO-STEP ALGORITHM OF SMOOTH SPLINE GENERATION ON RIEMANNIAN MANIFOLDS JANUSZ JAKUBIAK, FÁTIMA SILVA LEITE
More informationDifferential Geometry and Lie Groups with Applications to Medical Imaging, Computer Vision and Geometric Modeling CIS610, Spring 2008
Differential Geometry and Lie Groups with Applications to Medical Imaging, Computer Vision and Geometric Modeling CIS610, Spring 2008 Jean Gallier Department of Computer and Information Science University
More informationGeometric mean, splines and de Boor algorithm in geodesic spaces
Geometric mean, splines and de Boor algorithm in geodesic spaces Esfandiar Nava-Yazdani arxiv:1603.01484v4 [math.mg] 26 Aug 2016 Abstract We extend the concepts of de Casteljau and de Boor algorithms as
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS 1. Basic Terminology A differential equation is an equation that contains an unknown function together with one or more of its derivatives. 1 Examples: 1. y = 2x + cos x 2. dy dt
More informationSOLVING INTERPOLATION PROBLEMS ON STIEFEL MANIFOLDS USING QUASI-GEODESICS
Pré-Publicações do Departamento de Matemática Universidade de Coimbra Preprint Number 15 36 SOLVING INTERPOLATION PROBLEMS ON STIEFEL MANIFOLDS USING QUASI-GEODESICS KRZYSZTOF A. KRAKOWSKI, LUÍS MACHADO,
More informationVariational methods for restoration of phase or orientation data
Variational methods for restoration of phase or orientation data Martin Storath joint works with Laurent Demaret, Michael Unser, Andreas Weinmann Image Analysis and Learning Group Universität Heidelberg
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS 1. Basic Terminology A differential equation is an equation that contains an unknown function together with one or more of its derivatives. 1 Examples: 1. y = 2x + cos x 2. dy dt
More information4.7 The Levi-Civita connection and parallel transport
Classnotes: Geometry & Control of Dynamical Systems, M. Kawski. April 21, 2009 138 4.7 The Levi-Civita connection and parallel transport In the earlier investigation, characterizing the shortest curves
More informationII. DIFFERENTIABLE MANIFOLDS. Washington Mio CENTER FOR APPLIED VISION AND IMAGING SCIENCES
II. DIFFERENTIABLE MANIFOLDS Washington Mio Anuj Srivastava and Xiuwen Liu (Illustrations by D. Badlyans) CENTER FOR APPLIED VISION AND IMAGING SCIENCES Florida State University WHY MANIFOLDS? Non-linearity
More informationRegression: Lecture 2
Regression: Lecture 2 Niels Richard Hansen April 26, 2012 Contents 1 Linear regression and least squares estimation 1 1.1 Distributional results................................ 3 2 Non-linear effects and
More informationTHEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)
4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M
More informationgoing vertically down, L 2 going horizontal. Observer O' outside the lift. Cut the lift wire lift accelerates wrt
PC4771 Gravitation Lectures 3&4 Einstein lift experiment Observer O in a lift, with light L 1 going vertically down, L 2 going horizontal Observer O outside the lift Cut the lift wire lift accelerates
More informationarxiv: v1 [math.oc] 22 May 2018
On the Connection Between Sequential Quadratic Programming and Riemannian Gradient Methods Yu Bai Song Mei arxiv:1805.08756v1 [math.oc] 22 May 2018 May 23, 2018 Abstract We prove that a simple Sequential
More informationConvex Optimization. Newton s method. ENSAE: Optimisation 1/44
Convex Optimization Newton s method ENSAE: Optimisation 1/44 Unconstrained minimization minimize f(x) f convex, twice continuously differentiable (hence dom f open) we assume optimal value p = inf x f(x)
More informationLecture 20: Bezier Curves & Splines
Lecture 20: Bezier Curves & Splines December 6, 2016 12/6/16 CSU CS410 Bruce Draper & J. Ross Beveridge 1 Review: The Pen Metaphore Think of putting a pen to paper Pen position described by time t Seeing
More informationChapter 1 Numerical approximation of data : interpolation, least squares method
Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated
More informationLecture 23: Hermite and Bezier Curves
Lecture 23: Hermite and Bezier Curves November 16, 2017 11/16/17 CSU CS410 Fall 2017, Ross Beveridge & Bruce Draper 1 Representing Curved Objects So far we ve seen Polygonal objects (triangles) and Spheres
More informationA Gradient-Descent Method for Curve Fitting on Riemannian Manifolds
12 Nov 21 Technical report UCL-INMA-29.23-v3 A Gradient-Descent Method for Curve Fitting on Riemannian Manifolds Chafik Samir P.-A. Absil Anuj Srivastava Eric Klassen Abstract Given data points p,...,
More informationVariable Selection and Model Choice in Survival Models with Time-Varying Effects
Variable Selection and Model Choice in Survival Models with Time-Varying Effects Boosting Survival Models Benjamin Hofner 1 Department of Medical Informatics, Biometry and Epidemiology (IMBE) Friedrich-Alexander-Universität
More informationINTRINSIC MEAN ON MANIFOLDS. Abhishek Bhattacharya Project Advisor: Dr.Rabi Bhattacharya
INTRINSIC MEAN ON MANIFOLDS Abhishek Bhattacharya Project Advisor: Dr.Rabi Bhattacharya 1 Overview Properties of Intrinsic mean on Riemannian manifolds have been presented. The results have been applied
More informationDistances, volumes, and integration
Distances, volumes, and integration Scribe: Aric Bartle 1 Local Shape of a Surface A question that we may ask ourselves is what significance does the second fundamental form play in the geometric characteristics
More informationMAT 300 Midterm Exam Summer 2017
MAT Midterm Exam Summer 7 Note: For True-False questions, a statement is only True if it must always be True under the given assumptions, otherwise it is False.. The control points of a Bezier curve γ(t)
More informationLift me up but not too high Fast algorithms to solve SDP s with block-diagonal constraints
Lift me up but not too high Fast algorithms to solve SDP s with block-diagonal constraints Nicolas Boumal Université catholique de Louvain (Belgium) IDeAS seminar, May 13 th, 2014, Princeton The Riemannian
More informationSec. 1.1: Basics of Vectors
Sec. 1.1: Basics of Vectors Notation for Euclidean space R n : all points (x 1, x 2,..., x n ) in n-dimensional space. Examples: 1. R 1 : all points on the real number line. 2. R 2 : all points (x 1, x
More information(a) The points (3, 1, 2) and ( 1, 3, 4) are the endpoints of a diameter of a sphere.
MATH 4 FINAL EXAM REVIEW QUESTIONS Problem. a) The points,, ) and,, 4) are the endpoints of a diameter of a sphere. i) Determine the center and radius of the sphere. ii) Find an equation for the sphere.
More informationA Gradient-Descent Method for Curve Fitting on Riemannian Manifolds
11 May 21 Technical report UCL-INMA-29.23-v2 A Gradient-Descent Method for Curve Fitting on Riemannian Manifolds Chafik Samir P.-A. Absil Anuj Srivastava Eric Klassen Abstract Given data points p,...,
More information5.2 The Levi-Civita Connection on Surfaces. 1 Parallel transport of vector fields on a surface M
5.2 The Levi-Civita Connection on Surfaces In this section, we define the parallel transport of vector fields on a surface M, and then we introduce the concept of the Levi-Civita connection, which is also
More informationDifferential Geometry Exercises
Differential Geometry Exercises Isaac Chavel Spring 2006 Jordan curve theorem We think of a regular C 2 simply closed path in the plane as a C 2 imbedding of the circle ω : S 1 R 2. Theorem. Given the
More informationBézier Curves and Splines
CS-C3100 Computer Graphics Bézier Curves and Splines Majority of slides from Frédo Durand vectorportal.com CS-C3100 Fall 2017 Lehtinen Before We Begin Anything on your mind concerning Assignment 1? CS-C3100
More informationThe Karcher Mean of Points on SO n
The Karcher Mean of Points on SO n Knut Hüper joint work with Jonathan Manton (Univ. Melbourne) Knut.Hueper@nicta.com.au National ICT Australia Ltd. CESAME LLN, 15/7/04 p.1/25 Contents Introduction CESAME
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More informationQualifying Exams I, 2014 Spring
Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = F q be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that
More informationVariational inequalities for set-valued vector fields on Riemannian manifolds
Variational inequalities for set-valued vector fields on Riemannian manifolds Chong LI Department of Mathematics Zhejiang University Joint with Jen-Chih YAO Chong LI (Zhejiang University) VI on RM 1 /
More informationChoice of Riemannian Metrics for Rigid Body Kinematics
Choice of Riemannian Metrics for Rigid Body Kinematics Miloš Žefran1, Vijay Kumar 1 and Christopher Croke 2 1 General Robotics and Active Sensory Perception (GRASP) Laboratory 2 Department of Mathematics
More informationPart IB GEOMETRY (Lent 2016): Example Sheet 1
Part IB GEOMETRY (Lent 2016): Example Sheet 1 (a.g.kovalev@dpmms.cam.ac.uk) 1. Suppose that H is a hyperplane in Euclidean n-space R n defined by u x = c for some unit vector u and constant c. The reflection
More informationSubspace Projection Matrix Completion on Grassmann Manifold
Subspace Projection Matrix Completion on Grassmann Manifold Xinyue Shen and Yuantao Gu Dept. EE, Tsinghua University, Beijing, China http://gu.ee.tsinghua.edu.cn/ ICASSP 2015, Brisbane Contents 1 Background
More informationSmooth Invariant Interpolation of Rotations
Smooth Invariant Interpolation of Rotations F. C. PARK Seoul National University and BAHRAM RAVANI University of California, Davis We present an algorithm for generating a twice-differentiable curve on
More informationCubic regularization of Newton s method for convex problems with constraints
CORE DISCUSSION PAPER 006/39 Cubic regularization of Newton s method for convex problems with constraints Yu. Nesterov March 31, 006 Abstract In this paper we derive efficiency estimates of the regularized
More informationLectures in Discrete Differential Geometry 2 Surfaces
Lectures in Discrete Differential Geometry 2 Surfaces Etienne Vouga February 4, 24 Smooth Surfaces in R 3 In this section we will review some properties of smooth surfaces R 3. We will assume that is parameterized
More informationExercises for Multivariable Differential Calculus XM521
This document lists all the exercises for XM521. The Type I (True/False) exercises will be given, and should be answered, online immediately following each lecture. The Type III exercises are to be done
More informationMAT300/500 Programming Project Spring 2019
MAT300/500 Programming Project Spring 2019 Please submit all project parts on the Moodle page for MAT300 or MAT500. Due dates are listed on the syllabus and the Moodle site. You should include all neccessary
More informationRank-Constrainted Optimization: A Riemannian Manifold Approach
Ran-Constrainted Optimization: A Riemannian Manifold Approach Guifang Zhou1, Wen Huang2, Kyle A. Gallivan1, Paul Van Dooren2, P.-A. Absil2 1- Florida State University - Department of Mathematics 1017 Academic
More informationIntroduction to Information Geometry
Introduction to Information Geometry based on the book Methods of Information Geometry written by Shun-Ichi Amari and Hiroshi Nagaoka Yunshu Liu 2012-02-17 Outline 1 Introduction to differential geometry
More informationStability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games
Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,
More informationInterpolation APPLIED PROBLEMS. Reading Between the Lines FLY ROCKET FLY, FLY ROCKET FLY WHAT IS INTERPOLATION? Figure Interpolation of discrete data.
WHAT IS INTERPOLATION? Given (x 0,y 0 ), (x,y ), (x n,y n ), find the value of y at a value of x that is not given. Interpolation Reading Between the Lines Figure Interpolation of discrete data. FLY ROCKET
More informationIterative Reweighted Least Squares
Iterative Reweighted Least Squares Sargur. University at Buffalo, State University of ew York USA Topics in Linear Classification using Probabilistic Discriminative Models Generative vs Discriminative
More informationCurves. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Taku Komura
Curves Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 Some slides are courtesy of Steve Marschner and Taku Komura How to create a virtual world? To compose scenes We need to define objects
More informationCMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier
CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier Modeling Creating 3D objects How to construct complicated surfaces? Goal Specify objects with few control points Resulting object should be visually
More informationDefinition 5.1. A vector field v on a manifold M is map M T M such that for all x M, v(x) T x M.
5 Vector fields Last updated: March 12, 2012. 5.1 Definition and general properties We first need to define what a vector field is. Definition 5.1. A vector field v on a manifold M is map M T M such that
More informationAlgorithms for Riemannian Optimization
allivan, Absil, Qi, Baker Algorithms for Riemannian Optimization 1 Algorithms for Riemannian Optimization K. A. Gallivan 1 (*) P.-A. Absil 2 Chunhong Qi 1 C. G. Baker 3 1 Florida State University 2 Catholic
More informationHOMEWORK 2 - RIEMANNIAN GEOMETRY. 1. Problems In what follows (M, g) will always denote a Riemannian manifold with a Levi-Civita connection.
HOMEWORK 2 - RIEMANNIAN GEOMETRY ANDRÉ NEVES 1. Problems In what follows (M, g will always denote a Riemannian manifold with a Levi-Civita connection. 1 Let X, Y, Z be vector fields on M so that X(p Z(p
More informationMetrics and Curvature
Metrics and Curvature How to measure curvature? Metrics Euclidian/Minkowski Curved spaces General 4 dimensional space Cosmological principle Homogeneity and isotropy: evidence Robertson-Walker metrics
More informationThe nonsmooth Newton method on Riemannian manifolds
The nonsmooth Newton method on Riemannian manifolds C. Lageman, U. Helmke, J.H. Manton 1 Introduction Solving nonlinear equations in Euclidean space is a frequently occurring problem in optimization and
More informationHopf-Rinow and Hadamard Theorems
Summersemester 2015 University of Heidelberg Riemannian geometry seminar Hopf-Rinow and Hadamard Theorems by Sven Grützmacher supervised by: Dr. Gye-Seon Lee Prof. Dr. Anna Wienhard Contents Introduction..........................................
More informationLecture 8. Connections
Lecture 8. Connections This lecture introduces connections, which are the machinery required to allow differentiation of vector fields. 8.1 Differentiating vector fields. The idea of differentiating vector
More informationOptimization Algorithms on Riemannian Manifolds with Applications
Optimization Algorithms on Riemannian Manifolds with Applications Wen Huang Coadvisor: Kyle A. Gallivan Coadvisor: Pierre-Antoine Absil Florida State University Catholic University of Louvain November
More informationInformation geometry for bivariate distribution control
Information geometry for bivariate distribution control C.T.J.Dodson + Hong Wang Mathematics + Control Systems Centre, University of Manchester Institute of Science and Technology Optimal control of stochastic
More informationDiffusion Processes and Dimensionality Reduction on Manifolds
Faculty of Science Diffusion Processes and Dimensionality Reduction on Manifolds ESI, Vienna, Feb. 2015 Stefan Sommer Department of Computer Science, University of Copenhagen February 23, 2015 Slide 1/22
More informationCGT 511. Curves. Curves. Curves. What is a curve? 2) A continuous map of a 1D space to an nd space
Curves CGT 511 Curves Bedřich Beneš, Ph.D. Purdue University Department of Computer Graphics Technology What is a curve? Mathematical ldefinition i i is a bit complex 1) The continuous o image of an interval
More informationMATH 4030 Differential Geometry Lecture Notes Part 4 last revised on December 4, Elementary tensor calculus
MATH 4030 Differential Geometry Lecture Notes Part 4 last revised on December 4, 205 Elementary tensor calculus We will study in this section some basic multilinear algebra and operations on tensors. Let
More informationLINE SEARCH ALGORITHMS FOR LOCALLY LIPSCHITZ FUNCTIONS ON RIEMANNIAN MANIFOLDS
Tech. report INS Preprint No. 626 LINE SEARCH ALGORITHMS FOR LOCALLY LIPSCHITZ FUNCTIONS ON RIEMANNIAN MANIFOLDS SOMAYEH HOSSEINI, WEN HUANG, ROHOLLAH YOUSEFPOUR Abstract. This paper presents line search
More informationWEYL S LEMMA, ONE OF MANY. Daniel W. Stroock
WEYL S LEMMA, ONE OF MANY Daniel W Stroock Abstract This note is a brief, and somewhat biased, account of the evolution of what people working in PDE s call Weyl s Lemma about the regularity of solutions
More informationWelcome to Copenhagen!
Welcome to Copenhagen! Schedule: Monday Tuesday Wednesday Thursday Friday 8 Registration and welcome 9 Crash course on Crash course on Introduction to Differential and Differential and Information Geometry
More informationAccelerated Block-Coordinate Relaxation for Regularized Optimization
Accelerated Block-Coordinate Relaxation for Regularized Optimization Stephen J. Wright Computer Sciences University of Wisconsin, Madison October 09, 2012 Problem descriptions Consider where f is smooth
More informationMATH DIFFERENTIAL GEOMETRY. Contents
MATH 3968 - DIFFERENTIAL GEOMETRY ANDREW TULLOCH Contents 1. Curves in R N 2 2. General Analysis 2 3. Surfaces in R 3 3 3.1. The Gauss Bonnet Theorem 8 4. Abstract Manifolds 9 1 MATH 3968 - DIFFERENTIAL
More informationGeodesic shooting on shape spaces
Geodesic shooting on shape spaces Alain Trouvé CMLA, Ecole Normale Supérieure de Cachan GDR MIA Paris, November 21 2014 Outline Riemannian manifolds (finite dimensional) Spaces spaces (intrinsic metrics)
More informationBASIC DIFFERENTIAL GEOMETRY: CONNECTIONS AND GEODESICS
BASIC DIFFERENTIAL GEOMETRY: CONNECTIONS AND GEODESICS WERNER BALLMANN Introduction I discuss basic features of connections on manifolds: torsion and curvature tensor, geodesics and exponential maps, and
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS Basic Terminology A differential equation is an equation that contains an unknown function together with one or more of its derivatives. 1 Examples: 1. y = 2x + cos x 2. dy dt =
More informationEXISTENCE OF SET-INTERPOLATING AND ENERGY- MINIMIZING CURVES
EXISTENCE OF SET-INTERPOLATING AND ENERGY- MINIMIZING CURVES JOHANNES WALLNER Abstract. We consider existence of curves c : [0, 1] R n which minimize an energy of the form c (k) p (k = 1, 2,..., 1 < p
More informationSTUDY of genetic variations is a critical task to disease
Haplotype Assembly Using Manifold Optimization and Error Correction Mechanism Mohamad Mahdi Mohades, Sina Majidian, and Mohammad Hossein Kahaei arxiv:9.36v [math.oc] Jan 29 Abstract Recent matrix completion
More informationLine Search Methods for Unconstrained Optimisation
Line Search Methods for Unconstrained Optimisation Lecture 8, Numerical Linear Algebra and Optimisation Oxford University Computing Laboratory, MT 2007 Dr Raphael Hauser (hauser@comlab.ox.ac.uk) The Generic
More informationNumerical optimization. Numerical optimization. Longest Shortest where Maximal Minimal. Fastest. Largest. Optimization problems
1 Numerical optimization Alexander & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book Numerical optimization 048921 Advanced topics in vision Processing and Analysis of
More informationarxiv: v2 [math.oc] 31 Jan 2019
Analysis of Sequential Quadratic Programming through the Lens of Riemannian Optimization Yu Bai Song Mei arxiv:1805.08756v2 [math.oc] 31 Jan 2019 February 1, 2019 Abstract We prove that a first-order Sequential
More informationFUNCTIONS ON RIEMANNIAN MANIFOLDS
ε-subgradient ALGORITHMS FOR LOCALLY LIPSCHITZ FUNCTIONS ON RIEMANNIAN MANIFOLDS P. GROHS*, S. HOSSEINI* Abstract. This paper presents a descent direction method for finding extrema of locally Lipschitz
More informationLecture 5: September 12
10-725/36-725: Convex Optimization Fall 2015 Lecture 5: September 12 Lecturer: Lecturer: Ryan Tibshirani Scribes: Scribes: Barun Patra and Tyler Vuong Note: LaTeX template courtesy of UC Berkeley EECS
More information