smooth shape aware functions with controlled extrema
play

Smooth Shape-Aware Functions with Controlled Extrema Alec Jacobson 1 - PowerPoint PPT Presentation

Smooth Shape-Aware Functions with Controlled Extrema Alec Jacobson 1 1 ETH Zurich Tino Weinkauf 2 2 MPI Saarbrcken Olga Sorkine 1 August 9, 2012 Real-time deformation relies on smooth, shape-aware functions input shape + handles August 9,


  1. Smooth Shape-Aware Functions with Controlled Extrema Alec Jacobson 1 1 ETH Zurich Tino Weinkauf 2 2 MPI Saarbrücken Olga Sorkine 1 August 9, 2012

  2. Real-time deformation relies on smooth, shape-aware functions input shape + handles August 9, 2012 Alec Jacobson # 2

  3. Real-time deformation relies on smooth, shape-aware functions precompute weight functions August 9, 2012 Alec Jacobson # 3

  4. Real-time deformation relies on smooth, shape-aware functions deform handles à deform shape August 9, 2012 Alec Jacobson # 4

  5. Real-time deformation relies on smooth, shape-aware functions August 9, 2012 Alec Jacobson # 5

  6. Real-time deformation relies on smooth, shape-aware functions August 9, 2012 Alec Jacobson # 6

  7. Spurious extrema cause distracting artifacts unconstrained [Botsch & Kobbelt 2004] local max local min August 9, 2012 Alec Jacobson # 7

  8. Spurious extrema cause distracting artifacts unconstrained [Botsch & Kobbelt 2004] local max local min August 9, 2012 Alec Jacobson # 8

  9. Bounds help, but don’t solve problem bounded [Jacobson et al. 2011] local max local min August 9, 2012 Alec Jacobson # 9

  10. Bounds help, but don’t solve problem bounded [Jacobson et al. 2011] local max local min August 9, 2012 Alec Jacobson # 10

  11. Gets worse with higher-order smoothness bounded [Jacobson et al. 2011] local max local min oscillate too much August 9, 2012 Alec Jacobson # 11

  12. Gets worse with higher-order smoothness bounded [Jacobson et al. 2011] local max local min oscillate too much August 9, 2012 Alec Jacobson # 12

  13. We explicitly prohibit spurious extrema our local max local min August 9, 2012 Alec Jacobson # 13

  14. We explicitly prohibit spurious extrema our local max local min August 9, 2012 Alec Jacobson # 14

  15. Same functions used for color interpolation August 9, 2012 Alec Jacobson # 15

  16. Same functions used for color interpolation August 9, 2012 Alec Jacobson # 16

  17. Same functions used for color interpolation unconstrained [Finch et al. 2011] Image courtesy Mark Finch August 9, 2012 Alec Jacobson # 17

  18. Same functions used for color interpolation unconstrained [Finch et al. 2011] August 9, 2012 Alec Jacobson # 18

  19. Same functions used for color interpolation unconstrained [Finch et al. 2011] Our August 9, 2012 Alec Jacobson # 19

  20. Want same control when smoothing data August 9, 2012 Alec Jacobson # 20

  21. Want same control when smoothing data Exact, but sharp geodesic August 9, 2012 Alec Jacobson # 21

  22. Want same control when smoothing data Exact, but sharp geodesic August 9, 2012 Alec Jacobson # 22

  23. Want same control when smoothing data Exact, but sharp geodesic Smooth, but extrema are lost August 9, 2012 Alec Jacobson # 23

  24. Want same control when smoothing data Exact, but sharp geodesic Smooth and maintain extrema August 9, 2012 Alec Jacobson # 24

  25. Ideal discrete problem is intractable arg min E ( f ) f Interpolation functions: August 9, 2012 Alec Jacobson # 25

  26. Ideal discrete problem is intractable arg min E ( f ) f Data smoothing: August 9, 2012 Alec Jacobson # 26

  27. Ideal discrete problem is intractable arg min E ( f ) f August 9, 2012 Alec Jacobson # 27

  28. Ideal discrete problem is intractable arg min E ( f ) f s.t. f max = known f min = known August 9, 2012 Alec Jacobson # 28

  29. Ideal discrete problem is intractable arg min E ( f ) f s.t. f max = known f min = known f j < f max linear f max f j > f min f j August 9, 2012 Alec Jacobson # 29

  30. Ideal discrete problem is intractable arg min E ( f ) f s.t. f max = known f min = known f j f j < f max linear f j > f min f i f i > min j ∈ N ( i ) f j nonlinear f i < max j ∈ N ( i ) f j August 9, 2012 Alec Jacobson # 30

  31. Assume we have a feasible solution “Representative function” u u j < u max linear handles u j > u min u i > min j ∈ N ( i ) u j nonlinear interior u i < max j ∈ N ( i ) u j August 9, 2012 Alec Jacobson # 31

  32. Assume we have a feasible solution “Representative function” u u j < u max handles u j > u min u i > min j ∈ N ( i ) u j interior u i < max j ∈ N ( i ) u j August 9, 2012 Alec Jacobson # 32

  33. Copy “monotonicity” of representative arg min E ( f ) f s.t. f max = known f min = known ( f i − f j )( u i − u j ) > 0 ∀ ( i, j ) ∈ E linear At least one edge in either direction per vertex August 9, 2012 Alec Jacobson # 33

  34. Rewrite as conic optimization Conic QP Optimize with MOSEK August 9, 2012 Alec Jacobson # 34

  35. We always have harmonic representative 1 Z kr u k 2 dV arg min 2 Ω u August 9, 2012 Alec Jacobson # 35

  36. We always have harmonic representative 1 Z kr u k 2 dV arg min 2 Ω u u max = 1 s.t. August 9, 2012 Alec Jacobson # 36

  37. We always have harmonic representative 1 Z kr u k 2 dV arg min 2 Ω u u max = 1 s.t. u min = 0 s.t. August 9, 2012 Alec Jacobson # 37

  38. We always have harmonic representative 1 Z kr u k 2 dV arg min 2 Ω u u max = 1 s.t. u min = 0 s.t. Works well when no input function exists August 9, 2012 Alec Jacobson # 38

  39. Data energy may fight harmonic representative Anisotropic input data August 9, 2012 Alec Jacobson # 39

  40. Data energy may fight harmonic representative Anisotropic input data Harmonic representative August 9, 2012 Alec Jacobson # 40

  41. Data energy may fight harmonic representative Anisotropic input data Harmonic representative August 9, 2012 Alec Jacobson # 41

  42. Data energy may fight harmonic representative Anisotropic input data Harmonic representative August 9, 2012 Alec Jacobson # 42

  43. Data energy may fight harmonic representative Anisotropic input data Resulting solution with large August 9, 2012 Alec Jacobson # 43

  44. If data exists, copy topology, too Anisotropic input data [Weinkauf et al. 2010] representative August 9, 2012 Alec Jacobson # 44

  45. If data exists, copy topology, too Anisotropic input data Resulting solution with large August 9, 2012 Alec Jacobson # 45

  46. Final algorithm is simple and efficient ● Data smoothing : topology-aware representative § Morse-smale + linear solve ~milliseconds August 9, 2012 Alec Jacobson # 46

  47. Final algorithm is simple and efficient ● Data smoothing : topology-aware representative § Morse-smale + linear solve ~milliseconds ● Interpolation : harmonic representative § Linear solve ~milliseconds August 9, 2012 Alec Jacobson # 47

  48. Final algorithm is simple and efficient ● Data smoothing : topology-aware representative § Morse-smale + linear solve ~milliseconds ● Interpolation : harmonic representative § Linear solve ~milliseconds ● Conic optimization § 2D ~milliseconds, 3D ~seconds August 9, 2012 Alec Jacobson # 48

  49. Final algorithm is simple and efficient ● Data smoothing : topology-aware representative § Morse-smale + linear solve ~milliseconds ● Interpolation : harmonic representative § Linear solve ~milliseconds ● Conic optimization § 2D ~milliseconds, 3D ~seconds Interpolation: functions are precomputed August 9, 2012 Alec Jacobson # 49

  50. We preserve troublesome appendages Bounded Our August 9, 2012 Alec Jacobson # 50

  51. We preserve troublesome appendages Bounded Our August 9, 2012 Alec Jacobson # 51

  52. We preserve troublesome appendages Bounded Our #

  53. Our weights attach appendages to body [Botsch & Kobbelt 2004, Our method Jacobson et al. 2011] August 9, 2012 Alec Jacobson # 53

  54. Extrema glue appendages to far-away handles [Botsch & Kobbelt 2004, Jacobson et al. 2011] August 9, 2012 Alec Jacobson # 54

  55. Extrema glue appendages to far-away handles [Botsch & Kobbelt 2004, Jacobson et al. 2011] August 9, 2012 Alec Jacobson # 55

  56. Our weights attach appendages to body Our method August 9, 2012 Alec Jacobson # 56

  57. Our weights attach appendages to body Our method August 9, 2012 Alec Jacobson # 57

  58. Extrema distort small features Unconstrained [Botsch & Kobbelt 2004] weight of middle point August 9, 2012 Alec Jacobson # 58

  59. Extrema distort small features Unconstrained [Botsch & Kobbelt 2004] weight of middle point August 9, 2012 Alec Jacobson # 59

  60. Extrema distort small features Bounded [Jacobson et al. 2011] weight of middle point August 9, 2012 Alec Jacobson # 60

  61. “Monotonicity” helps preserve small features Bounded [Jacobson et al. 2011] Our August 9, 2012 Alec Jacobson # 61

  62. Spurious extrema are unstable, may “flip” slightly larger region August 9, 2012 Alec Jacobson # 62

  63. Spurious extrema are unstable, may “flip” slightly larger region August 9, 2012 Alec Jacobson # 63

  64. Spurious extrema are unstable, may “flip” Unconstrained [Botsch & Kobbelt, 2004] #

  65. Spurious extrema are unstable, may “flip” Unconstrained [Botsch & Kobbelt, 2004] #

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend