Johann Radon Institute for Computational and Applied Mathematics: www.ricam.oeaw.ac.at 1/38 Mathematische Grundlagen in Vision & Grafik (710.100) more.

Slides:



Advertisements
Similar presentations
Signal- und Bildverarbeitung, 323
Advertisements

Johann Radon Institute for Computational and Applied Mathematics: 1/25 Signal- und Bildverarbeitung, Image Analysis and Processing.
Ter Haar Romeny, FEV Geometry-driven diffusion: nonlinear scale-space – adaptive scale-space.
Ter Haar Romeny, ICPR 2010 Introduction to Scale-Space and Deep Structure.
Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
Various Regularization Methods in Computer Vision Min-Gyu Park Computer Vision Lab. School of Information and Communications GIST.
Johann Radon Institute for Computational and Applied Mathematics: 1/35 Signal- und Bildverarbeitung, Image Analysis and Processing.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Ter Haar Romeny, FEV Vesselness: Vessel enhancement filtering Better delineation of small vessels Preprocessing before MIP Preprocessing for segmentation.
Ter Haar Romeny, Computer Vision 2014 Geometry-driven diffusion: nonlinear scale-space – adaptive scale-space.
Johann Radon Institute for Computational and Applied Mathematics: 1/33 Signal- und Bildverarbeitung, Image Analysis and Processing.
Johann Radon Institute for Computational and Applied Mathematics: 1/31 Signal- und Bildverarbeitung, Image Analysis and Processing.
Johann Radon Institute for Computational and Applied Mathematics: 1/39 The Gaussian Kernel, Regularization.
Signal- und Bildverarbeitung, 323
Johann Radon Institute for Computational and Applied Mathematics: 1/28 Signal- und Bildverarbeitung, Image Analysis and Processing.
ECE 472/572 - Digital Image Processing Lecture 8 - Image Restoration – Linear, Position-Invariant Degradations 10/10/11.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Lecture 4 Linear Filters and Convolution
Motion Tracking. Image Processing and Computer Vision: 82 Introduction Finding how objects have moved in an image sequence Movement in space Movement.
Computer Vision Group Edge Detection Giacomo Boracchi 5/12/2007
1 Image filtering Hybrid Images, Oliva et al.,
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
Computer Vision Introduction to Image formats, reading and writing images, and image environments Image filtering.
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering
Highlights Lecture on the image part (10) Automatic Perception 16
Image Enhancement.
Lecture 2: Image filtering
Optical Flow Estimation using Variational Techniques Darya Frolova.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
Johann Radon Institute for Computational and Applied Mathematics: 1/49 Signal- und Bildverarbeitung, silently converted to:
Linear Algebra and Image Processing
Johann Radon Institute for Computational and Applied Mathematics: 1/48 Mathematische Grundlagen in Vision & Grafik ( ) more.
Computer vision.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
Image Processing Edge detection Filtering: Noise suppresion.
Image Processing Jitendra Malik. Different kinds of images Radiance images, where a pixel value corresponds to the radiance from some point in the scene.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
Digital Image Processing Lecture 10: Image Restoration March 28, 2005 Prof. Charlene Tsai.
Scale Space Geometry Arjan Kuijper Scale Space Geometry; PhD course on Scale Space, Cph 1-5 Dec Deep structure The challenge is.
Digital Image Processing Lecture 10: Image Restoration
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Axioms Arjan Kuijper Axioms; PhD course on Scale Space, Cph 1-5 Dec Axioms of measurements and scale I1I2I3O KYBL1F1APN L2F2 Convolution.
Math 3360: Mathematical Imaging Prof. Ronald Lok Ming Lui Department of Mathematics, The Chinese University of Hong Kong Lecture 11: Types of noises.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP7 Spatial Filters Miguel Tavares Coimbra.
Visual Computing Computer Vision 2 INFO410 & INFO350 S2 2015
Measurements and Scale Arjan Kuijper
Instructor: Mircea Nicolescu Lecture 7
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Projects Project 1a due this Friday Project 1b will go out on Friday to be done in pairs start looking for a partner now.
An Introduction to Digital Image Processing Dr.Amnach Khawne Department of Computer Engineering, KMITL.
Filters– Chapter 6. Filter Difference between a Filter and a Point Operation is that a Filter utilizes a neighborhood of pixels from the input image to.
Miguel Tavares Coimbra
Digital Image Processing
PDE Methods for Image Restoration
SIFT Scale-Invariant Feature Transform David Lowe
- photometric aspects of image formation gray level images
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering Northern Arizona University.
Advanced Engineering Mathematics 6th Edition, Concise Edition
Scale Invariant Feature Transform (SIFT)
Linear Filters and Edges Chapters 7 and 8
Linear Filters T-11 Computer Vision University of Houston
Edge Detection CS 678 Spring 2018.
Jeremy Bolton, PhD Assistant Teaching Professor
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Lecture 2: Edge detection
Lecture 2: Edge detection
Presentation transcript:

