Advisor : Ku-Yaw Chang Speaker : Ren-Li Shen 1 2007/6/12.

Slides:



Advertisements
Similar presentations
Interactive Point-based Isosurface Exploration and High-quality Rendering Haitao Zhang Arie Kaufman Stony Brook University V I SV I S
Advertisements

Reconstruction from Voxels (GATE-540)
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Surface Reconstruction From Unorganized Point Sets
Text Scaffolds for Effective Surface Labeling Gregory Cipriano and Michael Gleicher.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Contour Tree and Small Seed Sets for Isosurface Traversal Marc van Kreveld Rene van Oostrum Chandrajit Bajaj Valerio Pascucci Daniel R. Schikore.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
lecture 4 : Isosurface Extraction
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Surface Simplification & Edgebreaker Compression for 2D Cel Animations Vivek Kwatra & Jarek Rossignac GVU Center, College of Computing Georgia Institute.
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Robust Adaptive Meshes for Implicit Surfaces Afonso Paiva Hélio Lopes Thomas Lewiner Matmidia - Departament of Mathematics – PUC-Rio Luiz Henrique de Figueiredo.
Visibility-Guided Simplification Eugene Zhang and Greg Turk GVU Center, College of Computing Georgia Institute of Technology.
Suggestive Contours Final programming assignment Advanced topics in Computer Graphics.
Fluid Surface Rendering in CUDA Andrei Monteiro Marcelo Gattass Assignment 4 June 2010.
Feature extraction Feature extraction involves finding features of the segmented image. Usually performed on a binary image produced from.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
Marching Cubes A High Resolution 3D Surface Construction Algorithm.
CSS552 Final Project Demo Peter Lam Tim Chuang. Problem Statement Our goal is to experiment with different post rendering effects (Cel Shading, Bloom.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm
Volumetric and Blobby Objects Lecture 8 (Modelling)
CS559: Computer Graphics Lecture 33: Shape Modeling Li Zhang Spring 2008.
Efficient Editing of Aged Object Textures By: Olivier Clément Jocelyn Benoit Eric Paquette Multimedia Lab.
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
University of Coimbra Reconstruction of Voxels from Sensor Data Ricardo Martins Coimbra, 19 th January 2010 Doctoral Programme in Electrical Engineering.
Surface Modeling Visualization using BrainVISA Bill Rogers UTHSCSA – Research Imaging Center.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
計算機視覺 (Computer Vision) 課程簡介 Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information Engineering Da-Yeh.
Segmentation & Modeling ImagesSegmented Images Models.
CS559: Computer Graphics Lecture 24: Shape Modeling Li Zhang Spring 2010.
Author :Monica Barbu-McInnis, Jose G. Tamez-Pena, Sara Totterman Source : IEEE International Symposium on Biomedical Imaging April 2004 Page(s): 840 -
Author : Williams, T.G. Taylor, C.J. Waterton, J.C. Holmes, A Source : Macro to Nano, 2004.IEEE International Symposium on Macro to Nano, 2004.IEEE International.
Computer Graphics Chapter 6 Andreas Savva. 2 Interactive Graphics Graphics provides one of the most natural means of communicating with a computer. Interactive.
1 Rendering translucent materials using SSS Implemented by João Pedro Jorge & Willem Frishert.
3D Object Representations
3D Volume Visualization. Volume Graphics  Maintains a 3D image representation that is close to the underlying fully-3D object (but discrete)  경계표면 (Boundary.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
Daniele D’Agostino CNR - IMATI - Sezione di Genova
Hank Childs, University of Oregon Isosurfacing (Part 3)
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Geometry Synthesis Ares Lagae Olivier Dumont Philip Dutré Department of Computer Science Katholieke Universiteit Leuven 10 August, 2004.
2006/10/25 1 A Virtual Endoscopy System Author : Author : Anna Vilanova 、 Andreas K ö nig 、 Eduard Gr ö ller Source :Machine Graphics and Vision, 8(3),
Lecture 3 : Isosurface Extraction. Isosurface Definition  Isosurface (i.e. Level Set ) :  Constant density surface from a 3D array of data  C(w) =
Quiz Week 8 Topical. Topical Quiz (Section 2) What is the difference between Computer Vision and Computer Graphics What is the difference between Computer.
Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods IEEE Transactions on Visualization and Computer Graphics Authors: Carlos.
Introduction to Meshes Lecture 22 Mon, Oct 20, 2003.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Reducing Artifacts in Surface Meshes Extracted from Binary Volumes R. Bade, O. Konrad and B. Preim efficient smoothing of iso-surface meshes Plzen - WSCG.
Slide 1Lecture Fall ‘00 Surface Modeling Types: Polygon surfaces Curved surfaces Volumes Generating models: Interactive Procedural.
1 Interactive Volume Isosurface Rendering Using BT Volumes John Kloetzli Marc Olano Penny Rheingans UMBC.
Model Optimization Wed Nov 16th 2016 Garrett Morrison.
POLYGON MESH Advance Computer Graphics
CIS 410/510: Isosurfacing (pt 2)
Team Plan/Expected Challenges
CSc4730/6730 Scientific Visualization
Local Feature Extraction Using Scale-Space Decomposition
Domain-Modeling Techniques
Maximally Stable Extremal Regions
Meshing of 3-D Data Clouds for Object Description
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Maximally Stable Extremal Regions
Three Step Geometric Pipeline
Iso-Surface extraction from red and green samples on a regular lattice
Boolean Operations for Free-form Models Represented in Geometry Images
Chap 10. Geometric Level of Detail
The Image The pixels in the image The mask The resulting image 255 X
Presentation transcript:

Advisor : Ku-Yaw Chang Speaker : Ren-Li Shen /6/12

 Introduction Mesh Marching Cubes Algorithm Class  Results  Reference /6/12

 Surface extraction Associated with image segmentation Not a segmentation technique Changes the way a segmentation is represented  Method of surface extraction Marching Cubes algorithm /6/12

 Introduction Mesh Marching Cubes Algorithm Class  Results  Reference /6/12

 Mesh N-dimensional Represent shapes in space 2D: 3D: /6/12

 Introduction Mesh Marching Cubes Algorithm Class  Results  Reference /6/12

 Idea: Create a triangular mesh that will approximate the iso-surface Calculate the normals to the surface at each vertex of the triangle  Algorithm: Locate the surface in a cube of eight pixels Calculate normals March to the next cube /6/12

8

 Introduction Mesh Marching Cubes Algorithm Class  Results  Reference /6/12

 Use class: itk::Mesh  Implements the N-dimensional mesh structure /6/12

itk::BinaryMask3DMeshSource  Construct a 3D mesh surface based on a binary mask  Construct elements  Combine elements to form the final mesh  Merge all these mesh elements into one 3D mesh  Input should be a 3D binary image /6/12

 Introduction Mesh Marching Cubes Algorithm Class  Results  Reference /6/12

 Output: 3 DICOM Files  Nodes:89675  Cells: DICOM Files  Nodes:  Cells: DICOM Files  Nodes:  Cells: /6/12

 Introduction Mesh Marching Cubes Algorithm Class  Results  Reference /6/12

1. Ibanez, Luis, et al., ”The ITK Software Guide,” U.S.A., Kitware Inc., W. E. Lorensen and H. E. Cline. “Marching cubes: A high resolution 3d surface construction algorithm.” Computer Graphics, 21(4):163–169, July /6/12