Mesh ColorizationAuthor: George Leifman and Ayellet TalEUROGRAPHICS 2012, May in ItalySpeaker: Chung-Yuan LeeYuan-Ze Unive...
Outline Introduction Proposed method    ◦ Basic algorithm      Vertex similarity      Color propagation    ◦ Feature l...
IntroductionA novel algorithm for colorization ofmeshes.
Basic algorithm   Vertex similarity◦ Step1. Vertex descriptor◦ Use spin image to describe vertex  spreading.
2D histograms
Use a relatively small support region,                      by setting α=β=8
Basic algorithm   Step2. Similarity measureModel the difference between twohistogramswhere
 σ is a constant standard deviation for  the Gaussian filter ϕ The notation     denotes half size  down-sampling

Basic algorithm                      1
Basic algorithm   Color propagationFor each color channel C in the YUV colorspace,the method minimize the following cost ...
The result might include color bleeding near theboundaries !
Feature line field Definition For neighboring points that belong to the  same region, the directions of the  associated ...
Feature line field Computation This method describe the computation  for the case of valleys.
Surrounding face                Feature line field direction lies on the                line perpendicular to the edge adj...
Similarity measure adjustment
ԑis set to half of the shortest edge of themeshCase1:Case2:
Result
Reference[1] “Spin Images”    ◦ Georgios Papadimitriou [2] Ridge-Valley Lines on Meshes via  Implicit Surface Fitting ...
Mesh colorization presentation
Mesh colorization presentation
Mesh colorization presentation
Upcoming SlideShare
Loading in …5
×

Mesh colorization presentation

488 views

Published on

Mesh colorization presentation
by Chung-Yuan Lee from Yuan-Ze University, Taiwan

Published in: Education, Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
488
On SlideShare
0
From Embeds
0
Number of Embeds
5
Actions
Shares
0
Downloads
8
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Mesh colorization presentation

  1. 1. Mesh ColorizationAuthor: George Leifman and Ayellet TalEUROGRAPHICS 2012, May in ItalySpeaker: Chung-Yuan LeeYuan-Ze University
  2. 2. Outline Introduction Proposed method ◦ Basic algorithm  Vertex similarity  Color propagation ◦ Feature line field Result Reference
  3. 3. IntroductionA novel algorithm for colorization ofmeshes.
  4. 4. Basic algorithm Vertex similarity◦ Step1. Vertex descriptor◦ Use spin image to describe vertex spreading.
  5. 5. 2D histograms
  6. 6. Use a relatively small support region, by setting α=β=8
  7. 7. Basic algorithm Step2. Similarity measureModel the difference between twohistogramswhere
  8. 8.  σ is a constant standard deviation for the Gaussian filter ϕ The notation denotes half size down-sampling
  9. 9.
  10. 10. Basic algorithm 1
  11. 11. Basic algorithm Color propagationFor each color channel C in the YUV colorspace,the method minimize the following cost function.This equation constraint that two neighboringvertices should have similar colors if theirgeometry is similar.
  12. 12. The result might include color bleeding near theboundaries !
  13. 13. Feature line field Definition For neighboring points that belong to the same region, the directions of the associated vectors should have similar orientations. And vice versa!
  14. 14. Feature line field Computation This method describe the computation for the case of valleys.
  15. 15. Surrounding face Feature line field direction lies on the line perpendicular to the edge adjacent to itSolve the Laplace’s equation The average of all the field vectors computed for each face independently
  16. 16. Similarity measure adjustment
  17. 17. ԑis set to half of the shortest edge of themeshCase1:Case2:
  18. 18. Result
  19. 19. Reference[1] “Spin Images” ◦ Georgios Papadimitriou [2] Ridge-Valley Lines on Meshes via Implicit Surface Fitting ◦ Yutaka Ohtake , Alexander Belyaev ◦ Hans-Peter Seidel 2

×