Johann Radon Institute for Computational and Applied Mathematics: 1/38 Mathematische Grundlagen in Vision & Grafik ( ) more appropriate title: Scale Space and PDE methods in image analysis and processing Arjan Kuijper Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences Altenbergerstraße 56 A-4040 Linz, Austria

Johann Radon Institute for Computational and Applied Mathematics: 2/38 Contents Image analysis & processing deals with the investigation of images and the application of specific tasks on them, like enhancement, denoising, deblurring, and segmentation. Mathematical methods that are commonly used are presented and discussed. The focus will be on the axiomatic choice for the models, their mathematical properties, and their practical use.

Johann Radon Institute for Computational and Applied Mathematics: 3/38 Image analysis & processing As image analysis and processing is a mixture of several disciplines, like physics, mathematics, vision, computer science, and engineering, this course is aimed at a broad audience. Only basic knowledge of analysis is assumed and necessary mathematical tools will be outlined during the meetings. Computer Vision Human Perception … Mathematics Medicine Computer Science Electrical Engineering

Johann Radon Institute for Computational and Applied Mathematics: 4/38 Some key words Images & Observations: –Scale space, regularization, distributions. Filtering: –Edge detection, enhancement, Wiener, Fourier, … Objects: –Differential structure, invariants, feature detection Deep structure: –Catastrophes & Multi-scale Hierarchy Variational Methods & Partial Differential Methods: –Perona Malik, Anisotropic Diffusion, Total Variation, Mumford-Shah. Curve Evolution: –Normal Motion, Mean Curvature Motion, Euclidian Shortening Flow.

Johann Radon Institute for Computational and Applied Mathematics: 5/38 Contents : Introduction, Axioms, Gaussian kernel : Derivatives, deblurring, Differential structure I : Differential structure II, invariants, Perona Malik, Total Variation Deep structure : Mean Curvature Motion, Mumford Shah, : presentation : presentation : presentation

Johann Radon Institute for Computational and Applied Mathematics: 6/38 Examination Investigation and public presentation of recent work in image analysis provided at the course: –Front-End Vision and Multi-scale Image Analysis, B. M. ter Haar Romeny Kluwer Academic Publishers, Chapter 17: Optic Flow Chapter 18: Color Differential Structure Chapter 19: Steerable kernels –Handbook of Mathematical Models in Computer Vision, Edited by N. Paragios, Y. Chen and O. Faugeras Springer, 2005 Chapter 1: Diffusion Filters and Wavelets Chapter 2: Total Variation Image Restoration Chapter 3: PDE-Based Image and Surface Inpainting –…… A written exam (questions) on contents of the course.

Johann Radon Institute for Computational and Applied Mathematics: 7/38 Introduction, Axioms

Johann Radon Institute for Computational and Applied Mathematics: 8/38 Introduction Apertures and the notion of scale –Observations and the size of apertures –Mathematics, physics, and vision –We blur by looking –A critical view on observations Taken from B. M. ter Haar Romeny, Front-End Vision and Multi-scale Image Analysis, Dordrecht, Kluwer Academic Publishers, Chapter 1

Johann Radon Institute for Computational and Applied Mathematics: 9/38 Observations and the size of apertures What is a cloud? Observations are always done by integrating some physical property with a measurement device.

Johann Radon Institute for Computational and Applied Mathematics: 10/38 Measurements A typical image:

Johann Radon Institute for Computational and Applied Mathematics: 11/38 Mathematics, physics, and vision –Observations: math vs. physics Objects have a size. –Points don’t exist in reality. Objects live on a range of various sizes. –They contain several scales. Objects are measured by some device. –Cameras, the eye, … Devices are finite. –They have a minimum and a maximum detection range: the inner and outer scale. They determine the spatial resolution. The device measures an hierarchy of structures.

