BIOSYST-MeBioSwww.biw.kuleuven.be Ellipsoid tessellation algorithm for modelling fruit microstructure H K Mebatsion.

Slides:



Advertisements
Similar presentations
Patient specific reconstruction of vascular network for hemodynamic modeling Yury Ivanov (INM RAS), Roman Pryamonosov (MSU), 2014, Moscow.
Advertisements

July 31, 2013 Jason Su. Background and Tools Cramér-Rao Lower Bound (CRLB) Automatic Differentiation (AD) Applications in Parameter Mapping Evaluating.
BIOSYST-MeBioS. Model-based approach Purpose Improve understanding Optimization Control Macroscale approach (Ho et al., 2006) Geometry: intact fruit Gas.
電腦視覺 Computer and Robot Vision I
Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
A Coherent Grid Traversal Algorithm for Volume Rendering Ioannis Makris Supervisors: Philipp Slusallek*, Céline Loscos *Computer Graphics Lab, Universität.
Neural Network Approach to Modeling the Laser Material-Removal Process By Basem. F. Yousef London, Canada, N6A 5B9 December 2001.
Validation of Blood Flow Simulations in Intracranial Aneurysms Yue Yu Brown University.
IIIT Hyderabad A METHOD FOR MOTION DETECTION AND CATEGORIZATION IN PERFUSION WEIGHTED MRI Rohit Gautam, Jayanthi Sivaswamy CVIT, IIIT Hyderabad, Hyderabad,
© Fraunhofer MEVIS Toward Automated Validation of Sketch-based 3D Segmentation Editing Tools Frank Heckel 1, Momchil I. Ivanov 2, Jan H. Moltz 1, Horst.
CHAPTER 12 Height Maps, Hidden Surface Removal, Clipping and Level of Detail Algorithms © 2008 Cengage Learning EMEA.
Computational Geometry The systematic study of algorithms and data structures for geometric objects, with a focus on exact algorithms that are asymptotically.
Dual Mesh Method in Upscaling Pascal Audigane and Martin Blunt Imperial College London SPE Reservoir Simulation Symposium, Houston, 3-5 February 2003.
1 A component mode synthesis method for 3D cell by cell calculation using the mixed dual finite element solver MINOS P. Guérin, A.M. Baudron, J.J. Lautard.
Algorithms for the leather nesting problem: application to a real automotive industry instance Pedro Brás Supervision: Cláudio Alves and José Valério de.
Master thesis by H.C Achterberg
1 Geometry A line in 3D space is represented by  S is a point on the line, and V is the direction along which the line runs  Any point P on the line.
McDaniels – Feb 29, Outline Patient 6 question Patient 11 ADC results Abstract for AAPM conference.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
Single View Geometry Course web page: vision.cis.udel.edu/cv April 7, 2003  Lecture 19.
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Computational Geometry The systematic study of algorithms and data structures for geometric objects, with a focus on exact algorithms that are asymptotically.
OBJECT RECOGNITION. The next step in Robot Vision is the Object Recognition. This problem is accomplished using the extracted feature information. The.
Graph Abstraction for Simplified Proofreading of Slice-based Volume Segmentation Ronell Sicat 1, Markus Hadwiger 1, Niloy Mitra 1,2 1 King Abdullah University.
TSV-Aware Analytical Placement for 3D IC Designs Meng-Kai Hsu, Yao-Wen Chang, and Valerity Balabanov GIEE and EE department of NTU DAC 2011.
Proof of concept studies for surface-based mechanical property reconstruction 1. University of Canterbury, Christchurch, NZ 2. Eastman Kodak Company, Rochester,
1 Subdivision Termination Criteria in Subdivision Multivariate Solvers Iddo Hanniel, Gershon Elber CGGC, CS, Technion.
ASSESSMENT OF INTERNAL BRUISE VOLUME OF SELECTED FRUITS USING MR IMAGING Ta-Te Lin, Yu-Che Cheng, Jen-Fang Yu Department of Bio-Industrial Mechatronics.
Bin Wen and Nicholas Zabaras
Materials Process Design and Control Laboratory Finite Element Modeling of the Deformation of 3D Polycrystals Including the Effect of Grain Size Wei Li.
Materials Process Design and Control Laboratory MULTISCALE MODELING OF ALLOY SOLIDIFICATION LIJIAN TAN NICHOLAS ZABARAS Date: 24 July 2007 Sibley School.
Laboratoire Environnement, Géomécanique & Ouvrages Comparison of Theory and Experiment for Solute Transport in Bimodal Heterogeneous Porous Medium Fabrice.
Constructing Hexahedral Meshes of Abdominal Aortic Aneurysms for Use in Finite Element Analysis Rowena Ong Vanderbilt University Mentor: Kara Kruse Computational.
METHODS CT scans were segmented and triangular surface meshes generated using Amira. Antiga and Steinman’s method (2004) for automatically extracting parameterized.
Business Id © NetHawk All rights reserved. Confidential April 2005NetHawk NetHawk Quality of Service products Markus Ahokangas, MSc Product.
Nanoparticle transport and cell migration simulation using a Multi-Scale Approach Goal: The main objective of the study is focused to understand the phenomena.
Isolating Objects From Image Stack Presented By: Md. Amjad Hossain and Raja Naresh.
Image Segmentation Shengnan Wang
CS 641 Term project Level-set based segmentation algorithms Presented by- Karthik Alavala (under the guidance of Dr. Jundong Liu)
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Where We Stand At this point we know how to: –Convert points from local to window coordinates –Clip polygons and lines to the view volume –Determine which.
Designing Factorial Experiments with Binary Response Tel-Aviv University Faculty of Exact Sciences Department of Statistics and Operations Research Hovav.
Static Timing Analysis
KIT – University of the State of Baden-Wuerttemberg and National Laboratory of the Helmholtz Association INSTITUTE OF TECHNICAL PHYS An approximate.
1 CASE 2: Modeling of a synthetic jet in a cross flow Williamsburg, Virginia, USA March 29 th -31 th 2004 C. Marongiu 1, G. Iaccarino 2 1 CIRA Italian.
1 Giuseppe Romeo Voronoi based Source Detection. 2 Voronoi cell The Voronoi tessellation is constructed as follows: for each data point  i (also called.
Flair development for the MC TPS Wioletta Kozłowska CERN / Medical University of Vienna.
A novel approach to visualizing dark matter simulations
From: Hydraulic Loss of Finite Length Dividing Junctions
Microstructure Imaging Sequence Simulation Toolbox
Hasan Nourdeen Martin Blunt 10 Jan 2017
Real-Time Soft Shadows with Adaptive Light Source Sampling
Katsuyo Thornton1, R. Edwin García2, Larry Aagesen3
Dual Mesh Method in Dynamic Upscaling
Tutorial 3 – Computational Geometry
Mathematical modeling of cryogenic processes in biotissues and optimization of the cryosurgery operations N. A. Kudryashov, K. E. Shilnikov National Research.
3D Graphics Rendering PPT By Ricardo Veguilla.
Dingding Liu* Yingen Xiong† Linda Shapiro* Kari Pulli†
Predicting ligand binding sites on protein surface
Evaluate the integral by changing to polar coordinates
Tobias Heimann - DKFZ Ipek Oguz - UNC Ivo Wolf - DKFZ
Computational Geometry
Conservative Visibility Preprocessing using Extended Projections Frédo Durand, George Drettakis, Joëlle Thollot and Claude Puech iMAGIS-GRAVIR/IMAG-INRIA.
Towards Image Based Modelling of Composite Li-ion Electrodes
Triangulation of point set
Find the Jacobian of the transformation. {image}
Delaunay Triangulation & Application
A Block Based MAP Segmentation for Image Compression
Gradient Domain Salience-preserving Color-to-gray Conversion
Presentation transcript:

BIOSYST-MeBioSwww.biw.kuleuven.be Ellipsoid tessellation algorithm for modelling fruit microstructure H K Mebatsion

BIOSYST-MeBioS Why modelling fruit microstructure? “We have to investigate the smallest details in order to appreciate the wider spectrum.” “ Multiscale Modelling” Fruit microstructures are a web of interconnected cells Microstructures are the building block of the macrostructure Yet, microstructures are not homogeneous Elegant modelling procedure not affected by heterogeneity is a challenge

BIOSYST-MeBioS Microstructural heterogeneity a b c a) cortex b) vascular bundle c) v-c transition What you see is what you can see

