Texture Mapping using Surface Flattening via Multi-Dimensional Scaling G.Zigelman, R.Kimmel, N.Kiryati IEEE Transactions on Visualization and Computer.

Slides:

Advertisements

Similar presentations

Coherent Laplacian 3D protrusion segmentation Oxford Brookes Vision Group Queen Mary, University of London, 11/12/2009 Fabio Cuzzolin.

Advertisements

1 Registration of 3D Faces Leow Wee Kheng CS6101 AY Semester 1.

Self-Organizing Maps Projection of p dimensional observations to a two (or one) dimensional grid space Constraint version of K-means clustering –Prototypes.

DIMENSIONALITY REDUCTION Computer Graphics CourseJune 2013.

R Lecture 4 Naomi Altman Department of Statistics Department of Statistics (Based on notes by J. Lee)

VOXEL-BASED SURFACE FLATTENING Nahum Kiryati* Dept. of Electrical Engineering – Systems Tel Aviv University * Joint work with Ruth Grossmann and Ron Kimmel.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Manifold Learning Dimensionality Reduction. Outline Introduction Dim. Reduction Manifold Isomap Overall procedure Approximating geodesic dist. Dijkstra’s.

Presented by: Mingyuan Zhou Duke University, ECE April 3, 2009

Multimedia DBs. Multimedia dbs A multimedia database stores text, strings and images Similarity queries (content based retrieval) Given an image find.

3D Surface Parameterization Olga Sorkine, May 2005.

Non-linear Dimensionality Reduction CMPUT 466/551 Nilanjan Ray Prepared on materials from the book Non-linear dimensionality reduction By Lee and Verleysen,

6/26/2006CGI'06, Hangzhou China1 Sub-sampling for Efficient Spectral Mesh Processing Rong Liu, Varun Jain and Hao Zhang GrUVi lab, Simon Fraser University,

Robust 3D Shape Correspondence in the Spectral Domain

ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.

Asst. Prof. Yusuf Sahillioğlu

Iso-charts: Stretch-driven Mesh Parameterization using Spectral Analysis Kun Zhou, John Snyder*, Baining Guo, Heung-Yeung Shum Microsoft Research Asia.

Localization from Mere Connectivity Yi Shang (University of Missouri - Columbia); Wheeler Ruml (Palo Alto Research Center ); Ying Zhang; Markus Fromherz.

Dimensionality Reduction

Correspondence & Symmetry

1 Visualizing the Legislature Howard University - Systems and Computer Science October 29, 2010 Mugizi Robert Rwebangira.

1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.

1 Data Analysis  Data Matrix Variables ObjectsX1X1 X2X2 X3X3 …XPXP n.

Numerical geometry of non-rigid shapes

SVD and PCA COS 323. Dimensionality Reduction Map points in high-dimensional space to lower number of dimensionsMap points in high-dimensional space to.

Introduction Given a Matrix of distances D, (which contains zeros in the main diagonal and is squared and symmetric), find variables which could be able,

Quantization If too few levels of gray, (e.g. decrease halftone spot size to increase spatial resolution), then boundaries between adjacent gray levels.

Flattening via Multi- Dimensional Scaling Ron Kimmel Computer Science Department Geometric Image Processing Lab Technion-Israel.

A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.

1 Bronstein 2 & Kimmel An isometric model for facial animation and beyond AMDO, Puerto de Andratx, 2006 An isometric model for facial animation and beyond.

Iso-charts: Stretch-Driven Parameterization via Nonlinear Dimension Reduction Kun Zhou, John Snyder, Baining Guo, Harry Shum presented at SGP, June 2004.

Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 11: Quadric Error Metrics Ravi Ramamoorthi Some material.

Shape Classification Using the Inner-Distance Haibin Ling David W. Jacobs IEEE TRANSACTION ON PATTERN ANAYSIS AND MACHINE INTELLIGENCE FEBRUARY 2007.