Johann Radon Institute for Computational and Applied Mathematics: 12/38 From Wikipedia: Powers of Ten “Powers of Ten is a 1977 short documentary film which depicts the relative scale of the Universe in factors of ten (see also logarithmic scale and order of magnitude). It was written and directed by Charles and Ray Eames. The idea for the film appears to have come from the 1957 book Cosmic View by Kees Boeke.”Powers of Ten

Johann Radon Institute for Computational and Applied Mathematics: 13/38 We blur by looking

Johann Radon Institute for Computational and Applied Mathematics: 14/38 The visual system We see multi-scale: –The images only contain two values (black and white). –We regards them as grey level images, or see structure.

Johann Radon Institute for Computational and Applied Mathematics: 15/38 A critical view on observations –Infinite resolution is impossible. –We cannot measure at infinite resolution. –Take uncommitted observations –There is no bias, no knowledge, no memory. “We know nothing”. –At least, at the first stage. Refine later on. –Allow different scales. –There’s more than just pixels. –View all scales. –There is no preferred size. –Noise is part of the measurement. –In a measurement noise can only be separated from the observation if we have a model of the structures in the image, a model of the noise, or a model of both.

Johann Radon Institute for Computational and Applied Mathematics: 16/38 Spurious resolution Don’t trust the gridsize.

Johann Radon Institute for Computational and Applied Mathematics: 17/38 You don’t see what you see Don’t trust the resolution / nearest neighbor interpolation. –What does a detector of a 3 pixels circular size detect? Do you see the image as it is? Or did you see it in a modified way and is its intrinsic size different?

Johann Radon Institute for Computational and Applied Mathematics: 18/38 Summary Observations are necessarily done through a finite aperture. –Making this aperture infinitesimally small is not a physical reality. –The size of the aperture determines a hierarchy of structures, which occur naturally in (natural) images. –The visual system exploits a wide range of such observation apertures in the front-end simultaneously, in order to capture the information at all scales. Observed noise is part of the observation. –There is no way to separate the noise from the data if a model of the data, a model of the noise or a model of both is absent. The aperture cannot take any form. –An example of a wrong aperture is the square pixel so often used when zooming in on images. –Such a representation gives rise to edges that were never present in the original image. This artificial extra information is called 'spurious resolution'.

Johann Radon Institute for Computational and Applied Mathematics: 19/38 Introduction, Axioms (Let’s have a short break first) (what about the official Powers of Ten movie?)Powers of Ten

Johann Radon Institute for Computational and Applied Mathematics: 20/38 Axioms Foundations of scale space –Constraints for an uncommitted front-end –Axioms of a visual front-end –Axiomatic derivation of the Gaussian kernel –Scale space from causality –Scale space from entropy maximization –Derivatives of sampled, observed data –Scale space stack Taken from B. M. ter Haar Romeny, Front-End Vision and Multi-scale Image Analysis, Dordrecht, Kluwer Academic Publishers, Chapter 2

Johann Radon Institute for Computational and Applied Mathematics: 21/38 Constraints for an uncommitted front-end I1I2I3OKYBL1F1APNL2F2 Convolution kernel xxxxxxxxx xx Semigroup property xxxxxxxxx Locality x Regularity xxxxxxxx Infinitesimal generator x Max. loss principle x Causality xxxxx Nonnegativity xxxxxx Tikhonov regularization x Average grey level invar. xxxxxx Flat kernel for t to infinity x Isometry invariance xxxxxxxxxxx Homogeneity & isotropy x Separability xx Scale invariance xxxxxxxx Valid for dimension12221,2 11>1>1N NNN

Johann Radon Institute for Computational and Applied Mathematics: 22/38 Axioms of a visual front-end Uncommitted assumptions: 1.scale invariance (no preferred scale or size) 2.spatial shift invariance (no preferred location) 3.isotropy (no preferred orientation) 4.linearity (no memory or model) 5.separability (for the sake of computational ease)

Johann Radon Institute for Computational and Applied Mathematics: 23/38 Axioms of a visual front-end Physical properties: L [candela/meter 2 ] ”<>” x [meters] Intensity <> spatiality Pi-teorem: Physical laws must be independent of the choice of the fundamental parameters 1. Scale invariance L/ L 0 = G(   )