BIOSYST-MeBioS Voronoi tessellation (Mebatsion et al.,2006a) CVD PVD Porosity=15.95% Porosity=15.51%Porosity=16.17% Apple parenchyma 2D microstructural modelling

BIOSYST-MeBioS Finite element simulation (Greenstar) Pore Cell O 2 concentration profile Tri Ho (unpublished)

BIOSYST-MeBioS Middle lamella Individual cells Cells ESEM image of Granny Smith, Nieto et al., 2004 Cell wall TEM images of Jonagold (c) and conference pear (d) Cells Synchrotron image (C. Pear) Deeper investigation of microstructure a b c d

BIOSYST-MeBioS Ellipse tessellation (Mebatsion et al.,2006b) Cell Cell wall Intercellular space Porosity= 16% Porosity=17%

BIOSYST-MeBioS Investigation of O 2 profile at the microscale Conference pear Tri Ho (unpublished)

BIOSYST-MeBioS Cells in 2D are elliptical. Should they be ellipsoidal in 3D? How to determine the geometrical properties of ellipsoids (size, position…)? Is there something like ellipsoid fitting algorithm in 3D? Minimum Volume Circumscribing Ellipsoid (MVCE) 3D microstructural modelling

BIOSYST-MeBioS MVCE Given points in 3D, there a unique ellipsoid with a minimum volume that encloses these sets of point An ellipsoid can be given by the following standard equation n (1)

