Application: Multiresolution Curves Jyun-Ming Chen Spring 2001.

Slides:



Advertisements
Similar presentations
Computer Graphics (Spring 2008) COMS 4160, Lecture 6: Curves 1
Advertisements

© University of Wisconsin, CS559 Spring 2004
Active Contours, Level Sets, and Image Segmentation
Interpolation A method of constructing a function that crosses through a discrete set of known data points. .
Cubic Curves CSE167: Computer Graphics Instructor: Steve Rotenberg UCSD, Fall 2006.
Interactive Inverse 3D Modeling James Andrews Hailin Jin Carlo Séquin.
Multiresolution Analysis of Arbitrary Meshes Matthias Eck joint with Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery and Werner Stuetzle Matthias.
Spline Functions – An Elegant View of Interpolation Bruce Cohen David Sklar
Jehee Lee Seoul National University
MATH 685/ CSI 700/ OR 682 Lecture Notes
Selected from presentations by Jim Ramsay, McGill University, Hongliang Fei, and Brian Quanz Basis Basics.
Basis Expansion and Regularization Presenter: Hongliang Fei Brian Quanz Brian Quanz Date: July 03, 2008.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Dr. S.M. Malaek Assistant: M. Younesi
P. Brigger, J. Hoeg, and M. Unser Presented by Yu-Tseh Chi.
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
1cs542g-term Notes  Added required reading to web (numerical disasters)
Jim Ramsay McGill University Basis Basics. Overview  What are basis functions?  What properties should they have?  How are they usually constructed?
Finite Element Method Introduction General Principle
Curve Analogies Aaron Hertzmann Nuria Oliver Brain Curless Steven M. Seitz University of Washington Microsoft Research Thirteenth Eurographics.
Modelling: Curves Week 11, Wed Mar 23
Lecture 9 Interpolation and Splines. Lingo Interpolation – filling in gaps in data Find a function f(x) that 1) goes through all your data points 2) does.
CS Subdivision I: The Univariate Setting Peter Schröder.
ENG4BF3 Medical Image Processing
Curve Modeling Bézier Curves
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
CIS V/EE894R/ME894V A Case Study in Computational Science & Engineering HW 5 Repeat the HW associated with the FD LBI except that you will now use.
CS 376 Introduction to Computer Graphics 04 / 23 / 2007 Instructor: Michael Eckmann.
Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 9: Introduction to Spline Curves.
Cs: compressed sensing
Geometric Modeling using Polygonal Meshes Lecture 1: Introduction Hamid Laga Office: South.
Finite Element Method.
Extrapolation Models for Convergence Acceleration and Function ’ s Extension David Levin Tel-Aviv University MAIA Erice 2013.
Review of Interpolation. A method of constructing a function that crosses through a discrete set of known data points.
Quadratic Surfaces. SPLINE REPRESENTATIONS a spline is a flexible strip used to produce a smooth curve through a designated set of points. We.
Lecture 6 : Level Set Method
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
Center for Machine Perception Department of Cybernetics, Faculty of Electrical Engineering Czech Technical University in Prague A Minimal Solution for.
Review Questions Jyun-Ming Chen Spring Wavelet Transform What is wavelet? How is wavelet transform different from Fourier transform? Wavelets are.
1 Complex Images k’k’ k”k” k0k0 -k0-k0 branch cut   k 0 pole C1C1 C0C0 from the Sommerfeld identity, the complex exponentials must be a function.
Wavelets and their applications in CG&CAGD Speaker: Qianqian Hu Date: Mar. 28, 2007.
2005/12/021 Fast Image Retrieval Using Low Frequency DCT Coefficients Dept. of Computer Engineering Tatung University Presenter: Yo-Ping Huang ( 黃有評 )
Jump to first page Chapter 3 Splines Definition (3.1) : Given a function f defined on [a, b] and a set of numbers, a = x 0 < x 1 < x 2 < ……. < x n = b,
Ship Computer Aided Design MR 422. Geometry of Curves 1.Introduction 2.Mathematical Curve Definitions 3.Analytic Properties of Curves 4.Fairness of Curves.
Principles of Computer-Aided Design and Manufacturing Second Edition 2004 ISBN Author: Prof. Farid. Amirouche University of Illinois-Chicago.
CS 376 Introduction to Computer Graphics 04 / 25 / 2007 Instructor: Michael Eckmann.
1 EEE 431 Computational Methods in Electrodynamics Lecture 18 By Dr. Rasime Uyguroglu
Interactive Graphics Lecture 10: Slide 1 Interactive Computer Graphics Lecture 10 Introduction to Surface Construction.
Flexible Automatic Motion Blending with Registration Curves
CSCE 441: Keyframe Animation/Smooth Curves (Cont.) Jinxiang Chai.
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
CS 325 Computer Graphics 04 / 30 / 2010 Instructor: Michael Eckmann.
Energy-minimizing Curve Design Gang Xu Zhejiang University Ouyang Building, 20-December-2006.
Ship Computer Aided Design
Class A Curve Reporter: Cao Juan Date:
Foundations of Computer Graphics (Spring 2012) CS 184, Lecture 12: Curves 1
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Object Modeling: Curves and Surfaces CEng 477 Introduction to Computer Graphics.
Introduction to Parametric Curve and Surface Modeling.
Morphing and Shape Processing
Introduction to Graphics Modeling
CSE 167 [Win 17], Lecture 9: Curves 1 Ravi Ramamoorthi
© University of Wisconsin, CS559 Spring 2004
Finite Element Surface-Based Stereo 3D Reconstruction
Mesh Parameterization: Theory and Practice
Support Vector Machines
Introduction to Parametric Curve and Surface Modeling
Type to enter a caption. Computer Graphics Week 10 Lecture 1.
Spline representation. ❖ A spline is a flexible strip used to produce a smooth curve through a designated set of points. ❖ Mathematically describe such.
Presentation transcript:

