2. Algorithms and Modern Computer Science Dr. Marina L. Gavrilova Dept of Comp. Science, University of Calgary, AB, Canada, T2N1N4

3. Presentation outline About my research About my research Data structures and algorithms to be studied Data structures and algorithms to be studied Application areas Application areas Optimization and computer modelingOptimization and computer modeling Image processing and computer graphicsImage processing and computer graphics Spatial dataSpatial data BiometricsBiometrics Summary Summary

4. My Research Interests Computer modeling and simulation Computer modeling and simulation Computational geometry Computational geometry Image processing and visualization Image processing and visualization Voronoi diagram and Delaunay triangulation Voronoi diagram and Delaunay triangulation Biometric technologies Biometric technologies Collision detection optimization Collision detection optimization Terrain modeling and visualization Terrain modeling and visualization Computational methods in spatial analysis and GIS Computational methods in spatial analysis and GIS

5. Interests and affiliations SPARCS Lab Co-Founder and Director BT Lab Co-Founder and Director Computational Geometry and Applications Founder and Chair since 2001 ICCSA Conference series Scientific Chair (since 2003) Transactions on Computational Science Journal Springer Editor-in-Chief Research topics: optimization, reliability, geometric algorithms, data structures representation and visualization, GIS, spatial analysis, biometric modeling

6. Data Structures to be Studied Hashing and hash tables Hashing and hash tables Trees Trees Spatial subdivisions Spatial subdivisions Graphs Graphs Flow networks Flow networks Geometric data structures Geometric data structures

7. Algorithms to be studies Search heuristics Search heuristics Encoding and compression techniques Encoding and compression techniques Linear programming Linear programming Dynamic programming Dynamic programming Game design techniques Game design techniques Randomized algorithms Randomized algorithms

8. Long-Term Goals of Research in Computer Science Provide a solution to a problem Provide a solution to a problem Decrease possibility of an error Decrease possibility of an error Improve methodology or invent a novel solution Improve methodology or invent a novel solution Make solution more robust Make solution more robust Make solution more efficient Make solution more efficient Make solution less memory consuming Make solution less memory consuming

9. Examples of data structures applications in areas of computer science Typical applications: Typical applications: Heaps for data ordering and faster access in operating systemsHeaps for data ordering and faster access in operating systems K-d trees for multi-dimensional database searchesK-d trees for multi-dimensional database searches B, B*, B+ trees for file accessesB, B*, B+ trees for file accesses Geometric data structures for geographical data representation and processingGeometric data structures for geographical data representation and processing Compression algorithms for remote access, Internet, network transmission and securityCompression algorithms for remote access, Internet, network transmission and security Search heuristics for game strategy implementationSearch heuristics for game strategy implementation

10. Recent trends The old definition of computer science—the study of phenomena surrounding computers—is now obsolete. Computing is the study of natural and artificial information processes. The old definition of computer science—the study of phenomena surrounding computers—is now obsolete. Computing is the study of natural and artificial information processes. ACM Communications 50-07-2007 ACM Communications 50-07-2007

11. More Advanced Applications Data structures in Optimization and Computer Simulation Data structures in Optimization and Computer Simulation Data structures in Image Processing and Computer Graphics Data structures in Image Processing and Computer Graphics Data structures in GIS (Geographical Information Systems) and statistical analysis Data structures in GIS (Geographical Information Systems) and statistical analysis Data structures in biometrics Data structures in biometrics

12. Back then…

13. And now… Einar Rustad, VP Business Development, Dolphin Interconnect Solutions

14. But algorithms still should work, or else …

15. State of the art in computing Horst Simon Director NERSC, Lawrence Berkeley National Laboratory

16. High performance computing

17. Increased Scientific Demands

18. Space partitioningSpace partitioning TreesTrees Geometric data structuresGeometric data structures Part 1. Optimization and Computer Modeling Biological systems (plants, corals) Granular-type materials (silo, shaker, billiards) Molecular systems (fluids, lipid bilayers, protein docking) GIS terrain modeling

19. Pool of Data Structures Dynamic Delaunay triangulation Spatial subdivisions k cells Segment trees K-d trees Interval trees Combination of data structures

20. Collision detection optimization Problem: A set of n moving particles is given in the plane or 3D with equations of their motion. It is required to detect and handle collisions between objects and/or boundaries. Collisions are instantaneous and one-on-one only. Approach: Use dynamic data structures in the context of time-step event oriented simulation model. Data structures implemented are: dynamic generalized DT dynamic generalized DT regular spatial subdivision regular spatial subdivision regular spatial tree regular spatial tree set of segment tree set of segment tree

21. The nearest-neighbor problem Task: To find the nearest-neighbor in a system of circular objects {Gavrilova 01} Approach: To use generalized Voronoi diagram in Manhattan and power metric and k-d tree as a data structure. The Initial Distribution Generator (IDG) module: Used to create various input configurations: the uniform distribution of sites in a square, the uniform distribution of sites in a circle, cross, ring, degenerate grid and degenerate circle. The parameters for automatic generation are: the number of sites, the distribution of their radii, the size of the area, and the type of the distribution. The Nearest-Neighbour Monitor (NNM) module: The program constructs the additively weighted supremum VD, the power diagram and the k-d tree in supremum metric; performs series of nearest-neighbour searches and displays statistics. Tests: large data sets (10000 particles), silo model

