Variational methods for restoration of phase or orientation data
|
|
- Benjamin Booth
- 5 years ago
- Views:
Transcription
1 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 Symposium on Mathematical Optics, Image Modelling, and Algorithms June 21, 2016
2 Phase or orientation data Phase or orientation data: images (or time series) whose pixels take their values on the unit circle i.e. f ij S 1 = T π π/2 Direction [rad] 0 -π/ Time [h] Hourly wind directions at station VENF1 (Venice, FL) in 2014 Interferometric SAR image of Vesuvius used for creation of digital elevation maps Goal: devise variational regularization (total variation, Potts, Mumford-Shah,...) for cirlce-valued data 2 / 20
3 Total variation regularization for circle-valued data Total variation (TV) regularization for real valued data (Rudin/Osher/Fatemi 92) u = arg min u R M N γ u ij u i+1,j + γ u ij u +1 + u ij f ij p f R M N given image, γ > 0 model parameter widely used for edge/jump preserving regularization convex computationally tractable 3 / 20
4 Total variation regularization for circle-valued data Total variation (TV) regularization for real valued data (Rudin/Osher/Fatemi 92) u = arg min u R M N γ u ij u i+1,j + γ u ij u +1 + u ij f ij p f R M N given image, γ > 0 model parameter widely used for edge/jump preserving regularization convex computationally tractable TV for circle-valued data, f T M N (Giaquinta/Modica/Soucek 93; Strekalovskiy/Cremers 11) u = arg min u T M N γ d T (u ij, u i+1,j ) + γ d T (u ij, u +1 ) + d T (u ij, f ij ) p where d T (x, y) is the arc length distance between two point x, y S 1 nonlinear data space vector space methods not applicable nonconvex globally optimal solutions possible? 3 / 20
5 L 1 -TV for circle-valued data in 1D L 1 -TV for circle-valued signals f T N, (e.g., time series of orientations), arg min u T N is computationally tractable: N d T (u n, u n+1 ) + d T (u n, f n ), N 1 γ n=1 n=1 Theorem (S., Weinmann, Unser) There is an exact algorithm for the total variation problem with circle-valued data. Its complexity is O(KN), where K N the number of unique values in f. Sketch of proof: Show that there is a minimizer whose values are subset of the data values and its antipodal points. Utilize the Viterbi algorithm (a type of dynamic programming). Generalize infimal convolution for fast message passing (Felzenszwalb/Huttenlocher) to circular data. S., Weinmann, Unser. Exact algorithms for L1-TV regularization of real-valued or circle-valued signals. SIAM J. Sci. Comp. (2016). 4 / 20
6 Discontinuity-preserving smoothing of time series π π/2 Direction [rad] 0 -π/ Time [h] Hourly wind directions at station VENF1 (Venice, FL) in 2014 π/2 Direction [rad] 0 -π/ Time [h] Global minimizer of L 1 -TV with circle-valued data (CPU time 3.3 sec) Data available at 5 / 20
7 TV for circle-valued data NP hard in 2D TV problem for circle-valued images f ij T = S 1, arg min γ d T (u, u +1 ) + γ d T (u i+1,j, u ) + d T (u ij, f ij ), u T m n NP-hard in 2D (Cremers/Strekalovskiy 13) resort to approximative strategies 6 / 20
8 TV for circle-valued data NP hard in 2D TV problem for circle-valued images f ij T = S 1, arg min γ d T (u, u +1 ) + γ d T (u i+1,j, u ) + d T (u ij, f ij ), u T m n NP-hard in 2D (Cremers/Strekalovskiy 13) resort to approximative strategies Our approach: Cyclic proximal point algorithm (CPPA) devise algorithm for general (Riemannian) manifold-valued TV problem arg min γ d M (u, u +1 ) + γ d M (u i+1,j, u ) + d M (u ij, f ij ), u M m n where d M is the distance induced by the Riemannian metric algorithm should be globally convergent on nice manifolds M, e.g., tensor manifolds 6 / 20
9 Tensor manifolds in diffusion tensor imaging Diffusion tensor imaging (DTI) (Basser/Mattiello/LeBihan 94) Based on gradient weighted MR-images D v w.r.t. direction v R 3 Relation to diffusion tensor P by Stejskal-Tanner equation D v = A 0 e b vt Pv Clinical application: study of neurodegenerative diseases, e.g., Alzheimer The diffusion tensor manifold (Pennec et al. 04) A diffusion tensor P is a symmetric positive definite 3 3 matrix (P Pos 3 ). Pos 3 is a Riemannian manifold with the Riemannian metric g P (A, B) = trace(p 1/2 AP 1 BP 1/2 ), where P Pos 3, and A, B tangent vectors (symmetric 3 3 matrices) at P. affine invariant distance, unique geodesics A diffusion tensor image visualized by ellipsoids 7 / 20
10 Proposed minimization approach Split the TV functional into atomic functionals F(u) = γ d(u i, u i 1 ) + d(u j, f j ) p = F i (u) + G(u), i j i where F i (u) = γ d(u i, u i 1 ) and G = j d(u j, f j ) p. Use a cyclic proximal point strategy (Bertsekas, Bacak), i.e., iterate the proximal mappings of G and F i, 1 prox λg (u) = arg min d(u, v 2 v)2 + λg(v), 1 prox λfi (u) = arg min d(u, v 2 v)2 + λf i (v). (For simplicity: 1D functional; 2D/3D analogously) Weinmann, Demaret, S. Total variation regularization of manifold-valued images. SIAM J. Imag. Sci. (2014) 8 / 20
11 Computation of proximal points on a manifold Key observation: Proximal mappings can be computed explicitly Proximal mapping of G given by 2λ (1+2λ) prox λg (u) i = [u i, f i ] t, t = d(u i, f i ), for p = 2, min(λ, d(u i, f i )), for p = 1. Proximal mapping of F i given by u j, if j i, i 1, prox λfi (u) j = [u i, u i 1 ] t, if j = i, [u i 1, u i ] t, if j = i 1, with t = min(λγ, 1 2 d(u i, u i 1 )). Efficient computation of geodesics [P, Q] and Riemannian distances d(p, Q) [P, Q] t = exp P (t log P (Q)) and d(p, Q) = log P (Q) P via Riemannian exponential and logarithmic mappings (Pennec et al. 06) log P Q = P 1 2 log(p 1 2 QP 1 2 )P 1 2, and exp P A = P 1 2 exp(p 1 2 AP 1 2 )P 1 2. Weinmann, Demaret, S. Total variation regularization of manifold-valued images. SIAM J. Imag. Sci. (2014) 9 / 20
12 Results of TV regularization for synthetic DT images Original Rician noise (σ = 90) Result using the proposed method 10 / 20
13 Results for real DT images Diffusion tensor image of a human brain TV result using proposed cyclic proximal point algorithm (CPU-Time: 496 sec) Data by courtesy of the CAMINO project 11 / 20
14 Analytic results Cartan-Hadamard manifolds: (e.g., DTI manifold Pos 3 ) For each x 0, x 1 there is a point y on the geodesic [x 0, x 1 ] such that for every z, d 2 (z, y) 1 2 d2 (z, x 0 ) d2 (z, x 1 ) 1 4 d2 (x 0, x 1 ). Theorem (Weinmann/Demaret/S. 14) In a Cartan-Hadamard manifold (complete, simply connected), the proposed cyclic proximal point algorithm for TV minimization converges towards a global minimizer. 12 / 20
15 Analytic results Cartan-Hadamard manifolds: (e.g., DTI manifold Pos 3 ) For each x 0, x 1 there is a point y on the geodesic [x 0, x 1 ] such that for every z, d 2 (z, y) 1 2 d2 (z, x 0 ) d2 (z, x 1 ) 1 4 d2 (x 0, x 1 ). Theorem (Weinmann/Demaret/S. 14) In a Cartan-Hadamard manifold (complete, simply connected), the proposed cyclic proximal point algorithm for TV minimization converges towards a global minimizer. Related approaches for TV with manifold-valued data a priori discretization of manifold and convex relaxation (Lellmann et al. 13) iteratively reweighted least squares minimization (Grohs/Sprecher 15) Douglas-Rachford splitting for manifolds with constant sectional curvature (Bergmann et al. 16) 12 / 20
16 CPPA for phase data Application of proposed CPPA to circle-data using with a = e iθ and v ] π; π[, and exp a (v) = e i(θ+v), exp 1 a (b) = arg(b/a), where a, b complex number representations of values on the unit circle Results Interferometric SAR image of Vesuvius (real data) L 2 -TV L 1 -TV TV with Huber data term S 1 -values visualized as hue component in the HSV colorspace. 13 / 20
17 Further applications of our methods for manifold-valued regularization Shape data (RP d manifold) Top: Time series of segmentation curves; Bottom: TV regularization in shape space X-ray tensor tomography (Malecki et al. 14) (Pos3 manifold) Carbon fibers X-ray tensors TV denoising Position data (SO (3) manifold) Original Noisy SO(3) data 100 TV denoising Baust, Demaret, S., Navab, Weinmann. Total variation regularization for shape signals. CVPR (2015) M. Wieczorek et al. Total variation regularization for x-ray tensor tomography. Fully3D (2015) Weinmann, Demaret, S. Total variation regularization of manifold-valued images. SIAM J. Imag. Sci. (2014) 14 / 20
18 Mumford-Shah regularization for vectorial data Mumford-Shah model for vectorial data (Mumford/Shah 85/ 89; Blake/Zisserman 87) arg min γ length(k ) + α u,k Z Z u 2 dx + (u f )p dx KC where K R2 denotes a discontinuity set { piecewise smooth approximation + Preserves discontinuities Computationally challenging Blurred and noisy image Tikhonov regularization Mumford-Shah Induced edge set K 15 / 20
19 Mumford-Shah regularization for manifold-valued data Mumford-Shah model for manifold-valued data arg min γ K + α Du(x) q dx + 1 u,k q p Ω\K Ω d(u(x), f(x)) p dx Prior work: Level-set active contour approach for two-phase variant (manifold-valued Chan-Vese model) (Wang/Vemuri 04) Weinmann, Demaret, S. Mumford-Shah and Potts regularization for manifold-valued data. J. Math. Imag. Vis. (2016) 16 / 20
20 Mumford-Shah regularization for manifold-valued data Mumford-Shah model for manifold-valued data arg min γ K + α Du(x) q dx + 1 u,k q p Ω\K Ω d(u(x), f(x)) p dx Prior work: Level-set active contour approach for two-phase variant (manifold-valued Chan-Vese model) (Wang/Vemuri 04) Our approach: (i) Finite difference discretization of Blake-Zisserman-type with the directional penalty 1 arg min x M m n p dp (x, f) + α R ω s Ψ as (x), Ψ a (x) = ψ(x ()+a, x ij ) and ψ(w, z) = 1 q min(γq/α, d(w, z)q ). s=1 Weinmann, Demaret, S. Mumford-Shah and Potts regularization for manifold-valued data. J. Math. Imag. Vis. (2016) 16 / 20
21 Algorithm for 2D Mumford-Shah problem (ii) Penalty decomposition arg min x 1,...,x R R ω s prαψ as (x s ) + d p (x s, f) + µ k d p (x s, x s+1 ). s=1 with an increasing coupling parameter µ k (iii) Block coordinate descent x k+1 arg min prω 1 1 αψ a1 (x) + d p (x, f) + µ k d p (x, x k R ), x x k+1 arg min prω 2 2 αψ a2 (x) + d p (x, f) + µ k d p (x, x k+1 ), x 1. x k+1 R arg min x prω R αψ ar (x) + d p (x, f) + µ k d p (x, x k+1 R 1 ). univariate Mumford-Shah-type problems 17 / 20
22 Exact solver for univariate Mumford-Shah problems (iv) Solve univariate Mumford-Shah problems 1 arg min x p i=1 where J is the jump set of x. n d(x i, f i ) p + α d(x i, x i+1 ) q + γ J(x), q i J(x) Theorem (Weinmann/Demaret/S. 16) In a Cartan-Hadamard manifold, there is an algorithm that produces a global minimizer for the univariate Mumford-Shah problem. Sketch of proof: Employ dynamic programming strategy (Friedrich et al. 08) subproblems of TV q -L p type Solve subproblems using CPPA. 18 / 20
23 Results for diffusion tensor images Result using proposed splitting method Corpus callosum of human brain (CAMINO project) Mumford-Shah regularization using proposed method 19 / 20
24 Summary Algorithm for TV regularization with circle-valued data in 1D Exact solver for univariate L 1 -TV Worst case complexity O(N 2 ) Algorithms for TV regularization for manifold-valued images Cyclic proximal point strategy with explicit computation of proxies Globally convergent algorithm for Cartan-Hadamard manifolds Satisfactory results for (non-convex) circle-valued data Algorithms for Mumford-Shah regularization with manifold-valued data Based on penalty decomposition, dynamic programming, and CPPA No restrictions on discontinuity curve (e.g. number of segments) 20 / 20
25 Thank you!
Mumford Shah and Potts Regularization for Manifold-Valued Data
J Math Imaging Vis (2016) 55:428 445 DOI 10.1007/s10851-015-0628-2 Mumford Shah and Potts Regularization for Manifold-Valued Data Andreas Weinmann 1,2,4 Laurent Demaret 1 Martin Storath 3 Received: 15
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 Ronny Bergmann Mathematical Image Processing and Data Analysis Department of Mathematics University of Kaiserslautern July
More informationA Riemannian Framework for Denoising Diffusion Tensor Images
A Riemannian Framework for Denoising Diffusion Tensor Images Manasi Datar No Institute Given Abstract. Diffusion Tensor Imaging (DTI) is a relatively new imaging modality that has been extensively used
More informationTotal Generalized Variation for Manifold-valued Data
Total Generalized Variation for Manifold-valued Data K. Bredies M. Holler M. torath A. Weinmann. Abstract In this paper we introduce the notion of second-order total generalized variation (TGV) regularization
More informationSparse Regularization via Convex Analysis
Sparse Regularization via Convex Analysis Ivan Selesnick Electrical and Computer Engineering Tandon School of Engineering New York University Brooklyn, New York, USA 29 / 66 Convex or non-convex: Which
More informationHigher Order Cartesian Tensor Representation of Orientation Distribution Functions (ODFs)
Higher Order Cartesian Tensor Representation of Orientation Distribution Functions (ODFs) Yonas T. Weldeselassie (Ph.D. Candidate) Medical Image Computing and Analysis Lab, CS, SFU DT-MR Imaging Introduction
More informationErkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5.
LINEAR DIFFUSION Erkut Erdem Hacettepe University February 24 th, 2012 CONTENTS 1 Linear Diffusion 1 2 Appendix - The Calculus of Variations 5 References 6 1 LINEAR DIFFUSION The linear diffusion (heat)
More informationMulti-class DTI Segmentation: A Convex Approach
Multi-class DTI Segmentation: A Convex Approach Yuchen Xie 1 Ting Chen 2 Jeffrey Ho 1 Baba C. Vemuri 1 1 Department of CISE, University of Florida, Gainesville, FL 2 IBM Almaden Research Center, San Jose,
More informationMathematical Problems in Image Processing
Gilles Aubert Pierre Kornprobst Mathematical Problems in Image Processing Partial Differential Equations and the Calculus of Variations Second Edition Springer Foreword Preface to the Second Edition Preface
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 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 informationA Variational Model for Data Fitting on Manifolds by Minimizing the Acceleration of a Bézier Curve
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,
More informationMarkov Random Fields
Markov Random Fields Umamahesh Srinivas ipal Group Meeting February 25, 2011 Outline 1 Basic graph-theoretic concepts 2 Markov chain 3 Markov random field (MRF) 4 Gauss-Markov random field (GMRF), and
More informationSolving DC Programs that Promote Group 1-Sparsity
Solving DC Programs that Promote Group 1-Sparsity Ernie Esser Contains joint work with Xiaoqun Zhang, Yifei Lou and Jack Xin SIAM Conference on Imaging Science Hong Kong Baptist University May 14 2014
More informationInverse problems Total Variation Regularization Mark van Kraaij Casa seminar 23 May 2007 Technische Universiteit Eindh ove n University of Technology
Inverse problems Total Variation Regularization Mark van Kraaij Casa seminar 23 May 27 Introduction Fredholm first kind integral equation of convolution type in one space dimension: g(x) = 1 k(x x )f(x
More informationInverse problem and optimization
Inverse problem and optimization Laurent Condat, Nelly Pustelnik CNRS, Gipsa-lab CNRS, Laboratoire de Physique de l ENS de Lyon Decembre, 15th 2016 Inverse problem and optimization 2/36 Plan 1. Examples
More informationA Level Set Based. Finite Element Algorithm. for Image Segmentation
A Level Set Based Finite Element Algorithm for Image Segmentation Michael Fried, IAM Universität Freiburg, Germany Image Segmentation Ω IR n rectangular domain, n = (1), 2, 3 u 0 : Ω [0, C max ] intensity
More informationConvex Hodge Decomposition of Image Flows
Convex Hodge Decomposition of Image Flows Jing Yuan 1, Gabriele Steidl 2, Christoph Schnörr 1 1 Image and Pattern Analysis Group, Heidelberg Collaboratory for Image Processing, University of Heidelberg,
More informationA Convex Relaxation of the Ambrosio Tortorelli Elliptic Functionals for the Mumford Shah Functional
A Convex Relaxation of the Ambrosio Tortorelli Elliptic Functionals for the Mumford Shah Functional Youngwook Kee and Junmo Kim KAIST, South Korea Abstract In this paper, we revisit the phase-field approximation
More informationVariational Image Restoration
Variational Image Restoration Yuling Jiao yljiaostatistics@znufe.edu.cn School of and Statistics and Mathematics ZNUFE Dec 30, 2014 Outline 1 1 Classical Variational Restoration Models and Algorithms 1.1
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 informationGeneralized Newton-Type Method for Energy Formulations in Image Processing
Generalized Newton-Type Method for Energy Formulations in Image Processing Leah Bar and Guillermo Sapiro Department of Electrical and Computer Engineering University of Minnesota Outline Optimization in
More informationNONLINEAR DIFFUSION PDES
NONLINEAR DIFFUSION PDES Erkut Erdem Hacettepe University March 5 th, 0 CONTENTS Perona-Malik Type Nonlinear Diffusion Edge Enhancing Diffusion 5 References 7 PERONA-MALIK TYPE NONLINEAR DIFFUSION The
More informationCarotid Lumen Segmentation Based on Tubular Anisotropy and Contours Without Edges Release 0.00
Carotid Lumen Segmentation Based on Tubular Anisotropy and Contours Without Edges Release 0.00 Julien Mille, Fethallah Benmansour and Laurent D. Cohen July 20, 2009 CEREMADE, UMR CNRS 7534, Université
More informationPROBABILISTIC CONTINUOUS EDGE DETECTION USING LOCAL SYMMETRY
PROBABILISTIC CONTINUOUS EDGE DETECTION USING LOCAL SYMMETRY Gerald Mwangi, Paul Fieguth, Christoph S. Garbe : University of Heidelberg, Germany, : University of Waterloo, Canada ABSTRACT We describe a
More informationA First Order Primal-Dual Algorithm for Nonconvex T V q Regularization
A First Order Primal-Dual Algorithm for Nonconvex T V q Regularization Thomas Möllenhoff, Evgeny Strekalovskiy, and Daniel Cremers TU Munich, Germany Abstract. We propose an efficient first order primal-dual
More informationCombining multiresolution analysis and non-smooth optimization for texture segmentation
Combining multiresolution analysis and non-smooth optimization for texture segmentation Nelly Pustelnik CNRS, Laboratoire de Physique de l ENS de Lyon Intro Basics Segmentation Two-step texture segmentation
More informationRiemannian Metric Learning for Symmetric Positive Definite Matrices
CMSC 88J: Linear Subspaces and Manifolds for Computer Vision and Machine Learning Riemannian Metric Learning for Symmetric Positive Definite Matrices Raviteja Vemulapalli Guide: Professor David W. Jacobs
More informationComputers and Mathematics with Applications
Computers and Mathematics with Applications 6 () 77 745 Contents lists available at ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa Multiphase
More informationA Localized Linearized ROF Model for Surface Denoising
1 2 3 4 A Localized Linearized ROF Model for Surface Denoising Shingyu Leung August 7, 2008 5 Abstract 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 1 Introduction CT/MRI scan becomes a very
More informationEfficient Beltrami Filtering of Color Images via Vector Extrapolation
Efficient Beltrami Filtering of Color Images via Vector Extrapolation Lorina Dascal, Guy Rosman, and Ron Kimmel Computer Science Department, Technion, Institute of Technology, Haifa 32000, Israel Abstract.
More informationOptimal mass transport as a distance measure between images
Optimal mass transport as a distance measure between images Axel Ringh 1 1 Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden. 21 st of June 2018 INRIA, Sophia-Antipolis, France
More informationConvex Hodge Decomposition and Regularization of Image Flows
Convex Hodge Decomposition and Regularization of Image Flows Jing Yuan, Christoph Schnörr, Gabriele Steidl April 14, 2008 Abstract The total variation (TV) measure is a key concept in the field of variational
More informationStochastic gradient descent on Riemannian manifolds
Stochastic gradient descent on Riemannian manifolds Silvère Bonnabel 1 Centre de Robotique - Mathématiques et systèmes Mines ParisTech SMILE Seminar Mines ParisTech Novembre 14th, 2013 1 silvere.bonnabel@mines-paristech
More informationRobust Principal Component Pursuit via Alternating Minimization Scheme on Matrix Manifolds
Robust Principal Component Pursuit via Alternating Minimization Scheme on Matrix Manifolds Tao Wu Institute for Mathematics and Scientific Computing Karl-Franzens-University of Graz joint work with Prof.
More informationProximal point algorithm in Hadamard spaces
Proximal point algorithm in Hadamard spaces Miroslav Bacak Télécom ParisTech Optimisation Géométrique sur les Variétés - Paris, 21 novembre 2014 Contents of the talk 1 Basic facts on Hadamard spaces 2
More informationPDEs in Image Processing, Tutorials
PDEs in Image Processing, Tutorials Markus Grasmair Vienna, Winter Term 2010 2011 Direct Methods Let X be a topological space and R: X R {+ } some functional. following definitions: The mapping R is lower
More informationCoordinate Update Algorithm Short Course Operator Splitting
Coordinate Update Algorithm Short Course Operator Splitting Instructor: Wotao Yin (UCLA Math) Summer 2016 1 / 25 Operator splitting pipeline 1. Formulate a problem as 0 A(x) + B(x) with monotone operators
More informationA splitting minimization method on geodesic spaces
A splitting minimization method on geodesic spaces J.X. Cruz Neto DM, Universidade Federal do Piauí, Teresina, PI 64049-500, BR B.P. Lima DM, Universidade Federal do Piauí, Teresina, PI 64049-500, BR P.A.
More informationENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT
ENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT PRASHANT ATHAVALE Abstract. Digital images are can be realized as L 2 (R 2 objects. Noise is introduced in a digital image due to various reasons.
More informationManifolds, Lie Groups, Lie Algebras, with Applications. Kurt W.A.J.H.Y. Reillag (alias Jean Gallier) CIS610, Spring 2005
Manifolds, Lie Groups, Lie Algebras, with Applications Kurt W.A.J.H.Y. Reillag (alias Jean Gallier) CIS610, Spring 2005 1 Motivations and Goals 1. Motivations Observation: Often, the set of all objects
More informationITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms
ITK Filters Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms ITCS 6010:Biomedical Imaging and Visualization 1 ITK Filters:
More informationϕ ( ( u) i 2 ; T, a), (1.1)
CONVEX NON-CONVEX IMAGE SEGMENTATION RAYMOND CHAN, ALESSANDRO LANZA, SERENA MORIGI, AND FIORELLA SGALLARI Abstract. A convex non-convex variational model is proposed for multiphase image segmentation.
More informationVariational Methods in Image Denoising
Variational Methods in Image Denoising Jamylle Carter Postdoctoral Fellow Mathematical Sciences Research Institute (MSRI) MSRI Workshop for Women in Mathematics: Introduction to Image Analysis 22 January
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 informationCoordinate Update Algorithm Short Course Proximal Operators and Algorithms
Coordinate Update Algorithm Short Course Proximal Operators and Algorithms Instructor: Wotao Yin (UCLA Math) Summer 2016 1 / 36 Why proximal? Newton s method: for C 2 -smooth, unconstrained problems allow
More informationA Randomized Approach for Crowdsourcing in the Presence of Multiple Views
A Randomized Approach for Crowdsourcing in the Presence of Multiple Views Presenter: Yao Zhou joint work with: Jingrui He - 1 - Roadmap Motivation Proposed framework: M2VW Experimental results Conclusion
More informationFast median filtering for phase or orientation data
1 Fast median filtering for phase or orientation data Martin Storath, Andreas Weinmann Abstract Median filtering is among the most utilized tools for smoothing real-valued data, as it is robust, edge-preserving,
More informationDiffusion Tensor Imaging: Reconstruction Using Deterministic Error Bounds
Diffusion Tensor Imaging: Reconstruction Using Deterministic Error Bounds Yury Korolev 1, Tuomo Valkonen 2 and Artur Gorokh 3 1 Queen Mary University of London, UK 2 University of Cambridge, UK 3 Cornell
More informationRician Noise Removal in Diffusion Tensor MRI
Rician Noise Removal in Diffusion Tensor MRI Saurav Basu, Thomas Fletcher, and Ross Whitaker University of Utah, School of Computing, Salt Lake City, UT 84112, USA Abstract. Rician noise introduces a bias
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 informationExercise 1 (Formula for connection 1-forms) Using the first structure equation, show that
1 Stokes s Theorem Let D R 2 be a connected compact smooth domain, so that D is a smooth embedded circle. Given a smooth function f : D R, define fdx dy fdxdy, D where the left-hand side is the integral
More informationStochastic gradient descent on Riemannian manifolds
Stochastic gradient descent on Riemannian manifolds Silvère Bonnabel 1 Robotics lab - Mathématiques et systèmes Mines ParisTech Gipsa-lab, Grenoble June 20th, 2013 1 silvere.bonnabel@mines-paristech Introduction
More informationImage processing and Computer Vision
1 / 1 Image processing and Computer Vision Continuous Optimization and applications to image processing Martin de La Gorce martin.de-la-gorce@enpc.fr February 2015 Optimization 2 / 1 We have a function
More informationEnergy Minimization via Graph Cuts
Energy Minimization via Graph Cuts Xiaowei Zhou, June 11, 2010, Journal Club Presentation 1 outline Introduction MAP formulation for vision problems Min-cut and Max-flow Problem Energy Minimization via
More informationA memory gradient algorithm for l 2 -l 0 regularization with applications to image restoration
A memory gradient algorithm for l 2 -l 0 regularization with applications to image restoration E. Chouzenoux, A. Jezierska, J.-C. Pesquet and H. Talbot Université Paris-Est Lab. d Informatique Gaspard
More informationHyperbolic Geometry on Geometric Surfaces
Mathematics Seminar, 15 September 2010 Outline Introduction Hyperbolic geometry Abstract surfaces The hemisphere model as a geometric surface The Poincaré disk model as a geometric surface Conclusion Introduction
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 informationNotes on Cartan s Method of Moving Frames
Math 553 σιι June 4, 996 Notes on Cartan s Method of Moving Frames Andrejs Treibergs The method of moving frames is a very efficient way to carry out computations on surfaces Chern s Notes give an elementary
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationInformation geometry of mirror descent
Information geometry of mirror descent Geometric Science of Information Anthea Monod Department of Statistical Science Duke University Information Initiative at Duke G. Raskutti (UW Madison) and S. Mukherjee
More informationSimultaneous Multi-frame MAP Super-Resolution Video Enhancement using Spatio-temporal Priors
Simultaneous Multi-frame MAP Super-Resolution Video Enhancement using Spatio-temporal Priors Sean Borman and Robert L. Stevenson Department of Electrical Engineering, University of Notre Dame Notre Dame,
More informationLearning Spectral Graph Segmentation
Learning Spectral Graph Segmentation AISTATS 2005 Timothée Cour Jianbo Shi Nicolas Gogin Computer and Information Science Department University of Pennsylvania Computer Science Ecole Polytechnique Graph-based
More informationTHE DOUBLE COVER RELATIVE TO A CONVEX DOMAIN AND THE RELATIVE ISOPERIMETRIC INEQUALITY
J. Aust. Math. Soc. 80 (2006), 375 382 THE DOUBLE COVER RELATIVE TO A CONVEX DOMAIN AND THE RELATIVE ISOPERIMETRIC INEQUALITY JAIGYOUNG CHOE (Received 18 March 2004; revised 16 February 2005) Communicated
More informationNatural Evolution Strategies for Direct Search
Tobias Glasmachers Natural Evolution Strategies for Direct Search 1 Natural Evolution Strategies for Direct Search PGMO-COPI 2014 Recent Advances on Continuous Randomized black-box optimization Thursday
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 information1. Geometry of the unit tangent bundle
1 1. Geometry of the unit tangent bundle The main reference for this section is [8]. In the following, we consider (M, g) an n-dimensional smooth manifold endowed with a Riemannian metric g. 1.1. Notations
More informationREGULAR TRIPLETS IN COMPACT SYMMETRIC SPACES
REGULAR TRIPLETS IN COMPACT SYMMETRIC SPACES MAKIKO SUMI TANAKA 1. Introduction This article is based on the collaboration with Tadashi Nagano. In the first part of this article we briefly review basic
More informationConvergence rate analysis for averaged fixed point iterations in the presence of Hölder regularity
Convergence rate analysis for averaged fixed point iterations in the presence of Hölder regularity Jonathan M. Borwein Guoyin Li Matthew K. Tam October 23, 205 Abstract In this paper, we establish sublinear
More informationNonlinear Flows for Displacement Correction and Applications in Tomography
Nonlinear Flows for Displacement Correction and Applications in Tomography Guozhi Dong 1 and Otmar Scherzer 1,2 1 Computational Science Center, University of Vienna, Oskar-Morgenstern-Platz 1, 1090 Wien,
More informationEE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6)
EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement to the material discussed in
More informationExtracting structured dynamical systems using sparse optimization with very few samples
Extracting structured dynamical systems using sparse optimization with very few samples Hayden Schaeffer 1, Giang Tran 2, Rachel Ward 3 and Linan Zhang 1 1 Department of Mathematical Sciences, Carnegie
More informationTravel Time Tomography and Tensor Tomography, I
Travel Time Tomography and Tensor Tomography, I Plamen Stefanov Purdue University Mini Course, MSRI 2009 Plamen Stefanov (Purdue University ) Travel Time Tomography and Tensor Tomography, I 1 / 17 Alternative
More informationADMM algorithm for demosaicking deblurring denoising
ADMM algorithm for demosaicking deblurring denoising DANIELE GRAZIANI MORPHEME CNRS/UNS I3s 2000 route des Lucioles BP 121 93 06903 SOPHIA ANTIPOLIS CEDEX, FRANCE e.mail:graziani@i3s.unice.fr LAURE BLANC-FÉRAUD
More informationActive Contours Snakes and Level Set Method
Active Contours Snakes and Level Set Method Niels Chr. Overgaard 2010-09-21 N. Chr. Overgaard Lecture 7 2010-09-21 1 / 26 Outline What is an mage? What is an Active Contour? Deforming Force: The Edge Map
More informationarxiv: v1 [math.na] 3 Jan 2019
arxiv manuscript No. (will be inserted by the editor) A Finite Element Nonoverlapping Domain Decomposition Method with Lagrange Multipliers for the Dual Total Variation Minimizations Chang-Ock Lee Jongho
More informationNon-Negative Matrix Factorization with Quasi-Newton Optimization
Non-Negative Matrix Factorization with Quasi-Newton Optimization Rafal ZDUNEK, Andrzej CICHOCKI Laboratory for Advanced Brain Signal Processing BSI, RIKEN, Wako-shi, JAPAN Abstract. Non-negative matrix
More informationMonotone Point-to-Set Vector Fields
Monotone Point-to-Set Vector Fields J.X. da Cruz Neto, O.P.Ferreira and L.R. Lucambio Pérez Dedicated to Prof.Dr. Constantin UDRIŞTE on the occasion of his sixtieth birthday Abstract We introduce the concept
More informationDesign of optimal RF pulses for NMR as a discrete-valued control problem
Design of optimal RF pulses for NMR as a discrete-valued control problem Christian Clason Faculty of Mathematics, Universität Duisburg-Essen joint work with Carla Tameling (Göttingen) and Benedikt Wirth
More informationA Multilevel Proximal Algorithm for Large Scale Composite Convex Optimization
A Multilevel Proximal Algorithm for Large Scale Composite Convex Optimization Panos Parpas Department of Computing Imperial College London www.doc.ic.ac.uk/ pp500 p.parpas@imperial.ac.uk jointly with D.V.
More informationConvexity and Non-Convexity in Partitioning and Interpolation Problems
Convexity and Non-Convexity in Partitioning and Interpolation Problems Jan Lellmann CIA/DAMTP, University of Cambridge Joint work with: C. Schnörr, F. Lenzen (IPA/HCI, University of Heidelberg), F. Widmann,
More informationLinear Diffusion and Image Processing. Outline
Outline Linear Diffusion and Image Processing Fourier Transform Convolution Image Restoration: Linear Filtering Diffusion Processes for Noise Filtering linear scale space theory Gauss-Laplace pyramid for
More informationRobust Tensor Splines for Approximation of Diffusion Tensor MRI Data
Robust Tensor Splines for Approximation of Diffusion Tensor MRI Data Angelos Barmpoutis, Baba C. Vemuri, John R. Forder University of Florida Gainesville, FL 32611, USA {abarmpou, vemuri}@cise.ufl.edu,
More informationSolution-driven Adaptive Total Variation Regularization
1/15 Solution-driven Adaptive Total Variation Regularization Frank Lenzen 1, Jan Lellmann 2, Florian Becker 1, Stefania Petra 1, Johannes Berger 1, Christoph Schnörr 1 1 Heidelberg Collaboratory for Image
More informationA General Framework for a Class of Primal-Dual Algorithms for TV Minimization
A General Framework for a Class of Primal-Dual Algorithms for TV Minimization Ernie Esser UCLA 1 Outline A Model Convex Minimization Problem Main Idea Behind the Primal Dual Hybrid Gradient (PDHG) Method
More informationECE G: Special Topics in Signal Processing: Sparsity, Structure, and Inference
ECE 18-898G: Special Topics in Signal Processing: Sparsity, Structure, and Inference Sparse Recovery using L1 minimization - algorithms Yuejie Chi Department of Electrical and Computer Engineering Spring
More informationUniversität des Saarlandes. Fachrichtung 6.1 Mathematik
Universität des Saarlandes U N I V E R S I T A S S A R A V I E N I S S Fachrichtung 6.1 Mathematik Preprint Nr. 143 PDEs for Tensor Image Processing Joachim Weickert, Christian Feddern, Martin Welk, Bernhard
More informationNotes on Regularization and Robust Estimation Psych 267/CS 348D/EE 365 Prof. David J. Heeger September 15, 1998
Notes on Regularization and Robust Estimation Psych 67/CS 348D/EE 365 Prof. David J. Heeger September 5, 998 Regularization. Regularization is a class of techniques that have been widely used to solve
More informationA Dual Formulation of the TV-Stokes Algorithm for Image Denoising
A Dual Formulation of the TV-Stokes Algorithm for Image Denoising Christoffer A. Elo, Alexander Malyshev, and Talal Rahman Department of Mathematics, University of Bergen, Johannes Bruns gate 12, 5007
More informationMinimizing Isotropic Total Variation without Subiterations
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Minimizing Isotropic Total Variation without Subiterations Kamilov, U. S. TR206-09 August 206 Abstract Total variation (TV) is one of the most
More informationComputing and Processing Correspondences with Functional Maps
Computing and Processing Correspondences with Functional Maps Maks Ovsjanikov 1 Etienne Corman 2 Michael Bronstein 3,4,5 Emanuele Rodolà 3 Mirela Ben-Chen 6 Leonidas Guibas 7 Frédéric Chazal 8 Alexander
More informationSegmentation using deformable models
Segmentation using deformable models Isabelle Bloch http://www.tsi.enst.fr/ bloch Téécom ParisTech - CNRS UMR 5141 LTCI Paris - France Modèles déformables p.1/43 Introduction Deformable models = evolution
More informationMath 273a: Optimization Overview of First-Order Optimization Algorithms
Math 273a: Optimization Overview of First-Order Optimization Algorithms Wotao Yin Department of Mathematics, UCLA online discussions on piazza.com 1 / 9 Typical flow of numerical optimization Optimization
More informationPseudo-Poincaré Inequalities and Applications to Sobolev Inequalities
Pseudo-Poincaré Inequalities and Applications to Sobolev Inequalities Laurent Saloff-Coste Abstract Most smoothing procedures are via averaging. Pseudo-Poincaré inequalities give a basic L p -norm control
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 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 informationThe Metric Geometry of the Multivariable Matrix Geometric Mean
Trieste, 2013 p. 1/26 The Metric Geometry of the Multivariable Matrix Geometric Mean Jimmie Lawson Joint Work with Yongdo Lim Department of Mathematics Louisiana State University Baton Rouge, LA 70803,
More informationl 1 and l 2 Regularization
David Rosenberg New York University February 5, 2015 David Rosenberg (New York University) DS-GA 1003 February 5, 2015 1 / 32 Tikhonov and Ivanov Regularization Hypothesis Spaces We ve spoken vaguely about
More informationScale Space Smoothing, Image Feature Extraction and Bessel Filters
Scale Space Smoothing, Image Feature Extraction and Bessel Filters Sasan Mahmoodi and Steve Gunn School of Electronics and Computer Science, Building 1, Southampton University, Southampton, SO17 1BJ, UK
More information