Towards High Quality Gradient Estimation on Regular Lattices

Slides:



Advertisements
Similar presentations
Spectral Analysis of Function Composition and Its Implications for Sampling in Direct Volume Visualization Steven Bergner GrUVi-Lab/SFU Torsten Möller.
Advertisements

Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
Section 11.6 – Taylor’s Formula with Remainder
Numerical Methods Lecture 14 Differentiation-Continuous Functions
Computer Vision Lecture 16: Texture
EE3561_Unit 6(c)AL-DHAIFALLAH14351 EE 3561 : Computational Methods Unit 6 Numerical Differentiation Dr. Mujahed AlDhaifallah ( Term 342)
EARS1160 – Numerical Methods notes by G. Houseman
Density Surfaces Arturas Mazeika. Outline of the Presentation A very brief overview of the architecture of the 3DVDM system An intuition of the density.
1cs542g-term Notes  No extra class tomorrow.
Lecture 4 Edge Detection
January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.1 Image Measurements and Detection Davi Geiger
Lecture 2: Numerical Differentiation. Derivative as a gradient
Atms 4320 Lab 2 Anthony R. Lupo. Lab 2 -Methodologies for evaluating the total derviatives in the fundamental equations of hydrodynamics  Recall that.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Lecture 3: Integration. Integration of discrete functions
GPU vs. CPU computations Árni Einarsson Jacek Kolodziej.
Lattice Multiplication is an alternative way of doing higher level multiplication.
Problem 1 Given a high-resolution computer image of a map of an irregularly shaped lake with several islands, determine the water surface area. Assume.
Finite Differences Finite Difference Approximations  Simple geophysical partial differential equations  Finite differences - definitions  Finite-difference.
EE3561_Unit 8Al-Dhaifallah14351 EE 3561 : Computational Methods Unit 8 Solution of Ordinary Differential Equations Lesson 3: Midpoint and Heun’s Predictor.
Consider the following: Now, use the reciprocal function and tangent line to get an approximation. Lecture 31 – Approximating Functions
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
1 Perception, Illusion and VR HNRS 299, Spring 2008 Lecture 8 Seeing Depth.
Computational Model of Energetic Particle Fluxes in the Magnetosphere Computer Systems Yu (Evans) Xiang Mentor: Dr. John Guillory, George Mason.
Effective Optical Flow Estimation
A Computationally Efficient Framework for Modeling Soft Body Impact Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
8.02 Math (P)Review: Outline
12 INFINITE SEQUENCES AND SERIES. In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series.
Maclaurin and Taylor Polynomials Objective: Improve on the local linear approximation for higher order polynomials.
From local to global : ray tracing with grid spacing h.
Objective - To find the area of a circle. The area of a circle is the product of and the square of the radius. Find the area of the circle. Use 3.14 for.
Environmental Data Analysis with MatLab 2 nd Edition Lecture 22: Linear Approximations and Non Linear Least Squares.
Introduction to emulators Tony O’Hagan University of Sheffield.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 21 Numerical Differentiation.
Model Optimization Wed Nov 16th 2016 Garrett Morrison.
Enter Poster Title Here
<Project Title>
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Chapter 25 Electric Potential.
<Project Title>
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Enter Poster Title Here
Enter Poster Title Here
LINEAR AND NON-LINEAR CLASSIFICATION USING SVM and KERNELS
Enter Poster Title Here
Vehicle Segmentation and Tracking in the Presence of Occlusions
<Project Title>
Enter Poster Title Here
<Project Title>
Fluid Flow Regularization of Navier-Stokes Equations
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
Enter Poster Title Here
Chapter 23.
Enter Poster Title Here
Find the Taylor polynomial {image} for the function f at the number a = 1. f(x) = ln(x)
Expressing functions as infinite series
Enter Poster Title Here
topic13_grid_generation
Numerical Differentiation Chapter 23
6.5 Taylor Series Linearization
Thank You!! For More Information Visit: m/ Call to :
SIFT.
Enter Poster Title Here
30 m 2000 m 30 m 2000 m. 30 m 2000 m 30 m 2000 m.
Include your personal presentation if necessary.
<Project Title>
Author(s) Name(s) SURNAME(s)
Author(s) Name(s) SURNAME(s)
Author(s) Name(s) SURNAME(s)
Logistic Regression Geoff Hulten.
Presentation transcript:

Towards High Quality Gradient Estimation on Regular Lattices Our work is titled “Towards High Quality Gradient Estimation On Regular Lattices” And the authors are myself Zahid Hossain, Usman Raza Alim and Dr. Torsten Moller Zahid Hossain, Usman Raza Alim and Dr. Torsten Möller

Our Contributions Problem: Derivative Estimation Taylor Series Small Support Problem: Derivative Estimation Very accurate Taylor Series Framework Orthogonal Projection Framework “Derivative Estimation” is a fundamental problem in visualization. First derivative, or the gradient, is used for shading surfaces while other higher derivatives are used for measuring quantities like curvatures and so forth. Not only we have to estimate these derivatives but also estimate them for arbitrary lattices and dimensions. But how good are our derivative estimators ? We address this problem and we developed two separate frameworks. The first one is “Taylor Series Framework” where filters have small support with reasonable rendering quality. This method is good for on-the-fly computations. And the second one is “Orthogonal Projection Framework,” based on ideas from approximation theory, which yields very accurate results but requires pre-processing as the filter support is much larger. We then extended both the frameworks for all regular lattices in arbitrary dimensions and for accuracy requirements. Extended to all regular lattices in Rn: CC, BCC … CC BCC

Comparison: In BCC Grid High Res. Here we compare our methods with Karp dataset in BCC Grid. We zoom into the gill region of the fish. The image on the top-right is rendered using very high resolution dataset to give an intuition of how things should look like. The image below is using a low resolution dataset. This one is shaded with gradients estimated using the existing method, simple 2nd order central differencing. This one is shaded using our new Taylor series framework And the last one uses our new Orthogonal Projection framework which improves image quality quite dramatically! For more details we invite you to visit our poster, Thank you. Low Res. Our Method: Orthogonal Projection Framework Existing Method: 2nd-CD Our Method: Taylor Series Framework