Dimensionality Reduction. Multimedia DBs Many multimedia applications require efficient indexing in high-dimensions (time-series, images and videos, etc)

Clustering Vertices of 3D Animated Meshes

Nonlinear Dimensionality Reduction Approaches. Dimensionality Reduction The goal: The meaningful low-dimensional structures hidden in their high-dimensional.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.

Expression-invariant Face Recognition using Geodesic Distance Isometries Kerry Widder A Review of ‘Robust expression-invariant face recognition from partially.

Computer graphics & visualization. IntuitiveVersatileFast.

Analysis Using R R>voles_mds

Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.

ISOMAP TRACKING WITH PARTICLE FILTER Presented by Nikhil Rane.

Paired Sampling in Density-Sensitive Active Learning Pinar Donmez joint work with Jaime G. Carbonell Language Technologies Institute School of Computer.

Spectral Compression of Mesh Geometry (Karni and Gotsman 2000) Presenter: Eric Lorimer.

Manifold learning: MDS and Isomap

Nonlinear Dimensionality Reduction Approach (ISOMAP)

Non-Linear Dimensionality Reduction

Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.

Data Projections & Visualization Rajmonda Caceres MIT Lincoln Laboratory.

Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 9 Ravi Ramamoorthi

CENG 789 – Digital Geometry Processing 04- Distances, Descriptors and Sampling on Meshes Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.

CYBERINFRASTRUCTURE FOR THE GEOSCIENCES Hierarchies of visualization needs in earth science with particular applications to surface process.

Methods for 3D Shape Matching and Retrieval

Math 285 Project Diffusion Maps Xiaoyan Chong Department of Mathematics and Statistics San Jose State University.

MAP SCALE. A map shows features of the earth’s surface. To be accurate, all distances related to these features must be true to reality. However, to be.

실감나조 (Team SilGamNa) 컴퓨터학과 05 김현식 컴퓨터학과 05 홍종찬 고려대학교 2011 년 1 학기 Computer Graphics.

Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng

Geometric diffusions as a tool for harmonic analysis and structure definition of data By R. R. Coifman et al. The second-round discussion* on * The first-round.

Out of sample extension of PCA, Kernel PCA, and MDS WILSON A. FLORERO-SALINAS DAN LI MATH 285, FALL

Multi-View Discriminant Analysis 多视判别分析

Prn Auto Erik Mesh Carrie Mesh Erik Texture Carrie Texture 2.40mm0.88mm 1.08mm 1.18mm 2.39mm 0.97mm 1.07mm 2.55mm 2.35mm 2.62mm 2.16mm.

Spectral Methods for Dimensionality

Spectral Methods Tutorial 6 1 © Maks Ovsjanikov

SDE: Graph Drawing Using Spectral Distance Embedding

Physics-based simulation for visual computing applications

SVD, PCA, AND THE NFL By: Andrew Zachary.

A first-round discussion* on

05 Geodesics on Meshes jjcao Based on the idea of Professor Ligang Liu.

Presentation transcript:

Texture Mapping using Surface Flattening via Multi-Dimensional Scaling G.Zigelman, R.Kimmel, N.Kiryati IEEE Transactions on Visualization and Computer Graphics 2002

2 Multidimensional scaling (MDS) The idea: compute the pairwise geodesic distances between the vertices of the mesh: Now, find n points in R 2, so that their distance matrix is as close as possible to M. q1q1 q2q2

3 MDS – the math details We look for X’, such that || M’ – M || is as small as possible, where M’ is the Euclidean distances matrix for points x i ’.

4 MDS – the math details Ideally, we want: want to get rid of these

5 MDS – the math details Trick: use the “magic matrix” J :

6 MDS – the math details Cleaning the system:

7 How to find X’ We will use the spectral decomposition of B :

8 How to find X’ So we find X’ by throwing away the last n  d eigenvalues

9 Flattening results (Zigelman et al.)

10 Flattening results (Zigelman et al.)

11 Flattening results (Zigelman et al.)

The end