summer seminar
DESCRIPTION
Summer Seminar. Ruizhen Hu. Sampling. Spectral Sampling of Manifolds (Siggraph Asia 2010) Accurate Multidimensional Poisson-Disk Sampling (TOG) Efficient Maximal Poisson-Disk Sampling Blue-Noise Point Sampling using Kernel Density Model Differential Domain Analysis for Non-uniform Sampling. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/1.jpg)
Summer SeminarRuizhen Hu
![Page 2: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/2.jpg)
• Spectral Sampling of Manifolds (Siggraph Asia 2010)
• Accurate Multidimensional Poisson-Disk Sampling (TOG)
• Efficient Maximal Poisson-Disk Sampling
• Blue-Noise Point Sampling using Kernel Density Model
• Differential Domain Analysis for Non-uniform Sampling
Sampling
Noise & filtering
• Filtering Solid Gabor Noise
• Accelerating Spatially Varying Gaussian
![Page 3: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/3.jpg)
Spectral Sampling of Manifolds
A. Cengiz Öztireli Marc Alexa Markus Gross ETH Zürich TU Berlin ETH Zürich
![Page 4: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/4.jpg)
Authors
CENGİZ ÖZTİRELİ
PhD CandidateComputer Graphics LaboratoryETH Zürich
Research interests: Reconstruction, sampling and processing of surfaces, and sketch based modeling.
Marc Alexa
Professor Electrical Engineering & Computer Science TU Berlin
Markus Gross
ProfessorDepartment of Computer Science ETH Zürich
Research interests: Computer graphics, image generation, geometric modeling, computer animation, and scientific visualization
![Page 5: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/5.jpg)
Motivation
• Goal: finding optimal sampling conditions for a given surface representation
• Work: propose a new method to solve this problem based on spectral analysis of manifolds, kernel methods and matrix perturbation theory
![Page 6: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/6.jpg)
Contributions
• Efficient, simple to implement, easy to control through intuitive parameters, feature sensitive
• Result in accurate reconstructions with kernel based approximation methods and high quality isotropic samplings
• A discrete spectral analysis of manifolds using results from kernel methods and matrix perturbation theory
![Page 7: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/7.jpg)
Main Algorithm
• Input: a set of points lying near a manifold with normals + a kernel function definition = a continuous surface
![Page 8: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/8.jpg)
Algorithms for Sampling
• Subsampling: measuring the effect of a point on the manifold using the Laplace-Beltrami spectrum
measures the contribution of a point to the manifold definition
measures the contribution of a point to the manifold definition
![Page 9: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/9.jpg)
Algorithms for Sampling
• Resampling: maximizing and equalizing s (x) for all points– use local operations and move points in a simple gradient
ascent
![Page 10: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/10.jpg)
Results
![Page 11: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/11.jpg)
Results
![Page 12: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/12.jpg)
Results
![Page 13: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/13.jpg)
Conclusions
• New algorithms for the simplification and resampling of manifolds depending on a measure that restricts changes to the Laplace-Beltrami spectrum
• Limitations: the algorithms are greedy and thus not theoretically guaranteed to give the optimal sampling
• Future Directions:– texture on a surface– isotropic adaptive remeshing
![Page 14: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/14.jpg)
Accurate Multi-Dimensional Poisson-Disk Sampling
Manuel N. Gamito Steve Maddock Lightwork Design Ltd The University of Sheffield
![Page 15: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/15.jpg)
Authors
Manuel Noronha Gamito
software engineerLightwork Design Ltd
Steve Maddock
Senior Lecturer The University of Sheffield
Research interests: character animation, specifically modelling and animating faces
![Page 16: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/16.jpg)
Poisson-Disk Sampling
• Definition:– Each sample is placed with uniform probability density– No two samples are closer than , where is some chosen
distribution radius– A distribution is maximal if no more samples can be inserted
• Poisson-Disk sampling is useful for:– Distributed ray tracing [Cook 1986; Hachisuka et al. 2008]– Object placement and texturing [Lagae and Dutré 2006; Cline et al. 2009]– Stippling and dithering [Deussen et al. 2000; Secord et al. 2002] – Global Illumination [Lehtinen et al. 2008]
![Page 17: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/17.jpg)
Previous Methods
• Approximate Methods– Relax at least one of the sampling conditions
• Accurate Methods– Brute force
• Dart Throwing [Dippé and Wold 1985]– Assisted by a spatial data structure
• Voronoi diagram [Jones 2006]• Scalloped sectors [Dunbar and Humphreys 2006]• Uniform grid [Bridson 2007]• Simplified subdivision tree and uniform grid [White et al. 2007]
![Page 18: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/18.jpg)
Main Algorithm
![Page 19: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/19.jpg)
Radius vs. Number of Samples
• A distribution can be specified by supplying either– The distribution radius r– The desired number of samples N
• When the number of samples is specified– The algorithm uses a radius r based on N and on the measured
packing density of sample disks• The packing density was obtained by averaging the packing
densities measured from 100 distributions generated by our algorithm
• The number of samples of the resulting maximal distribution is approximately equal to the desired number N (error<5%)
![Page 20: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/20.jpg)
Results
• Number of samples• Sampling time• Samples per second
![Page 21: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/21.jpg)
Results
![Page 22: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/22.jpg)
Conclusions
• A Poisson-Disk Sampling Algorithm that– Is statistically correct (see proof in paper)– Is efficient through the use of a subdivision tree– Works in any number of dimensions
• Subject to available physical memory– Generates maximal distributions– Allows approximate control over the number of samples– Can enforce periodic or wall boundary conditions on the
boundaries of the domain
![Page 23: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/23.jpg)
Future Work
• Make it multi-threaded– Distant parts of the domain can be sampled in parallel with
different threads– Some synchronisation between threads is still required
• Generate non-uniform distributions– Have the distribution radius be a function of the position in the
domain
• Work over irregular domains– Discard subdivided tree nodes that fall outside the domain
![Page 24: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/24.jpg)
Efficient Maximal Poisson-Disk Sampling
![Page 25: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/25.jpg)
AuthorsMohamed S. Ebeida
post-doctorCarnegie Mellon university
Anjul Patney
PhDCarnegie University of California, Davis
Scott A. Mitchell
Principal Member of Technical StaffSandia National Laboratories
Andrew Davidson
PhDCarnegie University of California, Davis
Patrick M. Knupp
Distinguished Member Technical StaffSandia National Laboratories
John D. Owens
Associate ProfessorCarnegie University of California, Davis
![Page 26: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/26.jpg)
Work
• generating a uniform Poisson-disk sampling that is both maximal and unbiased over bounded non-convex domains
![Page 27: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/27.jpg)
Motivation
• Maximal Poisson-disk sampling distributions:– Avoid aliasing– Have blue noise property
• Bias-free:– Crucial in fracture propagation simulations
![Page 28: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/28.jpg)
Conditions
• Maximal : the sample disks overlap cover the whole domain leaving no room to insert an additional point
• Bias-free the likelihood of a sample being inside any subdomain is proportional to the area of the subdomain, provided the subdomain is completely outside all prior samples’ disks
•
![Page 29: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/29.jpg)
Previous methods
• relax the unbiased or maximal conditions, or require potentially unbounded time or space
• Dart-throwing– unbiased but also not maximal
• Tile-based– biased and require relatively large storage.
![Page 30: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/30.jpg)
Main Algorithm
• First phase:– an unbiased, near-maximal covering– voids: the part of a grid cell outside all circles
• Second phase:– completes the maximal covering– darts are thrown directly into the voids, maintaining the bias-
free condition– A maximal distribution is achieved when the domain is
completely covered, leaving no room for new points to be selected
![Page 31: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/31.jpg)
Sequential Sampling
1. Generate a background grid; mark interior and boundary cells
2. Phase I. Throw darts into square cells; remove hit cells
3. Generate polygonal approximations to the remaining voids
4. Phase II. Throw darts into voids; update remaining areas
![Page 32: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/32.jpg)
Algorithm through Phase I
![Page 33: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/33.jpg)
Voids
• Polygonal approximations to arc-voids
![Page 34: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/34.jpg)
Results
![Page 35: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/35.jpg)
Implementation Performance
![Page 36: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/36.jpg)
Conclusions
• An efficient algorithm for maximal Poisson-disk sampling in two-dimensions– the final result is provably maximal– the sampling is unbiased– it is O(n log n) in expected time– it is O(n) in deterministic memory required– not limited to convex domains– efficiently implemented in both sequential and parallel forms
• Future work: 3D maximal Poisson-disk sampling algorithm
![Page 37: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/37.jpg)
Blue-Noise Point Sampling using Kernel Density Model
Raanan FattalHebrew University of Jerusalem, Israel
![Page 38: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/38.jpg)
Author
Raanan Fattal
Alon faculty memberSchool of Computer Science and EngineeringThe Hebrew University of Jerusalem
![Page 39: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/39.jpg)
Work
• A new approach for generating point sets with high-quality blue noise properties that formulates the problem using a statistical mechanics interacting particle model
![Page 40: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/40.jpg)
Contributions
• present a new approach that formulates the problem using a statistical mechanics interacting particle model
• derive a highly efficient multi-scale sampling scheme for drawing random point distributions
• avoids the critical slowing down phenomena that plagues this type of models
![Page 41: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/41.jpg)
Previous work
• Dart throwing– constrain a minimal distance between every pair of points
• Relaxation– follow a greedy strategy that maximizes this distance– two main shortcomings:
• teriminatin• impreciseness : apparent blur
![Page 42: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/42.jpg)
New Approach
• model the target density as a sum of nonnegative radially-symmetric kernels
The j-th kernel centered around the point xj:
![Page 43: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/43.jpg)
New Approach
• The error of this approximation
• Minimizing E, with respect to the kernel centers– equivalent to the one obtained by converged Lloyd’s iterations– has the ability to achieve spectral enhancement
• We unify error minimization and randomness by defining a statistical mechanics particle model using E
![Page 44: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/44.jpg)
New Approach
• Assigning each configuration a probability density according to the following Boltzmann-Gibbs distribution:
![Page 45: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/45.jpg)
Drawing samples
• Markov-chain Monte Carlo(MCMC)• Gibbs sampler• Langevin method• Metropolis-Hastings(MH) test
![Page 46: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/46.jpg)
Critical slowing down
![Page 47: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/47.jpg)
Multi-scale sampling
![Page 48: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/48.jpg)
Results
![Page 49: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/49.jpg)
Results
![Page 50: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/50.jpg)
Differential Domain Analysis for Non-uniform Sampling
Li-Yi Wei Rui WangMicrosoft Research University of Massachusetts Amherst
![Page 51: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/51.jpg)
Authors
Li-Yi Wei
ResearcherMicrosoft Research
Rui Wang
Assistant Professor Department of Computer ScienceUniversity of Massachusetts
![Page 52: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/52.jpg)
Work
• new methods for analyzing non-uniform sample distributions
![Page 53: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/53.jpg)
Previous work
• Two common methodologies exist for evaluating the quality of samples– spatial uniformity: discrepancy & relative radius– Power spectrum analysis, including radial mean and anisotropy
• However, existing methods are primarily designed for uniform Euclidean domains and can not be easily extended to general non-uniform scenarios, such as– adaptive– anisotropic– non-Euclidean domains
![Page 54: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/54.jpg)
Contributions
• A reformulation of standard Fourier spectrum analysis into a form that depends on sample location differentials
• A generalization of this basic formulation, including different distance transformations for various domains, and range selection for better control of quality and speed
• Applications in spectral and spatial analysis for non-uniform sample distributions
![Page 55: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/55.jpg)
Core idea
• Fourier power spectrum– Fourier transform:
– power spectrum:
• Differential representation:
![Page 56: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/56.jpg)
Core idea
• Integral form:
• General kernel:
– Range selection (for computational reasons):
Where is a local distance measure of s’ with respect to the local frame centered at s. In uniform Euclidean domains,
![Page 57: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/57.jpg)
Core idea
• Non-uniform domain:
Where is a differential domain transformation function that locally warps each d from a non-uniform to a (hypothetical) uniform
![Page 58: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/58.jpg)
Kernel selection
• a cos kernel may amplify some information while obscure others
• A Gaussian kernel, in contrast, displays the main peak clearly without undulations. it can manifest the distribution properties more clearly, e.g. more apparent characteristic structures
![Page 59: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/59.jpg)
Spectral Analysis
• Exact – Isotropic Euclidean domain– Anisotropic Euclidean domain
• Range selection• Radial measures
– We can compute the circular average and variance of p(d)– The former gives the radial mean, indicating the overall
distance-based property of p(d)– The latter gives the anisotropy, which reveals if there is any
directional bias/structure in the distribution
![Page 60: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/60.jpg)
Comparisons
• How our method relates and compares to traditional Fourier spectrum analysis?
![Page 61: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/61.jpg)
Results
![Page 62: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/62.jpg)
Results
![Page 63: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/63.jpg)
Filtering Solid Gabor Noise
Ares Lagae George DrettakisKatholieke Universiteit Leuven REVES/INRIA Sophia-Antipolis
![Page 64: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/64.jpg)
Authors
Ares Lagae
Postdoctoral FellowComputer Graphics Research GroupKatholieke Universiteit Leuven
George Drettakis
Group LeaderREVES/Inria Sophia-Antipolis
![Page 65: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/65.jpg)
Work
• we show that a slicing approach is required to preserve continuity across sharp edges, and we present a new noise function that supports anisotropic filtering of sliced solid noise
![Page 66: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/66.jpg)
Filtering
• Filtering the noise on the surface using frequency clamping works better if the power spectrum of the noise on the surface is bandpass.
• The Fourier Slice Theorem: projecting in the spatial domain corresponds to slicing in the frequency domain, and vice versa
![Page 67: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/67.jpg)
Previous works
• Perlin noise[Perlin 1985]: – use slicing and frequency clamping– Filtering introduces an aliasing vs. detail loss trade-off since the
power spectrum of Perlin noise is not band-pass
• Wavelet noise [Cook and DeRose 2005]:– use projection and frequency clamping– Even though the power spectrum of the noise on the surface is
band-pass, filtering does not fully solve the aliasing vs. detail loss trade-off
• Gabor noise [Lagae et al. 2009]: – use projection and a filtering approach specific to Gabor noise– This results in high-quality anisotropic filtering, however,
introduces discontinuities at sharp edges
![Page 68: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/68.jpg)
New noise
• solid random-phase Gabor noise:– use slice (preserves continuity at sharp edges)– Since filtering is inherently a 2D operation, we have to explicitly
model the slicing of the 3D Gabor kernels to be able to filter the resulting 2D Gabor kernels. This requires the introduction of
• a new Gabor kernel, the phase-augmented Gabor kernel• a new Gabor noise, random-phase Gabor noise
![Page 69: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/69.jpg)
Slicing Solid Gabor Noise
• The Gabor kernel of Lagae et al. [2009] is not closed under slicing:
![Page 70: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/70.jpg)
Phase-augmented Gabor kernel
• The phase-augmented Gabor kernel is closed under slicing:
• solid random-phase Gabor noise (also closed under slicing):
![Page 71: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/71.jpg)
Slicing Random-Phase Gabor Noise
• solid random-phase Gabor noise is also closed under slicing
• the statistical properties of a sliced solid random-phase Gabor noise are obtained using the analytical expressions for the statistical properties of a 2D random-phase Gabor noise
![Page 72: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/72.jpg)
![Page 73: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/73.jpg)
Filtering Sliced Solid Gabor Noise
![Page 74: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/74.jpg)
Conclusion
• A new procedural noise function, random-phase Gabor noise, that supports – continuity across sharp edges– high-quality anisotropic filtering– Anisotropy
• Future work: – exploring volumetric filtering of solid Gabor noise– further exploring anisotropy in the context of solid noise– designing user interfaces for interacting with anisotropic solid
noise
![Page 75: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/75.jpg)
Results
![Page 76: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/76.jpg)
Results
![Page 77: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/77.jpg)
Accelerating Spatially Varying Gaussian Filters
Jongmin Baek David E. JacobsStanford University
![Page 78: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/78.jpg)
Jongmin Baek
Ph.D. studentStanford University
David E. Jacobs
PhD candidateStanford University
Authors
![Page 79: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/79.jpg)
Motivation
Input
GaussianFilter
SpatiallyVaryingGaussianFilter
![Page 80: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/80.jpg)
1) Accelerating Spatially Varying Gaussian Filters
2) Accelerating Spatially Varying Gaussian Filters
3) Accelerating Spatially Varying Gaussian Filters
4) Applications
Roadmap
![Page 81: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/81.jpg)
Gaussian Filters
Position Value
![Page 82: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/82.jpg)
Gaussian Filters
Each output value …
![Page 83: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/83.jpg)
Gaussian Filters
… is a weighted sum of input values …
![Page 84: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/84.jpg)
Gaussian Filters
… whose weight is a Gaussian …
![Page 85: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/85.jpg)
Gaussian Filters
… in the space of the associated positions.
![Page 86: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/86.jpg)
Gaussian Blur
Gaussian Filters: Uses
![Page 87: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/87.jpg)
Bilateral Filter
Gaussian Filters: Uses
![Page 88: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/88.jpg)
Non-local Means Filter
Gaussian Filters: Uses
![Page 89: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/89.jpg)
Applications Denoising images and meshes Data fusion and upsampling Abstraction / Stylization Tone-mapping ...
Gaussian Filters: Summary
Previous work on fast Gaussian Filters Bilateral Grid (Chen, Paris, Durand; 2007) Gaussian KD-Tree (Adams et al.; 2009) Permutohedral Lattice (Adams, Baek, Davis; 2010)
![Page 90: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/90.jpg)
Summary of Previous Implementations:
A separable blur flanked by resampling operations.Exploit the separability of the Gaussian kernel.
Gaussian Filters: Implementations
![Page 91: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/91.jpg)
Spatially Varying Gaussian Filters
Spatially varying covariance matrix
Spatially Invariant
![Page 92: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/92.jpg)
Trilateral Filter (Choudhury and Tumblin, 2003)
Tilt the kernel of a bilateral filter along the image gradient.
“Piecewise linear”instead of“Piecewise constant”model.
Spatial Variance in Previous Work
![Page 93: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/93.jpg)
Spatially Varying Gaussian Filters: Tradeoff
Benefits: Can adapt the kernel spatially. Better filtering performance.
Cost: No longer separable. No existing acceleration schemes.
Input Bilateral-filtered Trilateral-filtered
![Page 94: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/94.jpg)
Problem: Spatially varying (thus non-separable) Gaussian filter
Existing Tool: Fast algorithms for spatially invariant Gaussian filters
Solution: Re-formulate the problem to fit the tool. Need to obey the “piecewise-constant” assumption
Acceleration
![Page 95: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/95.jpg)
Naïve Approach (Toy Example)I LOST THE GAME
Input Signal
Desired Kernel1 1 12 3 4
filtered w/ 1filtered w/ 2filtered w/ 3filtered w/ 4
1 1 1
2
3Output Signal4
![Page 96: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/96.jpg)
In practice, the # of kernels can be very large.
Challenge #1
Pixel Location x
Desired Kernel K(x)
Range ofKernels needed
![Page 97: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/97.jpg)
Sample a few kernels and interpolate.
Solution #1
Desired Kernel K(x)
Sampledkernels
Interpolate result!
Pixel Location x
K1
K2
K3
![Page 98: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/98.jpg)
Interpolation needs an extra assumption to work:
The covariance matrix Ʃi is either piecewise-constant,
or smoothly varying.
Kernel is spatially varying, but locally spatially invariant.
Assumptions
![Page 99: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/99.jpg)
Runtime scales with the # of sampled kernels.
Challenge #2
Desired Kernel K(x)
Filter only some regions of the image with each kernel.
(“support”)
Pixel Location x
Sampledkernels
K1
K2
K3
![Page 100: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/100.jpg)
In this example, x needs to be in the support of K1 & K2.
Defining the Support
Desired Kernel K(x)
Pixel Location x
K1
K2
K3
![Page 101: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/101.jpg)
Dilating the Support
Desired Kernel K(x)
Pixel Location x
K1
K2
K3
![Page 102: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/102.jpg)
Algorithm
1) Identify kernels to sample.2) For each kernel, compute the support needed.3) Dilate each support.4) Filter each dilated support with its kernel.5) Interpolate from the filtered results.
![Page 103: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/103.jpg)
Algorithm
1) Identify kernels to sample.2) For each kernel, compute the support needed.3) Dilate each support.4) Filter each dilated support with its kernel.5) Interpolate from the filtered results.
K1
K2
K3
![Page 104: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/104.jpg)
Algorithm
1) Identify kernels to sample.2) For each kernel, compute the support needed.3) Dilate each support.4) Filter each dilated support with its kernel.5) Interpolate from the filtered results.
K1
K2
K3
![Page 105: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/105.jpg)
Algorithm
1) Identify kernels to sample.2) For each kernel, compute the support needed.3) Dilate each support.4) Filter each dilated support with its kernel.5) Interpolate from the filtered results.
K1
K2
K3
![Page 106: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/106.jpg)
Algorithm
1) Identify kernels to sample.2) For each kernel, compute the support needed.3) Dilate each support.4) Filter each dilated support with its kernel.5) Interpolate from the filtered results.
K1
K2
K3
![Page 107: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/107.jpg)
Algorithm
1) Identify kernels to sample.2) For each kernel, compute the support needed.3) Dilate each support.4) Filter each dilated support with its kernel.5) Interpolate from the filtered results.
K1
K2
K3
![Page 108: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/108.jpg)
Applications
HDR Tone-mapping
Joint Range Data Upsampling
![Page 109: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/109.jpg)
Application #1: HDR Tone-mapping
Input HDR
Detail
BaseFi
lter
Output
Attenuate
![Page 110: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/110.jpg)
Tone-mapping Example
Bilateral Filter Kernel Sampling
![Page 111: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/111.jpg)
Application #2: Joint Range Data Upsampling
Range Finder Data
Sparse Unstructured Noisy
Scene Image
Output
Filter
![Page 112: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/112.jpg)
Synthetic Example
Scene Image Ground Truth Depth
![Page 113: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/113.jpg)
Synthetic Example
Scene Image Simulated Sensor Data
![Page 114: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/114.jpg)
Synthetic Example : Result
Kernel SamplingBilateral Filter
![Page 115: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/115.jpg)
Synthetic Example : Relative Error
Bilateral Filter Kernel Sampling
2.41% Mean Relative Error 0.95% Mean Relative Error
![Page 116: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/116.jpg)
Real-World Example
Scene Image Range Finder Data
*Dataset courtesy of Jennifer Dolson, Stanford University
![Page 117: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/117.jpg)
Real-World Example: Result
Input
Bilateral
Naive
KernelSampling
![Page 118: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/118.jpg)
Performance
Kernel Sampling
Choudhury and Tumblin (2003) Naïve
Tonemap1 5.10 s 41.54 s 312.70 sTonemap2 6.30 s 88.08 s 528.99 s
Kernel Sampling
Kernel Sampling(No segmentation)
Depth1 3.71 s 57.90 sDepth2 9.18 s 131.68 s
![Page 119: Summer Seminar](https://reader036.vdocuments.mx/reader036/viewer/2022062500/568150fb550346895dbf18d1/html5/thumbnails/119.jpg)
1. A generalization of Gaussian filters• Spatially varying kernels• Lose the piecewise-constant assumption.
2. Acceleration via Kernel Sampling• Filter only necessary pixels (and their support)
and interpolate.
3. Applications
Conclusion