1/20 Using M-Reps to include a-priori Shape Knowledge into the Mumford-Shah Segmentation Functional FWF - Forschungsschwerpunkt S092 Subproject 7 „Pattern.

Slides:



Advertisements
Similar presentations
COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.
Advertisements

Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
Surface Reconstruction From Unorganized Point Sets
Surface normals and principal component analysis (PCA)
Geometric Modeling Notes on Curve and Surface Continuity Parts of Mortenson, Farin, Angel, Hill and others.
Extended Gaussian Images
PCA + SVD.
Discrete Geometry Tutorial 2 1
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Wangfei Ningbo University A Brief Introduction to Active Appearance Models.
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Shock Graphs and Shape Matching Kaleem Siddiqi, Ali Shokoufandeh, Sven Dickinson and Steven Zucker.
Image Segmentation and Active Contour
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
“Random Projections on Smooth Manifolds” -A short summary
Regionalized Variables take on values according to spatial location. Given: Where: A “structural” coarse scale forcing or trend A random” Local spatial.
Manifold Learning: ISOMAP Alan O'Connor April 29, 2008.
The Terms that You Have to Know! Basis, Linear independent, Orthogonal Column space, Row space, Rank Linear combination Linear transformation Inner product.
Subdivision Primer CS426, 2000 Robert Osada [DeRose 2000]
Unsupervised Learning
Non-Euclidean Embedding
Fat Curves and Representation of Planar Figures L.M. Mestetskii Department of Information Technologies, Tver’ State University, Tver, Russia Computers.
A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.
Atul Singh Junior Undergraduate CSE, IIT Kanpur.  Dimension reduction is a technique which is used to represent a high dimensional data in a more compact.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
NonLinear Dimensionality Reduction or Unfolding Manifolds Tennenbaum|Silva|Langford [Isomap] Roweis|Saul [Locally Linear Embedding] Presented by Vikas.
Normal Estimation in Point Clouds 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine.
SVD(Singular Value Decomposition) and Its Applications
Junjun Pan 1, Xiaosong Yang 1, Xin Xie 1, Philip Willis 2, Jian J Zhang 1
National Center for Supercomputing Applications University of Illinois at Urbana-Champaign Image Features Kenton McHenry, Ph.D. Research Scientist.
Summarized by Soo-Jin Kim
Linear Least Squares Approximation. 2 Definition (point set case) Given a point set x 1, x 2, …, x n  R d, linear least squares fitting amounts to find.
C O M P U T E R G R A P H I C S Stuff Jian Chen January 15, 2010 Transformations 1/10 Describing Shape By Andries van Dam.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Part 6: Graphics Output Primitives (4) 1.  Another useful construct,besides points, straight line segments, and curves for describing components of a.
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
1 Recognition by Appearance Appearance-based recognition is a competing paradigm to features and alignment. No features are extracted! Images are represented.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
A Challenging Example Male Pelvis –Bladder – Prostate – Rectum.
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
Computer Vision Lab. SNU Young Ki Baik Nonlinear Dimensionality Reduction Approach (ISOMAP, LLE)
Extended Grassfire Transform on Medial Axes of 2D Shapes
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2013.
CSE 185 Introduction to Computer Vision Face Recognition.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Object Orie’d Data Analysis, Last Time SiZer Analysis –Zooming version, -- Dependent version –Mass flux data, -- Cell cycle data Image Analysis –1 st Generation.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
Common Property of Shape Data Objects: Natural Feature Space is Curved I.e. a Manifold (from Differential Geometry) Shapes As Data Objects.
Information Geometry and Model Reduction Sorin Mitran 1 1 Department of Mathematics, University of North Carolina, Chapel Hill, NC, USA Reconstruction.
In the name of God Computer Graphics Bastanfard. Curve Function(2) Other method is approximate it using a poly-line. Just locate a set of points along.
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
1 UNC, Stat & OR Hailuoto Workshop Object Oriented Data Analysis, I J. S. Marron Dept. of Statistics and Operations Research, University of North Carolina.
Image Features (I) Dr. Chang Shu COMP 4900C Winter 2008.
Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng
Face detection and recognition Many slides adapted from K. Grauman and D. Lowe.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
3D Ojbects: Transformations and Modeling. Matrix Operations Matrices have dimensions: Vectors can be thought of as matrices: v=[2,3,4,1] is a 1x4 matrix.
Manifold Valued Statistics, Exact Principal Geodesic Analysis and the Effect of Linear Approximations ECCV 2010 Stefan Sommer 1, François Lauze 1, Søren.
Curve & Surface.
Chapter 12 Math 181.
3D Object Representations
Outline H. Murase, and S. K. Nayar, “Visual learning and recognition of 3-D objects from appearance,” International Journal of Computer Vision, vol. 14,
Mesh Parameterization: Theory and Practice
Linear Algebra Lecture 40.
CS4670: Intro to Computer Vision
NonLinear Dimensionality Reduction or Unfolding Manifolds
Spline representation. ❖ A spline is a flexible strip used to produce a smooth curve through a designated set of points. ❖ Mathematically describe such.
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

