Geometric Analysis of Packings Gady Frenkel, M. Blunt, P. King & R. Blumenfeld.

Slides:



Advertisements
Similar presentations
An insulating sphere of radius b has a spherical cavity of radius a located within its volume and centered a distance R from the center of the sphere.
Advertisements


CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014.
DIMENSIONALITY REDUCTION: FEATURE EXTRACTION & FEATURE SELECTION Principle Component Analysis.
Copyright © Cengage Learning. All rights reserved. 14 Partial Derivatives.
Surface Reconstruction From Unorganized Point Sets
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Convex Hulls in Two Dimensions Definitions Basic algorithms Gift Wrapping (algorithm of Jarvis ) Graham scan Divide and conquer Convex Hull for line intersections.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
1 The Arrow of Time In The Very EARLIEST Universe Brett McInnes NUS NUS Hep-th
Week 14 - Monday.  What did we talk about last time?  Bounding volume/bounding volume intersections.
Topology YAN JIE (Ryan).
Chapter 5 Raster –based algorithms in CAC. 5.1 area filling algorithm 5.2 distance transformation graph and skeleton graph generation algorithm 5.3 convolution.
Peyman Mostaghimi, Prof. Martin Blunt, Dr. Branko Bijeljic 16 January 2009, Imperial College Consortium on Pore-Scale Modelling The level set method and.
1 Lecture #5 Variational Approaches and Image Segmentation Lecture #5 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
A Versatile Depalletizer of Boxes Based on Range Imagery Dimitrios Katsoulas*, Lothar Bergen*, Lambis Tassakos** *University of Freiburg **Inos Automation-software.
Segmentation into Planar Patches for Recovery of Unmodeled Objects Kok-Lim Low COMP Computer Vision 4/26/2000.
Chapter 9 Morphological Image Processing. Preview Morphology: denotes a branch of biology that deals with the form and structure of animals and planets.
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Physics 1502: Lecture 30 Today’s Agenda Announcements: –Midterm 2: Monday Nov. 16 … –Homework 08: due Friday Optics –Mirrors –Lenses –Eye.
Hidden Line Removal Adopted from U Strathclyde’s course page.
Lesson 5 Representing Fields Geometrically. Class 13 Today, we will: review characteristics of field lines and contours learn more about electric field.
I-2 Gauss’ Law Main Topics The Electric Flux. The Gauss’ Law. The Charge Density. Use the G. L. to calculate the field of a.
Ch 9, Mirrors, Lenses and Optical Systems. 9.1 Geometrical Optics & Plane Mirrors  In this chapter the dimensions of the mirrors, prisms and lenses discussed.
10.3 Images in Concave Mirrors. Concave Mirror Unlike a plane mirror, a curved mirror produces an image that is a different size, shape, and/or orientation.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
CS 450: Computer Graphics REVIEW: OVERVIEW OF POLYGONS
Basics of Rendering Pipeline Based Rendering –Objects in the scene are rendered in a sequence of steps that form the Rendering Pipeline. Ray-Tracing –A.
© Imperial College LondonPage 1 Topological Analysis of Packings Gady Frenkel, R. Blumenfeld, M. Blunt, P. King Application to flow properties in granular.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
1 Ray Tracing Polyhedra ©Anthony Steed
Contour Shape Analysis Using Crystalline Flow 2001.Nov.7.
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Part 6: Graphics Output Primitives (4) 1.  Another useful construct,besides points, straight line segments, and curves for describing components of a.
Electric Flux and Gauss Law
Introduction to Computational Geometry Hackson
Quadratic Surfaces. SPLINE REPRESENTATIONS a spline is a flexible strip used to produce a smooth curve through a designated set of points. We.
Digital Image Processing CCS331 Relationships of Pixel 1.
Chapter 24 Gauss’s Law. Let’s return to the field lines and consider the flux through a surface. The number of lines per unit area is proportional to.
CHAPTER 24 : GAUSS’S LAW 24.1) ELECTRIC FLUX
Computer Graphics Basic 3D Geometry CO2409 Computer Graphics Week 5-1.
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
3D Object Modelling and Classification Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University,
Outline Introduction Research Project Findings / Results
References Books: Chapter 11, Image Processing, Analysis, and Machine Vision, Sonka et al Chapter 9, Digital Image Processing, Gonzalez & Woods.
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),
Physics 1202: Lecture 22 Today’s Agenda Announcements: –Lectures posted on: –HW assignments, etc.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Introduction to Curves
Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.
Computer Graphics Lecture 08 Taqdees A. Siddiqi Computer Graphics Filled Area Primitives I Lecture 08 Taqdees A. Siddiqi
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
Digital Image Processing Lecture 15: Morphological Algorithms April 27, 2005 Prof. Charlene Tsai.
Curvature driven grain growth
Predicting NMR Response in Micro-CT images and Networks
Make It Stand: Balancing Shapes for 3D Fabrication
Hu Li Moments for Low Resolution Thermal Face Recognition
Craig Schroeder October 26, 2004
CSCE 441 Computer Graphics: Clipping Polygons Jinxiang Chai
I. The Problem of Molding
Neural Networks and Their Application in the Fields of Coporate Finance By Eric Séverin Hanna Viinikainen.
CSCE 441 Computer Graphics: Clipping Polygons Jinxiang Chai
Digital Image Processing Lecture 15: Morphological Algorithms
CSE 554 Lecture 3: Shape Analysis (Part II)
Curved / Spherical Mirrors
CS654: Digital Image Analysis
Unit 37 Further Transformations
Volume and Surface Area
Presentation transcript:

