2012/4/11 Olga Sorkine Tel Aviv University Daniel Cohen-Or Tel Aviv University presented by sunwei.

Slides:



Advertisements
Similar presentations
Example 1 Matrix Solution of Linear Systems Chapter 7.2 Use matrix row operations to solve the system of equations  2009 PBLPathways.
Advertisements

Olga Sorkine and Daniel Cohen-Or Tel-Aviv University Warped textures for UV mapping encoding.
Least-squares Meshes Olga Sorkine and Daniel Cohen-Or Tel-Aviv University SMI 2004.
EXAMPLE 3 Use Cramer’s rule for a 2 X 2 system
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
High-Pass Quantization for Mesh Encoding Olga Sorkine, Daniel Cohen-Or, Sivan Toledo Eurographics Symposium on Geometry Processing, Aachen 2003.
Shape-from-X Class 11 Some slides from Shree Nayar. others.
Slides by Olga Sorkine, Tel Aviv University. 2 The plan today Singular Value Decomposition  Basic intuition  Formal definition  Applications.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
A Sketch-Based Interface for Detail-Preserving Mesh Editing Andrew Nealen Olga Sorkine Marc Alexa Daniel Cohen-Or.
Latent Semantic Indexing via a Semi-discrete Matrix Decomposition.
FiberMesh: Designing Freeform Surfaces with 3D Curves
Andrew Nealen, TU Berlin, CG 11 Andrew Nealen TU Berlin Takeo Igarashi The University of Tokyo / PRESTO JST Olga Sorkine Marc Alexa TU Berlin Laplacian.
Given Connections Solution
Planar X-ray Imaging Measure the integeral of the linear attenuation coefficient over the beam path through the object. has two main contributions 1.Photoelectric.
Normal Estimation in Point Clouds 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine.
3.5 Solving systems of equations in 3 variables
Laplacian Surface Editing
Geo479/579: Geostatistics Ch13. Block Kriging. Block Estimate  Requirements An estimate of the average value of a variable within a prescribed local.
Solving Linear Systems by Linear Combinations
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
Solving Linear Systems using Linear Combinations (Addition Method) Goal: To solve a system of linear equations using linear combinations.
Context-based Surface Completion Andrei Sharf, Marc Alexa, Daniel Cohen-Or.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Shortest Path Problem Weight of the graph –Nonnegative real number assigned to the edges connecting to vertices Weighted graphs –When a graph.
AN ORTHOGONAL PROJECTION
Projecting points onto a point cloud with noise Speaker: Jun Chen Mar 26, 2008.
Goal: Solve a system of linear equations in two variables by the linear combination method.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Mind Map vs. Mind Table -Student Choice -Same Expectations, Same Topics, Different Format for Different Learners.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Elimination Method: Solve the linear system. -8x + 3y=12 8x - 9y=12.
 3.5 More on Linear Equations Objective: solve more complicated equations that have variables on both sides.
2.1 – Linear and Quadratic Equations Linear Equations.
Rounding to the nearest 10,100,1000. Large numbers are often approximated to the nearest 10,100,1000 etc.
WARM-UP 1.Is the ordered pair (-6,-5) a solution to the inequality 2x -4y < 8? 2. Solve the linear inequalities: a.y > (3/5) x – 3 b.4x – 2y > -3.
WARM UP GRAPHING LINES Write the equation in slope- intercept form and then Graph. (Lesson 4.7) 1.3x + y = 1 2.x + y = 0 3.y = -4 3.
1.7 Linear Independence. in R n is said to be linearly independent if has only the trivial solution. in R n is said to be linearly dependent if there.
SOLVING SYSTEMS USING ELIMINATION 6-3. Solve the linear system using elimination. 5x – 6y = -32 3x + 6y = 48 (2, 7)
Y=3x+1 y 5x + 2 =13 Solution: (, ) Solve: Do you have an equation already solved for y or x?
Motivation 2 groups of tools for free-from design Images credits go out to the FiberMesh SIGGRAPH presentation and other sources courtesy of Google.
5 minutes Warm-Up Solve. 2) 1).
System of Equations Solve by Substitution. A System of Equations:  Consists of two linear equations  We want to find out information about the two lines:
Lesson 4-2: Solving Systems – Substitution & Linear Combinations Objectives: Students will: Solve systems of equations using substitution and linear combinations.
Algebra Review. Systems of Equations Review: Substitution Linear Combination 2 Methods to Solve:
CHAPTER THREE: SYSTEMS OF LINEAR EQUATIONS AND INEQUALITIES ALGEBRA TWO Section Solving Systems of Linear Equations in Three Variables.
Differential Coordinates and Laplacians Nicholas Vining Technical Director, Gaslamp Games.
Elimination Method - Systems. Elimination Method  With the elimination method, you create like terms that add to zero.
1 1.3 © 2016 Pearson Education, Ltd. Linear Equations in Linear Algebra VECTOR EQUATIONS.
Chapter 7 Systems of Linear Equations and Inequalities 7.1 Thursday 12/6 7.2 Friday12/7-Monday12/ Tuesday12/11-Wed12/ Thursday12/13-Friday12/14.
Systems of Equations Draw 2 lines on a piece of paper. There are three possible outcomes.
Substitution Method: Solve the linear system. Y = 3x + 2 Equation 1 x + 2y=11 Equation 2.
MAN-522 Computer Vision Spring
Polynomial and Rational Functions
Solving Linear Systems by Linear Combinations
6-2 Solving Systems using Substitution
Geometry Unit 12 Equation of a Line.
Solve System by Linear Combination / Addition Method
3.5 Solving systems of equations in 3 variables
Solving Linear Systems by Linear Combinations (Elimination)
Systems of Equations Solve by Graphing.
Software Architecture Analysis Method
Solve the linear system.
Example 2B: Solving Linear Systems by Elimination
15.3--RECTANGLE AND COOORDINATE GEOMETRY.
Unit 7: Systems of Equations
Solving a System of Linear Equations
Filtering Removing components from an image is know as “image filtering”. If we remove the high frequency components, we tend to remove the noise. This.
Notes Over 6.1 Graphing a Linear Inequality Graph the inequality.
Practice Geometry Practice
Presentation transcript:

2012/4/11 Olga Sorkine Tel Aviv University Daniel Cohen-Or Tel Aviv University presented by sunwei

1. Problem description 2. Solution of this paper 3. Solution details

Fill the hole

Tele-registration How to fill the gap between them ??

Solution of this paper Control pointsReconstructed model

1. Select control points and analyse the constrains 2. Solve the linear least-square system 3. Fill out the hole

Analyse the constrains a. Random selection b. One-by-one greedy selection c. Combined local maxima method Control points 1. Select control points 2. Analyse the constrains a. Connected parts should be as smooth as possible b. Newly reconstructed control points should be as much close as original ones

Solve the linear matrix Constrain aConstrain b

R: points of Removed geometry C: Control points X: R x +C x X s : C x V s : Original Control points “[ C ]”.Points that we are going to approximate on part R and C.Points that we are going to approximate on “part C” X=R + C R C

Pay attention to these two point 1.Connectivity of the reconstruct part should be given 2. Part C will also be reconstructed, not just Part R

W: weight of the control points constrains Xs is getting closer to Vs W tends to infinity Xs = Vs

Solution result Figure out Matrix X Fill out the hole on the hump Fill out the gap

Have you understood?