1/20 Using M-Reps to include a-priori Shape Knowledge into the Mumford-Shah Segmentation Functional FWF - Forschungsschwerpunkt S092 Subproject 7 „Pattern and 3D Shape Recognition“ Grossauer Harald

2/20 Outlook Mumford-Shah Mumford-Shah with a-priori knowledge Medial axis and m-reps Statistical analysis of shapes

3/20 Original Mumford-Shah functional: For minimizers (u,C) : –u … piecewise constant approximation of f –C … curve along which discontinuities of u are located Mumford-Shah

4/20

5/20 Replace by d(S ap,S) S ap represents the expected shape (prior) d(S ap,∙) somehow measures the distance to the prior Mumford-Shah with a-priori knowledge How is „somehow“?

6/20 Curve representation Curves (resp. surfaces) are frequently represented as –Triangle mesh (easy to render) –Set of spline control points (smoother) –CSG, … Problems: –Local boundary description –No global shape properties

7/20 Blum‘s Medial Axis (in 2D) Medial axis for a given „shape“ S : Set of centers of all circles that can be inscribed into S, which touch S at two or more points Medial axis + radius function → Medial axis representation (m-reps)

8/20 Information derived from the m-rep (1) Connection graph: –Hierarchy of figure(s) –Main figure, protrusion, intrusion –Topology of surface –Connection and substance edges

9/20 Let be a parametrization of, then – is the „principal direction“ of S – describes the „bending“ of S – is the local „thinning“ or „thickening“ of S –Branchings of may indicate singular surface points (edges, corners) Information derived from the m-rep (2)

10/20 Problem of m-reps Stability: We never infer the medial axis from the boundary surface!

11/20 Discrete representation (in 3D) Approximate medial manifold by a mesh Store radius in each mesh node → Bad approximation of surface → Store more information per node: Medial Atoms

12/20 Medial Atoms (in 3D) Stored per node: Position and radius Local coordinate frame Opening angle Elongation (for „boundary atoms“ only)

13/20 Shape description by medial atoms One medial atom: Shape consisting of N medial Atoms: + connection graph

14/20 A distance between shapes? Current main problem: What is a suitable distance Or maybe even consider

15/20 Statistical analysis of shapes Goal: Principal Component Analysis (PCA) of a set of shapes Zero‘th principal component = mean value Problem: is not a vector space

16/20 Statistical analysis of shapes Variational formulation of mean value: No vector space structure needed, but not necessarily unique → All S i must be in a „small enough neighborhood“

17/20 How to carry over these concepts from the vector space to the manifold ? PCA in For data the k ‘th principal component is defined inductively by: – is orthogonal to – is orthogonal to the subspace, where: has codimension k the variance of the data projected onto is maximal

18/20 Principal Geodesic Analysis Vector spaceManifold Linear subspaceGeodesic submanifold Projection onto subspace Closest point on submanifold Problem again: not necessarily unique

19/20 Principal Geodesic Analysis Second main problem(s): –Under what conditions is PGA meaningful? –How to deal with the non-uniqueness? –Does PGA capture shape variability well enough? –How to compute PGA efficiently?

20/20 The End Comments? Ideas? Questions? Suggestions?