Johann Radon Institute for Computational and Applied Mathematics: 24/38 An uncommitted front-end 2. Linear shift invariance Convolution : In Fourier domain equal to multiplication: 3. Isotropy Consider the length of 4. Linearity Which implies

Johann Radon Institute for Computational and Applied Mathematics: 25/38 An uncommitted front-end 5. Separability p = 2 –Outer scale (image averages) –So  2 < 0, say -1/2 for later convenience.

Johann Radon Institute for Computational and Applied Mathematics: 26/38 An uncommitted front-end Back to the spatial domain, normalizing the kernel:

Johann Radon Institute for Computational and Applied Mathematics: 27/38 Scale space from causality Whatever you do on this image, you don’t want the introduction of white regions in the black ones. No new level lines are to be created: Causality

Johann Radon Institute for Computational and Applied Mathematics: 28/38 Scale space from causality Causality: non-enhancement of local extrema. Let D L = L xx + L yy D L equals the sum of the eigenvalues of the Hessian. Then at a maximum D L 0 and L t > 0 So D L L t > 0. Choose L t = a D L, a > 0 With a = 1, L t = D L

Johann Radon Institute for Computational and Applied Mathematics: 29/38 Scale space from causality L t (x,y;t) = D L (x,y;t) Obviously, for t -> 0, L (x,y;t) = L 0 The general solution (Greens function) for this diffusion equation is convolution of the original image with an Gaussian: G(x,y;t) = Exp (-(x 2 +y 2 )/(4 t)) / (4 p t) Note: one uses rater 4t than 2s 2

Johann Radon Institute for Computational and Applied Mathematics: 30/38 Scale space from entropy maximization A statistical measure for the disorder of the filter is given by the entropy: 1D for simplicity If it is maximized it states something like “there is nothing ordered” (we know nothing). Obviously, there are some constraints.

Johann Radon Institute for Computational and Applied Mathematics: 31/38 Constraints –The function must be normalized; no global enhancement: –The mean of the measurement is at the location where we measure, say 0: –There is a standard deviation, say  : –The function is positive; it’s a real object: g(x)>0 Scale space from entropy maximization

Johann Radon Institute for Computational and Applied Mathematics: 32/38 Scale space from entropy maximization Maximize the Euler Lagrange equation Set the variational derivative w.r.t. g(x) equal to zero: So

Johann Radon Institute for Computational and Applied Mathematics: 33/38 Scale space from entropy maximization ∫ x g(x) dx = 0 -> λ 2 = 0 ∫ x 2 g(x) dx =  2 -> λ 3 = -1/(2  2 ) g(x)>0 -> OK ∫ g(x) dx = 1 -> λ 1 = Log[e/√(2 p 2 )] => g(x)= Exp[-1+1-Log[√(2 p 2 )]- x 2 /(2  2 )] = Exp[-x 2 /(2  2 )] / √(2 p 2 )

Johann Radon Institute for Computational and Applied Mathematics: 34/38 Derivatives of sampled, observed data The Gaussian kernel and all of its partial derivatives form the unique set of kernels for a front-end visual system that satisfies the constraints: –no preference for location, scale and orientation, and linearity. It is a one-parameter family of kernels, where the scale is the free parameter. The derivative of the observed data is given by which equals

Johann Radon Institute for Computational and Applied Mathematics: 35/38 Derivatives of sampled, observed data Derivatives of a Gaussian: The first order derivative of an image gives edges

Johann Radon Institute for Computational and Applied Mathematics: 36/38 Gaussian scale space L(x;  ) = L 0 (x) * Exp (- x 2 /(2  2 ) / Sqrt[ (2 p  2 ) D ] L(x;  ) is called the Gaussian scale space image.

Johann Radon Institute for Computational and Applied Mathematics: 37/38 Summary We have specific physical constraints for the early vision front-end kernel. We are able to set up a 'first principle' framework from which the exact sensitivity function of the measurement aperture can be derived. There exist many such derivations for an uncommitted kernel, all leading to the same unique result: the Gaussian kernel. –The assumptions of linearity, isoptropy, homogeneity and scale-invariance; –The principle of causality; –Minimization of the entropy Differentiation of discrete data is done by the convolution with the derivative of the observation kernel. This means that differentiation can never be done without blurring the data somewhat.

Johann Radon Institute for Computational and Applied Mathematics: 38/38 Powers of Ten revisited Short popularized version