Accurate Reconstruction by Interpolation
|
|
- Melissa Todd
- 5 years ago
- Views:
Transcription
1 Accurate Reconstruction by Interpolation Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore International Conference on Inverse Problems and Related Topics 14 Aug 2018 Leow Wee Kheng (NUS) Reconstruction by Interpolation 1 / 35
2 Motivation Motivation Reconstruction of 3D models and images is important and challenging. Craniofacial Surgery: How does his normal skull look like? How to reconstruct the normal skull model? Leow Wee Kheng (NUS) Reconstruction by Interpolation 2 / 35
3 Motivation Face Recognition: Who is she? How does she look like? How to recover the unoccluded face image? Leow Wee Kheng (NUS) Reconstruction by Interpolation 3 / 35
4 Motivation General Idea: Find a model that fits the input data as best as possible. A convenient definition of best is least error, e.g., Given input data v(p), for points p in a selected non-defective part S, find a model f(p) that minimizes the sum-sqaured error E: E = p S(f(p) v(p)) 2. (1) Then, the fitted model is the reconstruction result. target p f v skull model surface point reconstructed position input position face image image point reconstructed colour input colour Leow Wee Kheng (NUS) Reconstruction by Interpolation 4 / 35
5 Motivation Conventional wisdom: Least-error result is the optimal result. Or is it? Least-error result (Eq. 1) is actually an approximation of input data: there are non-zero errors even for reconstruction of non-defective parts. Surface type Error Over-fitting very complex very small very large complex small large. simple large small very simple. very large very small plane very large none. Leow Wee Kheng (NUS) Reconstruction by Interpolation 5 / 35
6 Motivation For some application problems, fitting to data needs to tbe perfect, if possible. skull reconstruction aircraft body manufacturing Leow Wee Kheng (NUS) Reconstruction by Interpolation 6 / 35
7 Interpolation Interpolation Approximation Problem Given input data v(p), for points p in a selected non-defective part S, find a model f(p) that minimizes the sum-sqaured error E: E = p S(f(p) v(p)) 2. Interpolation Problem Given input data v(p), for points p in a selected non-defective part S, find a model f(p) such that f(p) = v(p), for all p S. Leow Wee Kheng (NUS) Reconstruction by Interpolation 7 / 35
8 Interpolation Approximation Interpolation q i q i p i p i Minimizes error to the points. Non-zero error. Easier problem to solve. Passes through the points exactly. Zero error. Harder problem to solve. Leow Wee Kheng (NUS) Reconstruction by Interpolation 8 / 35
9 Interpolation Example: Consider n+1 points p i = (x i,y i ), i = 0,1,...,n on a curve. Let s fit the points with a polynomial of degree (order) d: y i = a 0 +a 1 x i +a 2 x 2 i + +a d x d i, for i = 0,1,...,n. (2) In matrix form, 1 x 0 x 2 0 x d 0 1 x 1 x 2 1 x d x n x 2 n x d n a 0 a 1. a d = y 0 y 1. y n (3) If d > n, no unique solution. If d = n, matrix has inverse: interpolating solution. If d < n, matrix has pseudo-inverse: approximating solution. Leow Wee Kheng (NUS) Reconstruction by Interpolation 9 / 35
10 Interpolation Interpolation vs. Approximation y x control points (n = 6) degree n interpolation degree n-1 approximation degree n-3 approximation Leow Wee Kheng (NUS) Reconstruction by Interpolation 10 / 35
11 Surface Interpolation Surface Interpolation Surface interpolation methods: General spline surface Thin plate spline Laplacian deformation Leow Wee Kheng (NUS) Reconstruction by Interpolation 11 / 35
12 Surface Interpolation Thin Plate Spline Thin Plate Spline Thin plate spline (TPS) warping [Bookstein89] Analogous to bending of a thin metal sheet. Impose smoothness by minimizing bending energy. q i p i TPS maps points p i = [x i1 x id ] on reference surface to desired positions q i = [v i1 v id ] exactly. Leow Wee Kheng (NUS) Reconstruction by Interpolation 12 / 35
13 Surface Interpolation Thin Plate Spline The function f that minimizes bending energy takes the form [Bookstein89] f( x) = a x+ n w i U( x p i ). (4) i=1 U(r) is increasing function of distance r, e.g., U(r) = r 2 logr. 1st term is affine (linear) transformation. 2nd term is nonlinear warping. Consider j-th dimension of v ij, dropping j for notational convenience. For interpolation, want to find a and w such that, for each p i, v i = f( p i ) = a p n i + w j U( p i p j ). (5) j=1 Leow Wee Kheng (NUS) Reconstruction by Interpolation 13 / 35
14 Surface Interpolation Thin Plate Spline Eq. 5 can be written in matrix form [ ][ K P w P 0 a ] [ v = 0 ]. (6) For points in general position, P has independent columns. Then, [ ] [ ] 1 [ ] w K P v = a P. (7) 0 0 It is possible to solve for all dimensions at the same time: Pack w j, a j and v j for all dimensions j = 1,...,d together: and apply Eq. 7. w = [w 1 w d ], a = [a 1 a d ], v = [v 1 v d ]. (8) Leow Wee Kheng (NUS) Reconstruction by Interpolation 14 / 35
15 Surface Interpolation Laplacian Deformation Laplacian Deformation Laplacian Deformation [Sorkine2004, Masuda2006] Preserve shape: local surface curvature and surface normal. d i p i Laplacian deformation maps points p i on reference surface to desired positions d i exactly. Leow Wee Kheng (NUS) Reconstruction by Interpolation 15 / 35
16 Surface Interpolation Laplacian Deformation Laplacian operator estimates surface curvature and normal at vertex i: L(p i ) = p i 1 N i j N i p j. (9) Shape is preserved by minimizing the difference of Laplacian operators L(p 0 i ) before and L(p i) after shape deformation: L(p i ) L(p 0 i) 2, (10) This difference is organized into a matrix form for all mesh vertices: Ax b 2. (11) The positional constraints are organised into a matrix form Cx = d (12) Then, Laplacian deformation solves the problem: minimize Ax b 2 subject to Cx = d. (13) Leow Wee Kheng (NUS) Reconstruction by Interpolation 16 / 35
17 Surface Interpolation Laplacian Deformation Applying QR factorization, C can be decomposed as C = [ Q 1 Q 2 ] R = [ I3m 0 0 I 3(n m) ][ I3m 0 ]. (14) Organize A as A = [ A 1 A 2 ], (15) where A 1 is a 3n 3m matrix and A 2 is a 3n 3(n m) matrix. Then, the soluion of x is given by [ ] d x = Q 1 d+q 2 v =. (16) v where v = (A 2 A 2 ) 1 A 2 (b A 1 d) (17) Leow Wee Kheng (NUS) Reconstruction by Interpolation 17 / 35
18 Surface Interpolation Laplacian Deformation Comparions TPS Laplacian Deformation approach miminize energy preserve shape shape constraints hard to impose easy to impose positional constraints given in v given in d determines K no need to compute d more constraints larger K larger d larger matrix smaller matrix longer run time shorter run time Leow Wee Kheng (NUS) Reconstruction by Interpolation 18 / 35
19 Skull Reconstruction Skull Reconstruction When positional constraints conflit, interpoating methods produce flipped surfaces. conflicts Laplacian TPS Approximating methods don t adhere to positional constraints strictly; do not produce flipped surfaces but have non-zero errors. Leow Wee Kheng (NUS) Reconstruction by Interpolation 19 / 35
20 Flip Avoidance Skull Reconstruction Flip Avoidance Consider two points p and q on a mesh surface, whose corresponding target positions are p and q. Correspondence vectors v(p) = (p,p ), v(q) = (q,q ). If v(p) and v(q) don t cross, then no surface flipping. When v(p) and v(q) meet at a point, they form a triangle. Then, v(p) cosθ(p;q)+ v(q) cosθ(q;p) = p q. (18) Leow Wee Kheng (NUS) Reconstruction by Interpolation 20 / 35
21 Skull Reconstruction Flip Avoidance Let D denote upper bound: v(p) D, p. Then, v(p) and v(q) will not cross if This condition can be simplified as cosθ(p;q)+cosθ(q;p) < p q D. (19) cosθ(p;q) < p q q p, cosθ(q;p) < 2D 2D. (20) The simplest case is p q > 2D. Leow Wee Kheng (NUS) Reconstruction by Interpolation 21 / 35
22 Skull Reconstruction Flip Avoidance Let C denote the set of corresponding vectors. Simple No-Crossing Condition There is no crossing if, for all pairs (p,p ) and (q,q ) in C, p q > 2D. General No-Crossing Condition There is no crossing if, for each (p,p ) C, cosθ(p;q) < p q 2D, q N(p) = {q p q 2D} and (q,q ) C. Leow Wee Kheng (NUS) Reconstruction by Interpolation 22 / 35
23 Skull Reconstruction Flip Avoidance Use manually marked landmarks to ensure anatomical correctness. reference model target model Leow Wee Kheng (NUS) Reconstruction by Interpolation 23 / 35
24 Skull Reconstruction Flip Avoidance FAIS: Flip-Avoiding Interpolating Surface Input: Reference F, target T, manually marked correspondence C. Output: Reconstructed model R. Rigidly register F to T using manually marked correspondence C. Non-rigidly register F to T using C, then set R as registered F. for k from 1 to K do Find C, nearby corresponding points with similar surface normals. Apply simple no-crossing condition to choose a sparse subset C + from C C. Non-rigidly register R to T with C +. Find C, nearest corresponding points within range. Apply general no-crossing condition to choose a dense subset C + from C C. Non-rigidly register R to T with C +. Leow Wee Kheng (NUS) Reconstruction by Interpolation 24 / 35
25 Skull Reconstruction Test Results Test Results Test on non-defective targets. Laplacian deformation yields more corresponding points than TPS. Laplacian deformation runs faster with more corresponding points. At last step, not enough memory space to run TPS. Leow Wee Kheng (NUS) Reconstruction by Interpolation 25 / 35
26 Skull Reconstruction Test Results Test on non-defective targets. FAIS has very small error on non-defective parts. FAIS-0 slightly larger error on non-defective parts. Other methods errors are about 10 times larger. Leow Wee Kheng (NUS) Reconstruction by Interpolation 26 / 35
27 Skull Reconstruction Test Results Test on non-defective targets. FAIS has smallest error on defective parts. FAIS-0 slightly larger error on defective parts. Other methods errors are more 3 times larger. Leow Wee Kheng (NUS) Reconstruction by Interpolation 27 / 35
28 Skull Reconstruction Test Results Test on synthetic defective targets. Leow Wee Kheng (NUS) Reconstruction by Interpolation 28 / 35
29 Skull Reconstruction Test Results Comparison of FAIS and ASM results. Target FAIS ASM Leow Wee Kheng (NUS) Reconstruction by Interpolation 29 / 35
30 Skull Reconstruction Test Results Test on real defective targets. Leow Wee Kheng (NUS) Reconstruction by Interpolation 30 / 35
31 Skull Reconstruction Test Results Reconstructino is robust to x-ray metal artifacts Leow Wee Kheng (NUS) Reconstruction by Interpolation 31 / 35
32 Face Image Deocclusion Face Image Deocclusion For face image deocclusion, apply Robust PCA matrix completion. Leow Wee Kheng (NUS) Reconstruction by Interpolation 32 / 35
33 Summary Summary Conventional wisdom: least-error solution is optimal. For some problems, interpolation produces more accurate results than approximation. Surface interpolation can be tricky: surface flipping and self-intersection. TPS runs slower with more positional constraints. Laplacian deformation runs faster with more positional constraints. Well-designed interpolation algorithm can be fast and still accurate. Leow Wee Kheng (NUS) Reconstruction by Interpolation 33 / 35
34 Reference Reference 1. F. L. Bookstein, Principal warps: Thin-plate splines and the decomposition of deformations, IEEE Trans. on Pattern Analysis and Machine Intelligence, 11(6): , G. Wahba, Spline Models for Observational Data, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, M. J. D. Powell, A thin plate spline method for mapping curves into curves in two dimensions, Proc. Biennial Conf. on Computational Techniques and Applications: CTAC95, 43 57, O. Sorkine, D. Cohen-Or, Y. Lipman, M. Alexa, C. Rössl, and H. P. Seidel, Laplacian surface editing, In Proc. Eurographics/ACM SIGGRAPH Symp. Geometry Processing, pages , H. Masuda, Y. Yoshioka, Y. Furukawa, Interactive mesh deformation using equality-constrained least squares, Computers & Graphics, 30(6): , Leow Wee Kheng (NUS) Reconstruction by Interpolation 34 / 35
35 Reference 1. S. Xie, W. K. Leow, H. Lee and T. C. Lim. Flip-Avoiding Interpolating Surface Registration for Skull Reconstruction. International Journal of Medical Robotics and Computer Assisted Surgery, 14(4), Aug S. Xie, W. K. Leow and T. C. Lim. Laplacian Deformation with Symmetry Constraints for Reconstruction of Defective Skulls. In Proc. Int. Conf. on Computer Analysis of Images and Patterns, Aug S. Xie and W. K. Leow. Flip-Avoiding Interpolating Surface Registration for Skull Reconstruction. In Proc. Int. Conf. on Pattern Recognition, Dec W. K. Leow, G. Li, J. Lai, T. Sim, V. Sharma. Hide and Seek: Uncovering Facial Occlusion with Variable-Threshold Robust PCA. In Proc. IEEE Winter Conf. on Applications of Computer Vision, Mar Leow Wee Kheng (NUS) Reconstruction by Interpolation 35 / 35
CSE 554 Lecture 7: Deformation II
CSE 554 Lecture 7: Deformation II Fall 2011 CSE554 Deformation II Slide 1 Review Rigid-body alignment Non-rigid deformation Intrinsic methods: deforming the boundary points An optimization problem Minimize
More informationDeformations. Recall: important tmodel dlof shape change is the deformation of one form into another.
Deformations Recall: important tmodel dlof shape change is the deformation of one form into another. Dates back to D Arcy Thompson s (1917) transformation grids. Deformation maps a set of morphological
More informationReal-Time Shape Editing using Radial Basis Functions
Real-Time Shape Editing using Radial Basis Functions, Leif Kobbelt RWTH Aachen Boundary Constraint Modeling Prescribe irregular constraints Vertex positions Constrained energy minimization Optimal fairness
More informationGeometric Transformations and Image Warping
Geometric Transformations and Image Warping Ross Whitaker SCI Institute, School of Computing University of Utah Univ of Utah, CS6640 2009 1 Geometric Transformations Greyscale transformations -> operate
More informationDense Correspondence of Skull Models by Automatic Detection of Anatomical Landmarks
Dense Correspondence of Skull Models by Automatic Detection of Anatomical Landmarks Kun Zhang, Yuan Cheng, and Wee Kheng Leow Department of Computer Science, National University of Singapore Computing
More informationDeepSketch2Face: A Deep Learning Based Sketching System for 3D Face and Caricature Modeling. Part I: User Studies on the Interface
DeepSketch2Face: A Deep Learning Based Sketching System for 3D Face and Caricature Modeling (Supplemental Materials) Xiaoguang Han, Chang Gao, Yizhou Yu The University of Hong Kong Stage I: User experience
More informationSmart point landmark distribution for thin-plate splines
Smart point landmark distribution for thin-plate splines John Lewis a, Hea-Juen Hwang a, Ulrich Neumann a, and Reyes Enciso b a Integrated Media Systems Center, University of Southern California, 3740
More informationFeature Detection and Matching
and Matching CS4243 Computer Vision and Pattern Recognition Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore Leow Wee Kheng (CS4243) Camera Models 1 /
More informationLarge Mesh Deformation Using the Volumetric Graph Laplacian
Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Xinguo Liu1 Hujun Bao2 Baining Guo1 Heung-Yeung Shum1 1 Microsoft Research Asia 2 Zhejiang University 3 Microsoft
More informationStatistical Shape Analysis
Statistical Shape Analysis I. L. Dryden and K. V. Mardia University ofleeds, UK JOHN WILEY& SONS Chichester New York Weinheim Brisbane Singapore Toronto Contents Preface Acknowledgements xv xix 1 Introduction
More informationGeometric Modeling and Processing
Geometric Modeling and Processing Tutorial of 3DIM&PVT 2011 (Hangzhou, China) May 16, 2011 6. Mesh Simplification Problems High resolution meshes becoming increasingly available 3D active scanners Computer
More informationMulti-view stereo. Many slides adapted from S. Seitz
Multi-view stereo Many slides adapted from S. Seitz Beyond two-view stereo The third eye can be used for verification Multiple-baseline stereo Pick a reference image, and slide the corresponding window
More informationDef De orma f tion orma Disney/Pixar
Deformation Disney/Pixar Deformation 2 Motivation Easy modeling generate new shapes by deforming existing ones 3 Motivation Easy modeling generate new shapes by deforming existing ones 4 Motivation Character
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 informationLaplacian Meshes. COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman
Laplacian Meshes COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman Outline Differential surface representation Ideas and applications Compact shape representation Mesh editing and manipulation
More informationNonrigid Surface Modelling. and Fast Recovery. Department of Computer Science and Engineering. Committee: Prof. Leo J. Jia and Prof. K. H.
Nonrigid Surface Modelling and Fast Recovery Zhu Jianke Supervisor: Prof. Michael R. Lyu Committee: Prof. Leo J. Jia and Prof. K. H. Wong Department of Computer Science and Engineering May 11, 2007 1 2
More informationTransformation Functions
Transformation Functions A. Ardeshir Goshtasby 1 Introduction Transformation functions are used to describe geometric differences between two images that have the same or overlapping contents. Given the
More informationImage Coding with Active Appearance Models
Image Coding with Active Appearance Models Simon Baker, Iain Matthews, and Jeff Schneider CMU-RI-TR-03-13 The Robotics Institute Carnegie Mellon University Abstract Image coding is the task of representing
More informationSurfaces, meshes, and topology
Surfaces from Point Samples Surfaces, meshes, and topology A surface is a 2-manifold embedded in 3- dimensional Euclidean space Such surfaces are often approximated by triangle meshes 2 1 Triangle mesh
More informationTransformation Functions for Image Registration
Transformation Functions for Image Registration A. Goshtasby Wright State University 6/16/2011 CVPR 2011 Tutorial 6, Introduction 1 Problem Definition Given n corresponding points in two images: find a
More informationCSE452 Computer Graphics
CSE452 Computer Graphics Lecture 19: From Morphing To Animation Capturing and Animating Skin Deformation in Human Motion, Park and Hodgins, SIGGRAPH 2006 CSE452 Lecture 19: From Morphing to Animation 1
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 information3D Mesh Sequence Compression Using Thin-plate Spline based Prediction
Appl. Math. Inf. Sci. 10, No. 4, 1603-1608 (2016) 1603 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.18576/amis/100440 3D Mesh Sequence Compression Using Thin-plate
More informationOpen-Curve Shape Correspondence Without Endpoint Correspondence
Open-Curve Shape Correspondence Without Endpoint Correspondence Theodor Richardson and Song Wang Department of Computer Science and Engineering, University of South Carolina, Columbia, SC 29208, USA richa268@cse.sc.edu,
More informationGeometry Processing & Geometric Queries. Computer Graphics CMU /15-662
Geometry Processing & Geometric Queries Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans,
More informationImage Warping. Srikumar Ramalingam School of Computing University of Utah. [Slides borrowed from Ross Whitaker] 1
Image Warping Srikumar Ramalingam School of Computing University of Utah [Slides borrowed from Ross Whitaker] 1 Geom Trans: Distortion From Optics Barrel Distortion Pincushion Distortion Straight lines
More informationModel Fitting. CS6240 Multimedia Analysis. Leow Wee Kheng. Department of Computer Science School of Computing National University of Singapore
Model Fitting CS6240 Multimedia Analysis Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore (CS6240) Model Fitting 1 / 34 Introduction Introduction Model
More informationEasy modeling generate new shapes by deforming existing ones
Deformation I Deformation Motivation Easy modeling generate new shapes by deforming existing ones Motivation Easy modeling generate new shapes by deforming existing ones Motivation Character posing for
More information03 - Reconstruction. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Spring 17 - Daniele Panozzo
3 - Reconstruction Acknowledgements: Olga Sorkine-Hornung Geometry Acquisition Pipeline Scanning: results in range images Registration: bring all range images to one coordinate system Stitching/ reconstruction:
More information2 problem. Finally, we discuss a novel application of the Nyström approximation [1] to the TPS mapping problem. Our experimental results suggest that
Approximate Thin Plate Spline Mappings Gianluca Donato 1 and Serge Belongie 2 1 Digital Persona, Inc., Redwood City, CA 94063 gianlucad@digitalpersona.com 2 U.C. San Diego, La Jolla, CA 92093-0114 sjb@cs.ucsd.edu
More informationDimensionality Reduction of Laplacian Embedding for 3D Mesh Reconstruction
Journal of Physics: Conference Series PAPER OPEN ACCESS Dimensionality Reduction of Laplacian Embedding for 3D Mesh Reconstruction To cite this article: I Mardhiyah et al 2016 J. Phys.: Conf. Ser. 725
More informationAPPLICATION OF INTERACTIVE DEFORMATION TO ASSEMBLED MESH MODELS FOR CAE ANALYSIS
Proceedings of the ASME 007 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference IDETC/CIE 007 September 4-7, 007, Las Vegas, Nevada, USA DETC007-34636
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 informationAssignment 4: Mesh Parametrization
CSCI-GA.3033-018 - Geometric Modeling Assignment 4: Mesh Parametrization In this exercise you will Familiarize yourself with vector field design on surfaces. Create scalar fields whose gradients align
More informationFacial Expression Morphing and Animation with Local Warping Methods
Facial Expression Morphing and Animation with Local Warping Methods Daw-Tung Lin and Han Huang Department of Computer Science and Information Engineering Chung Hua University 30 Tung-shiang, Hsin-chu,
More informationA Method of Automated Landmark Generation for Automated 3D PDM Construction
A Method of Automated Landmark Generation for Automated 3D PDM Construction A. D. Brett and C. J. Taylor Department of Medical Biophysics University of Manchester Manchester M13 9PT, Uk adb@sv1.smb.man.ac.uk
More informationInteractive Mesh Deformation Using Equality-Constrained Least Squares
Interactive Mesh Deformation Using Equality-Constrained Least Squares H. Masuda a,, Y. Yoshioka a, Y. Furukawa b a The University of Tokyo, Department of Environmental and Ocean Engineering, Hongo, Bunkyo-ku,
More informationAn introduction to interpolation and splines
An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve
More informationModeling and Measurement of 3D Deformation of Scoliotic Spine Using 2D X-ray Images
Modeling and Measurement of 3D Deformation of Scoliotic Spine Using 2D X-ray Images Hao Li 1, Wee Kheng Leow 1, Chao-Hui Huang 1, and Tet Sen Howe 2 1 Dept. of Computer Science, National University of
More information(Sparse) Linear Solvers
(Sparse) Linear Solvers Ax = B Why? Many geometry processing applications boil down to: solve one or more linear systems Parameterization Editing Reconstruction Fairing Morphing 2 Don t you just invert
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 informationAnimation. CS 465 Lecture 22
Animation CS 465 Lecture 22 Animation Industry production process leading up to animation What animation is How animation works (very generally) Artistic process of animation Further topics in how it works
More informationDeformation Transfer for Detail-Preserving Surface Editing
Deformation Transfer for Detail-Preserving Surface Editing Mario Botsch Robert W Sumner 2 Mark Pauly 2 Markus Gross Computer Graphics Laboratory, ETH Zurich 2 Applied Geometry Group, ETH Zurich Abstract
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 informationComputational Design. Stelian Coros
Computational Design Stelian Coros Schedule for presentations February 3 5 10 12 17 19 24 26 March 3 5 10 12 17 19 24 26 30 April 2 7 9 14 16 21 23 28 30 Send me: ASAP: 3 choices for dates + approximate
More informationDeformable Segmentation using Sparse Shape Representation. Shaoting Zhang
Deformable Segmentation using Sparse Shape Representation Shaoting Zhang Introduction Outline Our methods Segmentation framework Sparse shape representation Applications 2D lung localization in X-ray 3D
More informationTexture Mapping using Surface Flattening via Multi-Dimensional Scaling
Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Gil Zigelman Ron Kimmel Department of Computer Science, Technion, Haifa 32000, Israel and Nahum Kiryati Department of Electrical Engineering
More informationMulti-View Stereo for Static and Dynamic Scenes
Multi-View Stereo for Static and Dynamic Scenes Wolfgang Burgard Jan 6, 2010 Main references Yasutaka Furukawa and Jean Ponce, Accurate, Dense and Robust Multi-View Stereopsis, 2007 C.L. Zitnick, S.B.
More information05 Mesh Animation. Steve Marschner CS5625 Spring 2016
05 Mesh Animation Steve Marschner CS5625 Spring 2016 Basic surface deformation methods Blend shapes: make a mesh by combining several meshes Mesh skinning: deform a mesh based on an underlying skeleton
More informationMesh Processing Pipeline
Mesh Smoothing 1 Mesh Processing Pipeline... Scan Reconstruct Clean Remesh 2 Mesh Quality Visual inspection of sensitive attributes Specular shading Flat Shading Gouraud Shading Phong Shading 3 Mesh Quality
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
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 informationGeometric Modeling and Processing
Geometric Modeling and Processing Tutorial of 3DIM&PVT 2011 (Hangzhou, China) May 16, 2011 4. Geometric Registration 4.1 Rigid Registration Range Scanning: Reconstruction Set of raw scans Reconstructed
More informationMatching. Compare region of image to region of image. Today, simplest kind of matching. Intensities similar.
Matching Compare region of image to region of image. We talked about this for stereo. Important for motion. Epipolar constraint unknown. But motion small. Recognition Find object in image. Recognize object.
More informationSkull Assembly and Completion using Template-based Surface Matching
Skull Assembly and Completion using Template-based Surface Matching Li Wei, Wei Yu, Maoqing Li 1 Xin Li* 2 1 School of Information Science and Technology Xiamen University 2 Department of Electrical and
More informationDigital Makeup Face Generation
Digital Makeup Face Generation Wut Yee Oo Mechanical Engineering Stanford University wutyee@stanford.edu Abstract Make up applications offer photoshop tools to get users inputs in generating a make up
More informationInterpreter aided salt boundary segmentation using SVM regression shape deformation technique
Interpreter aided salt boundary segmentation using SVM regression shape deformation technique Problem Introduction For the seismic imaging project in offshore oil and gas exploration, a good velocity model
More informationTEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA
TEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA Tomoki Hayashi 1, Francois de Sorbier 1 and Hideo Saito 1 1 Graduate School of Science and Technology, Keio University, 3-14-1 Hiyoshi,
More informationA New Shape Matching Measure for Nonlinear Distorted Object Recognition
A New Shape Matching Measure for Nonlinear Distorted Object Recognition S. Srisuky, M. Tamsriy, R. Fooprateepsiri?, P. Sookavatanay and K. Sunaty Department of Computer Engineeringy, Department of Information
More informationAssignment 5: Shape Deformation
CSCI-GA.3033-018 - Geometric Modeling Assignment 5: Shape Deformation Goal of this exercise In this exercise, you will implement an algorithm to interactively deform 3D models. You will construct a two-level
More informationAnimations. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Kavita Bala
Animations Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 Some slides are courtesy of Steve Marschner and Kavita Bala Animation Artistic process What are animators trying to do? What tools
More informationSurface Reconstruction. Gianpaolo Palma
Surface Reconstruction Gianpaolo Palma Surface reconstruction Input Point cloud With or without normals Examples: multi-view stereo, union of range scan vertices Range scans Each scan is a triangular mesh
More informationLecture 7: Image Morphing. Idea #2: Align, then cross-disolve. Dog Averaging. Averaging vectors. Idea #1: Cross-Dissolving / Cross-fading
Lecture 7: Image Morphing Averaging vectors v = p + α (q p) = (1 - α) p + α q where α = q - v p α v (1-α) q p and q can be anything: points on a plane (2D) or in space (3D) Colors in RGB or HSV (3D) Whole
More informationSELECTION OF THE OPTIMAL PARAMETER VALUE FOR THE LOCALLY LINEAR EMBEDDING ALGORITHM. Olga Kouropteva, Oleg Okun and Matti Pietikäinen
SELECTION OF THE OPTIMAL PARAMETER VALUE FOR THE LOCALLY LINEAR EMBEDDING ALGORITHM Olga Kouropteva, Oleg Okun and Matti Pietikäinen Machine Vision Group, Infotech Oulu and Department of Electrical and
More informationSupplementary Material : Partial Sum Minimization of Singular Values in RPCA for Low-Level Vision
Supplementary Material : Partial Sum Minimization of Singular Values in RPCA for Low-Level Vision Due to space limitation in the main paper, we present additional experimental results in this supplementary
More informationRaghuraman Gopalan Center for Automation Research University of Maryland, College Park
2D Shape Matching (and Object Recognition) Raghuraman Gopalan Center for Automation Research University of Maryland, College Park 1 Outline What is a shape? Part 1: Matching/ Recognition Shape contexts
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationCurvature Estimation on Smoothed 3-D Meshes
Curvature Estimation on Smoothed 3-D Meshes Peter Yuen, Nasser Khalili and Farzin Mokhtarian Centre for Vision, Speech and Signal Processing School of Electronic Engineering, Information Technology and
More informationLearning based face hallucination techniques: A survey
Vol. 3 (2014-15) pp. 37-45. : A survey Premitha Premnath K Department of Computer Science & Engineering Vidya Academy of Science & Technology Thrissur - 680501, Kerala, India (email: premithakpnath@gmail.com)
More informationA Hole-Filling Algorithm for Triangular Meshes. Abstract
A Hole-Filling Algorithm for Triangular Meshes Lavanya Sita Tekumalla, Elaine Cohen UUCS-04-019 School of Computing University of Utah Salt Lake City, UT 84112 USA December 20, 2004 Abstract Data obtained
More informationRegistration of Expressions Data using a 3D Morphable Model
Registration of Expressions Data using a 3D Morphable Model Curzio Basso, Pascal Paysan, Thomas Vetter Computer Science Department, University of Basel {curzio.basso,pascal.paysan,thomas.vetter}@unibas.ch
More informationThin Plate Spline Feature Point Matching for Organ Surfaces in Minimally Invasive Surgery Imaging
Thin Plate Spline Feature Point Matching for Organ Surfaces in Minimally Invasive Surgery Imaging Bingxiong Lin, Yu Sun and Xiaoning Qian University of South Florida, Tampa, FL., U.S.A. ABSTRACT Robust
More informationStereo and Epipolar geometry
Previously Image Primitives (feature points, lines, contours) Today: Stereo and Epipolar geometry How to match primitives between two (multiple) views) Goals: 3D reconstruction, recognition Jana Kosecka
More informationDetecting Multiple Symmetries with Extended SIFT
1 Detecting Multiple Symmetries with Extended SIFT 2 3 Anonymous ACCV submission Paper ID 388 4 5 6 7 8 9 10 11 12 13 14 15 16 Abstract. This paper describes an effective method for detecting multiple
More informationLecture 8 Object Descriptors
Lecture 8 Object Descriptors Azadeh Fakhrzadeh Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapter 11.1 11.4 in G-W Azadeh Fakhrzadeh
More informationTEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA
TEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA Tomoki Hayashi, Francois de Sorbier and Hideo Saito Graduate School of Science and Technology, Keio University, 3-14-1 Hiyoshi, Kohoku-ku,
More informationStereo Vision. MAN-522 Computer Vision
Stereo Vision MAN-522 Computer Vision What is the goal of stereo vision? The recovery of the 3D structure of a scene using two or more images of the 3D scene, each acquired from a different viewpoint in
More informationMotivation. Gray Levels
Motivation Image Intensity and Point Operations Dr. Edmund Lam Department of Electrical and Electronic Engineering The University of Hong ong A digital image is a matrix of numbers, each corresponding
More informationUnderstanding Gridfit
Understanding Gridfit John R. D Errico Email: woodchips@rochester.rr.com December 28, 2006 1 Introduction GRIDFIT is a surface modeling tool, fitting a surface of the form z(x, y) to scattered (or regular)
More informationLandmark Detection on 3D Face Scans by Facial Model Registration
Landmark Detection on 3D Face Scans by Facial Model Registration Tristan Whitmarsh 1, Remco C. Veltkamp 2, Michela Spagnuolo 1 Simone Marini 1, Frank ter Haar 2 1 IMATI-CNR, Genoa, Italy 2 Dept. Computer
More informationShape Correspondence through Landmark Sliding
Shape Correspondence through Landmark Sliding Song Wang, Toshiro Kubota, and Theodor Richardson Department of Computer Science and Engineering University of South Carolina, Columbia, SC 29208, U.S.A. songwang@cse.sc.edu,
More informationTracking Using Online Feature Selection and a Local Generative Model
Tracking Using Online Feature Selection and a Local Generative Model Thomas Woodley Bjorn Stenger Roberto Cipolla Dept. of Engineering University of Cambridge {tew32 cipolla}@eng.cam.ac.uk Computer Vision
More informationHumanoid Robotics. Projective Geometry, Homogeneous Coordinates. (brief introduction) Maren Bennewitz
Humanoid Robotics Projective Geometry, Homogeneous Coordinates (brief introduction) Maren Bennewitz Motivation Cameras generate a projected image of the 3D world In Euclidian geometry, the math for describing
More informationMultivariate statistics and geometric morphometrics
Multivariate statistics and geometric morphometrics Eigenanalysis i used in several ways in geometric morphometrics: Calculation of partial warps. Use of partial warp scores in PCA, DFA, and CCA. Direct
More informationBroad field that includes low-level operations as well as complex high-level algorithms
Image processing About Broad field that includes low-level operations as well as complex high-level algorithms Low-level image processing Computer vision Computational photography Several procedures and
More informationA dynamic programming algorithm for perceptually consistent stereo
A dynamic programming algorithm for perceptually consistent stereo The Harvard community has made this article openly available. Please share ho this access benefits you. Your story matters. Citation Accessed
More informationCurves. Computer Graphics CSE 167 Lecture 11
Curves Computer Graphics CSE 167 Lecture 11 CSE 167: Computer graphics Polynomial Curves Polynomial functions Bézier Curves Drawing Bézier curves Piecewise Bézier curves Based on slides courtesy of Jurgen
More informationHST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007
MIT OpenCourseWare http://ocw.mit.edu HST.582J / 6.555J / 16.456J Biomedical Signal and Image Processing Spring 2007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationMulti-Scale Free-Form Surface Description
Multi-Scale Free-Form Surface Description Farzin Mokhtarian, Nasser Khalili and Peter Yuen Centre for Vision Speech and Signal Processing Dept. of Electronic and Electrical Engineering University of Surrey,
More informationRecognizing Deformable Shapes. Salvador Ruiz Correa (CSE/EE576 Computer Vision I)
Recognizing Deformable Shapes Salvador Ruiz Correa (CSE/EE576 Computer Vision I) Input 3-D Object Goal We are interested in developing algorithms for recognizing and classifying deformable object shapes
More informationWarping and Morphing. Ligang Liu Graphics&Geometric Computing Lab USTC
Warping and Morphing Ligang Liu Graphics&Geometric Computing Lab USTC http://staff.ustc.edu.cn/~lgliu Metamorphosis "transformation of a shape and its visual attributes" Intrinsic in our environment Deformations
More informationDesign Intent of Geometric Models
School of Computer Science Cardiff University Design Intent of Geometric Models Frank C. Langbein GR/M78267 GR/S69085/01 NUF-NAL 00638/G Auckland University 15th September 2004; Version 1.1 Design Intent
More informationIMAGE-BASED RENDERING
IMAGE-BASED RENDERING 1. What is Image-Based Rendering? - The synthesis of new views of a scene from pre-recorded pictures.!"$#% "'&( )*+,-/.). #0 1 ' 2"&43+5+, 2. Why? (1) We really enjoy visual magic!
More informationSnakes, level sets and graphcuts. (Deformable models)
INSTITUTE OF INFORMATION AND COMMUNICATION TECHNOLOGIES BULGARIAN ACADEMY OF SCIENCE Snakes, level sets and graphcuts (Deformable models) Centro de Visión por Computador, Departament de Matemàtica Aplicada
More informationFeature Extraction and Image Processing, 2 nd Edition. Contents. Preface
, 2 nd Edition Preface ix 1 Introduction 1 1.1 Overview 1 1.2 Human and Computer Vision 1 1.3 The Human Vision System 3 1.3.1 The Eye 4 1.3.2 The Neural System 7 1.3.3 Processing 7 1.4 Computer Vision
More informationGeometric Transformations and Image Warping Chapter 2.6.5
Geometric Transformations and Image Warping Chapter 2.6.5 Ross Whitaker (modified by Guido Gerig) SCI Institute, School of Computing University of Utah Univ of Utah, CS6640 2010 1 Geometric Transformations
More informationAdvanced Computer Graphics
G22.2274 001, Fall 2009 Advanced Computer Graphics Project details and tools 1 Project Topics Computer Animation Geometric Modeling Computational Photography Image processing 2 Optimization All projects
More informationManifold Parameterization
Manifold Parameterization Lei Zhang 1,2, Ligang Liu 1,2, Zhongping Ji 1,2, and Guojin Wang 1,2 1 Department of Mathematics, Zhejiang University, Hangzhou 310027, China 2 State Key Lab of CAD&CG, Zhejiang
More informationMotion Estimation and Optical Flow Tracking
Image Matching Image Retrieval Object Recognition Motion Estimation and Optical Flow Tracking Example: Mosiacing (Panorama) M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 Example 3D Reconstruction
More informationFree-Form Deformation and Other Deformation Techniques
Free-Form Deformation and Other Deformation Techniques Deformation Deformation Basic Definition Deformation: A transformation/mapping of the positions of every particle in the original object to those
More information