Geometric Analysis of Packings Gady Frenkel, M. Blunt, P. King & R. Blumenfeld

Agenda Motivation: Definition of a new model –The balloon algorithm – non negative curvature Results: –2D –3D throats emulation Conclusions and future prospects

The Big Picture: Goals: Extracting networks –Robust algorithm –efficient Investigate the wide distribution of permeability –Caused by topology? –Caused by the distribution of the throats cross-section? Can we model and predict connections between electrical conductivity and permeability

Granular Packing Characterization Components: Grains, Pores, Throats. Definitions of pores and throats are quite ambiguous. –Two convex pores connected by a wide throat form one concave pore or not? –Example: spheres - poresspheres pores One or Two Pores?

Our model of Granular Packing Grains: (transformed) –Straight lines and planes that connect contacts instead of real boundaries PORES: –“Convex” “empty” volumes that are surrounded by transformed grains. THROATS: –the openings that connect two pores:

2D Packing Example: GRAINS: –Straight lines and planes that connect contacts instead of real boundaries

2D Packing Example: GRAINS: –Straight lines and planes that connect contacts instead of real boundaries Contact Points

2D Packing Example: GRAINS: –Straight lines and planes that connect contacts instead of real boundaries Contact Points

2D Packing Example: GRAINS: –Straight lines and planes that connect contacts instead of real boundaries PORES: –“Convex” “empty” volumes that are surrounded by transformed grains. CONTACT POINT: Should I mention here that the pores need to be Convex in 3D (because in 2D it is not true)

Obtaining pores 2D Grain Pore Grain: Anti-Clockwise Pore: Clockwise

3D example Packed Spheres Revisited: –Every 3 neighbouring contact points create a plane facet. –Pores spheres - poresspheres pores Need to ask Peter for citation concerning The 3D sphere packing

Finding Throats: Facets of Pore are Known Use the 2D algorithm where the radial vector sets the positive edge direction

Finding Throats:

Implementation: (2D&3D) 2 Step Algorithm: 1.Find contact points – skeletonization 2.Apply algorithm to find the pore-network and the throats characteristics. Benefits: –Easier, Grains are simplified to plane facet. –Less information to deal with –East to extract the throat information Do I need this slide?

Growing a deformable object : Inflating balloon inside the pore until it is filled. –Advantage: Fit any pore shape by deforming. –Only one object per pore. Obtaining Pores: Main Idea

Question: How can we prevent this balloon from exiting the pore through the throats.? Clue: Balloons tend to be convex. When a balloon expands through the narrower throats it will develop a negative curvature By preferring positive curvature we can prevent the balloon from exiting the pore. Add Picture

Algorithm Step 1: –Obtain contact points of grains – Determine the facets of the grains.

Algorithm Step 2: –Choose a Facet and put a small balloon at the pore near the facets centre. – Grow the balloon according to the rules: Surface points get further from the centre Curvature is calculated at each point, negative curvature is not allowed. –When balloon is fully grown, find the facets that it touches.

Example: Beads in 2D 1.Grains → polygons

Example: Beads in 2D 1.Grains → polygons

Example: Beads in 2D 1.Grains → polygons 2.Balloons are inflated from each facet

Emulating “Throats” in 2D “Throats”

Emulating “Throats” in 2D Pores

Conclusions New Characterization of pore space. –Step 1: skeletonization –Step 2: non-negative curvature algorithm Algorithm Shows promising results and seems to be applicable in any dimension.

Future Prospects 3D Software – is in advanced stages Recognizing the facets that belong to the pore. Combining/dividing pores for the conventional definition. Finding the contact points from real 3D data. Analysis of real systems: –Need Data