Quadrilateral Meshes for Finite Element-Based Image Registration
|
|
- Lesley Wheeler
- 5 years ago
- Views:
Transcription
1 Quadrilateral Meshes for Finite Element-Based Image Registration Marcelo Siqueira 1, Tessa Sundaram 1, Suneeta Ramaswami 2, Jean Gallier 1,and James Gee 1 1 University of Pennsylvania, Philadelphia, PA 19104, USA {marcelos,tessa}@seas.upenn.edu 2 Rutgers University, Camden, NJ 08102, USA Abstract. The use of finite element (FE) analysis in biomedical research has prompted the need to construct meshes from images. Despite the availability of several tools for generating meshes for FE-based applications, most are not directly applicable to image data. Additionally, they may not produce good-quality meshes when presented with geometrically complex domains such as those in the human body. Here we investigate the construction of quadrilateral meshes from 2D images of the human brain. We describe an algorithm to derive quadrangulations from triangulations of polygonal regions, an approach to construct quadrilateral finite element meshes from segmented images using the aforementioned algorithm, and an analysis of the quality and performance of the resulting meshes when applied to a FE-based image registration. 1 Introduction Image registration is the process of finding a spatial correspondence between two images, [1]. This correspondence is usually achieved by optimizing a function that balances the similarity between the image pair with the deformation caused by the applied registration transformation. Transformations can be rigid (such as translation or rotation) or non-rigid. The former are used to globally align the image pair, while the latter are necessary when regional distortions are required to effectively match the two images. Image registration has found many uses in biomedical research. For example, it can be employed to extract motion information about an organ (such as the heart or lung), [2], or to study the morphological changes caused by tumor growth within a region, [3]. Broit, [4], developed a method for non-rigid image registration in which one image, modeled as an elastic continuum, is warped to match the appearance of another. The variational formulation of the registration problem makes it possible to implement his technique using the finite element method (FEM), [5]. The FEM is a very powerful method for numerically solving differential equations or variational problems that arise during structural modeling in engineering and the applied sciences. One of its key features is the specification of a mesh over the problem domain, i.e. a subdivision of the domain into non-overlapping subdomains called finite elements. If the problem domain is a subset of the Euclidean
2 plane, triangular or quadrilateral elements are typically utilized. The accuracy of a problem s solution and the efficiency with which it is obtained using a particular FE implementation are highly dependent on a number of mesh parameters, such as element number, size, shape, connectivity, and physical behavior, [6]. Triangular meshes have been extensively investigated by the meshing community, and their theoretical properties are now well understood. Algorithms for generating provably good triangular meshes have been proposed, [7]. However, the generation of good quadrilateral meshes is not as well understood. A few algorithms exist that generate quadrilateral meshes of bounded size, [8], and bounded maximum polygonal angle, [9], but there are no known algorithms that optimize size and shape for more complex geometric domains. Such qualityguaranteed meshes are more desirable for certain FE-based applications. The use of the FEM in medical applications has led researchers to explore the construction of meshes that attempt to account for the geometric complexity of the anatomy under study. Most of the available tools for automated mesh generation cater to the construction of meshes for structural engineering applications, [10], but these are typically optimized for much simpler shapes than those encountered in biology, [11]. This paper describes an algorithm to generate anatomically adaptive quadrilateral meshes that can be used with the two-dimensional FE-based non-rigid registration method in [5]. The algorithm takes a triangular mesh built from an image segmentation as input, and produces a convex quadrangulation which preserves local variations in element size and imposes an upper bound on the number of elements in the mesh. Registrations are performed using a variety of meshes, and the results demonstrate that anatomically-specific quadrilateral meshes produce equivalent results to much denser grids of quadrilaterals in a fraction of the time. Results using brain MR data are presented here, but the algorithm is in no way restricted to any particular imaging modality or body part. 2 Preliminaries A polygonal region R is a connected region of the plane whose boundary is one polygon or the union of a finite number of disjoint polygons. When the boundary of R consists of 1 + k polygons with k>0, we say that R has k holes. Vertices and edges of a polygonal region are the vertices and edges of its bounding polygons. We denote the set of vertices (edges) of R by V (R) (E(R)). In this paper, we are primarily interested in closed and bounded polygonal regions, i.e., polygonal regions that contain their bounding polygons and for which we can define a bounding rectangle of finite size. Unless otherwise specified, we refer to these closed and bounded polygonal regions simply as polygonal regions. A triangulation T of R is a subdivision of R into triangles satisfying the following two conditions: (1) if t 1 and t 2 are two triangles of T then t 1 t 2 is either empty, a common vertex of t 1 and t 2, or a common edge of t 1 and t 2 ; and (2) the union
3 of all triangles of T,thedomain T of T,isR. We denote the set of vertices of T by V (T ). If R has n vertices and k holes, and T is a triangulation of R with m vertices such that V (R) V (T ), we have that T has t =2m +2k 2 m b triangles, where m b is the number of vertices of T and n m b m. Thedual graph of T is an undirected graph that has a vertex for each triangle of T andanedgefor each pair of adjacent triangles of T.Aspanning tree T G of an undirected graph G is a subgraph of G that is a tree and that contains all the vertices of G. A spanning tree of the dual graph of a triangulation is always a binary tree. A quadrangulation Q of R is a subdivision of R into quadrilaterals satisfying the following two conditions: (1) if q 1 and q 2 are two quadrilaterals of Q then q 1 q 2 is either empty, a common vertex of q 1 and q 2, or a common edge of q 1 and q 2 ; and (2) the union of all quadrilaterals of Q, thedomain Q of Q, is R. We denote the set of vertices of Q by V (Q). We say that Q is a convex quadrangulation of R if every quadrilateral q of Q is convex, i.e., the quadrilateral q has no angle greater than 180 degrees. If each of the four angles of every quadrilateral q in Q is strictly less than 180 degrees, we say that Q is a strictly convex quadrangulation of R. 3 Convex Quadrangulations Convex and strictly convex quadrangulations are the two classes of quadrilateral meshes that can be used in FE applications. Several algorithms for generating convex quadrangulations have been proposed, [10]. Some of these algorithms adopt an indirect approach: the polygonal region is first triangulated, and then the triangulation is converted into a convex quadrangulation of the polygonal region, [12], [13], [14], [15]. Since there are several algorithms for generating provably good triangulations of polygonal regions, quadrangulation algorithms that employ the indirect approach may take advantage of this fact by attempting to preserve the features of the input triangulation. Johnston et al., [12], introduced an algorithm that uses several heuristics for automatically converting a triangulation of a general polygonal region into a strictly convex quadrangulation. Their algorithm runs in O(t 2 ) for a triangulation with t triangles. Everett et al., [13], presented an algorithm that generates at most 8t 3 strictly convex quadrilaterals and runs in linear time in t. Shimada et al., [14], proposed an indirect algorithm that optimizes several mesh quality criteria, but becomes very expensive when quadrangulating polygonal regions with complex geometry. Owen et al., [15], presented another indirect algorithm that considers some of the mesh quality criteria in [14] during the conversion process. Their algorithm has the advantage of being simpler than the latter, and has been implemented in commercial software. However, it does not guarantee a bounded-size output quadrangulation, even though it accounts for mesh quality. It is unclear how the size and quality of the output quadrangulation would be affected by an input triangulation of a complex domain.
4 Ramaswami et al., [8], presented an algorithm called Q-percolation for converting triangulations of general polygonal regions into bounded-size quadrangulations, where the bounds are considerably better than those in [13]. However, Q-percolation does not guarantee that the output quadrangulation is convex. By modifying the Q-percolation algorithm, we have developed a new algorithm (CQpercolation) that converts triangulations of general polygonal regions with holes into convex quadrangulations. CQ-percolation always generates convex quadrangulations with at most 3t 2 quadrilaterals, which is a better bound than the one in [13]. CQ-percolation also preserves the local element size variation of the input triangulation, which is highly desirable if the input triangulation was built to adaptively subdivide the polygonal region. The underlying premise of both Q-percolation and CQ-percolation is to quadrangulate a small group of triangles at a time until the entire quadrangulation is complete. Each group represents a triangulation of a small, simple polygonal region, such as a non-convex quadrilateral, pentagon, hexagon, or septagon. Both algorithms form a group of triangles at a time and convert it into a partial or complete quadrangulation before considering the next group. By using a spanning tree of the dual graph of the input triangulation, Q-percolation and CQ-percolation systematically group triangles together so that no isolated triangles remain in the resulting decomposition. The two algorithms differ somewhat in their approaches to the grouping and conversion processes. (a) (b) (c) Fig. 1. Mesh generation from image contours. (a) Contours from a segmented image. (b) Triangulation. (c) Quadrangulation. Although CQ-percolation does not take into account the shape quality of the quadrilaterals produced, our registration results in Sec. 5 show that the quality of the output quadrangulations is comparable to those of their triangular counterparts. By using well-known methods to improve and smooth mesh topology, we further improve our mesh quality by making our quadrangulations strictly convex.
5 4 Meshes from Images In order to use our quadrangulation algorithm to generate a mesh from an image, we must first triangulate the image domain. Since most triangulation algorithms take a polygonal region as input, we must convert the raw, pixel-based representation of an image into a polygonal representation. This is done by segmenting the image and then generating a closed polygonal contour for every distinct anatomic boundary of interest. The contours are generated by adaptively sampling the set of pixels defining each boundary, and then connecting them with straight line segments. The resulting polygonal contours are always disjoint, but may define several nested layers of polygonal contours. Figure 1a shows the contours obtained from a segmented image of a human brain. Once we have the contours of each distinct anatomic feature of the segmented image, we group them together to define polygonal regions. Next, we generate a triangular mesh for each polygonal region. This must be done systematically since the triangulation and quadrangulation algorithms are allowed to insert points in the polygonal contours. We first mesh the innermost polygonal regions, and only allow insertion of vertices in the outer contours of the polygonal regions. This protects any contours that are part of a polygonal region that has already been meshed. Figure 1b shows a triangular mesh built from the polygonal regions defined by the contours in figure 1a, and figure 1c shows the quadrilateral mesh obtained by CQ-percolation of the triangular mesh. Note that there is a rectangular contour enclosing the contours defining the actual image. This rectangular contour is intentionally inserted to support the image registration algorithm. 5 Results (a) (b) (c) (d) Fig. 2. Inputs to and outputs from the FE-based registration using a particular quadrangulation. (a) Coronal brain MR image. (b) Warped version of (a) with quadrilateral mesh overlaid. (c) Registration result using the mesh in (b). (d) RMS error between (b) and (c). In order to evaluate the quadrilateral meshes generated by our algorithm, we performed a quantitative, registration-based analysis using a pair (A, B) of 2D
6 images of the human brain. A (figure 2a) was a 256x256-pixel coronal MR image, and B (figure 2b) was the result of applying a cubic polynomial warp to A. We used the approach described in Section 4 to generate a variety of triangular and quadrilateral meshes of A and B. Next, we used these meshes to register A to B with the FE-based elastic registration method in the Insight Segmentation and Registration Toolkit (ITK) ( Mesh #Elements #Vertices #Int. Pts. Runtime (s) RMS Table 1. Summary of registration results using different types of meshes. Meshes 1 4 are triangular meshes. Meshes 5 8 are uniform grids of quadrilaterals with 8 8, 4 4, 2 2 and 1 1 pixel elements, respectively. Meshes 9 12 are quadrilateral meshes generated by the algorithm in Sec. 3 and the approach in Sec. 4 from triangular meshes 1 4, respectively. Meshes are the result of topological and geometric improvements over meshes 9 12, respectively. We created triangulations with minimum angles of 20 o,25 o,30 o,and33 o using Triangle, [16], a publicly available mesh generator. These meshes served as inputs to our quadrangulation algorithm. We also used quadrilateral meshes whose elements were arranged in uniform grids of various resolutions; these were generated automatically within the registration application. Each mesh was sampled using different numbers of integration points (required by the FE code for Gaussian integration over the element) to examine the relationship between element size and number of integration points with respect to registration accuracy. All registrations were run for 20 iterations on a PC with an Intel Pentium III processor running Windows 98. We evaluated the results of the registrations by
7 calculating the RMS (root mean squared) difference between the intensity values of corresponding pixels over the entire image domain of (A, B). Each row in table 1 shows the results obtained for a particular mesh and number of integration points. The meshes generated by our quadrangulation algorithm contain about 60% as many elements as their input triangulations, although the quadrilateral meshes have more vertices. This reduction in element density does not appear to affect the RMS error of the registration, since the triangular and quadrilateral meshes perform comparably. However, the runtimes for the quadrilateral meshes are slightly higher than those of their triangular counterparts. This is most likely due to the higher vertex number in the quadrilateral meshes as well as the added expense of computing solutions using quadrilaterals in the FE code. As seen in figure 2d, the majority of the RMS error is associated with edge mismatch along the sulci of the brain. The remainder of the image is well-matched by the registration. Note that meshes 11 and 15 have less than 75% as many quadrilaterals as mesh 6 but still report a lower RMS. This result supports the observation that anatomically-adapted meshes provide better registration results in less time than uniform grids of similar size. This is mainly due to the fact that adaptive meshes, such as meshes 1 4 and 9 16, can approximate the inherent geometry of an image more precisely and position smaller elements along the boundary (where an accurate warp is more difficult to compute). In addition, by using adaptive meshes in which every element belongs to only one region, we easily support the modeling of different image regions with anatomically appropriate material properties. This is more difficult to achieve using uniform grids without dramatically increasing both the mesh resolution and, consequently, the runtime (see mesh 8). 6 Conclusions and Future Work We present an algorithm to convert triangulations of polygonal regions with polygonal holes into convex quadrangulations. Our algorithm has a runtime linear in the number of triangles, and offers better bounds than similar algorithms that also produce strictly convex quadrilateral meshes of bounded size. Using this algorithm and traditional techniques to improve mesh quality, we describe an approach for generating strictly convex quadrilateral meshes that approximate the geometry of an image and prevent elements from belonging to more than one distinct image region. In addition, we discuss a quantitative analysis of these quadrilateral meshes, their triangular counterparts and uniform grids, using a particular implementation of a FE-based, image registration method. Our analysis demonstrates that less dense quadrilateral meshes derived from triangulations effectively capture the transformation of one image into another compared to triangular and uniform quadrilateral meshes of similar density. Future work will focus on registering additional pairs of images with this protocol, incorporating anatomically appropriate material properties into the scheme, improving correspondence along image boundaries and rigorously ex-
8 amining bounds on angles of quadrilateral meshes generated from triangular meshes with quality constraints. References 1. Maintz, J.B.A., Viergever, M.A.: A survey of medical image registration. Medical Image Analysis 2 (1998) Gee, J., Sundaram, T., Hasegawa, I., Uematsu, H., Hatabu, H.: Characterization of Regional Pulmonary Mechanics from Serial MR Data. In T. Dohi, R.K., ed.: Medical Image Computing and Computer-Assisted Intervention - MICCAI (2002) Rueckert, D., Sonada, L.I., Hayes, C., Hill, D.L.G., Leach, M.O., Hawkes, D.J.: Nonrigid Registration Using Free-Form Deformations: Application to Breast MR Images. IEE Transactions on Medical Imaging 18 (1999) Broit, C.: Optimal Registration of Deformed Images. PhD thesis, Department of Information and Computer Science, University of Pennsylvania, Philadelphia, PA, USA (1981) 5. Gee, J., Bajcsy, R.: Elastic Matching: Continuum Mechanical and Probabilistic Analysis. In Toga, A., ed.: Brain Warping. Academic Press (1999) 6. Bern, M., Plassmann, P.: Mesh Generation. In Sack, J., Urrutia, J., eds.: Handbook of Computational Geometry. Elsevier Science (1999) 7. Bern, M., Eppstein, D.: Mesh Generation and Optimal Triangulation. In Hwang, F., Du, D.Z., eds.: Computing in Euclidean Geometry. World Scientific (1992) 8. Ramaswami, S., Ramos, P., Toussaint, G.: Converting Triangulations to Quadrangulations. Computational Geometry: Theory and Applications 9 (1998) Bern, M., Eppstein, D.: Quadrilateral Meshing by Circle Packing. In: Proceedings of the 6 th International Meshing Roundtable. (1997) Owen, S.: A Survey of Unstructured Mesh Generation Technology. In: Proceedings of the 7 th International Meshing Roundtable, Dearborn, MI (1998) Mohamed, A., Davatzikos, C.: A Simple Approach for Three-Dimensional Finite- Element Mesh Generation from Segmented Medical Images. submitted to Computer Vision and Pattern Recognition, 2003 (2003) 12. Johnston, B., Sullivan, J., Kwasnik, A.: Automatic Conversion of Triangular Finite Meshes to Quadrilateral Meshes. International Journal of Numerical Methods in Engineering 31 (1991) Everett, H., Lenhart, W., Overmars, M., Shermer, T., Urrutia, J.: Strictly Convex Quadrilateralizations of Polygons. In: Proceedings of the 4 th Canadian Conference on Computational Geometry. (1992) Shimada, K., Liao, J.H., Itoh, T.: Quadrilateral Meshing with Directionality Control through the Packing of Square Cells. In: Proceedings of the 7 th International Meshing Roundtable, Dearborn, Michigan, USA (1998) Owen, S., Staten, M., Cannan, S., Saigal, S.: Advancing Front Quadrilateral Meshing Using Triangle Transformations. In: Proceedings of the 7 th International Meshing Roundtable, Dearborn, Michigan, USA (1998) Shewchuk, J.: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In: First Workshop on Applied Computational Geometry, Philadelphia, PA, USA (1996)
Linear Complexity Hexahedral Mesh Generation
Linear Complexity Hexahedral Mesh Generation David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 http://www.ics.uci.edu/ eppstein/ Tech. Report 95-51
More informationA NEW ALGORITHM FOR GENERATING QUADRILATERAL MESHES AND ITS APPLICATION TO FE-BASED IMAGE REGISTRATION
A NEW ALGORITHM FOR GENERATING QUADRILATERAL MESHES AND ITS APPLICATION TO FE-BASED IMAGE REGISTRATION S. Ramaswami 1 M. Siqueira 2 3 T. Sundaram 2 J. Gallier 2 J. Gee 2 1 Rutgers Uniersity, Camden, NJ
More informationMöbius Transformations in Scientific Computing. David Eppstein
Möbius Transformations in Scientific Computing David Eppstein Univ. of California, Irvine School of Information and Computer Science (including joint work with Marshall Bern from WADS 01 and SODA 03) Outline
More informationQuadrilateral Meshing by Circle Packing
Quadrilateral Meshing by Circle Packing Marshall Bern 1 David Eppstein 2 Abstract We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the
More informationcoding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight
Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image
More informationTiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research
Tiling Three-Dimensional Space with Simplices Shankar Krishnan AT&T Labs - Research What is a Tiling? Partition of an infinite space into pieces having a finite number of distinct shapes usually Euclidean
More information2) For any triangle edge not on the boundary, there is exactly one neighboring
Triangulating Trimmed NURBS Surfaces Chang Shu and Pierre Boulanger Abstract. This paper describes techniques for the piecewise linear approximation of trimmed NURBS surfaces. The problem, called surface
More informationSome Open Problems in Graph Theory and Computational Geometry
Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research
More informationAn Efficient Paving Method of Pure Quad Mesh Generation
2016 International Conference on Intelligent Manufacturing and Materials (ICIMM 2016) ISBN: 978-1-60595-363-2 An Efficient Paving Method of Pure Quad Mesh Generation Yongcai Liu, Wenliang Chen and Yidong
More informationarxiv:cs/ v1 [cs.cg] 13 Jun 2001
Hinged Kite Mirror Dissection David Eppstein arxiv:cs/0106032v1 [cs.cg] 13 Jun 2001 Abstract Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases
More informationNonrigid Registration using Free-Form Deformations
Nonrigid Registration using Free-Form Deformations Hongchang Peng April 20th Paper Presented: Rueckert et al., TMI 1999: Nonrigid registration using freeform deformations: Application to breast MR images
More informationMathematics Curriculum
6 G R A D E Mathematics Curriculum GRADE 6 5 Table of Contents 1... 1 Topic A: Area of Triangles, Quadrilaterals, and Polygons (6.G.A.1)... 11 Lesson 1: The Area of Parallelograms Through Rectangle Facts...
More informationHierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach
Hierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach O. El Badawy, M. S. Kamel Pattern Analysis and Machine Intelligence Laboratory, Department of Systems Design Engineering,
More informationLecture notes: Object modeling
Lecture notes: Object modeling One of the classic problems in computer vision is to construct a model of an object from an image of the object. An object model has the following general principles: Compact
More informationarxiv:cs/ v1 [cs.cg] 19 Aug 1999
Quadrilateral Meshing by Circle Packing Marshall Bern David Eppstein arxiv:cs/9908016v1 [cs.cg] 19 Aug 1999 Abstract We use circle-packing methods to generate quadrilateral meshes for polygonal domains,
More informationUnit Activity Correlations to Common Core State Standards. Geometry. Table of Contents. Geometry 1 Statistics and Probability 8
Unit Activity Correlations to Common Core State Standards Geometry Table of Contents Geometry 1 Statistics and Probability 8 Geometry Experiment with transformations in the plane 1. Know precise definitions
More information13.472J/1.128J/2.158J/16.940J COMPUTATIONAL GEOMETRY
13.472J/1.128J/2.158J/16.940J COMPUTATIONAL GEOMETRY Lecture 23 Dr. W. Cho Prof. N. M. Patrikalakis Copyright c 2003 Massachusetts Institute of Technology Contents 23 F.E. and B.E. Meshing Algorithms 2
More informationCOMPUTING CONSTRAINED DELAUNAY
COMPUTING CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE By Samuel Peterson, University of Minnesota Undergraduate The Goal The Problem The Algorithms The Implementation Applications Acknowledgments
More informationCorrespondence Detection Using Wavelet-Based Attribute Vectors
Correspondence Detection Using Wavelet-Based Attribute Vectors Zhong Xue, Dinggang Shen, and Christos Davatzikos Section of Biomedical Image Analysis, Department of Radiology University of Pennsylvania,
More informationMulti-Atlas Segmentation of the Cardiac MR Right Ventricle
Multi-Atlas Segmentation of the Cardiac MR Right Ventricle Yangming Ou, Jimit Doshi, Guray Erus, and Christos Davatzikos Section of Biomedical Image Analysis (SBIA) Department of Radiology, University
More informationCONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY
South Bohemia Mathematical Letters Volume 24, (2016), No. 1, 43-48. CONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY PETRA SURYNKOVÁ abstrakt. Polygonal meshes represent important geometric structures
More informationGeometry Curriculum Map
Quadrilaterals 7.1 Interior Angle Sum Theorem 7.2 Exterior Angle Sum Theorem 7.3 Using Interior and Exterior Angles to Solve Problems Define the Angle Sum Theorem. Illustrate interior angles with the Angle
More informationThe Insight Toolkit. Image Registration Algorithms & Frameworks
The Insight Toolkit Image Registration Algorithms & Frameworks Registration in ITK Image Registration Framework Multi Resolution Registration Framework Components PDE Based Registration FEM Based Registration
More informationMorphological Image Processing
Morphological Image Processing Morphology Identification, analysis, and description of the structure of the smallest unit of words Theory and technique for the analysis and processing of geometric structures
More informationOrthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem
Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem Pawe l Żyliński Institute of Mathematics University of Gdańsk, 8095 Gdańsk, Poland pz@math.univ.gda.pl Submitted: Sep 9, 005;
More informationAn algorithm for automatic 2D quadrilateral mesh generation with line constraints
Computer-Aided Design 35 (2003) 1055 1068 www.elsevier.com/locate/cad An algorithm for automatic 2D quadrilateral mesh generation with line constraints Kyu-Yeul Lee a, In-Il Kim b, Doo-Yeoun Cho c, Tae-wan
More informationNon-Rigid Multimodal Medical Image Registration using Optical Flow and Gradient Orientation
M. HEINRICH et al.: MULTIMODAL REGISTRATION USING GRADIENT ORIENTATION 1 Non-Rigid Multimodal Medical Image Registration using Optical Flow and Gradient Orientation Mattias P. Heinrich 1 mattias.heinrich@eng.ox.ac.uk
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationGeometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms:
Geometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms: point, line, and distance along a line in a plane I can
More informationHybrid Spline-based Multimodal Registration using a Local Measure for Mutual Information
Hybrid Spline-based Multimodal Registration using a Local Measure for Mutual Information Andreas Biesdorf 1, Stefan Wörz 1, Hans-Jürgen Kaiser 2, Karl Rohr 1 1 University of Heidelberg, BIOQUANT, IPMB,
More informationMISCELLANEOUS SHAPES
MISCELLANEOUS SHAPES 4.1. INTRODUCTION Five generic shapes of polygons have been usefully distinguished in the literature: convex, orthogonal, star, spiral, and monotone. 1 Convex polygons obviously do
More informationMorphological Image Processing
Morphological Image Processing Binary image processing In binary images, we conventionally take background as black (0) and foreground objects as white (1 or 255) Morphology Figure 4.1 objects on a conveyor
More informationThe Anatomical Equivalence Class Formulation and its Application to Shape-based Computational Neuroanatomy
The Anatomical Equivalence Class Formulation and its Application to Shape-based Computational Neuroanatomy Sokratis K. Makrogiannis, PhD From post-doctoral research at SBIA lab, Department of Radiology,
More informationContours & Implicit Modelling 1
Contouring & Implicit Modelling Visualisation Lecture 8 Institute for Perception, Action & Behaviour School of Informatics Contours & Implicit Modelling 1 Brief Recap Contouring Implicit Functions lecture
More informationImage Coding with Active Appearance Models
Image Coding with Active Appearance Models Simon Baker, Iain Matthews, and Jeff Schneider CMU-RI-TR-03-13 The Robotics Institute Carnegie Mellon University Abstract Image coding is the task of representing
More information6 Mathematics Curriculum
New York State Common Core 6 Mathematics Curriculum GRADE GRADE 6 MODULE 5 Table of Contents 1 Area, Surface Area, and Volume Problems... 3 Topic A: Area of Triangles, Quadrilaterals, and Polygons (6.G.A.1)...
More informationA Keypoint Descriptor Inspired by Retinal Computation
A Keypoint Descriptor Inspired by Retinal Computation Bongsoo Suh, Sungjoon Choi, Han Lee Stanford University {bssuh,sungjoonchoi,hanlee}@stanford.edu Abstract. The main goal of our project is to implement
More informationFinite Element Method. Chapter 7. Practical considerations in FEM modeling
Finite Element Method Chapter 7 Practical considerations in FEM modeling Finite Element Modeling General Consideration The following are some of the difficult tasks (or decisions) that face the engineer
More informationDATA MODELS IN GIS. Prachi Misra Sahoo I.A.S.R.I., New Delhi
DATA MODELS IN GIS Prachi Misra Sahoo I.A.S.R.I., New Delhi -110012 1. Introduction GIS depicts the real world through models involving geometry, attributes, relations, and data quality. Here the realization
More information9. Three Dimensional Object Representations
9. Three Dimensional Object Representations Methods: Polygon and Quadric surfaces: For simple Euclidean objects Spline surfaces and construction: For curved surfaces Procedural methods: Eg. Fractals, Particle
More informationDifferential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]
Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function
More informationTopological Issues in Hexahedral Meshing
Topological Issues in Hexahedral Meshing David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science Outline I. What is meshing? Problem statement Types of mesh Quality issues
More informationThe General Purpose Parameter Based Two Dimensional Mesh Generator
The General Purpose Parameter Based Two Dimensional Mesh Generator Abstract Sivamayam Sivasuthan Department of Electrical and Computer Engineering Michigan State University East Lansing, MI 48824, USA
More informationv Mesh Generation SMS Tutorials Prerequisites Requirements Time Objectives
v. 12.3 SMS 12.3 Tutorial Mesh Generation Objectives This tutorial demostrates the fundamental tools used to generate a mesh in the SMS. Prerequisites SMS Overview SMS Map Module Requirements Mesh Module
More informationGeneration of Triangle Meshes from Time-of-Flight Data for Surface Registration
Generation of Triangle Meshes from Time-of-Flight Data for Surface Registration Thomas Kilgus, Thiago R. dos Santos, Alexander Seitel, Kwong Yung, Alfred M. Franz, Anja Groch, Ivo Wolf, Hans-Peter Meinzer,
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationGuidelines for proper use of Plate elements
Guidelines for proper use of Plate elements In structural analysis using finite element method, the analysis model is created by dividing the entire structure into finite elements. This procedure is known
More informationAtlas Based Segmentation of the prostate in MR images
Atlas Based Segmentation of the prostate in MR images Albert Gubern-Merida and Robert Marti Universitat de Girona, Computer Vision and Robotics Group, Girona, Spain {agubern,marly}@eia.udg.edu Abstract.
More informationAutomatic Construction of 3D Statistical Deformation Models Using Non-rigid Registration
Automatic Construction of 3D Statistical Deformation Models Using Non-rigid Registration D. Rueckert 1, A.F. Frangi 2,3, and J.A. Schnabel 4 1 Visual Information Processing, Department of Computing, Imperial
More informationGEOMETRY Graded Course of Study
GEOMETRY Graded Course of Study Conceptual Category: Domain: Congruence Experiment with transformations in the plane. Understand congruence in terms of rigid motions. Prove geometric theorems both formally
More informationLearning-based Neuroimage Registration
Learning-based Neuroimage Registration Leonid Teverovskiy and Yanxi Liu 1 October 2004 CMU-CALD-04-108, CMU-RI-TR-04-59 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Abstract
More informationDeformable Registration Using Scale Space Keypoints
Deformable Registration Using Scale Space Keypoints Mehdi Moradi a, Purang Abolmaesoumi a,b and Parvin Mousavi a a School of Computing, Queen s University, Kingston, Ontario, Canada K7L 3N6; b Department
More information8/3/2017. Contour Assessment for Quality Assurance and Data Mining. Objective. Outline. Tom Purdie, PhD, MCCPM
Contour Assessment for Quality Assurance and Data Mining Tom Purdie, PhD, MCCPM Objective Understand the state-of-the-art in contour assessment for quality assurance including data mining-based techniques
More informationA Review on Mesh Generation Algorithms
A Review on Mesh Generation Algorithms Mechanical Engineering Department, Lokeshsingh@gmx.com GD Rungta College of Engineering & Technology, Bhilai, 490023, India Abstract Meshing is a process of spatial
More informationFast unstructured quadrilateral mesh generation
Fast unstructured quadrilateral mesh generation Andrew Giuliani a, Lilia Krivodonova a, a Department of Applied Mathematics, University of Waterloo Abstract We present a novel approach for the indirect
More informationRigid and Deformable Vasculature-to-Image Registration : a Hierarchical Approach
Rigid and Deformable Vasculature-to-Image Registration : a Hierarchical Approach Julien Jomier and Stephen R. Aylward Computer-Aided Diagnosis and Display Lab The University of North Carolina at Chapel
More informationA Finite Element Method for Deformable Models
A Finite Element Method for Deformable Models Persephoni Karaolani, G.D. Sullivan, K.D. Baker & M.J. Baines Intelligent Systems Group, Department of Computer Science University of Reading, RG6 2AX, UK,
More informationContours & Implicit Modelling 4
Brief Recap Contouring & Implicit Modelling Contouring Implicit Functions Visualisation Lecture 8 lecture 6 Marching Cubes lecture 3 visualisation of a Quadric toby.breckon@ed.ac.uk Computer Vision Lab.
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationVOLUMETRIC HARMONIC MAP
COMMUNICATIONS IN INFORMATION AND SYSTEMS c 2004 International Press Vol. 3, No. 3, pp. 191-202, March 2004 004 VOLUMETRIC HARMONIC MAP YALIN WANG, XIANFENG GU, AND SHING-TUNG YAU Abstract. We develop
More informationInteractive Deformable Registration Visualization and Analysis of 4D Computed Tomography
Interactive Deformable Registration Visualization and Analysis of 4D Computed Tomography Burak Erem 1, Gregory C. Sharp 2, Ziji Wu 2, and David Kaeli 1 1 Department of Electrical and Computer Engineering,
More informationA New Smoothing Algorithm for Quadrilateral and Hexahedral Meshes
A New Smoothing Algorithm for Quadrilateral and Hexahedral Meshes Sanjay Kumar Khattri Department of Mathematics, University of Bergen, Norway sanjay@mi.uib.no http://www.mi.uib.no/ sanjay Abstract. Mesh
More informationPlanar Graphs with Many Perfect Matchings and Forests
Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that
More information3D Volume Mesh Generation of Human Organs Using Surface Geometries Created from the Visible Human Data Set
3D Volume Mesh Generation of Human Organs Using Surface Geometries Created from the Visible Human Data Set John M. Sullivan, Jr., Ziji Wu, and Anand Kulkarni Worcester Polytechnic Institute Worcester,
More informationAspect-Ratio Voronoi Diagram with Applications
Aspect-Ratio Voronoi Diagram with Applications Tetsuo Asano School of Information Science, JAIST (Japan Advanced Institute of Science and Technology), Japan 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan
More informationA Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010
A Flavor of Topology Shireen Elhabian and Aly A. Farag University of Louisville January 2010 In 1670 s I believe that we need another analysis properly geometric or linear, which treats place directly
More informationNovel Method to Generate and Optimize Reticulated Structures of a Non Convex Conception Domain
, pp. 17-26 http://dx.doi.org/10.14257/ijseia.2017.11.2.03 Novel Method to Generate and Optimize Reticulated Structures of a Non Convex Conception Domain Zineb Bialleten 1*, Raddouane Chiheb 2, Abdellatif
More informationBildverarbeitung für die Medizin 2007
Bildverarbeitung für die Medizin 2007 Image Registration with Local Rigidity Constraints Jan Modersitzki Institute of Mathematics, University of Lübeck, Wallstraße 40, D-23560 Lübeck 1 Summary Registration
More informationApplication of Finite Volume Method for Structural Analysis
Application of Finite Volume Method for Structural Analysis Saeed-Reza Sabbagh-Yazdi and Milad Bayatlou Associate Professor, Civil Engineering Department of KNToosi University of Technology, PostGraduate
More informationShape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow
Shape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow Abstract. Finding meaningful 1-1 correspondences between hippocampal (HP) surfaces is an important but difficult
More informationBending Circle Limits
Proceedings of Bridges 2013: Mathematics, Music, Art, Architecture, Culture Bending Circle Limits Vladimir Bulatov Corvallis Oregon, USA info@bulatov.org Abstract M.C.Escher s hyperbolic tessellations
More informationRay shooting from convex ranges
Discrete Applied Mathematics 108 (2001) 259 267 Ray shooting from convex ranges Evangelos Kranakis a, Danny Krizanc b, Anil Maheshwari a;, Jorg-Rudiger Sack a, Jorge Urrutia c a School of Computer Science,
More informationSTATISTICS AND ANALYSIS OF SHAPE
Control and Cybernetics vol. 36 (2007) No. 2 Book review: STATISTICS AND ANALYSIS OF SHAPE by H. Krim, A. Yezzi, Jr., eds. There are numerous definitions of a notion of shape of an object. These definitions
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationThe Full Survey on The Euclidean Steiner Tree Problem
The Full Survey on The Euclidean Steiner Tree Problem Shikun Liu Abstract The Steiner Tree Problem is a famous and long-studied problem in combinatorial optimization. However, the best heuristics algorithm
More informationResearch Article Polygon Morphing and Its Application in Orebody Modeling
Mathematical Problems in Engineering Volume 212, Article ID 732365, 9 pages doi:1.1155/212/732365 Research Article Polygon Morphing and Its Application in Orebody Modeling Hacer İlhan and Haşmet Gürçay
More informationGrade 9, 10 or 11- Geometry
Grade 9, 10 or 11- Geometry Strands 1. Congruence, Proof, and Constructions 2. Similarity, Proof, and Trigonometry 3. Extending to Three Dimensions 4. Connecting Algebra and Geometry through Coordinates
More informationThe organization of the human cerebral cortex estimated by intrinsic functional connectivity
1 The organization of the human cerebral cortex estimated by intrinsic functional connectivity Journal: Journal of Neurophysiology Author: B. T. Thomas Yeo, et al Link: https://www.ncbi.nlm.nih.gov/pubmed/21653723
More informationGeometry. Given a rectangle, parallelogram, trapezoid, or regular polygon, describe the rotations and reflections that carry it onto itself.
Common Core State for Mathematics High School Following is a correlation of Pearson s Prentice Hall Common Core Geometry 2012 to Common Core State for High School Mathematics. Geometry Congruence G-CO
More informationElastic registration of medical images using finite element meshes
Elastic registration of medical images using finite element meshes Hartwig Grabowski Institute of Real-Time Computer Systems & Robotics, University of Karlsruhe, D-76128 Karlsruhe, Germany. Email: grabow@ira.uka.de
More informationGeometry SEMESTER 1 SEMESTER 2
SEMESTER 1 Geometry 1. Geometry Basics 2. Coordinate Geometry a) Transformations, e.g., T(x + a, y + b) 3. Angles 4. Triangles a) Circumcenter 5. Construction a) Copy a segment, angle b) Bisect a segment,
More informationL1 - Introduction. Contents. Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming
L1 - Introduction Contents Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming 1 Definitions Computer-Aided Design (CAD) The technology concerned with the
More informationCSE 554 Lecture 7: Deformation II
CSE 554 Lecture 7: Deformation II Fall 2011 CSE554 Deformation II Slide 1 Review Rigid-body alignment Non-rigid deformation Intrinsic methods: deforming the boundary points An optimization problem Minimize
More informationGEOMETRY CCR MATH STANDARDS
CONGRUENCE, PROOF, AND CONSTRUCTIONS M.GHS. M.GHS. M.GHS. GEOMETRY CCR MATH STANDARDS Mathematical Habits of Mind. Make sense of problems and persevere in solving them.. Use appropriate tools strategically..
More informationOptimal Möbius Transformation for Information Visualization and Meshing
Optimal Möbius Transformation for Information Visualization and Meshing Marshall Bern Xerox Palo Alto Research Ctr. David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science
More informationComputer Vision/Graphics -- Dr. Chandra Kambhamettu for SIGNEWGRAD 11/24/04
Computer Vision/Graphics -- Dr. Chandra Kambhamettu for SIGNEWGRAD 11/24/04 Computer Vision : Understanding of images Computer Graphics : Creation of images Courses offered: CISC4/640, CISC4/689, CISC849,
More informationGEOMETRY. Changes to the original 2010 COS is in red. If it is red and crossed out, it has been moved to another course.
The Geometry course builds on Algebra I concepts and increases students knowledge of shapes and their properties through geometry-based applications, many of which are observable in aspects of everyday
More informationNon-rigid Image Registration using Electric Current Flow
Non-rigid Image Registration using Electric Current Flow Shu Liao, Max W. K. Law and Albert C. S. Chung Lo Kwee-Seong Medical Image Analysis Laboratory, Department of Computer Science and Engineering,
More informationA Method of Automated Landmark Generation for Automated 3D PDM Construction
A Method of Automated Landmark Generation for Automated 3D PDM Construction A. D. Brett and C. J. Taylor Department of Medical Biophysics University of Manchester Manchester M13 9PT, Uk adb@sv1.smb.man.ac.uk
More informationComputational Geometry for Imprecise Data
Computational Geometry for Imprecise Data November 30, 2008 PDF Version 1 Introduction Computational geometry deals with algorithms on geometric inputs. Historically, geometric algorithms have focused
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More informationLecture 3: Art Gallery Problems and Polygon Triangulation
EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified
More informationScope and Sequence for the New Jersey Core Curriculum Content Standards
Scope and Sequence for the New Jersey Core Curriculum Content Standards The following chart provides an overview of where within Prentice Hall Course 3 Mathematics each of the Cumulative Progress Indicators
More informationGrade 6 Mathematics Item Specifications Florida Standards Assessments
Content Standard MAFS.6.G Geometry MAFS.6.G.1 Solve real-world and mathematical problems involving area, surface area, and volume. Assessment Limits Calculator s Context A shape is shown. MAFS.6.G.1.1
More informationParameterization of Triangular Meshes with Virtual Boundaries
Parameterization of Triangular Meshes with Virtual Boundaries Yunjin Lee 1;Λ Hyoung Seok Kim 2;y Seungyong Lee 1;z 1 Department of Computer Science and Engineering Pohang University of Science and Technology
More informationBasic LOgical Bulk Shapes (BLOBs) for Finite Element Hexahedral Mesh Generation
Basic LOgical Bulk Shapes (BLOBs) for Finite Element Hexahedral Mesh Generation Shang-Sheng Liu and Rajit Gadh Department of Mechanical Engineering University of Wisconsin - Madison Madison, Wisconsin
More informationSHAPE SEGMENTATION FOR SHAPE DESCRIPTION
SHAPE SEGMENTATION FOR SHAPE DESCRIPTION Olga Symonova GraphiTech Salita dei Molini 2, Villazzano (TN), Italy olga.symonova@graphitech.it Raffaele De Amicis GraphiTech Salita dei Molini 2, Villazzano (TN),
More informationIsosurface Rendering. CSC 7443: Scientific Information Visualization
Isosurface Rendering What is Isosurfacing? An isosurface is the 3D surface representing the locations of a constant scalar value within a volume A surface with the same scalar field value Isosurfaces form
More informationUsing Semi-Regular 4 8 Meshes for Subdivision Surfaces
Using Semi-Regular 8 Meshes for Subdivision Surfaces Luiz Velho IMPA Instituto de Matemática Pura e Aplicada Abstract. Semi-regular 8 meshes are refinable triangulated quadrangulations. They provide a
More informationSolid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO
Solid Modelling Graphics Systems / Computer Graphics and Interfaces 1 Solid Modelling In 2D, one set 2D line segments or curves does not necessarily form a closed area. In 3D, a collection of surfaces
More information