Application: Multiresolution Curves Jyun-Ming Chen Spring 2001

Introduction Plays fundamental roles in –Animation, 2D design, … –CAD: cross section design A good representation should support –Continuous level of smoothing (fig) –Editing LOD; direct manipulation –Data fitting We use B-spline wavelets to develop multiresolution curve All algorithms are simple, fast and require no extra storage (we shall see)

Curve Smoothing Construct an approximate curve with fewer control points Assume end-point interpolating cubic B- spline curve Discrete nature: –m = 4, 5, 7, 11, 19, … Trivially done using analysis filters Fast –Linear with banded LU

Fractional-level Curve Resolving discrete nature Smoothing … Editing (p ) Direct manipulation Local change

Example

Direct Manipulation

MR Editing Changing overall sweep Alter detailed characterstic (eq on p.113 is quite flexible, depending on j)

MR Editing Curve character library Contains different detail functions Can be extracted from hand-drawn strokes, or procedurally generated

Application: Variational Modeling

Introduction In geometry design, instead of direct manipulating the mathematical representation, sometimes we set up an objective function (typically as a minimization of some functional) and subject to some constraints; and let the computer determine the “best” shape satisfying the conditions Minimizing the integral is in the domain of variational calculus (and so named variational modeling) Wavelets are useful in speeding the computations required for variational modeling

Example Problem Design a “smooth” curve that passes through some particular points The curve (here: a functional curve) Formulate “smoothness” as a variational problem (minimize total curvature)

Aside: for surface problems Smoothness/fairing –Energy-minimizing surface

Solution Method: the finite-element method Choose a set of basis functions (called finite element) –discretize and parameterize the problem space Represent the unknown function as a linear combination of the finite elements Substitute back to the original problem

Back to the Problem If we choose to represent the curve as a quartic function

Problem (cont) A b

Algebraic Manipulation

The problem becomes … Problem in the form of quadratic programming Use the method of Lagrange multipliers –Works well for quadratic programming problems

Discussion In general, the matrix in the linear system is quite large; therefore, iterative solvers (e.g., Gauss-Seidel or conjugate gradient) are used Unlike the previous demonstration, usually B- spline basis is chosen (instead of the monomial basis) –The computation result can be directly used in geometric representation However, B-spline basis converges slowly in the iterative solver –compact support of the basis prohibits broad changes Gortler and Cohen (1995) uses B-spline wavelets for the finite element (instead of B-splines themselves) and works better

Mathematically, they solve where W represents the wavelet transform and is the set of the wavelet coefficient for the solution Gortler and Cohen (cont) Intuitively, the wavelet basis allows changes in the curve to propagate much more quickly from one region to another by allowing the effects to “bubble up” the hierarchy to basis functions with broader support and then descend back down to hierarchy to the narrower basis functions for the regions affected

Application: Tiling Skipped for now

Tiling: The Problem General requirement: matched (linked) indentations “correct” tiling: depends on the nature of the problem

Solution Methods Optimization –Formulate as graph searching problem; solved by dynamic programming –High complexity O(n 2 log n) –Too expensive for interactive applications with thousands of vertices Greedy methods –Linear time –Do not work well

Challenging Case (Contours from Human Brain) Input: A pair of contours Results from greedy algorithms Results from optimizing algorithm; Still require user interaction

Multiresolution Tiling Meyers et al. (1992)

Details (MR Tiling)

Compare: MR Tiling and Optimizing Method MR Tiling Optimization

Application: Surfaces

Polyhedral compression continuous level-of-detail progressive transmission Multiresolution editig