BIOSYST-MeBioS Then the equation of ellipsoid in the centre form reduces to (1.1)

BIOSYST-MeBioS We want points to be inside the ellipsoid hence, they must satisfy And the volume of the ellipsoid, is given by the volume of unit sphere (2) (1.2)

BIOSYST-MeBioS Hence, the optimization problem is all about To guarantee the positive volume (avoid trivial solution) lift the set of points Each point is lifted to a hyperplane

BIOSYST-MeBioS The MVCE is determined as The solution is obtained using Khachiyan's algorithm The optimization problem is converted into concave optimization problem Lagrangian dual approach

BIOSYST-MeBioS MVCE algorithm ( Conditional Gradient Ascent Method) N Y initialization

BIOSYST-MeBioS Previous Minimum Volume Circumscribing Ellipsoid (MVCE) algorithms took into account all sets of points In our approach, we determine the MVCE of a polytope determined by the Convhull of the set of points Our approach is many times faster!!!

BIOSYST-MeBioS Comparison of previous and our approaches 101 points 45 points 2.2 times as fast

BIOSYST-MeBioS Evaluation of MVCE code (2D) MVCE Centroid =[ ] l1= l2= Ellipse fitting Centroid =[ ] l1= l2=

BIOSYST-MeBioS Evaluation of MVCE code (3D) Centroid =[0 0 0] R1=R2=R3=1 Centroid =[0.3887, , ] * 1.0e-016 R1=R2=R3=1 MVCE

BIOSYST-MeBioS Implementation of MVCE Image acquisition Synchrotron experiment

BIOSYST-MeBioS Implementation… 120 phase contrast images were used Digitization of cells in different slices is impractical Digitization at every 10th slice (compromised) Getting 3D coordinates of individual cells MVCE calculation of individual cells Visualization Visualization tool

BIOSYST-MeBioS Results MVCE

BIOSYST-MeBioS Results

BIOSYST-MeBioS Results MVCE

BIOSYST-MeBioS Comparison of our approach and Amira Conference pear ThreeDview version 1.1 Amira version 4.2

BIOSYST-MeBioS Ellipsoid Tessellation algorithm MVCE (i) MVCE (j) Overlap ? Non-overlap region (i) MVCE (i) (NOR) + (MVCE (i)) Y N Y N Intersection of regions End Y N Start

BIOSYST-MeBioS Ellipsoid tessellation A brand new approach Volume distribution Pear parenchyma tissue

BIOSYST-MeBioS Ellipsoid tessellation A brand new approach Volume distribution Pear dermal tissue Porosity=9.3%

BIOSYST-MeBioS Conclusion and future plan A very fast MVCE for the 3D visualization of cells was developed Due to the nature of the synchrotron image automatic contour detection was not possible A brand new ellipsoid tessellation algorithms was developed These geometries will be exported to finite element/ volume codes (Ansys)

BIOSYST-MeBioS Thank you

BIOSYST-MeBioS Nothing amuses more harmlessly than computation… Mike L Klien