Anatomic Modeling from Unstructured Samples Using Variational Implicit Surfaces
|
|
|
- Edmund Jonas Merritt
- 10 years ago
- Views:
Transcription
1 Studies in Health Technology and Informatics, vol. 81 (Proceedings of Medicine Meets Virtual Reality J. D. Westwood, et al., eds.), Amsterdam: IOS Press, pp Anatomic Modeling from Unstructured Samples Using Variational Implicit Surfaces Terry S. Yoo 1, Bryan Morse 2, K.R. Subramanian 3, Penny Rheingans 4, Michael J. Ackerman 1 1 National Library of Medicine, National Institutes of Health, Bethesda, MD USA 2 Dept. of Computer Science, Brigham Young University, Provo UT USA 3 Dept. of Computer Science, Univ. of North Carolina Charlotte, Charlotte NC USA 4 Dept. of CSEE, Univ. Maryland Baltimore County, Baltimore MD USA 1. Introduction Abstract. We describe the use of variational implicit surfaces (level sets of an embedded generating function modeled using radial basis interpolants) in anatomic modeling. This technique allows the practitioner to employ sparsely and unevenly sampled data to represent complex biological surfaces, including data acquired as a series of non-parallel image slices. The method inherently accommodates interpolation across irregular spans. In addition, shapes with arbitrary topology are easily represented without interpolation or aliasing errors arising from discrete sampling. To demonstrate the medical use of variational implicit surfaces, we present the reconstruction of the inner surfaces of blood vessels from a series of endovascular ultrasound images. Medical data analysis and visualization often requires the representation of known segments or objects in an easily processed form. The primitives used for these representations are often either a binary voxel map or a polygonal or polyhedral representation. Each of these modeling primitives has its limitations. As a modeling representation, voxel maps are not invariant with respect to rotation or changes in scale. When arbitrarily rotating or scaling a binary voxel map, grey values will be introduced near the boundary as voxels become partially covered by the rotated or scaled bitmap, making necessary a type change from a binary-valued array to a scalar valued system. The alternative is to enforce a binary mapping of the voxel representation, accepting the subsequent sampling errors. Surface representations modeled either with polygons (or with volume structuring primitives such as tetrahedra) are invariant with respect to rotation and scale. However, if you create a close-up view of the surface representation, the discretization of the surface into planar primitives becomes apparent, and the viewed surface no longer closely approximates the desired smoothness for the representation of the model. Thus although invariant with respect to changes in scale, polygonal surface models are susceptible to artifacts and errors in the piecewise planar approximation to smooth surfaces when scaled.
2 What is desired is a smooth representation that is easily captured from a binary segmentation and that is invariant with respect to rotation, translation, and scale. Moreover, it should support resampling of the surface model at any arbitrary sampling rate to support visualization at any level of zoom or scale. We have explored the use of variational implicit surfaces as a modeling primitive for binary anatomical objects. These systems provide the necessary smooth differentiable surface models with the desired properties for robust representation of complex biological structures. 2. Background and History When viewing the 3D relationships among anatomical structures identified within medical data, researchers often apply direct volume rendering techniques [6]. The generation of surface models from volumetric information is an alternative to direct rendering and is also a common practice in the visualization of anatomy. Reconstruction of piecewise planar polygonal surface models from rectilinear volume data is frequently achieved using computationally efficient methods such as Marching Cubes [7]. However, when either of these techniques is applied to objects that are represented as binary bitmaps, sampling and discretization errors arise leading to terracing and jaggies, a prominent problem in medical imaging. Recent work in surface fitting has addressed these issues. Gibson extracts smooth surface models treating the existing binary data as a constraining element in an energyminimizing deformable surface system [4]. The resulting data structure can be used either to create Euclidean distance maps for direct volume rendering or employed directly as a polygonal surface model [5]. Whitaker has modified the constrained deformable surface model to a constrained level-set model, which creates smooth models while bypassing the need for a separate surface representation [14]. However, while these methods generate smooth representations, both the level set model and the surface net remain discretely sampled and retain the problem that they are not zoom invariant. A different modeling primitive is still needed. Turk and O Brien adapt earlier work on thin plate splines [1][2] and radial basis interpolants [3][10] to create a new technique in generating implicit surfaces [11]. Their method allows direct specification of a complex surface from sparse, irregular surface samples. The method is quite flexible and has been extended to higher dimensions to support shape interpolation [12]. However, their technique as described cannot be used to model surfaces where large numbers of surface points are included, making it unsuitable for medical applications where range data or tomographic reconstruction often lead to data described by hundreds of thousands of surface points. 3. Methods & Tools An implicit surface is defined by {`x: f(`x) = k}, k Œ, for some characteristic embedding function f : 3 Æ. Given a set of surface points C = {`c 1, `c 2, `c 3, `c n }, the variational implicit technique interpolates the smoothest possible scalar function f(`x) whose zero level set, {`x: f(`x) = 0}, passes through all points in C. That is, find the smoothest function f such that f (`x i ) = 0 for each known surface point `x i, and f (`y i ) = 1 for one or more points `y i known to be inside the shape. Following Turk and O Brien s generalization of the 2
3 problem,., given a set of positions `c i and corresponding values h i, solve for an embedding function f such that f (`c i ) = h i. by employing radial basis interpolating functions f(r) in a critically constrained linear system of n equations and n unknowns. Specifically, given a radial basis interpolating function f (r) and a series of known points where the desired function f is constrained to be f(`c i ) = h i, solve the following equation for the unknown weights d j. Expanding `c i = (c i x, c i y, c i z ), the entire linear system can be expressed as an (n+4)_(n+4) matrix M where: (1) The resulting matrix is known to be positive semi-definite, and can be solved with a linear decomposition system. Once the weights d i are found, the embedding function can be written as: (2) Depending on the differentiability of the radial basis function, f(r), f(`x) is an implicit surface generating function that can be resampled with arbitrary precision and remains invariant under rotation, translation, and zoom. (For most of this work, we have used the same radial basis function, f(r) = r 3 for r 0, used by Turk and O Brien from related research on thin-plate splines.) If the constraints `c i for f(`x) are abstracted from either a grey-level or a binary bit mask volume sampled volume, the resulting variational implicit surface is a more compact analytical representation of the same data. (3) 4. Results We have applied this method to the modeling of a bovine aorta from data acquired using an endovascular ultrasound transducer. This particular modality acquires noisy 2D image slices, sampled at uneven intervals with non-parallel orientations. The transducer is drawn slowly through the vessel, acquiring cross-sectional sonographic images (see Figure 1). 3
4 Figure 1. Cross-sectional ultrasound images of an ex-vivo bovine aorta. The slices are acquired at angles perpendicular to the endovascular catheter path. The imaging path is determined by the geometry of the blood vessel. Each individual slice is then segmented, and the aggregate contours from the tilted slices are processed to form a variational implicit surface. The resulting analytic description can be sampled and rendered using volume rendering approaches, or it can be interrogated and tesselated into a polygonal or parametric surface representation. Figure 2 shows the two views of the interior surface of the bovine aorta from Figure 1 reconstructed as a variational implicit surface. The zero-set of the implicit model has been extracted using a surface tiler, rendering them as polygons at the resolution desired for the magnification shown. If close-up views are desired, the model can easily be reinterrogated and tiled in the surface rendering case or the model simply re-rendered in a direct volume rendering system with arbitrary precision, eliminating aliasing artifacts in the representation of the model. Figure 2. Surface renderings of the interior surfaces of the ex-vivo bovine aorta reconstructed as a variationalimplicit surface from the ultrasound slices in Figure 1. The models are not subject to aliasing artifacts generated by comparable surface or volume. In addition, these models are generated from sparse, non-uniformly sampled non-parallel ultrasound slices. 5. Discussion and Future Work The radial basis function, f(r) = r 3 for r 0, advocated by Turk and O Brien is infinite in extent. It has advantages when interpolating across unpredictable spans, making it ideal for morphing and shape interpolation. However, the infinite extent leads to ill-conditioned matrices and increased computational complexity. A naïve approach is easily order O(n 3 ). 4
5 f(r) = r 3, r 0 f(r) = (1 r/s) 7 (16(r/s) 2 + 7(r/s) + 1), r < s Figure 3. Two radial basis functions. The left function f(r) = r 3, r 0 has infinite extent. The right function f(r) = (1 r/s) 7 (16(r/s) 2 + 7(r/s) + 1) is clamped to zero outside a specified radius of support s, and is proven to be C 4 continuous. The compactly supported function on the right leads to more stable numerics and faster solutions of the variational implicit surface model. In related work, we address the computational complexity of variational implicit surface modeling. Instead of f(r) = r 3 as the underlying interpolant, we address select from among a family of radial basis functions presented by Wendland [13] to find a function with the necessary continuity but also with finite, compact local support. Figure 3 shows a comparison of the 3D thin-plate-spline radial basis function and the suggested compactly supported radial basis functions of our current research. The shift from a radial basis function of infinite extent to one that has compact local support has created dramatic gains in memory utilization and computational complexity. Previous work described solutions for systems of equations of order O(n 3 ) complexity with iterative solutions capable of achieving order O(n 2 ). The shift to finite interpolants and sparse matrices has shifted the bulk of the computation toward order O(n), depending on the complexity of the model and the uniformity of the density of the surface constraints. We have measured the complexity of the matrix solution for some test cases as O(n 1.5 ). For more details, see Morse [8]. The use of compactly supported radial basis functions imposes a restriction on the maximum distance allowed between systems of surface constraints. This trade-off between speed and the granularity of the surface samples is the topic of some of our future research in this area. The infinite radial basis function permits interpolation across wide spans and with arbitrary orientations to the subsets of constraints that comprise the initial surface description. However, the costs of using this system rise with the number of points required to faithfully represent the surface. This trade-off has ramifications in the choice and precision of the segmentation algorithm to be used and the complexity of the objects to be represented. Future work on this topic includes the development of hybrid representations that incorporate both infinite and compact radial basis functions. In addition, we will explore advanced slice-based segmentation techniques with confidence in our ability to interpolated smoothly between 2D segments. It should be noted that variational implicit 5
6 surfaces can be generated as the output of segmentation systems; however, as a means of smoothly interpolating between sample slices, they can be used to initialize a deformable contour for segmenting an unknown intermediate slice. The use of variational implicit surfaces to help generate priors for segmentation systems is a current focus for some of our group. Finally, we are investigating algorithms for the automatic generation of variational implicit surface models for the anatomic structures currently identified as part of the Visible Human Project (VHP) [9]. Four hundred thirty-five (435) hand-segmented structures comprise the current segmented thorax database, with each segment modeled using an uncompressed binary bitmask. For example, the bitmask for the heart is over 400 kilobytes, alone. We are seeking a means of automatically generating compact analytical descriptions of these models using the techniques described here. 6. Conclusions Given a set of surface points C = {`c 1, `c 2, `c 3, `c n }, the variational implicit technique interpolates the smoothest possible scalar function f(`x) whose zero level set, {`x: f(`x) = 0}, passes through all points in C. These surface constraints or points can be generated from a variety of sources including segmentation systems. We show that variational implicit surfaces can be effectively used to model anatomic structures. Earlier limitations of computational and memory efficiency can been solved through a judicious selection of interpolant and improved numerics. Examples including noisy data from modalities generating curvilinear gridded data, such as endovascular ultrasound, demonstrate the utility of this technique. 7. Acknowledgements This work was performed in large part at the National Library of Medicine under a visiting faculty program supporting both Dr. Morse and Dr. Subramanian. Dr. Rheingans was supported in part by NSF CAREER Grant # We would like to thank Greg Turk for his useful conversations and for making his code available to us, upon which our implementation is based. References [1] Bookstein, F. L Morphometric tools for landmark data. Cambridge University Press [2] Duchon, J Splines minimizing rotation invariant semi-norms in Sobolev spaces, in Constructive theory of functions of several variables, Lecture Notes in Mathematics, edited by A. Dolb and B. Eckmann, Springer-Verlag, 1977, pp [3] Floater, M. S. and A. Iske Multistep scattered data interpolation using compactly supported radial basis functions. J. Comp. Appl. Math. 73, pp [4] Gibson, S Constrained elastic surface nets: generating smooth surfaces from binary segmented data, in Proceedings of Medical Image Computing and Computer Assisted Interventions (MICCAI 1998)W. M. Wells, A. Colchester, and S. Delp, eds., Lecture Notes in Computer Science 1496, Springer- Verlag, pp [5] Gibson, S Using distance maps for accurate surface representation in sampled volumes, in Proceedings of the 1998 Symposium on Volume Visualization, ACM SIGGRAPH, pp [6] Kaufman, A. Volume visualization. IEEE Computer Society Press, Los Alamitos, CA,
7 [7] Lorensen, W. and H. Cline Marching Cubes: a high-resolution 3D surface construction algorithm. In Proc. SIGGRAPH 87, Computer Graphics, 21(4), pp [8] Morse, B., T. Yoo, P. Rheingans, D. Chen, and K.R. Subramanian Complex Models Using Variational Implicit Surfaces. Submitted to Shape Modeling International [9] V. Spitzer, M. J. Ackerman, A. L. Scherzinger, and D. Whitlock The Visible Human Male: A Technical Report. J. of the Am. Medical Informatics Assoc. 3(2) [10] Szeliski, R Fast surface interpolation using hierarchical basis functions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(6): , June [11] Turk, G. and J. F. O'Brien Variational implicit surfaces, Tech Report GIT-GVU-99-15, Georgia Institute of Technology, May 1999, 9 pages. [12] Turk, G. and J. F. O Brien Shape transformation using variational implicit functions. Computer Graphics Proceedings, Annual Conference Series (SIGGRAPH 99), pp [13] Wendland, H Piecewise polynomial positive definite and compactly supported radial basis functions of minimal degree. AICM 4 (1995), pp [14] Whitaker, R Reducing Aliasing Artifacts in Iso-Surfaces of Binary Volumes. in Volume Visualization and Graphics Symposium 2000, ACM SIGGRAPH, pp
Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points
COS702; Assignment 6. Point Cloud Data Surface Interpolation University of Southern Missisippi Tyler Reese December 3, 2012
COS702; Assignment 6 Point Cloud Data Surface Interpolation University of Southern Missisippi Tyler Reese December 3, 2012 The Problem COS 702, Assignment 6: Given appropriate sets of Point Cloud data,
Interactive 3D Medical Visualization: A Parallel Approach to Surface Rendering 3D Medical Data
Interactive 3D Medical Visualization: A Parallel Approach to Surface Rendering 3D Medical Data Terry S. Yoo and David T. Chen Department of Computer Science University of North Carolina Chapel Hill, NC
Degree Reduction of Interval SB Curves
International Journal of Video&Image Processing and Network Security IJVIPNS-IJENS Vol:13 No:04 1 Degree Reduction of Interval SB Curves O. Ismail, Senior Member, IEEE Abstract Ball basis was introduced
Mean Value Coordinates
Mean Value Coordinates Michael S. Floater Abstract: We derive a generalization of barycentric coordinates which allows a vertex in a planar triangulation to be expressed as a convex combination of its
Volume visualization I Elvins
Volume visualization I Elvins 1 surface fitting algorithms marching cubes dividing cubes direct volume rendering algorithms ray casting, integration methods voxel projection, projected tetrahedra, splatting
EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
Model Repair. Leif Kobbelt RWTH Aachen University )NPUT $ATA 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS !NALYSIS OF SURFACE QUALITY
)NPUT $ATA 2ANGE 3CAN #!$ 4OMOGRAPHY 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS!NALYSIS OF SURFACE QUALITY 3URFACE SMOOTHING FOR NOISE REMOVAL 0ARAMETERIZATION 3IMPLIFICATION FOR COMPLEXITY REDUCTION
3D Modelling and Volume Rotation of 2D Medical Images
3D Modelling and Volume Rotation of 2D Medical Images Himani S. Bhatt 1, Sima K. Gonsai 2 Student (ME-CSE), Dept. of ECE, L. D. College of Engineering, Ahmedabad, India 1 Assistant Professor, Dept. of
A Short Introduction to Computer Graphics
A Short Introduction to Computer Graphics Frédo Durand MIT Laboratory for Computer Science 1 Introduction Chapter I: Basics Although computer graphics is a vast field that encompasses almost any graphical
We can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model
CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significant
Computer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics CS 54 Lecture 1 (Part 1) Curves Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) So Far Dealt with straight lines and flat surfaces Real world objects include
Interactive Level-Set Segmentation on the GPU
Interactive Level-Set Segmentation on the GPU Problem Statement Goal Interactive system for deformable surface manipulation Level-sets Challenges Deformation is slow Deformation is hard to control Solution
Lecture 9: Geometric map transformations. Cartographic Transformations
Cartographic Transformations Analytical and Computer Cartography Lecture 9: Geometric Map Transformations Attribute Data (e.g. classification) Locational properties (e.g. projection) Graphics (e.g. symbolization)
DEVELOPMENT OF AN IMAGING SYSTEM FOR THE CHARACTERIZATION OF THE THORACIC AORTA.
DEVELOPMENT OF AN IMAGING SYSTEM FOR THE CHARACTERIZATION OF THE THORACIC AORTA. Juan Antonio Martínez Mera Centro Singular de Investigación en Tecnoloxías da Información Universidade de Santiago de Compostela
Dual Marching Cubes: Primal Contouring of Dual Grids
Dual Marching Cubes: Primal Contouring of Dual Grids Scott Schaefer and Joe Warren Rice University 6100 Main St. Houston, TX 77005 [email protected] and [email protected] Abstract We present a method for
Modelling with Implicit Surfaces that Interpolate
Modelling with Implicit Surfaces that Interpolate Greg Turk GVU Center, College of Computing Georgia Institute of Technology James F O Brien EECS, Computer Science Division University of California, Berkeley
(Refer Slide Time: 1:42)
Introduction to Computer Graphics Dr. Prem Kalra Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture - 10 Curves So today we are going to have a new topic. So far
A Generalized Marching Cubes Algorithm Based On Non-Binary Classifications
Konrad-Zuse-Zentrum fu r Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany HANS-CHRISTIAN HEGE DETLEV STALLING MARTIN SEEBASS MALTE ZOCKLER A Generalized Marching Cubes Algorithm Based
Robust NURBS Surface Fitting from Unorganized 3D Point Clouds for Infrastructure As-Built Modeling
81 Robust NURBS Surface Fitting from Unorganized 3D Point Clouds for Infrastructure As-Built Modeling Andrey Dimitrov 1 and Mani Golparvar-Fard 2 1 Graduate Student, Depts of Civil Eng and Engineering
Curves and Surfaces. Goals. How do we draw surfaces? How do we specify a surface? How do we approximate a surface?
Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] Goals How do we draw surfaces? Approximate with polygons Draw polygons
Part-Based Recognition
Part-Based Recognition Benedict Brown CS597D, Fall 2003 Princeton University CS 597D, Part-Based Recognition p. 1/32 Introduction Many objects are made up of parts It s presumably easier to identify simple
Essential Mathematics for Computer Graphics fast
John Vince Essential Mathematics for Computer Graphics fast Springer Contents 1. MATHEMATICS 1 Is mathematics difficult? 3 Who should read this book? 4 Aims and objectives of this book 4 Assumptions made
OpenFOAM Optimization Tools
OpenFOAM Optimization Tools Henrik Rusche and Aleks Jemcov [email protected] and [email protected] Wikki, Germany and United Kingdom OpenFOAM Optimization Tools p. 1 Agenda Objective Review optimisation
RUN-LENGTH ENCODING FOR VOLUMETRIC TEXTURE
RUN-LENGTH ENCODING FOR VOLUMETRIC TEXTURE Dong-Hui Xu, Arati S. Kurani, Jacob D. Furst, Daniela S. Raicu Intelligent Multimedia Processing Laboratory, School of Computer Science, Telecommunications, and
A unified representation for interactive 3D modeling
A unified representation for interactive 3D modeling Dragan Tubić, Patrick Hébert, Jean-Daniel Deschênes and Denis Laurendeau Computer Vision and Systems Laboratory, University Laval, Québec, Canada [tdragan,hebert,laurendeau]@gel.ulaval.ca
FACIAL RIGGING FOR 3D CHARACTER
FACIAL RIGGING FOR 3D CHARACTER Matahari Bhakti Nendya 1, Eko Mulyanto Yuniarno 2 and Samuel Gandang Gunanto 3 1,2 Department of Electrical Engineering, Institut Teknologi Sepuluh Nopember, Surabaya, Indonesia
2.5 Physically-based Animation
2.5 Physically-based Animation 320491: Advanced Graphics - Chapter 2 74 Physically-based animation Morphing allowed us to animate between two known states. Typically, only one state of an object is known.
From Scattered Samples to Smooth Surfaces
From Scattered Samples to Smooth Surfaces Kai Hormann 1 California Institute of Technology (a) (b) (c) (d) Figure 1: A point cloud with 4,100 scattered samples (a), its triangulation with 7,938 triangles
Multiphysics Software Applications in Reverse Engineering
Multiphysics Software Applications in Reverse Engineering *W. Wang 1, K. Genc 2 1 University of Massachusetts Lowell, Lowell, MA, USA 2 Simpleware, Exeter, United Kingdom *Corresponding author: University
NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS
NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document
Introduction to Computer Graphics
Introduction to Computer Graphics Torsten Möller TASC 8021 778-782-2215 [email protected] www.cs.sfu.ca/~torsten Today What is computer graphics? Contents of this course Syllabus Overview of course topics
Applications to Data Smoothing and Image Processing I
Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is
MATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 7: Conditionally Positive Definite Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 [email protected] MATH 590 Chapter
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and
Prentice Hall Algebra 2 2011 Correlated to: Colorado P-12 Academic Standards for High School Mathematics, Adopted 12/2009
Content Area: Mathematics Grade Level Expectations: High School Standard: Number Sense, Properties, and Operations Understand the structure and properties of our number system. At their most basic level
Representing Geography
3 Representing Geography OVERVIEW This chapter introduces the concept of representation, or the construction of a digital model of some aspect of the Earth s surface. The geographic world is extremely
Fast and Robust Normal Estimation for Point Clouds with Sharp Features
1/37 Fast and Robust Normal Estimation for Point Clouds with Sharp Features Alexandre Boulch & Renaud Marlet University Paris-Est, LIGM (UMR CNRS), Ecole des Ponts ParisTech Symposium on Geometry Processing
3D Distance from a Point to a Triangle
3D Distance from a Point to a Triangle Mark W. Jones Technical Report CSR-5-95 Department of Computer Science, University of Wales Swansea February 1995 Abstract In this technical report, two different
MEng, BSc Applied Computer Science
School of Computing FACULTY OF ENGINEERING MEng, BSc Applied Computer Science Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give a machine instructions
A Robust Method for Solving Transcendental Equations
www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
CSE 167: Lecture 13: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011
CSE 167: Introduction to Computer Graphics Lecture 13: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011 Announcements Homework project #6 due Friday, Nov 18
Constrained Tetrahedral Mesh Generation of Human Organs on Segmented Volume *
Constrained Tetrahedral Mesh Generation of Human Organs on Segmented Volume * Xiaosong Yang 1, Pheng Ann Heng 2, Zesheng Tang 3 1 Department of Computer Science and Technology, Tsinghua University, Beijing
How To Create A Surface From Points On A Computer With A Marching Cube
Surface Reconstruction from a Point Cloud with Normals Landon Boyd and Massih Khorvash Department of Computer Science University of British Columbia,2366 Main Mall Vancouver, BC, V6T1Z4, Canada {blandon,khorvash}@cs.ubc.ca
Simultaneous Gamma Correction and Registration in the Frequency Domain
Simultaneous Gamma Correction and Registration in the Frequency Domain Alexander Wong [email protected] William Bishop [email protected] Department of Electrical and Computer Engineering University
A Fuzzy System Approach of Feed Rate Determination for CNC Milling
A Fuzzy System Approach of Determination for CNC Milling Zhibin Miao Department of Mechanical and Electrical Engineering Heilongjiang Institute of Technology Harbin, China e-mail:[email protected]
Lecture 7 - Meshing. Applied Computational Fluid Dynamics
Lecture 7 - Meshing Applied Computational Fluid Dynamics Instructor: André Bakker http://www.bakker.org André Bakker (2002-2006) Fluent Inc. (2002) 1 Outline Why is a grid needed? Element types. Grid types.
Modelling 3D Avatar for Virtual Try on
Modelling 3D Avatar for Virtual Try on NADIA MAGNENAT THALMANN DIRECTOR MIRALAB UNIVERSITY OF GENEVA DIRECTOR INSTITUTE FOR MEDIA INNOVATION, NTU, SINGAPORE WWW.MIRALAB.CH/ Creating Digital Humans Vertex
High-accuracy ultrasound target localization for hand-eye calibration between optical tracking systems and three-dimensional ultrasound
High-accuracy ultrasound target localization for hand-eye calibration between optical tracking systems and three-dimensional ultrasound Ralf Bruder 1, Florian Griese 2, Floris Ernst 1, Achim Schweikard
Interactive Level-Set Deformation On the GPU
Interactive Level-Set Deformation On the GPU Institute for Data Analysis and Visualization University of California, Davis Problem Statement Goal Interactive system for deformable surface manipulation
Max-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
Constrained curve and surface fitting
Constrained curve and surface fitting Simon Flöry FSP-Meeting Strobl (June 20, 2006), [email protected], Vienna University of Technology Overview Introduction Motivation, Overview, Problem
MEng, BSc Computer Science with Artificial Intelligence
School of Computing FACULTY OF ENGINEERING MEng, BSc Computer Science with Artificial Intelligence Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give
Department of Computer Science
113 Department of Computer Science Chairperson: Nasri, Ahmad H. Professor: Nasri, Ahmad H. Associate Professors: Attie, Paul C.; Karam, Marcel R.; Turkiyyah, George M. Assistant Professors: Abu Salem,
How To Smoothear Data With A Radial Basis Function (Rf)
Smooth surface reconstruction from noisy range data J. C. Carr 1 R. K. Beatson 2 B. C. McCallum 1 W. R. Fright 1 T. J. McLennan 1 T. J. Mitchell 1 1 Applied Research Associates NZ Ltd 2 University of Canterbury
MATHEMATICS (MATH) 3. Provides experiences that enable graduates to find employment in sciencerelated
194 / Department of Natural Sciences and Mathematics MATHEMATICS (MATH) The Mathematics Program: 1. Provides challenging experiences in Mathematics, Physics, and Physical Science, which prepare graduates
Overview Motivation and applications Challenges. Dynamic Volume Computation and Visualization on the GPU. GPU feature requests Conclusions
Module 4: Beyond Static Scalar Fields Dynamic Volume Computation and Visualization on the GPU Visualization and Computer Graphics Group University of California, Davis Overview Motivation and applications
ENG4BF3 Medical Image Processing. Image Visualization
ENG4BF3 Medical Image Processing Image Visualization Visualization Methods Visualization of medical images is for the determination of the quantitative information about the properties of anatomic tissues
Advanced visualization with VisNow platform Case study #2 3D scalar data visualization
Advanced visualization with VisNow platform Case study #2 3D scalar data visualization This work is licensed under a Creative Commons Attribution- NonCommercial-NoDerivatives 4.0 International License.
COMP175: Computer Graphics. Lecture 1 Introduction and Display Technologies
COMP175: Computer Graphics Lecture 1 Introduction and Display Technologies Course mechanics Number: COMP 175-01, Fall 2009 Meetings: TR 1:30-2:45pm Instructor: Sara Su ([email protected]) TA: Matt Menke
Visualization of Adaptive Mesh Refinement Data with VisIt
Visualization of Adaptive Mesh Refinement Data with VisIt Gunther H. Weber Lawrence Berkeley National Laboratory VisIt Richly featured visualization and analysis tool for large data sets Built for five
How To Program With Adaptive Vision Studio
Studio 4 intuitive powerful adaptable software for machine vision engineers Introduction Adaptive Vision Studio Adaptive Vision Studio software is the most powerful graphical environment for machine vision
Math 241, Exam 1 Information.
Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)
Finite Element Formulation for Plates - Handout 3 -
Finite Element Formulation for Plates - Handout 3 - Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than the
Twelve. Figure 12.1: 3D Curved MPR Viewer Window
Twelve The 3D Curved MPR Viewer This Chapter describes how to visualize and reformat a 3D dataset in a Curved MPR plane: Curved Planar Reformation (CPR). The 3D Curved MPR Viewer is a window opened from
TWO-DIMENSIONAL TRANSFORMATION
CHAPTER 2 TWO-DIMENSIONAL TRANSFORMATION 2.1 Introduction As stated earlier, Computer Aided Design consists of three components, namely, Design (Geometric Modeling), Analysis (FEA, etc), and Visualization
Point Lattices in Computer Graphics and Visualization how signal processing may help computer graphics
Point Lattices in Computer Graphics and Visualization how signal processing may help computer graphics Dimitri Van De Ville Ecole Polytechnique Fédérale de Lausanne Biomedical Imaging Group [email protected]
Building 3D anatomical scenes on the Web
Building 3D anatomical scenes on the Web F. Evesque, S. Gerlach, R. D. Hersch Ecole Polytechnique Fédérale de Lausanne (EPFL) http://visiblehuman.epfl.ch Abstract We propose a new service for building
SECONDARY STORAGE TERRAIN VISUALIZATION IN A CLIENT-SERVER ENVIRONMENT: A SURVEY
SECONDARY STORAGE TERRAIN VISUALIZATION IN A CLIENT-SERVER ENVIRONMENT: A SURVEY Kai Xu and Xiaofang Zhou School of Information Technology and Electrical Engineering The University of Queensland, Brisbane,
Piecewise Cubic Splines
280 CHAP. 5 CURVE FITTING Piecewise Cubic Splines The fitting of a polynomial curve to a set of data points has applications in CAD (computer-assisted design), CAM (computer-assisted manufacturing), and
Volumetric Meshes for Real Time Medical Simulations
Volumetric Meshes for Real Time Medical Simulations Matthias Mueller and Matthias Teschner Computer Graphics Laboratory ETH Zurich, Switzerland [email protected], http://graphics.ethz.ch/ Abstract.
Classifying Manipulation Primitives from Visual Data
Classifying Manipulation Primitives from Visual Data Sandy Huang and Dylan Hadfield-Menell Abstract One approach to learning from demonstrations in robotics is to make use of a classifier to predict if
Lecture Notes, CEng 477
Computer Graphics Hardware and Software Lecture Notes, CEng 477 What is Computer Graphics? Different things in different contexts: pictures, scenes that are generated by a computer. tools used to make
Least-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
H.Calculating Normal Vectors
Appendix H H.Calculating Normal Vectors This appendix describes how to calculate normal vectors for surfaces. You need to define normals to use the OpenGL lighting facility, which is described in Chapter
INTEGRAL METHODS IN LOW-FREQUENCY ELECTROMAGNETICS
INTEGRAL METHODS IN LOW-FREQUENCY ELECTROMAGNETICS I. Dolezel Czech Technical University, Praha, Czech Republic P. Karban University of West Bohemia, Plzeft, Czech Republic P. Solin University of Nevada,
B2.53-R3: COMPUTER GRAPHICS. NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions.
B2.53-R3: COMPUTER GRAPHICS NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF ANSWER
Segmentation of building models from dense 3D point-clouds
Segmentation of building models from dense 3D point-clouds Joachim Bauer, Konrad Karner, Konrad Schindler, Andreas Klaus, Christopher Zach VRVis Research Center for Virtual Reality and Visualization, Institute
Computer Animation and Visualisation. Lecture 1. Introduction
Computer Animation and Visualisation Lecture 1 Introduction 1 Today s topics Overview of the lecture Introduction to Computer Animation Introduction to Visualisation 2 Introduction (PhD in Tokyo, 2000,
Finite Element Formulation for Beams - Handout 2 -
Finite Element Formulation for Beams - Handout 2 - Dr Fehmi Cirak (fc286@) Completed Version Review of Euler-Bernoulli Beam Physical beam model midline Beam domain in three-dimensions Midline, also called
Computer Aided Systems
5 Computer Aided Systems Ivan Kuric Prof. Ivan Kuric, University of Zilina, Faculty of Mechanical Engineering, Department of Machining and Automation, Slovak republic, [email protected] 1.1 Introduction
Heat Kernel Signature
INTODUCTION Heat Kernel Signature Thomas Hörmann Informatics - Technische Universität ünchen Abstract Due to the increasing computational power and new low cost depth cameras the analysis of 3D shapes
High Quality Image Magnification using Cross-Scale Self-Similarity
High Quality Image Magnification using Cross-Scale Self-Similarity André Gooßen 1, Arne Ehlers 1, Thomas Pralow 2, Rolf-Rainer Grigat 1 1 Vision Systems, Hamburg University of Technology, D-21079 Hamburg
Computer Applications in Textile Engineering. Computer Applications in Textile Engineering
3. Computer Graphics Sungmin Kim http://latam.jnu.ac.kr Computer Graphics Definition Introduction Research field related to the activities that includes graphics as input and output Importance Interactive
Data Mining: Exploring Data. Lecture Notes for Chapter 3. Introduction to Data Mining
Data Mining: Exploring Data Lecture Notes for Chapter 3 Introduction to Data Mining by Tan, Steinbach, Kumar Tan,Steinbach, Kumar Introduction to Data Mining 8/05/2005 1 What is data exploration? A preliminary
Intersection of a Line and a Convex. Hull of Points Cloud
Applied Mathematical Sciences, Vol. 7, 213, no. 13, 5139-5149 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.213.37372 Intersection of a Line and a Convex Hull of Points Cloud R. P. Koptelov
FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM
International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT
3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials
3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines
A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS
A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors
Topological Data Analysis Applications to Computer Vision
Topological Data Analysis Applications to Computer Vision Vitaliy Kurlin, http://kurlin.org Microsoft Research Cambridge and Durham University, UK Topological Data Analysis quantifies topological structures
POISSON AND LAPLACE EQUATIONS. Charles R. O Neill. School of Mechanical and Aerospace Engineering. Oklahoma State University. Stillwater, OK 74078
21 ELLIPTICAL PARTIAL DIFFERENTIAL EQUATIONS: POISSON AND LAPLACE EQUATIONS Charles R. O Neill School of Mechanical and Aerospace Engineering Oklahoma State University Stillwater, OK 74078 2nd Computer
Computer Aided Liver Surgery Planning Based on Augmented Reality Techniques
Computer Aided Liver Surgery Planning Based on Augmented Reality Techniques Alexander Bornik 1, Reinhard Beichel 1, Bernhard Reitinger 1, Georg Gotschuli 2, Erich Sorantin 2, Franz Leberl 1 and Milan Sonka
Support Vector Machines with Clustering for Training with Very Large Datasets
Support Vector Machines with Clustering for Training with Very Large Datasets Theodoros Evgeniou Technology Management INSEAD Bd de Constance, Fontainebleau 77300, France [email protected] Massimiliano
3D Model of the City Using LiDAR and Visualization of Flood in Three-Dimension
3D Model of the City Using LiDAR and Visualization of Flood in Three-Dimension R.Queen Suraajini, Department of Civil Engineering, College of Engineering Guindy, Anna University, India, [email protected]
Jiří Matas. Hough Transform
Hough Transform Jiří Matas Center for Machine Perception Department of Cybernetics, Faculty of Electrical Engineering Czech Technical University, Prague Many slides thanks to Kristen Grauman and Bastian
