Lecture Notes in Statistics 183 Edited by P

Total Page:16

File Type:pdf, Size:1020Kb

Lecture Notes in Statistics 183 Edited by P Lecture Notes in Statistics 183 Edited by P. Bickel, P. Diggle, S. Fienberg, U. Gather, I. Olkin, S. Zeger Michel Bilodeau Fernand Meyer Michel Schmitt (Editors) Space, Structure and Randomness Contributions in Honor of Georges Matheron in the Field of Geostatistics, Random Sets and Mathematical Morphology With 121 Figures Michel Bilodeau Fernand Meyer Michel Schmitt Ecole des Mines de Paris Ecole des Mines de Paris Ecole des Mines de Paris Centre de Morphologie Centre de Morphologie Direction des recherches Mathématique Mathématique 60 Boulevard Saint Michel 35 rue Saint Honoré 35 rue Saint Honoré 75272 Paris Cedex 06 77305 Fontainebleau 77305 Fontainebleau France France France [email protected] [email protected] [email protected] Library of Congress Control Number: 2005927580 ISBN 10: 0-387-20331-1 Printed on acid-free paper ISBN 13: 978-0387-20331-7 © 2005 Springer Science+Business Media, Inc. All rights reserved. This work may not be translated or copied in whole or in part without the written per- mission of the publisher (Springer Science+Business Media, Inc., 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Typesetting: Camera ready by the editors Printed in the United States of America (SB) 987654321 springeronline.com Lecture Notes in Statistics 144: L. Mark Berliner, Douglas Nychka, and Timothy Hoar (Editors), Case Studies in Statistics and the For information about Volumes 1 to 128, Atmospheric Sciences. x, 208 pp., 2000. please contact Springer-Verlag 145: James H. Matis and Thomas R. Kiffe, Stochastic Population Models. viii, 220 pp., 2000. 146: Wim Schoutens, Stochastic Processes and 129: Wolfgang Härdle, Gerard Kerkyacharian, Orthogonal Polynomials. xiv, 163 pp., 2000. Dominique Picard, and Alexander Tsybakov, Wavelets, Approximation, and Statistical 147: Jürgen Franke, Wolfgang Härdle, and Gerhard Applications. xvi, 265 pp., 1998. Stahl, Measuring Risk in Complex Stochastic Systems. xvi, 272 pp., 2000. 130: Bo-Cheng Wei, Exponential Family Nonlinear Models. ix, 240 pp., 1998. 148: S.E. Ahmed and Nancy Reid, Empirical Bayes and Likelihood Inference. x, 200 pp., 2000. 131: Joel L. Horowitz, Semiparametric Methods in Econometrics. ix, 204 pp., 1998. 149: D. Bosq, Linear Processes in Function Spaces: Theory and Applications. xv, 296 pp., 2000. 132: Douglas Nychka, Walter W. Piegorsch, and Lawrence H. Cox (Editors), Case Studies in 150: Tadeusz Cali´nski and Sanpei Kageyama, Block Environmental Statistics. viii, 200 pp., 1998. Designs: A Randomization Approach, Volume I: Analysis. ix, 313 pp., 2000. 133: Dipak Dey, Peter Müller, and Debajyoti Sinha (Editors), Practical Nonparametric and 151: Håkan Andersson and Tom Britton, Stochastic Semiparametric Bayesian Statistics. xv, 408 pp., 1998. Epidemic Models and Their Statistical Analysis. ix, 152 pp., 2000. 134: Yu. A. Kutoyants, Statistical Inference For Spatial Poisson Processes. vii, 284 pp., 1998. 152: David Ríos Insua and Fabrizio Ruggeri, Robust Bayesian Analysis. xiii, 435 pp., 2000. 135: Christian P. Robert, Discretization and MCMC Convergence Assessment. x, 192 pp., 1998. 153: Parimal Mukhopadhyay, Topics in Survey Sampling. x, 303 pp., 2000. 136: Gregory C. Reinsel, Raja P. Velu, Multivariate Reduced-Rank Regression. xiii, 272 pp., 1998. 154: Regina Kaiser and Agustín Maravall, Measuring Business Cycles in Economic Time Series. vi, 190 pp., 137: V. Seshadri, The Inverse Gaussian Distribution: 2000. Statistical Theory and Applications. xii, 360 pp., 1998. 155: Leon Willenborg and Ton de Waal, Elements of Statistical Disclosure Control. xvii, 289 pp., 2000. 138: Peter Hellekalek and Gerhard Larcher (Editors), Random and Quasi-Random Point Sets. xi, 352 pp., 156: Gordon Willmot and X. Sheldon Lin, Lundberg 1998. Approximations for Compound Distributions with Insurance Applications. xi, 272 pp., 2000. 139: Roger B. Nelsen, An Introduction to Copulas. xi, 232 pp., 1999. 157: Anne Boomsma, Marijtje A.J. van Duijn, and Tom A.B. Snijders (Editors), Essays on Item Response 140: Constantine Gatsonis, Robert E. Kass, Bradley Theory. xv, 448 pp., 2000. Carlin, Alicia Carriquiry, Andrew Gelman, Isabella Verdinelli, and Mike West (Editors), Case Studies in 158: Dominique Ladiray and Benoît Quenneville, Bayesian Statistics, Volume IV. xvi, 456 pp., 1999. Seasonal Adjustment with the X-11 Method. xxii, 220 pp., 2001. 141: Peter Müller and Brani Vidakovic (Editors), Bayesian Inference in Wavelet Based Models. xiii, 394 159: Marc Moore (Editor), Spatial Statistics: pp., 1999. Methodological Aspects and Some Applications. xvi, 282 pp., 2001. 142: György Terdik, Bilinear Stochastic Models and Related Problems of Nonlinear Time Series Analysis: 160: Tomasz Rychlik, Projecting Statistical A Frequency Domain Approach. xi, 258 pp., 1999. Functionals. viii, 184 pp., 2001. 143: Russell Barton, Graphical Methods for the 161: Maarten Jansen, Noise Reduction by Wavelet Design of Experiments. x, 208 pp., 1999. Thresholding. xxii, 224 pp., 2001. 162: Constantine Gatsonis, Bradley Carlin, Alicia 173: Jesper Møller (Editor), Spatial Statistics and Carriquiry, Andrew Gelman, Robert E. Kass Computational Methods. xi, 214 pp., 2002. Isabella Verdinelli, and Mike West (Editors), Case Studies in Bayesian Statistics, Volume V. xiv, 448 174: Yasuko Chikuse, Statistics on Special Manifolds. pp., 2001. xi, 418 pp., 2002. 163: Erkki P. Liski, Nripes K. Mandal, Kirti R. Shah, 175: Jürgen Gross, Linear Regression. xiv, 394 pp., and Bikas K. Sinha, Topics in Optimal Design. xii, 2003. 164 pp., 2002. 176: Zehua Chen, Zhidong Bai, Bimal K. Sinha, 164: Peter Goos, The Optimal Design of Blocked and Ranked Set Sampling: Theory and Applications. xii, Split-Plot Experiments. xiv, 244 pp., 2002. 224 pp., 2003 165: Karl Mosler, Multivariate Dispersion, Central 177: Caitlin Buck and Andrew Millard (Editors), Regions and Depth: The Lift Zonoid Approach. xii, Tools for Constructing Chronologies: Crossing 280 pp., 2002. Disciplinary Boundaries, xvi, 263 pp., 2004 166: Hira L. Koul, Weighted Empirical Processes in 178: Gauri Sankar Datta and Rahul Mukerjee , Dynamic Nonlinear Models, Second Edition. xiii, 425 Probability Matching Priors: Higher Order pp., 2002. Asymptotics, x, 144 pp., 2004 167: Constantine Gatsonis, Alicia Carriquiry, Andrew 179: D.Y. Lin and P.J. Heagerty (Editors), Gelman, David Higdon, Robert Proceedings of the Second Seattle Symposium in E. Kass, Donna Pauler, and Isabella Verdinelli Biostatistics: Analysis of Correlated Data, vii, 336 (Editors), Case Studies in Bayesian Statistics, Volume pp., 2004 VI. xiv, 376 pp., 2002. 180: Yanhong Wu, Inference for Change-Point and 168: Susanne Rässler, Statistical Matching: A Post-Change Means After a CUSUM Test, xiv, 176 Frequentist Theory, Practical Applications and pp., 2004 Alternative Bayesian Approaches. xviii, 238 pp., 2002. 181: Daniel Straumann, Estimation in Conditionally 169: Yu. I. Ingster and Irina A. Suslina, Heteroscedastic Time Series Models , x, 250 pp., 2004 Nonparametric Goodness-of-Fit Testing Under Gaussian Models. xiv, 453 pp., 2003. 182: Lixing Zhu, Nonparametric Monte Carlo Tests and Their Applications, xi., 192 pp., 2005 170: Tadeusz Calinski and Sanpei Kageyama, Block Designs: A Randomization Approach, Volume II: 183: Michel Bilodeau, Fernand Meyer, and Michel Design. xii, 351 pp., 2003. Schmitt (Editors), Space, Structure and Randomness, xiv., 416 pp., 2005 171: D.D. Denison, M.H. Hansen, C.C. Holmes, B. Mallick, B. Yu (Editors), Nonlinear Estimation and Classification. x, 474 pp., 2002. 172: Sneh Gulati, William J. Padgett, Parametric and Nonparametric Inference from Record-Breaking Data. ix, 112 pp., 2002. Personal Reminiscences of Georges Matheron Dietrich Stoyan Institut f¨ur Stochastik, TU Bergakademie Freiberg I am glad that I had the chance to meet Georges Matheron personally once in my life, in October 1996. Like many other statisticians, I had learned a lot in the years before from his books, papers, and research reports produced in Fontainebleau. From the very beginning, I had felt a particular solidarity with him because he worked at the Ecole des Mines de Paris, together with Bergakademie Freiberg one of the oldest European mining schools. The first contact to his work occurred in talks with Hans Bandemer, who in the late 1960s had some correspondence with Georges Matheron. Proudly he showed me letters and reprints from Georges Matheron. He also had a copy of Georges Matheron’s thesis of 1965, 300 pages narrowly printed. Its first part used Schwartz’ theory of distributions (Laurent Schwartz was the supervisor) in the theory of regionalized variables, while the second part de- scribed the theory of kriging. Hans Bandemer was able to read the French text, translated it into German language and tried, without success, to find a German publisher. Unfortunately, the political conditions in East Germany prevented a meeting between Hans Bandemer and Georges Matheron. A bit later, in 1969, I saw George Matheron’s book “Trait´edeG´eostatis- tique Appliqu´ee”. It is typical of the situation in East Germany
Recommended publications
  • Introduction to Mathematical Morphology
    COMPUTER VISION, GRAPHICS, AND IMAGE PROCESSING 35, 283-305 (1986) Introduction to Mathematical Morphology JEAN SERRA E. N. S. M. de Paris, Paris, France Received October 6,1983; revised March 20,1986 1. BACKGROUND As we saw in the foreword, there are several ways of approaching the description of phenomena which spread in space, and which exhibit a certain spatial structure. One such approach is to consider them as objects, i.e., as subsets of their space of definition. The method which derives from this point of view is. called mathematical morphology [l, 21. In order to define mathematical morphology, we first require some background definitions. Consider an arbitrary space (or set) E. The “objects” of this :space are the subsets X c E; therefore, the family that we have to handle theoretically is the set 0 (E) of all the subsets X of E. The set p(E) is incomparably less arbitrary than E itself; indeed it is constructured to be a Boolean algebra [3], that is: (i) p(E) is a complete lattice, i.e., is provided with a partial-ordering relation, called inclusion, and denoted by “ c .” Moreover every (finite or not) family of members Xi E p(E) has a least upper bound (their union C/Xi) and a greatest lower bound (their intersection f7 X,) which both belong to p(E); (ii) The lattice p(E) is distributiue, i.e., xu(Ynz)=(XuY)n(xuZ) VX,Y,ZE b(E) and is complemented, i.e., there exist a greatest set (E itself) and a smallest set 0 (the empty set) such that every X E p(E) possesses a complement Xc defined by the relationships: XUXC=E and xn xc= 0.
    [Show full text]
  • Newsletternewsletter Official Newsletter of the International Association for Mathematical Geology
    No. 71 December 2005 IAMGIAMG NewsletterNewsletter Official Newsletter of the International Association for Mathematical Geology Contents oronto - welcoming city on the shores of Lake Ontario and site of IAMG 2005 this last August. The organizers of the confer- ence chose well: Hart House of the University of Toronto, an President’s Forum .................................................................................3 Tivy-draped, Oxbridge style college building, recalling the British her- IAMG Journal Report ...........................................................................4 itage, was a very suitable venue for plenary talks in the “Great Hall”, topical sessions in various smaller rooms, spaces for work sessions, Association Business ............................................................................4 posters and the “music room” for reading, computer connections, and The Matrix Man ....................................................................................5 listening to the occasional piano player. Member News .......................................................................................5 Downtown Toronto turned out to be a nicely accessible city with Conference Reports ...............................................................................6 many places within walking distance from the university, and a good public transportation system of Toronto Photo Album ............................................................................7 subways and bus lines to reach Student Affairs ....................................................................................10
    [Show full text]
  • Learning Deep Morphological Networks with Neural Architecture Search APREPRINT
    LEARNING DEEP MORPHOLOGICAL NETWORKS WITH NEURAL ARCHITECTURE SEARCH APREPRINT Yufei Hu Nacim Belkhir U2IS, ENSTA Paris, Institut Polytechnique de Paris Safrantech, Safran Group [email protected] [email protected] Jesus Angulo Angela Yao CMM, Mines ParisTech, PSL Research University School of Computing National University of Singapore [email protected] [email protected] Gianni Franchi U2IS, ENSTA Paris, Institut Polytechnique de Paris [email protected] June 16, 2021 ABSTRACT Deep Neural Networks (DNNs) are generated by sequentially performing linear and non-linear processes. Using a combination of linear and non-linear procedures is critical for generating a sufficiently deep feature space. The majority of non-linear operators are derivations of activation functions or pooling functions. Mathematical morphology is a branch of mathematics that provides non-linear operators for a variety of image processing problems. We investigate the utility of integrating these operations in an end-to-end deep learning framework in this paper. DNNs are designed to acquire a realistic representation for a particular job. Morphological operators give topological descriptors that convey salient information about the shapes of objects depicted in images. We propose a method based on meta-learning to incorporate morphological operators into DNNs. The learned architecture demonstrates how our novel morphological operations significantly increase DNN performance on various tasks, including picture classification and edge detection. Keywords Mathematical Morphology; deep learning; architecture search. arXiv:2106.07714v1 [cs.CV] 14 Jun 2021 1 Introduction Over the last decade, deep learning has made several breakthroughs and demonstrated successful applications in various fields (e.g.
    [Show full text]
  • Puupintojen Laadunvalvonta Ja Luokittelu
    Image thresholding During the thresholding process, individual pixels in an image are marked as “object” pixels if their value is greater than some threshold value (assuming an object to be brighter than the background) and as “background” pixels otherwise. This convention is known as threshold above. Variants include threshold below, which is opposite of threshold above; threshold inside, where a pixel is labeled "object" if its value is between two thresholds; and threshold outside, which is the opposite of threshold inside (Shapiro, et al. 2001:83). Typically, an object pixel is given a value of “1” while a background pixel is given a value of “0.” Finally, a binary image is created by coloring each pixel white or black, depending on a pixel's label. Image thresholding Sezgin and Sankur (2004) categorize thresholding methods into the following six groups based on the information the algorithm manipulates (Sezgin et al., 2004): • histogram shape-based methods, where, for example, the peaks, valleys and curvatures of the smoothed histogram are analyzed • clustering-based methods, where the gray-level samples are clustered in two parts as background and foreground (object), or alternately are modeled as a mixture of two Gaussians • entropy-based methods result in algorithms that use the entropy of the foreground and background regions, the cross-entropy between the original and binarized image, etc. • object attribute-based methods search a measure of similarity between the gray-level and the binarized images, such as fuzzy shape similarity, edge coincidence, etc. • spatial methods [that] use higher-order probability distribution and/or correlation between pixels • local methods adapt the threshold value on each pixel to the local image characteristics." Mathematical morphology • Mathematical Morphology was born in 1964 from the collaborative work of Georges Matheron and Jean Serra, at the École des Mines de Paris, France.
    [Show full text]
  • Mathematical Morphology
    Mathematical morphology Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception http://cmp.felk.cvut.cz/˜hlavac, [email protected] Outline of the talk: Point sets. Morphological transformation. Skeleton. Erosion, dilation, properties. Thinning, sequential thinning. Opening, closing, hit or miss. Distance transformation. Morphology is a general concept 2/55 In biology: the analysis of size, shape, inner structure (and relationship among them) of animals, plants and microorganisms. In linguistics: analysis of the inner structure of word forms. In materials science: the study of shape, size, texture and thermodynamically distinct phases of physical objects. In signal/image processing: mathematical morphology – a theoretical model based on lattice theory used for signal/image preprocessing, segmentation, etc. Mathematical morphology, introduction 3/55 Mathematical morphology (MM): is a theory for analysis of planar and spatial structures; is suitable for analyzing the shape of objects; is based on a set theory, integral algebra and lattice algebra; is successful due to a a simple mathematical formalism, which opens a path to powerful image analysis tools. The morphological way . The key idea of morphological analysis is extracting knowledge from the relation of an image and a simple, small probe (called the structuring element), which is a predefined shape. It is checked in each pixel, how does this shape matches or misses local shapes in the image. MM founding fathers 4/55 Georges Matheron (∗ 1930, † 2000) Jean Serra (∗ 1940) Matheron, G. Elements pour une Theorie del Milieux Poreux Masson, Paris, 1967. Serra, J. Image Analysis and Mathematical Morphology, Academic Press, London 1982.
    [Show full text]
  • Revised Mathematical Morphological Concepts
    Advances in Pure Mathematics, 2015, 5, 155-161 Published Online March 2015 in SciRes. http://www.scirp.org/journal/apm http://dx.doi.org/10.4236/apm.2015.54019 Revised Mathematical Morphological Concepts Joseph Ackora-Prah, Yao Elikem Ayekple, Robert Kofi Acquah, Perpetual Saah Andam, Eric Adu Sakyi, Daniel Gyamfi Department of Mathematics, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana Email: [email protected], [email protected], [email protected], [email protected], [email protected], [email protected] Received 17 February 2015; accepted 12 March 2015; published 23 March 2015 Copyright © 2015 by authors and Scientific Research Publishing Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/ Abstract We revise some mathematical morphological operators such as Dilation, Erosion, Opening and Closing. We show proofs of our theorems for the above operators when the structural elements are partitioned. Our results show that structural elements can be partitioned before carrying out morphological operations. Keywords Mathematical Morphology, Dilation, Erosion, Opening, Closing 1. Introduction Mathematical morphology is the theory and technique for the analysis and processing of geometrical structures, based on set theory, lattice theory, topology, and random functions. We consider classical mathematical mor- phology as a field of nonlinear geometric image analysis, developed initially by Matheron [1], Serra [2] and their collaborators, which is applied successfully to geological and biomedical problems of image analysis. The basic morphological operators were developed first for binary images based on set theory [1] [2] inspired by the work of Minkowski [3] and Hadwiger [4].
    [Show full text]
  • Prelucrarea Imaginilorimaginilor Curscurs 88 Morphologicalmorphological Imageimage Processingprocessing
    PrelucrareaPrelucrarea ImaginilorImaginilor CursCurs 88 MorphologicalMorphological ImageImage ProcessingProcessing Utilizate in extragerea componentelor unei imagini la reprezentare si descriere: Extragere contur Schelet Invelitoare convexa Filtrare Subtiere Curatare ... 2/21 GrayGray--ScaleScale imagesimages -- EroziuneEroziune,, DilatareDilatare Functiile pentru valorile nuantelor de gri: XX(x,y) Æ obiect BB(x,y) Æ element structural DilatareaDilatarea luilui XX prin BB, notată cu XX ℗ BB este: (XX ℗ B)B (s,t) = MaxMax{XX(s-x,y-t)++BB(x,y) / ((s-x),(y-t))∈XX, (x,y)∈BB} EroziuneaEroziunea lui X de către BB, notată cu XXΘΘBB este: (XX Θ B)B (s,t) = MinMin{XX(s+x,y+t)--BB(x,y) / ((s+x),(y+t))∈XX, (x,y)∈BB} 3/21 …… GrayGray--ScaleScale imagesimages - Eroziune, Dilatare ... proprietăţi: ExempluExemplu:: X,X, XX ℗ B,B, XX Θ BB :: Dualitate (eroziunea şi dilatarea sunt duale faţă de complementare notată cu XC): (X(XC ℗℗ ⌐B)B) (s,t) == (X(X ΘΘ B)B)C (s,t) ,, unde: XXC == --XX (x,y) si ⌐BB == BB (-x,-y).. 4/21 … Morphological Image Processing - Transformări uzuale derivate Deschiderea lui X faţă de B, notată cu XB este : XB = (X Θ B) ℗ B; B Închiderea lui X faţă de B, notată cu X este: XB = (X ℗ B) Θ B; Dualitate (Deschiderea şi Închiderea ) : B C C ((X ) = (X(X )) (⌐B) 5/21 … Morphological Image Processing - Transformări uzuale derivate Netezire morfologica : B gg = (XB) ; Efect: atenuare a nuantelor deschise/inchise si a zgomotului: 6/21 … Morphological Image Processing - Transformări uzuale derivate Gradientul morfologic : gg = (X ℗ B) – (X Θ B); Top-Hat : hh = X - XB; 7/21 … Morphological Image Processing - Transformări uzuale derivate Segmentare texturala : Se aplica operatorul de inchidere utilizand succesiv elemente structurale mai mari decat elementele de textura mici; Se aplica operatorul de deschidere utilizand un element structural mai mare decat distanta dintre elemntele de textura mari; Avand o regiune deschisa in stanga si una inchisa in dreapta, vom folosi un prag simplu pentru a rezulta granita dintre cele doua texturi.
    [Show full text]
  • Medium Resolution
    IAMGIAMG No. 75 December 2007 NewsletterNewsletter Official Newsletter of the International Association for Mathematical Geology Contents t’s about time! We finally will have a female president: Vera President’s Forum ............................................................................3 Pawlowsky-Glahn from the University of Girona in Spain Association Business .......................................................................4 Iwill take over as IAMG president in 2008. As Frits points out IAMG Distinguished Lecturers ........................................................4 in the President’s Forum she is well qualified for the job, and we Forthcoming IAMG Name Change .................................................5 look forward to her “reign”. This is a first for the IAMG, but other Membership Campaign ...................................................................5 organizations have preceded us in electing female presidents. The largest one, AAPG, has had only one, Robbie Gries, in Slate of candidates for the 2008-2012 IAMG Council ...............6-11 2001. At SEPM Mary Kraus will take over the presidency in Responsibilities of Officers and Councilors .................................. 11 the coming year. A cursory survey of a few other associations Member News ...........................................................................11-12 with easily accessible data shows three female presidents in SPE Where Are They Now .................................................................... 11 (DeAnn Creig in 1998,
    [Show full text]
  • A Tribute to Prof. Dominique Jeulin Jean Serra, François Willot
    Special topic on multiscale modeling of granular media: a tribute to Prof. Dominique Jeulin Jean Serra, François Willot To cite this version: Jean Serra, François Willot. Special topic on multiscale modeling of granular media: a tribute to Prof. Dominique Jeulin. Image Analysis and Stereology, International Society for Stereology, 2019, 38 (1), pp.1. 10.5566/ias.2146. hal-02102998 HAL Id: hal-02102998 https://hal.archives-ouvertes.fr/hal-02102998 Submitted on 18 Apr 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Image Anal Stereol 2019;38:1–2 doi:10.5566/ias.2146 Editorial SPECIAL TOPIC ON MULTISCALE MODELING OF GRANULAR MEDIA: A TRIBUTE TO PROF. DOMINIQUE JEULIN JEAN SERRA1 AND FRANC¸ OIS WILLOT2 1Laboratoire d’Informatique Gaspard-Monge, ESIEE, Paris-Est University, France, 2Centre for Materials, PSL Research University, Mines ParisTech, France e-mail: [email protected],[email protected] ABSTRACT A few words on the present special topic, devoted to the multiscale modeling of granular media, and published in honor of Prof. Dominique Jeulin’s enduring contribution to the wide field of image analysis, random structures and material science.
    [Show full text]
  • Mathematical Morphology Operators
    IMAGE FILTERING WITH MATHEMATICAL MORPHOLOGY OPERATORS DR. – ING. GABRIELE CAVALLARO, JUELICH SUPERCOMPUTING CENTRE (JSC) DEPUTY HEAD - HIGH PRODUCTIVITY DATA PROCESSING RESEARCH GROUP 18.05.2020, IMAGE PROCESSING FOR REMOTE SENSING (INVITED LECTURE), TECHNICAL UNIVERSITY OF BERLIN LECTURER Gabriele Cavallaro . Since 2013 working in the field of remote sensing and image processing . Holds PhD in Electrical and Computer Engineering (University of Iceland - 2016) − BS and MS Degrees in Telecommunications Engineering (University of Trento – 2011,2013) . Postdoctoral researcher at Forschungszentrum Juelich - Juelich Supercomputing Centre (since 2016) − Deputy Head of the High Productivity Data Processing group − The group focuses on application-driven parallel and scalable machine learning methods that exploit innovative high performance and distributed computing technologies . Research interests − Processing and analysis of high dimensional remote sensing data − Parallel and scalable machine (deep) learning with HPC . Contact − Email: [email protected] − Website: https://www.gabriele-cavallaro.com/ Page 2 FORSCHUNGSZENTRUM JUELICH (FZJ) Multi-Disciplinary Research Centre of the Helmholtz Association in Germany (Juelich Supercomputing Centre - JSC) [1] Holmholtz Association Facility on 2.2 . Selected Facts 2 − One of EU’s largest inter-disciplinary research centres (~6000 employees) − Special expertise in physics, materials science, nanotechnology, neuroscience and medicine & information technology (HPC & Data) Page 3 JUELICH SUPERCOMPUTING CENTRE (JSC) Evolution of Supercomputers and Research activities . JSC is part of the Institute for Advance Simulation (IAS) − Operate supercomputers (->TOP500) and cloud systems − Unique support and research environment . R&D work − Algorithms, computational science, performance tools − Scientific big data analytics and data management − Exascale labs (e.g., NVIDIA) and Co-design projects (DEEP) . With General purpose processors .
    [Show full text]
  • Fundamenta Morphologicae Mathematicae * 1. Introduction
    Fundamenta Informaticae 41 (2000) 1-31 1 !OS Press Fundamenta Morphologicae Mathematicae * John Goutsias t Center for Imaging Science and Department of Electrical and Computer· Engineering The Johns Hopkins University Baltimore, MD 21218, U. S. A. [email protected] Henk J .A.M. Heijmans Centre for Mathematics and Computer Science P.O. Box 94079 1090 GB Amsterdam, The Netherlands [email protected] Abstract. Mathematical morphology is a geometric approach in image processing and anal­ ysis with a strong mathematical f!avor. Originally, it was developed as a powerful tool for shape analysis in binary and, later, grey-scale images. But it was soon recognized that the underlying ideas could be extended naturally to a much wider class of mathematical ob­ jects, namely complete lattices. This paper presents, in a bird's eye view, the foundations of mathematical morphology, or more precisely, the theory of morphological operators on complete lattices. Keywords: adjunction, alternating sequential filter, Boolean function, closing, complete lattice, connectivity, connected operator, dilation, erosion, flat operator, fuzzy set, grain operator, granulometry, grey-scale image, idempotence, mathematical morphology, morpho­ logical filter, morphological operator, multivalued image, opening, thresholding. 1. Introduction In 1975, a seminal book by Georges Matheron, entitled Random Sets and Integral Geometry, appeared in the literature [20]. This book laid down the foundations of a novel technique for • This work was supported in part by NATO Collaborative Research Grant CRG.971503. The work of the first author was also supported by the Office of Naval Research, Mathematical, Computer, and Information Sciences Division, under ONR Grant N00014-90-1345, and by the National Science Foundation, under NSF Award #9729576.
    [Show full text]
  • The Birth of Mathematical Morphology
    ISMM 2000 , Xeros Center Palo-Alto, June 2000 The Birth of Mathematical Morphology Georges Matheron and Jean Serra G. Matheron, J. Serra Ecole des Mines de Paris ( 2000 ) Birth of Math. Morph. 1 ISMM 2000 , Xeros Center Palo-Alto, June 2000 Context • Before considering how Mathematical Morphology originated in 1964, we will describe briefly the backgrounds of its two founders at the beginning of that year, • even though they were hardly aware of the theoretical turn they would take a few months later. G. Matheron, J. Serra Ecole des Mines de Paris ( 2000 ) Birth of Math. Morph. 2 ISMM 2000 , Xeros Center Palo-Alto, June 2000 First Protagonist • Georges Matheron was a mining engineer from the Corps des Mines, 34 years old, working with the B.R.G.M. ( i.e. geological survey) , in Paris. • At the end of 1963, he had just achieved the doctrinal body of his theory concerning the estimation of deposits, called Geostatistics, and started in Algeria ten years before. G. Matheron, J. Serra Ecole des Mines de Paris ( 2000 ) Birth of Math. Morph. 3 ISMM 2000 , Xeros Center Palo-Alto, June 2000 First Protagonist (II) • It was time for a break and for investigating new horizons beyond the mining world. • His publication of reports paused at that time, decreasing from fifty in ten years to none in ten months. He wouldn't return to geostatistics until January 1969, five years later, via universal kriging. G. Matheron, J. Serra Ecole des Mines de Paris ( 2000 ) Birth of Math. Morph. 4 ISMM 2000 , Xeros Center Palo-Alto, June 2000 Second Protagonist • Jean Serra was a civil engineer from the Ecole des Mines de Nancy.
    [Show full text]