Shape analysis through geometric distributions
|
|
- Maurice Barton
- 5 years ago
- Views:
Transcription
1 Shape analysis through geometric distributions Nicolas Charon (CIS, Johns Hopkins University) joint work with B. Charlier (Université de Montpellier), I. Kaltenmark (CMLA), A. Trouvé, Hsi-Wei Hsieh (JHU)... Applications-Driven Geometric Functional Data Analysis Workshop, FSU
2 1. Representation of shapes as generalized distributions 2. Metric spaces of oriented varifolds 3. Applications
3 1 Shapes as distributions: Shape similarity metrics between unparametrized submanifolds Our goal is to propose a notion of shape similarity that: Is intrinsically parametrization-invariant. Leads to closed form expressions for the metrics and can be easily differentiated. Applies consistently to continuous or discrete objects. Is robust to imperfections: noise, disconnections, segmentation issues... Can handle a variety of situations: open curves and surfaces, bundles, multi-shapes... 3/24
4 1 Shapes as distributions: 4/24 One must abandon the idea of describing all the competing surfaces by continuous maps from a single predetermined parameter space. One should rather think of surfaces as m-dimensional mass distributions, with tangent m-vectors attached. H. Federer
5 1 Shapes as distributions: 5/24 A simple case: point clouds A point cloud is by definition a set of unlabelled point positions {x k } k=1,..,p in a vector space R n
6 1 Shapes as distributions: A simple case: point clouds Alternatively, it can be viewed as a sum of Dirac distributions p k=1 δ x k acting on the set of functions f C 0 (R n, R) : p δ xk (f ) = k=1 p f (x k ) This gives an embedding of all point clouds in a functional space : the set of signed measures of R n, C 0 (R n, R), which can be then equipped with various possible metrics 1. k=1 1 Glaunès, Trouvé, Younes. Diffeomorphic matching of distributions. A new approach for unlabelled point sets and submanifolds matching /24
7 1 Shapes as distributions: An extended framework: oriented varifolds 2 We focus on the special case of curves and surfaces in R n, n = 2, 3. Definition An oriented varifold of R n is a distribution (or measure) on the space R n S n 1. Specifically, if W C 0 (R n S n 1 ) is a given Banach space of continuous test functions, an oriented varifold is an element of W. 2 Kaltenmark, Charlier, Charon. A general framework for curve and surface comparison and registration with oriented varifolds. CVPR /24
8 1 Shapes as distributions: An extended framework: oriented varifolds 2 We focus on the special case of curves and surfaces in R n, n = 2, 3. Definition An oriented varifold of R n is a distribution (or measure) on the space R n S n 1. Specifically, if W C 0 (R n S n 1 ) is a given Banach space of continuous test functions, an oriented varifold is an element of W. Example: the Dirac delta distribution δ (x,u) correspond to a singular mass located at position x R n carrying the unit oriented vector u S n 1. 2 Kaltenmark, Charlier, Charon. A general framework for curve and surface comparison and registration with oriented varifolds. CVPR /24
9 1 Shapes as distributions: The oriented varifold representation of shapes Given an embedded oriented curve or surface X, one can define the map µ : X µ X by: µ X (ω) = X ω(x, u(x))dvol(x) for all ω W where u(x) is the unit tangent or normal vector to X at x. 8/24
10 1 Shapes as distributions: The oriented varifold representation of shapes Given an embedded oriented curve or surface X, one can define the map µ : X µ X by: µ X (ω) = X ω(x, u(x))dvol(x) for all ω W where u(x) is the unit tangent or normal vector to X at x. In other words, the mapping q µ q for q Emb(M, R n ) is invariant to positive reparametrizations in Diff + (M). 8/24
11 1 Shapes as distributions: 8/24 The oriented varifold representation of shapes Given an embedded oriented curve or surface X, one can define the map µ : X µ X by: µ X (ω) = X ω(x, u(x))dvol(x) for all ω W where u(x) is the unit tangent or normal vector to X at x. In other words, the mapping q µ q for q Emb(M, R n ) is invariant to positive reparametrizations in Diff + (M). µ extends to d-dimensional rectifiable subsets of R n : ( ) µ X (ω) = ω(x, u(x))dh d (x) = δ (x,u(x)) dh d (x) (ω) X X
12 1 Shapes as distributions: 9/24 Discrete shapes and approximation Discrete shapes are usually given as X = p i=1 X i with cells X i (segments or faces). The associated µ X = p i=1 µ X i can be conveniently approximated by the discrete varifold: µ X = p i=1 r iδ (xi, t i )
13 1. Representation of shapes as generalized distributions 2. Metric spaces of oriented varifolds 3. Applications
14 2 Varifold metrics: 11/24 Dual metrics and induced distance Idea: given a norm on W and the dual norm W, define the distance induced by µ: d W (X 1, X 2 ) = µ X1 µ X2 W.
15 2 Varifold metrics: Dual metrics and induced distance Idea: given a norm on W and the dual norm W, define the distance induced by µ: d W (X 1, X 2 ) = µ X1 µ X2 W. Remaining issues: In general, d W is only a pseudo-distance: conditions on W for µ to be injective? Closed form expression of the distance? 11/24
16 2 Varifold metrics: 12/24 Separable kernel metrics on oriented varifolds Construct W and W with the following conditions: W is a Reproducing Kernel Hilbert Space (RKHS) generated by a kernel k on R n S n 1. k is separable: k(x, u, y, v) = k pos (x, y)k or (u, v). k pos (x, y). = ρ( x y 2 ) is a C 1 radial positive kernel on R n. k or (u, v). = γ(u v) is a C 1 zonal positive kernel on S n 1.
17 2 Varifold metrics: 12/24 Separable kernel metrics on oriented varifolds Construct W and W with the following conditions: W is a Reproducing Kernel Hilbert Space (RKHS) generated by a kernel k on R n S n 1. k is separable: k(x, u, y, v) = k pos (x, y)k or (u, v). k pos (x, y). = ρ( x y 2 ) is a C 1 radial positive kernel on R n. k or (u, v). = γ(u v) is a C 1 zonal positive kernel on S n 1. Under those assumptions, one has W C0 1(Rn S n 1 ) and: µ X1, µ X2 W = ρ( x 1 x 2 2 ) γ(u 1 (x 1 ) u 2 (x 2 ))dh d (x 1 )dh d (x 2 ) X 2 X 1
18 2 Varifold metrics: 13/24 Induced distance Theorem (Hsieh, C.) If, in addition, k pos is a C 0 -universal kernel on R n and for all u S n 1, k or (u, u) > 0 then d W (X 1, X 2 ) = µ X µ Y W is a distance between rectifiable subsets. We also have the following invariance: Property The action of rigid motions is isometric for d W, i.e for all (R, b) SO n (R) R n : d W (RX 1 + b, RX 2 + b) = d W (X 1, X 2 ).
19 2 Varifold metrics: 14/24 Examples of kernels Standard choices for k pos are Gaussian kernels k pos (x, y) = e x y 2 σ 2 (smooth, radial and C 0 universal) or sum of Gaussian kernels (for multiscale problems), inverse multiquadrics...
20 2 Varifold metrics: Examples of kernels For k or, multiple possibilities leading to fundamentally different properties: k or ( u, v) = u v (linear kernel): equivalent to currents. k or ( u, v) = ( u v) 2 (Binet kernel): unoriented varifold. 2( u v) σ k or ( u, v) = e s 2 non-linear. (oriented spherical Gaussian): oriented but 14/24
21 1. Representation of shapes as generalized distributions 2. Metric spaces of oriented varifolds 3. Applications
22 16/24 Shape clustering based on varifold-type metrics Figure: Kimia shapes database We compute a rigid-invariant metric by quotienting out rotations and translations: d(x, Y ) = inf µ RX +b µ Y W (R,b) SO(n) R n
23 17/24 Clustering results Method 1 st 2 nd 3 rd 4 th 5 th 6 th 7 th 8 th Current Unoriented varifold Oriented varifold Method 9 th 10 th 11 th Total Current % Unoriented varifold % Oriented varifold % Table: Clustering scores for k nearest neighbors, k = 1,..., 11 overall percentage of correct assignment.
24 Registration of curves, surfaces and more... Those metrics can be embedded as fidelity terms in the many existing registration models. For example, in the case of Large Deformation Diffeomorphic Metric Mapping (LDDMM) 3, registration of template shape X 0 on target Y consists in the optimal control problem: min v J(v). = 1 v t 2 V dt +γ µ φ v 1 (X 0) µ Y 2 W 0 }{{ }}{{} fidelity term regularization term over time-varying velocity field v L 2 ([0, 1], V ), with φ v t the flow application at time t. 3 Beg, Miller, Trouvé, and Younes. Computing large deformation metric mappings via geodesic flows of diffeomorphisms. International journal of computer vision, /24
25 Registration of curves, surfaces and more... Those metrics can be embedded as fidelity terms in the many existing registration models. For example, in the case of Large Deformation Diffeomorphic Metric Mapping (LDDMM) 3, registration of template shape X 0 on target Y consists in the optimal control problem: min v J(v). = 1 v t 2 V dt +γ µ φ v 1 (X 0) µ Y 2 W 0 }{{ }}{{} fidelity term regularization term over time-varying velocity field v L 2 ([0, 1], V ), with φ v t the flow application at time t. Optimal solutions correspond to geodesics on a diffeomorphism group and the problem can be solved efficiently in practice with geodesic shooting algorithms. 3 Beg, Miller, Trouvé, and Younes. Computing large deformation metric mappings via geodesic flows of diffeomorphisms. International journal of computer vision, /24
26 3 Applications: Example of registration Linear Binet Oriented Gaussian Figure: Registration for the three different kernels kor 19/24
27 20/24 Registration with noise Linear Binet Oriented Gaussian Figure: Registration on noisy target for three different kernels k or
28 21/24 Shape denoising with currents Smooth surface Noisy version
29 21/24 Shape denoising with currents Smooth surface Noisy version Deformation (t=0)
30 21/24 Shape denoising with currents Smooth surface Noisy version Deformation (t=0.3)
31 21/24 Shape denoising with currents Smooth surface Noisy version Deformation (t=0.6)
32 21/24 Shape denoising with currents Smooth surface Noisy version Deformation (t=1)
33 21/24 Shape denoising with currents Smooth surface Noisy version Matched shape + smooth target
34 22/24 Partial shapes Unoriented varifolds are advantageous in the situation of incomplete shapes: Fully sampled surface 30% of faces left
35 22/24 Partial shapes Unoriented varifolds are advantageous in the situation of incomplete shapes: Fully sampled surface 30% of faces left
36 22/24 Partial shapes Unoriented varifolds are advantageous in the situation of incomplete shapes: Fully sampled surface 30% of faces left
37 22/24 Partial shapes Unoriented varifolds are advantageous in the situation of incomplete shapes: Fully sampled surface 30% of faces left
38 22/24 Partial shapes Unoriented varifolds are advantageous in the situation of incomplete shapes: Fully sampled surface 30% of faces left
39 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching
40 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching
41 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching
42 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching
43 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching
44 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching
45 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching Figure: Surface + curve matching
46 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching Figure: Surface + curve matching
47 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching Figure: Surface + curve matching
48 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching Figure: Surface + curve matching
49 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching Figure: Surface + curve matching
50 23/24 Multi-varifolds Multi-dimensional objects can be similarly represented and compared as direct sums of varifolds. Example: represent a surface with boundary as µ = µ X µ X. Figure: Surface matching Figure: Surface + curve matching
51 Other related directions Varifold relaxation for intrinsic metric mapping. 4 Sparse approximations of shapes. Incorporate curvature information in the representation and distance: with mutlidirectional varifolds 5 or normal cycles 6. Scale invariance/robustness: use similarity terms based on optimal transport 7? 4 Bauer,Bruveris,Charon,Moeller-Andersen. Varifold-based matching of curves via Sobolev-type Riemannian metrics Rekik,Li,Lin,Shen. Multidirectional and Topography-based Dynamic-scale Varifold Representations with Application to Matching Developing Cortical Surfaces Roussillon,Glaunès. Kernel Metrics on Normal Cycles and Application to Curve Matching Feydi,Charlier,Vialard,Peyré. Optimal Transport for Diffeomorphic Registration /24
A general framework for curve and surface comparison and registration with oriented varifolds
A general framework for curve and surface comparison and registration with oriented varifolds Irène Kaltenmark CMLA, ENS Cachan, CNRS, Université Paris-Saclay, 94235, Cachan, France irene.kaltenmark@cmla.ens-cachan.fr
More informationLower bounds on the barrier parameter of convex cones
of convex cones Université Grenoble 1 / CNRS June 20, 2012 / High Performance Optimization 2012, Delft Outline Logarithmically homogeneous barriers 1 Logarithmically homogeneous barriers Conic optimization
More informationTemplate Estimation for Large Database : a Diffeomorphic Iterative Centroid Method Using Currents
Template Estimation for Large Database : a Diffeomorphic Iterative Centroid Method Using Currents Claire Cury 12346, Olivier Colliot 1234, and Joan A. Glaunès 5 1 Université Pierre et Marie Curie-Paris
More informationExtensions and Applications of Image Metamorphosis
Extensions and Applications of Image Metamorphosis Sebastian Neumayer TU Kaiserslautern neumayer@mathematik.uni-kl.de joint work with A. Effland (Graz), L. Lang (Cambridge), O. Öktem (Stockholm), J. Persch
More informationSTATISTICS AND ANALYSIS OF SHAPE
Control and Cybernetics vol. 36 (2007) No. 2 Book review: STATISTICS AND ANALYSIS OF SHAPE by H. Krim, A. Yezzi, Jr., eds. There are numerous definitions of a notion of shape of an object. These definitions
More informationAn Image Curvature Microscope
An Jean-Michel MOREL Joint work with Adina CIOMAGA and Pascal MONASSE Centre de Mathématiques et de Leurs Applications, Ecole Normale Supérieure de Cachan Séminaire Jean Serra - 70 ans April 2, 2010 Jean-Michel
More informationDeformetrica: a software for statistical analysis of anatomical shapes
Deformetrica: a software for statistical analysis of anatomical shapes Alexandre Routier, Marcel Prastawa, Benjamin Charlier, Cédric Doucet, Joan Alexis Glaunès, Stanley Durrleman To cite this version:
More informationLTI Thesis Defense: Riemannian Geometry and Statistical Machine Learning
Outline LTI Thesis Defense: Riemannian Geometry and Statistical Machine Learning Guy Lebanon Motivation Introduction Previous Work Committee:John Lafferty Geoff Gordon, Michael I. Jordan, Larry Wasserman
More informationIain Claridge. Surface Curvature
Iain Claridge Surface Curvature Siddhartha Chaudhuri http://www.cse.iitb.ac.in/~cs749 Curves and surfaces in 3D For our purposes: A curve is a map α : ℝ ℝ3 a b I (or from some subset I of ℝ) α(a) α(b)
More informationCorrespondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov
Shape Matching & Correspondence CS 468 Geometry Processing Algorithms Maks Ovsjanikov Wednesday, October 27 th 2010 Overall Goal Given two shapes, find correspondences between them. Overall Goal Given
More informationAn Image Curvature Microscope
An Jean-Michel MOREL Joint work with Adina CIOMAGA and Pascal MONASSE Centre de Mathématiques et de Leurs Applications, Ecole Normale Supérieure de Cachan Séminaire Jean Serra - 70 ans April 2, 2010 Jean-Michel
More informationParticle Filtering. CS6240 Multimedia Analysis. Leow Wee Kheng. Department of Computer Science School of Computing National University of Singapore
Particle Filtering CS6240 Multimedia Analysis Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore (CS6240) Particle Filtering 1 / 28 Introduction Introduction
More informationA Geometric Perspective on Machine Learning
A Geometric Perspective on Machine Learning Partha Niyogi The University of Chicago Collaborators: M. Belkin, V. Sindhwani, X. He, S. Smale, S. Weinberger A Geometric Perspectiveon Machine Learning p.1
More information10. Cartesian Trajectory Planning for Robot Manipulators
V. Kumar 0. Cartesian rajectory Planning for obot Manipulators 0.. Introduction Given a starting end effector position and orientation and a goal position and orientation we want to generate a smooth trajectory
More informationGeometric structures on 2-orbifolds
Geometric structures on 2-orbifolds Section 1: Manifolds and differentiable structures S. Choi Department of Mathematical Science KAIST, Daejeon, South Korea 2010 Fall, Lectures at KAIST S. Choi (KAIST)
More informationGeometric Registration for Deformable Shapes 3.3 Advanced Global Matching
Geometric Registration for Deformable Shapes 3.3 Advanced Global Matching Correlated Correspondences [ASP*04] A Complete Registration System [HAW*08] In this session Advanced Global Matching Some practical
More informationSpline Curves. Spline Curves. Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1
Spline Curves Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1 Problem: In the previous chapter, we have seen that interpolating polynomials, especially those of high degree, tend to produce strong
More informationEE 584 MACHINE VISION
EE 584 MACHINE VISION Binary Images Analysis Geometrical & Topological Properties Connectedness Binary Algorithms Morphology Binary Images Binary (two-valued; black/white) images gives better efficiency
More informationPreparation Meeting. Recent Advances in the Analysis of 3D Shapes. Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers
Preparation Meeting Recent Advances in the Analysis of 3D Shapes Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers What You Will Learn in the Seminar Get an overview on state of the art
More informationNon-Rigid Image Registration III
Non-Rigid Image Registration III CS6240 Multimedia Analysis Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore Leow Wee Kheng (CS6240) Non-Rigid Image Registration
More informationAn introduction to Topological Data Analysis through persistent homology: Intro and geometric inference
Sophia-Antipolis, January 2016 Winter School An introduction to Topological Data Analysis through persistent homology: Intro and geometric inference Frédéric Chazal INRIA Saclay - Ile-de-France frederic.chazal@inria.fr
More informationTeichmüller Space and Fenchel-Nielsen Coordinates
Teichmüller Space and Fenchel-Nielsen Coordinates Nathan Lopez November 30, 2015 Abstract Here we give an overview of Teichmüller space and its realization as a smooth manifold through Fenchel- Nielsen
More informationCompressed Point Cloud Visualizations
Compressed Point Cloud Visualizations Christopher Miller October 2, 2007 Outline Description of The Problem Description of The Wedgelet Algorithm Statistical Preprocessing Intrinsic Point Cloud Simplification
More informationMathematical Tools for 3D Shape Analysis and Description
outline Mathematical Tools for 3D Shape Analysis and Description SGP 2013 Graduate School Silvia Biasotti, Andrea Cerri, Michela Spagnuolo Istituto di Matematica Applicata e Tecnologie Informatiche E.
More informationGeodesics in heat: A new approach to computing distance
Geodesics in heat: A new approach to computing distance based on heat flow Diana Papyan Faculty of Informatics - Technische Universität München Abstract In this report we are going to introduce new method
More informationIntroduction to geometry
1 2 Manifolds A topological space in which every point has a neighborhood homeomorphic to (topological disc) is called an n-dimensional (or n-) manifold Introduction to geometry The German way 2-manifold
More informationA barrier on convex cones with parameter equal to the dimension
A barrier on convex cones with parameter equal to the dimension Université Grenoble 1 / CNRS August 23 / ISMP 2012, Berlin Outline 1 Universal barrier 2 Projective images of barriers Pseudo-metric on the
More informationweighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces.
weighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces. joint work with (S. Osher, R. Fedkiw and M. Kang) Desired properties for surface reconstruction:
More informationFeature Extractors. CS 188: Artificial Intelligence Fall Some (Vague) Biology. The Binary Perceptron. Binary Decision Rule.
CS 188: Artificial Intelligence Fall 2008 Lecture 24: Perceptrons II 11/24/2008 Dan Klein UC Berkeley Feature Extractors A feature extractor maps inputs to feature vectors Dear Sir. First, I must solicit
More informationTranslation Symmetry Detection: A Repetitive Pattern Analysis Approach
2013 IEEE Conference on Computer Vision and Pattern Recognition Workshops Translation Symmetry Detection: A Repetitive Pattern Analysis Approach Yunliang Cai and George Baciu GAMA Lab, Department of Computing
More informationDiscrete Exterior Calculus How to Turn Your Mesh into a Computational Structure. Discrete Differential Geometry
Discrete Exterior Calculus How to Turn Your Mesh into a Computational Structure Discrete Differential Geometry Big Picture Deriving a whole Discrete Calculus you need first a discrete domain will induce
More informationTOOLS FOR ANALYZING SHAPES OF CURVES AND SURFACES. ANUJ SRIVASTAVA Department of Statistics Florida State University
TOOLS FOR ANALYZING SHAPES OF CURVES AND SURFACES ANUJ SRIVASTAVA Department of Statistics Florida State University 1 MURI: INTGERATED FUSION AND SENSOR MANAGEMENT FOR ATE Innovative Front-End Processing
More informationIntroduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama
Introduction to Computer Graphics Modeling (3) April 27, 2017 Kenshi Takayama Solid modeling 2 Solid models Thin shapes represented by single polygons Unorientable Clear definition of inside & outside
More informationDefinition A metric space is proper if all closed balls are compact. The length pseudo metric of a metric space X is given by.
Chapter 1 Geometry: Nuts and Bolts 1.1 Metric Spaces Definition 1.1.1. A metric space is proper if all closed balls are compact. The length pseudo metric of a metric space X is given by (x, y) inf p. p:x
More informationImproving Shape retrieval by Spectral Matching and Meta Similarity
1 / 21 Improving Shape retrieval by Spectral Matching and Meta Similarity Amir Egozi (BGU), Yosi Keller (BIU) and Hugo Guterman (BGU) Department of Electrical and Computer Engineering, Ben-Gurion University
More informationGlobally Optimal Joint Image Segmentation and Shape Matching Based on Wasserstein Modes
Globally Optimal Joint Image Segmentation and Shape Matching Based on Wasserstein Modes Bernhard Schmitzer and Christoph Schnörr November 4, 2014 Abstract A functional for joint variational object segmentation
More informationLoop detection and extended target tracking using laser data
Licentiate seminar 1(39) Loop detection and extended target tracking using laser data Karl Granström Division of Automatic Control Department of Electrical Engineering Linköping University Linköping, Sweden
More informationPositive Definite Kernel Functions on Fuzzy Sets
Positive Definite Kernel Functions on Fuzzy Sets FUZZ 2014 Jorge Guevara Díaz 1 Roberto Hirata Jr. 1 Stéphane Canu 2 1 Institute of Mathematics and Statistics University of Sao Paulo-Brazil 2 Institut
More informationDiffusion Wavelets for Natural Image Analysis
Diffusion Wavelets for Natural Image Analysis Tyrus Berry December 16, 2011 Contents 1 Project Description 2 2 Introduction to Diffusion Wavelets 2 2.1 Diffusion Multiresolution............................
More informationShape Modeling and Geometry Processing
252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry
More informationGeodesic and curvature of piecewise flat Finsler surfaces
Geodesic and curvature of piecewise flat Finsler surfaces Ming Xu Capital Normal University (based on a joint work with S. Deng) in Southwest Jiaotong University, Emei, July 2018 Outline 1 Background Definition
More informationRecent Developments in Model-based Derivative-free Optimization
Recent Developments in Model-based Derivative-free Optimization Seppo Pulkkinen April 23, 2010 Introduction Problem definition The problem we are considering is a nonlinear optimization problem with constraints:
More informationFiltering Images. Contents
Image Processing and Data Visualization with MATLAB Filtering Images Hansrudi Noser June 8-9, 010 UZH, Multimedia and Robotics Summer School Noise Smoothing Filters Sigmoid Filters Gradient Filters Contents
More informationCurvature, Finite Topology, and Foliations
Characterizations of Complete Embedded Minimal Surfaces: Finite Curvature, Finite Topology, and Foliations Michael Nagle March 15, 2005 In classifying minimal surfaces, we start by requiring them to be
More informationA Geometric Perspective on Data Analysis
A Geometric Perspective on Data Analysis Partha Niyogi The University of Chicago Collaborators: M. Belkin, X. He, A. Jansen, H. Narayanan, V. Sindhwani, S. Smale, S. Weinberger A Geometric Perspectiveon
More informationInvariant shape similarity. Invariant shape similarity. Invariant similarity. Equivalence. Equivalence. Equivalence. Equal SIMILARITY TRANSFORMATION
1 Invariant shape similarity Alexer & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book 2 Invariant shape similarity 048921 Advanced topics in vision Processing Analysis
More informationStable and Multiscale Topological Signatures
Stable and Multiscale Topological Signatures Mathieu Carrière, Steve Oudot, Maks Ovsjanikov Inria Saclay Geometrica April 21, 2015 1 / 31 Shape = point cloud in R d (d = 3) 2 / 31 Signature = mathematical
More informationIntroduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department
More informationPreprocessing II: Between Subjects John Ashburner
Preprocessing II: Between Subjects John Ashburner Pre-processing Overview Statistics or whatever fmri time-series Anatomical MRI Template Smoothed Estimate Spatial Norm Motion Correct Smooth Coregister
More informationStructured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov
Structured Light II Johannes Köhler Johannes.koehler@dfki.de Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Introduction Previous lecture: Structured Light I Active Scanning Camera/emitter
More informationIntrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts
Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts Frank R. Schmidt 1,EnoTöppe 1,DanielCremers 1,andYuriBoykov 2 1 Department of Computer Science University of Bonn Römerstr. 164, 53117 Bonn,
More information(Discrete) Differential Geometry
(Discrete) Differential Geometry Motivation Understand the structure of the surface Properties: smoothness, curviness, important directions How to modify the surface to change these properties What properties
More informationWESTFÄLISCHE WILHELMS-UNIVERSITÄT MÜNSTER
MÜNSTER Adaptive Discretization of Liftings for Curvature Regularization SIAM Conference on Imaging Science 2016, Albuquerque, NM Ulrich Hartleif, Prof. Dr. Benedikt Wirth May 23, 2016 Outline MÜNSTER
More informationContinuous and Discrete Optimization Methods in Computer Vision. Daniel Cremers Department of Computer Science University of Bonn
Continuous and Discrete Optimization Methods in Computer Vision Daniel Cremers Department of Computer Science University of Bonn Oxford, August 16 2007 Segmentation by Energy Minimization Given an image,
More informationLecture 0: Reivew of some basic material
Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms
More informationStatistical Shape Models Using Elastic-String Representations
Statistical Shape Models Using Elastic-String Representations Anuj Srivastava, Aastha Jain, Shantanu Joshi,andDavidKaziska Florida State University, Tallahassee, FL, USA Indian Institute of Technology,
More informationDivide and Conquer Kernel Ridge Regression
Divide and Conquer Kernel Ridge Regression Yuchen Zhang John Duchi Martin Wainwright University of California, Berkeley COLT 2013 Yuchen Zhang (UC Berkeley) Divide and Conquer KRR COLT 2013 1 / 15 Problem
More informationShape Modeling. Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell. CS 523: Computer Graphics, Spring 2011
CS 523: Computer Graphics, Spring 2011 Shape Modeling Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell 2/15/2011 1 Motivation Geometry processing: understand geometric characteristics,
More informationCAT(0)-spaces. Münster, June 22, 2004
CAT(0)-spaces Münster, June 22, 2004 CAT(0)-space is a term invented by Gromov. Also, called Hadamard space. Roughly, a space which is nonpositively curved and simply connected. C = Comparison or Cartan
More informationComputer Vision I. Dense Stereo Correspondences. Anita Sellent 1/15/16
Computer Vision I Dense Stereo Correspondences Anita Sellent Stereo Two Cameras Overlapping field of view Known transformation between cameras From disparity compute depth [ Bradski, Kaehler: Learning
More informationClassification: Feature Vectors
Classification: Feature Vectors Hello, Do you want free printr cartriges? Why pay more when you can get them ABSOLUTELY FREE! Just # free YOUR_NAME MISSPELLED FROM_FRIEND... : : : : 2 0 2 0 PIXEL 7,12
More informationFloer Homotopy of Lagrangian Submanifolds
Floer Homotopy of Lagrangian Submanifolds (revisiting Cohen-Jones-Segal after 25 years) Mohammed Abouzaid Partly describing joint work with - A. Blumberg and T. Kragh - A. Blumberg. July 18, 2017 Symplectic
More informationISSN: X International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE) Volume 6, Issue 8, August 2017
ENTROPY BASED CONSTRAINT METHOD FOR IMAGE SEGMENTATION USING ACTIVE CONTOUR MODEL M.Nirmala Department of ECE JNTUA college of engineering, Anantapuramu Andhra Pradesh,India Abstract: Over the past existing
More informationLearning Two-View Stereo Matching
Learning Two-View Stereo Matching Jianxiong Xiao Jingni Chen Dit-Yan Yeung Long Quan Department of Computer Science and Engineering The Hong Kong University of Science and Technology The 10th European
More informationMotivation. Parametric Curves (later Surfaces) Outline. Tangents, Normals, Binormals. Arclength. Advanced Computer Graphics (Fall 2010)
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 19: Basic Geometric Concepts and Rotations Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283/fa10 Motivation Moving from rendering to simulation,
More informationThe Level Set Method. Lecture Notes, MIT J / 2.097J / 6.339J Numerical Methods for Partial Differential Equations
The Level Set Method Lecture Notes, MIT 16.920J / 2.097J / 6.339J Numerical Methods for Partial Differential Equations Per-Olof Persson persson@mit.edu March 7, 2005 1 Evolving Curves and Surfaces Evolving
More informationMesh segmentation. Florent Lafarge Inria Sophia Antipolis - Mediterranee
Mesh segmentation Florent Lafarge Inria Sophia Antipolis - Mediterranee Outline What is mesh segmentation? M = {V,E,F} is a mesh S is either V, E or F (usually F) A Segmentation is a set of sub-meshes
More informationSome existence results for Chebyshev nets with singularities
Some existence results for Yannick Masson (Cermics, University Paris-Est) joint work with O. Baverel, A. Ern, L. Hauswirth, A. Lebée, L. Monasse 9th International Conference on Mathematical Methods for
More informationDon t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?
Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Is the converse true? What happens in the classical special case?
More information3D Computer Vision. Structured Light II. Prof. Didier Stricker. Kaiserlautern University.
3D Computer Vision Structured Light II Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de 1 Introduction
More informationSemi-automated Basal Ganglia Segmentation Using Large Deformation Diffeomorphic Metric Mapping
Semi-automated Basal Ganglia Segmentation Using Large Deformation Diffeomorphic Metric Mapping Ali Khan 1, Elizabeth Aylward 2, Patrick Barta 3, Michael Miller 4,andM.FaisalBeg 1 1 School of Engineering
More informationAlgebraic Topology: A brief introduction
Algebraic Topology: A brief introduction Harish Chintakunta This chapter is intended to serve as a brief, and far from comprehensive, introduction to Algebraic Topology to help the reading flow of this
More informationData Analysis 3. Support Vector Machines. Jan Platoš October 30, 2017
Data Analysis 3 Support Vector Machines Jan Platoš October 30, 2017 Department of Computer Science Faculty of Electrical Engineering and Computer Science VŠB - Technical University of Ostrava Table of
More informationLevel lines based disocclusion
Level lines based disocclusion Simon Masnou Jean-Michel Morel CEREMADE CMLA Université Paris-IX Dauphine Ecole Normale Supérieure de Cachan 75775 Paris Cedex 16, France 94235 Cachan Cedex, France Abstract
More informationDesigning Cylinders with Constant Negative Curvature
Designing Cylinders with Constant Negative Curvature Ulrich Pinkall Abstract. We describe algorithms that can be used to interactively construct ( design ) surfaces with constant negative curvature, in
More informationOutline. Level Set Methods. For Inverse Obstacle Problems 4. Introduction. Introduction. Martin Burger
For Inverse Obstacle Problems Martin Burger Outline Introduction Optimal Geometries Inverse Obstacle Problems & Shape Optimization Sensitivity Analysis based on Gradient Flows Numerical Methods University
More informationRobotics Programming Laboratory
Chair of Software Engineering Robotics Programming Laboratory Bertrand Meyer Jiwon Shin Lecture 8: Robot Perception Perception http://pascallin.ecs.soton.ac.uk/challenges/voc/databases.html#caltech car
More informationSubspace Clustering with Global Dimension Minimization And Application to Motion Segmentation
Subspace Clustering with Global Dimension Minimization And Application to Motion Segmentation Bryan Poling University of Minnesota Joint work with Gilad Lerman University of Minnesota The Problem of Subspace
More informationWWW links for Mathematics 138A notes
WWW links for Mathematics 138A notes General statements about the use of Internet resources appear in the document listed below. We shall give separate lists of links for each of the relevant files in
More informationComputing and Processing Correspondences with Functional Maps
Computing and Processing Correspondences with Functional Maps SIGGRAPH 2017 course Maks Ovsjanikov, Etienne Corman, Michael Bronstein, Emanuele Rodolà, Mirela Ben-Chen, Leonidas Guibas, Frederic Chazal,
More informationA Dendrogram. Bioinformatics (Lec 17)
A Dendrogram 3/15/05 1 Hierarchical Clustering [Johnson, SC, 1967] Given n points in R d, compute the distance between every pair of points While (not done) Pick closest pair of points s i and s j and
More informationBasis Functions. Volker Tresp Summer 2017
Basis Functions Volker Tresp Summer 2017 1 Nonlinear Mappings and Nonlinear Classifiers Regression: Linearity is often a good assumption when many inputs influence the output Some natural laws are (approximately)
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
More informationCSE 573: Artificial Intelligence Autumn 2010
CSE 573: Artificial Intelligence Autumn 2010 Lecture 16: Machine Learning Topics 12/7/2010 Luke Zettlemoyer Most slides over the course adapted from Dan Klein. 1 Announcements Syllabus revised Machine
More informationGeometric Registration for Deformable Shapes 2.2 Deformable Registration
Geometric Registration or Deormable Shapes 2.2 Deormable Registration Variational Model Deormable ICP Variational Model What is deormable shape matching? Example? What are the Correspondences? Eurographics
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationContents I IMAGE FORMATION 1
Contents I IMAGE FORMATION 1 1 Geometric Camera Models 3 1.1 Image Formation............................. 4 1.1.1 Pinhole Perspective....................... 4 1.1.2 Weak Perspective.........................
More informationIntrinsic Dimensionality Estimation for Data Sets
Intrinsic Dimensionality Estimation for Data Sets Yoon-Mo Jung, Jason Lee, Anna V. Little, Mauro Maggioni Department of Mathematics, Duke University Lorenzo Rosasco Center for Biological and Computational
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 FDH 204 Lecture 10 130221 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Canny Edge Detector Hough Transform Feature-Based
More informationNon-Bayesian Classifiers Part I: k-nearest Neighbor Classifier and Distance Functions
Non-Bayesian Classifiers Part I: k-nearest Neighbor Classifier and Distance Functions Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Fall 2017 CS 551,
More informationDigital Geometry Processing
Digital Geometry Processing Spring 2011 physical model acquired point cloud reconstructed model 2 Digital Michelangelo Project Range Scanning Systems Passive: Stereo Matching Find and match features in
More informationCHAPTER 1 Introduction 1. CHAPTER 2 Images, Sampling and Frequency Domain Processing 37
Extended Contents List Preface... xi About the authors... xvii CHAPTER 1 Introduction 1 1.1 Overview... 1 1.2 Human and Computer Vision... 2 1.3 The Human Vision System... 4 1.3.1 The Eye... 5 1.3.2 The
More informationA Random Variable Shape Parameter Strategy for Radial Basis Function Approximation Methods
A Random Variable Shape Parameter Strategy for Radial Basis Function Approximation Methods Scott A. Sarra, Derek Sturgill Marshall University, Department of Mathematics, One John Marshall Drive, Huntington
More informationImplicit Active Shape Models for 3D Segmentation in MR Imaging
Implicit Active Shape Models for 3D Segmentation in MR Imaging Mikaël Rousson 1, Nikos Paragios 2, and Rachid Deriche 1 1 I.N.R.I.A. Sophia Antipolis, France E-mail: {Mikael.Rousson,Rachid.Deriche}@sophia.inria.fr
More information1 Discrete Connections
CS 177: Discrete Differential Geometry Homework 4: Vector Field Design (due: Tuesday Nov 30th, 11:59pm) In the last homework you saw how to decompose an existing vector field using DEC. In this homework
More informationLast update: May 4, Vision. CMSC 421: Chapter 24. CMSC 421: Chapter 24 1
Last update: May 4, 200 Vision CMSC 42: Chapter 24 CMSC 42: Chapter 24 Outline Perception generally Image formation Early vision 2D D Object recognition CMSC 42: Chapter 24 2 Perception generally Stimulus
More informationLOCAL-GLOBAL OPTICAL FLOW FOR IMAGE REGISTRATION
LOCAL-GLOBAL OPTICAL FLOW FOR IMAGE REGISTRATION Ammar Zayouna Richard Comley Daming Shi Middlesex University School of Engineering and Information Sciences Middlesex University, London NW4 4BT, UK A.Zayouna@mdx.ac.uk
More informationA Novel Method for Enhanced Needle Localization Using Ultrasound-Guidance
A Novel Method for Enhanced Needle Localization Using Ultrasound-Guidance Bin Dong 1,EricSavitsky 2, and Stanley Osher 3 1 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive,
More information04 - Normal Estimation, Curves
04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0
More informationIntroduction to Immersion, Embedding, and the Whitney Embedding Theorems
Introduction to Immersion, Embedding, and the Whitney Embedding Theorems Paul Rapoport November 23, 2015 Abstract We give an overview of immersion in order to present the idea of embedding, then discuss
More information