22. Example: supremum VD and DT The supremum weighted Voronoi diagram (left) and the corresponding Delaunay triangulation (right) for 1000 randomly distributed sites.

23. Study of porous materials in 3d Collaborators: N.N. Medvedev, V.A.Luchnikov, V. P. Voloshin, Russian Academy of Sciences, Novosibirsk [Luchnikov 01]. Task: To study the properties of the system of polydisperse spheres in 3D, confined inside a cylindrical container. Approach: A boundary of a container is considered as one of the elements of the system. To compute the Voronoi network for a set of balls in a cylinder we use the modification of the known 3D incremental construction technique, discussed in {Gavrilova et. al.} To compute the Voronoi network for a set of balls in a cylinder we use the modification of the known 3D incremental construction technique, discussed in {Gavrilova et. al.} The center of an empty sphere, which moves inside the system so that it touches at least three objects at any moment of time, defines an edge of the 3D Voronoi network. The center of an empty sphere, which moves inside the system so that it touches at least three objects at any moment of time, defines an edge of the 3D Voronoi network. Tests: porous materials, molecular structures

24. Example: 3D Euclidean Voronoi diagram 3D Euclidean Voronoi diagram: hyperbolic arcs identify voids – empty spaces around items obtained by Monte Carlo method.

25. Experiments The approach was tested on a system representing dense packing of 300 Lennard-Jones atoms. The largest channels of the Voronoi network occur near to the wall of the cylinder. A fraction of large channels along the wall is higher for the model with the fixed diameter (right) than for the model with relaxed diameter (left).

26. Space partitioningSpace partitioning TreesTrees Geometric data structuresGeometric data structures CompressionCompression Search heuristicsSearch heuristics Part 2. Image processing and Computer Graphics Image reconstruction Image compression Morphing Detail enhancement Image comparison Pattern recognition

27. Pattern Matching Aside from a problem of measuring the distance, pattern matching between the template and the given image is a very serious problem on its own. Aside from a problem of measuring the distance, pattern matching between the template and the given image is a very serious problem on its own.

28. Template Matching approach to Symbol Recognition Compare an image with each template and see which one gives the best mach (courtesy of Prof. Jim Parker, U of C)

29. Good Match Image Template Most of the pixels overlap means a good match (courtesy of Prof. Jim Parker, U of C)

30. Distance Transform Given an n x m binary image I of white and black pixels, the distance transform of I is a map that assigns to each pixel the distance to the nearest black pixel (a feature).

31. Medial axis transform The medial axis, or skeleton of the set D, denoted M(D), is defined as the locus of points inside D which lie at the centers of all closed discs (or spheres) which are maximal in D, together with the limit points of this locus. The medial axis, or skeleton of the set D, denoted M(D), is defined as the locus of points inside D which lie at the centers of all closed discs (or spheres) which are maximal in D, together with the limit points of this locus.

32. Medial axis transform

33. Voronoi diagram in 3D

34. Space partitioningSpace partitioning GridsGrids Distance metricsDistance metrics Geometric data structuresGeometric data structures Part 3. Spatial Data and GIS Terrain visualization Terrain modeling Urban planning City planning GIS systems design Navigation and tracking problems Statistical analysis

35. GIS studies - SPARCS Lab Collaborators: S. Bertazzon, Dept. of Geography, C. Gold, Hong Kong Polytechnic, M. Goodchild, Santa Barbara Problem: study or patterns and correlation among attributed geographical entities, including health, demographic, education etc. statistics. Approach: pattern analysis using 3D Voronoi diagram, spatial statistics and autocorrelation using L p metrics, pattern matching and visualization

36. Terrain models

37. Quantitative Map Analysis

38. DEM: Digital Elevation Model Contains only relative Height Regular interval Pixel color determine height Discrete resolution

39. Non-Photo-Realistic Real-time 3D Terrain Rendering Uses DEM as input of the application Generates frame coherent animated view in real-time Uses texturing, shades, particles etc. for layer visualization

40. HashingHashing Space partitioningSpace partitioning TreesTrees Geometric data structuresGeometric data structures SearchingSearching Part 4. Biometrics Biometric identification Biometric recognition Biometric synthesis

41. Background Biometrics refers to the automatic identification of a person based on his/her physiological or behavioral characteristics. Biometrics refers to the automatic identification of a person based on his/her physiological or behavioral characteristics.

42. Thermogram vs. distance transform Thermogram of an ear (Brent Griffith, Infrared Thermography Laboratory, Lawrence Berkeley National Laboratory )

43. Nearest Neighbor Approach Voronoi diagram Voronoi diagram Directions of feature points Directions of feature points

44. Delaunay Triangulation of Minutiae Points

45. (a) Binary Hand (b) Hand Contour

46. Spatial Interpolation using RBF(Radial Basis Functions) Deformation in 2D and 3D

47. Summary Data structures and algorithms studies in the course are powerful tools not only for basic operation of computer systems and networks but also a vast array of techniques for advancing the state of the research in various computer science disciplines. Data structures and algorithms studies in the course are powerful tools not only for basic operation of computer systems and networks but also a vast array of techniques for advancing the state of the research in various computer science disciplines.